Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r101-tall-167814475200316.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
............................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool itstools
Input is DBSingleClientW-PT-d2m07, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r101-tall-167814475200316
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.9M
-rw-r--r-- 1 mcc users 5.3K Feb 26 15:33 CTLCardinality.txt
-rw-r--r-- 1 mcc users 49K Feb 26 15:33 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.9K Feb 26 15:32 CTLFireability.txt
-rw-r--r-- 1 mcc users 40K Feb 26 15:32 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Feb 25 15:49 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Feb 25 15:49 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 15:49 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 15:49 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.0K Feb 26 15:34 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 89K Feb 26 15:34 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.3K Feb 26 15:33 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 47K Feb 26 15:33 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 15:49 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 15:49 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 1.6M Mar 5 18:22 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-d2m07-LTLFireability-00
FORMULA_NAME DBSingleClientW-PT-d2m07-LTLFireability-01
FORMULA_NAME DBSingleClientW-PT-d2m07-LTLFireability-02
FORMULA_NAME DBSingleClientW-PT-d2m07-LTLFireability-03
FORMULA_NAME DBSingleClientW-PT-d2m07-LTLFireability-04
FORMULA_NAME DBSingleClientW-PT-d2m07-LTLFireability-05
FORMULA_NAME DBSingleClientW-PT-d2m07-LTLFireability-06
FORMULA_NAME DBSingleClientW-PT-d2m07-LTLFireability-07
FORMULA_NAME DBSingleClientW-PT-d2m07-LTLFireability-08
FORMULA_NAME DBSingleClientW-PT-d2m07-LTLFireability-09
FORMULA_NAME DBSingleClientW-PT-d2m07-LTLFireability-10
FORMULA_NAME DBSingleClientW-PT-d2m07-LTLFireability-11
FORMULA_NAME DBSingleClientW-PT-d2m07-LTLFireability-12
FORMULA_NAME DBSingleClientW-PT-d2m07-LTLFireability-13
FORMULA_NAME DBSingleClientW-PT-d2m07-LTLFireability-14
FORMULA_NAME DBSingleClientW-PT-d2m07-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1678249928041

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=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DBSingleClientW-PT-d2m07
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202303021504
[2023-03-08 04:32:09] [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]
[2023-03-08 04:32:09] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-08 04:32:09] [INFO ] Load time of PNML (sax parser for PT used): 165 ms
[2023-03-08 04:32:09] [INFO ] Transformed 4763 places.
[2023-03-08 04:32:09] [INFO ] Transformed 2478 transitions.
[2023-03-08 04:32:09] [INFO ] Parsed PT model containing 4763 places and 2478 transitions and 9912 arcs in 255 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 7 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
Deduced a syphon composed of 3580 places in 16 ms
Reduce places removed 3580 places and 0 transitions.
FORMULA DBSingleClientW-PT-d2m07-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m07-LTLFireability-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 29 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 374 places :
Symmetric choice reduction at 1 with 374 rule applications. Total rules 619 place count 763 transition count 1424
Iterating global reduction 1 with 374 rules applied. Total rules applied 993 place count 763 transition count 1424
Ensure Unique test removed 48 transitions
Reduce isomorphic transitions removed 48 transitions.
Iterating post reduction 1 with 48 rules applied. Total rules applied 1041 place count 763 transition count 1376
Discarding 301 places :
Symmetric choice reduction at 2 with 301 rule applications. Total rules 1342 place count 462 transition count 1075
Iterating global reduction 2 with 301 rules applied. Total rules applied 1643 place count 462 transition count 1075
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 1653 place count 462 transition count 1065
Discarding 222 places :
Symmetric choice reduction at 3 with 222 rule applications. Total rules 1875 place count 240 transition count 758
Iterating global reduction 3 with 222 rules applied. Total rules applied 2097 place count 240 transition count 758
Ensure Unique test removed 257 transitions
Reduce isomorphic transitions removed 257 transitions.
Iterating post reduction 3 with 257 rules applied. Total rules applied 2354 place count 240 transition count 501
Discarding 16 places :
Symmetric choice reduction at 4 with 16 rule applications. Total rules 2370 place count 224 transition count 472
Iterating global reduction 4 with 16 rules applied. Total rules applied 2386 place count 224 transition count 472
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 4 with 24 rules applied. Total rules applied 2410 place count 224 transition count 448
Discarding 9 places :
Symmetric choice reduction at 5 with 9 rule applications. Total rules 2419 place count 215 transition count 439
Iterating global reduction 5 with 9 rules applied. Total rules applied 2428 place count 215 transition count 439
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 2430 place count 215 transition count 437
Discarding 7 places :
Symmetric choice reduction at 6 with 7 rule applications. Total rules 2437 place count 208 transition count 430
Iterating global reduction 6 with 7 rules applied. Total rules applied 2444 place count 208 transition count 430
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 2448 place count 208 transition count 426
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 2450 place count 206 transition count 422
Iterating global reduction 7 with 2 rules applied. Total rules applied 2452 place count 206 transition count 422
Applied a total of 2452 rules in 248 ms. Remains 206 /1183 variables (removed 977) and now considering 422/2478 (removed 2056) transitions.
// Phase 1: matrix 422 rows 206 cols
[2023-03-08 04:32:10] [INFO ] Computed 2 place invariants in 19 ms
[2023-03-08 04:32:10] [INFO ] Implicit Places using invariants in 334 ms returned []
[2023-03-08 04:32:10] [INFO ] Invariant cache hit.
[2023-03-08 04:32:10] [INFO ] State equation strengthened by 224 read => feed constraints.
[2023-03-08 04:32:11] [INFO ] Implicit Places using invariants and state equation in 823 ms returned []
Implicit Place search using SMT with State Equation took 1203 ms to find 0 implicit places.
[2023-03-08 04:32:11] [INFO ] Invariant cache hit.
[2023-03-08 04:32:11] [INFO ] Dead Transitions using invariants and state equation in 172 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 206/1183 places, 422/2478 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1625 ms. Remains : 206/1183 places, 422/2478 transitions.
Support contains 29 out of 206 places after structural reductions.
[2023-03-08 04:32:12] [INFO ] Flatten gal took : 52 ms
[2023-03-08 04:32:12] [INFO ] Flatten gal took : 27 ms
[2023-03-08 04:32:12] [INFO ] Input system was already deterministic with 422 transitions.
Support contains 28 out of 206 places (down from 29) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 2295 resets, run finished after 573 ms. (steps per millisecond=17 ) properties (out of 26) seen :1
Incomplete Best-First random walk after 1001 steps, including 48 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 46 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 49 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1000 steps, including 47 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1000 steps, including 42 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 42 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 49 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 39 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 76 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 40 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1000 steps, including 49 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 38 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 97 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1000 steps, including 45 resets, run finished after 13 ms. (steps per millisecond=76 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 46 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 51 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 49 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1000 steps, including 106 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 50 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 77 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 40 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 84 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1000 steps, including 49 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1000 steps, including 50 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1000 steps, including 54 resets, run finished after 13 ms. (steps per millisecond=76 ) properties (out of 25) seen :0
Interrupted probabilistic random walk after 623646 steps, run timeout after 3001 ms. (steps per millisecond=207 ) properties seen :{1=1, 2=1, 3=1, 4=1, 5=1, 6=1, 7=1, 8=1, 9=1, 10=1, 11=1, 12=1, 13=1, 14=1, 15=1, 16=1, 17=1, 18=1, 19=1, 20=1, 21=1, 23=1, 24=1}
Probabilistic random walk after 623646 steps, saw 250368 distinct states, run finished after 3002 ms. (steps per millisecond=207 ) properties seen :23
Running SMT prover for 2 properties.
[2023-03-08 04:32:16] [INFO ] Invariant cache hit.
[2023-03-08 04:32:18] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-08 04:32:18] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-08 04:32:18] [INFO ] After 1848ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:1
[2023-03-08 04:32:18] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-08 04:32:18] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-08 04:32:18] [INFO ] After 149ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :1
[2023-03-08 04:32:18] [INFO ] State equation strengthened by 224 read => feed constraints.
[2023-03-08 04:32:18] [INFO ] After 103ms SMT Verify possible using 224 Read/Feed constraints in natural domain returned unsat :1 sat :1
[2023-03-08 04:32:18] [INFO ] After 246ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :1
Attempting to minimize the solution found.
Minimization took 107 ms.
[2023-03-08 04:32:19] [INFO ] After 578ms 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 3 ms.
Support contains 3 out of 206 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 206/206 places, 422/422 transitions.
Graph (complete) has 774 edges and 206 vertex of which 205 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 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 7 place count 205 transition count 416
Discarding 23 places :
Symmetric choice reduction at 1 with 23 rule applications. Total rules 30 place count 182 transition count 316
Iterating global reduction 1 with 23 rules applied. Total rules applied 53 place count 182 transition count 316
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 57 place count 182 transition count 312
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 75 place count 164 transition count 289
Iterating global reduction 2 with 18 rules applied. Total rules applied 93 place count 164 transition count 289
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 103 place count 164 transition count 279
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 115 place count 152 transition count 263
Iterating global reduction 3 with 12 rules applied. Total rules applied 127 place count 152 transition count 263
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 132 place count 152 transition count 258
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 140 place count 144 transition count 244
Iterating global reduction 4 with 8 rules applied. Total rules applied 148 place count 144 transition count 244
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 152 place count 144 transition count 240
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 156 place count 140 transition count 236
Iterating global reduction 5 with 4 rules applied. Total rules applied 160 place count 140 transition count 236
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 5 with 5 rules applied. Total rules applied 165 place count 140 transition count 231
Discarding 5 places :
Symmetric choice reduction at 6 with 5 rule applications. Total rules 170 place count 135 transition count 209
Iterating global reduction 6 with 5 rules applied. Total rules applied 175 place count 135 transition count 209
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 176 place count 135 transition count 208
Applied a total of 176 rules in 55 ms. Remains 135 /206 variables (removed 71) and now considering 208/422 (removed 214) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 55 ms. Remains : 135/206 places, 208/422 transitions.
Incomplete random walk after 10000 steps, including 2290 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 463 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Finished probabilistic random walk after 1186750 steps, run visited all 1 properties in 1709 ms. (steps per millisecond=694 )
Probabilistic random walk after 1186750 steps, saw 472265 distinct states, run finished after 1709 ms. (steps per millisecond=694 ) properties seen :1
FORMULA DBSingleClientW-PT-d2m07-LTLFireability-02 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA DBSingleClientW-PT-d2m07-LTLFireability-05 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 12 simplifications.
Computed a total of 5 stabilizing places and 32 stable transitions
Graph (complete) has 838 edges and 206 vertex of which 205 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.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0)&&(G(X(X(G(!p1)))) U p2)))'
Support contains 4 out of 206 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 206/206 places, 422/422 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 184 transition count 322
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 184 transition count 322
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 48 place count 184 transition count 318
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 65 place count 167 transition count 296
Iterating global reduction 1 with 17 rules applied. Total rules applied 82 place count 167 transition count 296
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 90 place count 167 transition count 288
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 102 place count 155 transition count 272
Iterating global reduction 2 with 12 rules applied. Total rules applied 114 place count 155 transition count 272
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 119 place count 155 transition count 267
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 127 place count 147 transition count 251
Iterating global reduction 3 with 8 rules applied. Total rules applied 135 place count 147 transition count 251
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 139 place count 147 transition count 247
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 143 place count 143 transition count 243
Iterating global reduction 4 with 4 rules applied. Total rules applied 147 place count 143 transition count 243
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 152 place count 143 transition count 238
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 157 place count 138 transition count 216
Iterating global reduction 5 with 5 rules applied. Total rules applied 162 place count 138 transition count 216
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 163 place count 138 transition count 215
Applied a total of 163 rules in 17 ms. Remains 138 /206 variables (removed 68) and now considering 215/422 (removed 207) transitions.
// Phase 1: matrix 215 rows 138 cols
[2023-03-08 04:32:21] [INFO ] Computed 2 place invariants in 3 ms
[2023-03-08 04:32:21] [INFO ] Implicit Places using invariants in 86 ms returned []
[2023-03-08 04:32:21] [INFO ] Invariant cache hit.
[2023-03-08 04:32:21] [INFO ] State equation strengthened by 82 read => feed constraints.
[2023-03-08 04:32:21] [INFO ] Implicit Places using invariants and state equation in 332 ms returned []
Implicit Place search using SMT with State Equation took 422 ms to find 0 implicit places.
[2023-03-08 04:32:21] [INFO ] Invariant cache hit.
[2023-03-08 04:32:21] [INFO ] Dead Transitions using invariants and state equation in 110 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 138/206 places, 215/422 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 552 ms. Remains : 138/206 places, 215/422 transitions.
Stuttering acceptance computed with spot in 731 ms :[(OR (NOT p0) (NOT p2)), (NOT p0), (OR (NOT p2) p1), true, p1]
Running random walk in product with property : DBSingleClientW-PT-d2m07-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p2), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(NOT p2), acceptance={0} source=2 dest: 2}, { cond=true, acceptance={0} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=p1, acceptance={} source=4 dest: 3}, { cond=(NOT p1), acceptance={} source=4 dest: 4}]], initial=0, aps=[p2:(AND (GEQ s1 1) (GEQ s126 1)), p0:(AND (GEQ s1 1) (GEQ s85 1) (GEQ s1 1) (GEQ s132 1)), p1:(AND (GEQ s1 1) (GEQ s85 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 3 steps with 0 reset in 3 ms.
FORMULA DBSingleClientW-PT-d2m07-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d2m07-LTLFireability-00 finished in 1348 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 206 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 206/206 places, 422/422 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 182 transition count 318
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 182 transition count 318
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 51 place count 182 transition count 315
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 70 place count 163 transition count 291
Iterating global reduction 1 with 19 rules applied. Total rules applied 89 place count 163 transition count 291
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 99 place count 163 transition count 281
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 112 place count 150 transition count 263
Iterating global reduction 2 with 13 rules applied. Total rules applied 125 place count 150 transition count 263
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 131 place count 150 transition count 257
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 139 place count 142 transition count 245
Iterating global reduction 3 with 8 rules applied. Total rules applied 147 place count 142 transition count 245
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 152 place count 142 transition count 240
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 159 place count 135 transition count 216
Iterating global reduction 4 with 7 rules applied. Total rules applied 166 place count 135 transition count 216
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 171 place count 135 transition count 211
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 176 place count 130 transition count 189
Iterating global reduction 5 with 5 rules applied. Total rules applied 181 place count 130 transition count 189
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 183 place count 130 transition count 187
Applied a total of 183 rules in 25 ms. Remains 130 /206 variables (removed 76) and now considering 187/422 (removed 235) transitions.
// Phase 1: matrix 187 rows 130 cols
[2023-03-08 04:32:22] [INFO ] Computed 2 place invariants in 6 ms
[2023-03-08 04:32:22] [INFO ] Implicit Places using invariants in 70 ms returned []
[2023-03-08 04:32:22] [INFO ] Invariant cache hit.
[2023-03-08 04:32:22] [INFO ] State equation strengthened by 61 read => feed constraints.
[2023-03-08 04:32:22] [INFO ] Implicit Places using invariants and state equation in 240 ms returned []
Implicit Place search using SMT with State Equation took 314 ms to find 0 implicit places.
[2023-03-08 04:32:22] [INFO ] Invariant cache hit.
[2023-03-08 04:32:22] [INFO ] Dead Transitions using invariants and state equation in 79 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 130/206 places, 187/422 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 422 ms. Remains : 130/206 places, 187/422 transitions.
Stuttering acceptance computed with spot in 80 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d2m07-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (GEQ s1 1) (GEQ s124 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 6 steps with 0 reset in 1 ms.
FORMULA DBSingleClientW-PT-d2m07-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d2m07-LTLFireability-03 finished in 517 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(G(p0))&&(G(!p1)||(!p1&&F(p2))))))'
Support contains 4 out of 206 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 206/206 places, 422/422 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 184 transition count 326
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 184 transition count 326
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 46 place count 184 transition count 324
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 64 place count 166 transition count 301
Iterating global reduction 1 with 18 rules applied. Total rules applied 82 place count 166 transition count 301
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 92 place count 166 transition count 291
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 104 place count 154 transition count 274
Iterating global reduction 2 with 12 rules applied. Total rules applied 116 place count 154 transition count 274
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 122 place count 154 transition count 268
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 129 place count 147 transition count 255
Iterating global reduction 3 with 7 rules applied. Total rules applied 136 place count 147 transition count 255
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 141 place count 147 transition count 250
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 146 place count 142 transition count 234
Iterating global reduction 4 with 5 rules applied. Total rules applied 151 place count 142 transition count 234
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 156 place count 142 transition count 229
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 160 place count 138 transition count 208
Iterating global reduction 5 with 4 rules applied. Total rules applied 164 place count 138 transition count 208
Applied a total of 164 rules in 19 ms. Remains 138 /206 variables (removed 68) and now considering 208/422 (removed 214) transitions.
// Phase 1: matrix 208 rows 138 cols
[2023-03-08 04:32:23] [INFO ] Computed 2 place invariants in 2 ms
[2023-03-08 04:32:23] [INFO ] Implicit Places using invariants in 66 ms returned []
[2023-03-08 04:32:23] [INFO ] Invariant cache hit.
[2023-03-08 04:32:23] [INFO ] State equation strengthened by 78 read => feed constraints.
[2023-03-08 04:32:23] [INFO ] Implicit Places using invariants and state equation in 285 ms returned []
Implicit Place search using SMT with State Equation took 355 ms to find 0 implicit places.
[2023-03-08 04:32:23] [INFO ] Invariant cache hit.
[2023-03-08 04:32:23] [INFO ] Dead Transitions using invariants and state equation in 88 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 138/206 places, 208/422 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 463 ms. Remains : 138/206 places, 208/422 transitions.
Stuttering acceptance computed with spot in 293 ms :[true, (OR (NOT p0) (NOT p2)), (OR (NOT p0) p1), (OR (NOT p0) p1), (NOT p0), (OR (NOT p0) (AND p1 (NOT p2)))]
Running random walk in product with property : DBSingleClientW-PT-d2m07-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p2) p0), acceptance={0} source=1 dest: 1}, { cond=(AND p2 p0), acceptance={0} source=1 dest: 4}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=p1, acceptance={} source=3 dest: 0}, { cond=(AND (NOT p1) p2), acceptance={} source=3 dest: 4}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=3 dest: 5}], [{ cond=(NOT p0), acceptance={} source=4 dest: 0}, { cond=p0, acceptance={} source=4 dest: 4}], [{ cond=(NOT p0), acceptance={} source=5 dest: 0}, { cond=(AND p1 (NOT p2) p0), acceptance={} source=5 dest: 1}, { cond=(AND p2 p0), acceptance={} source=5 dest: 4}, { cond=(AND (NOT p1) (NOT p2) p0), acceptance={} source=5 dest: 5}]], initial=2, aps=[p0:(OR (LT s1 1) (LT s136 1)), p2:(AND (GEQ s1 1) (GEQ s67 1)), p1:(AND (GEQ s1 1) (GEQ s134 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, 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 23005 reset in 338 ms.
Product exploration explored 100000 steps with 22799 reset in 228 ms.
Computed a total of 5 stabilizing places and 18 stable transitions
Graph (complete) has 506 edges and 138 vertex of which 137 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 : [(AND p0 (NOT p2) (NOT p1)), (X (NOT (AND (NOT p1) p2))), (X (AND (NOT p1) (NOT p2))), (X (NOT p1)), true, (X (X p0)), (X (X (NOT (AND p2 p0)))), (X (X (NOT (AND p1 (NOT p2) p0)))), (X (X (AND (NOT p1) (NOT p2) p0)))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 1843 ms. Reduced automaton from 6 states, 14 edges and 3 AP (stutter sensitive) to 6 states, 12 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 224 ms :[true, (OR (NOT p0) (NOT p2)), (NOT p0), (OR (NOT p0) (AND p1 (NOT p2))), (OR (NOT p0) (AND p1 (NOT p2))), (OR (NOT p0) (AND p1 (NOT p2)))]
Incomplete random walk after 10000 steps, including 2287 resets, run finished after 161 ms. (steps per millisecond=62 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 458 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 426 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 464 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 399 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 443 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 5) seen :0
Finished probabilistic random walk after 73401 steps, run visited all 5 properties in 282 ms. (steps per millisecond=260 )
Probabilistic random walk after 73401 steps, saw 32289 distinct states, run finished after 282 ms. (steps per millisecond=260 ) properties seen :5
Knowledge obtained : [(AND p0 (NOT p2) (NOT p1)), (X (NOT (AND (NOT p1) p2))), (X (AND (NOT p1) (NOT p2))), (X (NOT p1)), true, (X (X p0)), (X (X (NOT (AND p2 p0)))), (X (X (NOT (AND p1 (NOT p2) p0)))), (X (X (AND (NOT p1) (NOT p2) p0)))]
False Knowledge obtained : [(F (NOT (AND p0 (NOT p1) (NOT p2)))), (F (AND p0 p1 (NOT p2))), (F (NOT p0)), (F (AND p0 p2)), (F (NOT (AND p0 (NOT p2))))]
Knowledge based reduction with 9 factoid took 547 ms. Reduced automaton from 6 states, 12 edges and 3 AP (stutter sensitive) to 6 states, 12 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 210 ms :[true, (OR (NOT p0) (NOT p2)), (NOT p0), (OR (NOT p0) (AND p1 (NOT p2))), (OR (NOT p0) (AND p1 (NOT p2))), (OR (NOT p0) (AND p1 (NOT p2)))]
Stuttering acceptance computed with spot in 253 ms :[true, (OR (NOT p0) (NOT p2)), (NOT p0), (OR (NOT p0) (AND p1 (NOT p2))), (OR (NOT p0) (AND p1 (NOT p2))), (OR (NOT p0) (AND p1 (NOT p2)))]
Support contains 4 out of 138 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 138/138 places, 208/208 transitions.
Applied a total of 0 rules in 4 ms. Remains 138 /138 variables (removed 0) and now considering 208/208 (removed 0) transitions.
[2023-03-08 04:32:28] [INFO ] Invariant cache hit.
[2023-03-08 04:32:28] [INFO ] Implicit Places using invariants in 73 ms returned []
[2023-03-08 04:32:28] [INFO ] Invariant cache hit.
[2023-03-08 04:32:28] [INFO ] State equation strengthened by 78 read => feed constraints.
[2023-03-08 04:32:28] [INFO ] Implicit Places using invariants and state equation in 289 ms returned []
Implicit Place search using SMT with State Equation took 367 ms to find 0 implicit places.
[2023-03-08 04:32:28] [INFO ] Invariant cache hit.
[2023-03-08 04:32:28] [INFO ] Dead Transitions using invariants and state equation in 89 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 462 ms. Remains : 138/138 places, 208/208 transitions.
Computed a total of 5 stabilizing places and 18 stable transitions
Graph (complete) has 506 edges and 138 vertex of which 137 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 : [(AND p0 (NOT p2) (NOT p1)), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (AND p0 (NOT p1) (NOT p2)))), (X (X (NOT (AND p0 p2)))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 187 ms. Reduced automaton from 6 states, 12 edges and 3 AP (stutter sensitive) to 6 states, 12 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 201 ms :[true, (OR (NOT p0) (NOT p2)), (NOT p0), (OR (NOT p0) (AND p1 (NOT p2))), (OR (NOT p0) (AND p1 (NOT p2))), (OR (NOT p0) (AND p1 (NOT p2)))]
Incomplete random walk after 10000 steps, including 2274 resets, run finished after 176 ms. (steps per millisecond=56 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 421 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 450 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 444 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 427 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 437 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 5) seen :0
Finished probabilistic random walk after 73401 steps, run visited all 5 properties in 275 ms. (steps per millisecond=266 )
Probabilistic random walk after 73401 steps, saw 32289 distinct states, run finished after 278 ms. (steps per millisecond=264 ) properties seen :5
Knowledge obtained : [(AND p0 (NOT p2) (NOT p1)), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (AND p0 (NOT p1) (NOT p2)))), (X (X (NOT (AND p0 p2)))), (X (X p0))]
False Knowledge obtained : [(F (NOT (AND (NOT p2) (NOT p1) p0))), (F (AND (NOT p2) p1 p0)), (F (NOT p0)), (F (AND p2 p0)), (F (NOT (AND (NOT p2) p0)))]
Knowledge based reduction with 5 factoid took 305 ms. Reduced automaton from 6 states, 12 edges and 3 AP (stutter sensitive) to 6 states, 12 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 200 ms :[true, (OR (NOT p0) (NOT p2)), (NOT p0), (OR (NOT p0) (AND p1 (NOT p2))), (OR (NOT p0) (AND p1 (NOT p2))), (OR (NOT p0) (AND p1 (NOT p2)))]
Stuttering acceptance computed with spot in 217 ms :[true, (OR (NOT p0) (NOT p2)), (NOT p0), (OR (NOT p0) (AND p1 (NOT p2))), (OR (NOT p0) (AND p1 (NOT p2))), (OR (NOT p0) (AND p1 (NOT p2)))]
Stuttering acceptance computed with spot in 215 ms :[true, (OR (NOT p0) (NOT p2)), (NOT p0), (OR (NOT p0) (AND p1 (NOT p2))), (OR (NOT p0) (AND p1 (NOT p2))), (OR (NOT p0) (AND p1 (NOT p2)))]
Product exploration explored 100000 steps with 23003 reset in 182 ms.
Product exploration explored 100000 steps with 22871 reset in 182 ms.
Applying partial POR strategy [true, true, true, true, false, false]
Stuttering acceptance computed with spot in 205 ms :[true, (OR (NOT p0) (NOT p2)), (NOT p0), (OR (NOT p0) (AND p1 (NOT p2))), (OR (NOT p0) (AND p1 (NOT p2))), (OR (NOT p0) (AND p1 (NOT p2)))]
Support contains 4 out of 138 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 138/138 places, 208/208 transitions.
Applied a total of 0 rules in 18 ms. Remains 138 /138 variables (removed 0) and now considering 208/208 (removed 0) transitions.
[2023-03-08 04:32:31] [INFO ] Redundant transitions in 6 ms returned []
[2023-03-08 04:32:31] [INFO ] Invariant cache hit.
[2023-03-08 04:32:31] [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 118 ms. Remains : 138/138 places, 208/208 transitions.
Built C files in :
/tmp/ltsmin6190985351441929553
[2023-03-08 04:32:31] [INFO ] Built C files in 14ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6190985351441929553
Running compilation step : cd /tmp/ltsmin6190985351441929553;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 424 ms.
Running link step : cd /tmp/ltsmin6190985351441929553;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 659 ms.
Running LTSmin : cd /tmp/ltsmin6190985351441929553;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased4595005681759075895.hoa' '--buchi-type=spotba'
LTSmin run took 94 ms.
FORMULA DBSingleClientW-PT-d2m07-LTLFireability-04 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property DBSingleClientW-PT-d2m07-LTLFireability-04 finished in 9874 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 206 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 206/206 places, 422/422 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 182 transition count 312
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 182 transition count 312
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 51 place count 182 transition count 309
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 70 place count 163 transition count 285
Iterating global reduction 1 with 19 rules applied. Total rules applied 89 place count 163 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 96 place count 163 transition count 278
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 110 place count 149 transition count 259
Iterating global reduction 2 with 14 rules applied. Total rules applied 124 place count 149 transition count 259
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 130 place count 149 transition count 253
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 139 place count 140 transition count 236
Iterating global reduction 3 with 9 rules applied. Total rules applied 148 place count 140 transition count 236
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 153 place count 140 transition count 231
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 158 place count 135 transition count 226
Iterating global reduction 4 with 5 rules applied. Total rules applied 163 place count 135 transition count 226
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 168 place count 135 transition count 221
Discarding 6 places :
Symmetric choice reduction at 5 with 6 rule applications. Total rules 174 place count 129 transition count 198
Iterating global reduction 5 with 6 rules applied. Total rules applied 180 place count 129 transition count 198
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 182 place count 129 transition count 196
Applied a total of 182 rules in 41 ms. Remains 129 /206 variables (removed 77) and now considering 196/422 (removed 226) transitions.
// Phase 1: matrix 196 rows 129 cols
[2023-03-08 04:32:33] [INFO ] Computed 2 place invariants in 4 ms
[2023-03-08 04:32:33] [INFO ] Implicit Places using invariants in 73 ms returned []
[2023-03-08 04:32:33] [INFO ] Invariant cache hit.
[2023-03-08 04:32:33] [INFO ] State equation strengthened by 75 read => feed constraints.
[2023-03-08 04:32:33] [INFO ] Implicit Places using invariants and state equation in 283 ms returned []
Implicit Place search using SMT with State Equation took 359 ms to find 0 implicit places.
[2023-03-08 04:32:33] [INFO ] Redundant transitions in 9 ms returned []
[2023-03-08 04:32:33] [INFO ] Invariant cache hit.
[2023-03-08 04:32:33] [INFO ] Dead Transitions using invariants and state equation in 80 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 129/206 places, 196/422 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 496 ms. Remains : 129/206 places, 196/422 transitions.
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d2m07-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s8 1) (GEQ s53 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 5 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d2m07-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d2m07-LTLFireability-06 finished in 544 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(G(p0))&&F((G(p1)&&X(F(p2))))))'
Support contains 4 out of 206 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 206/206 places, 422/422 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 184 transition count 333
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 184 transition count 333
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 48 place count 184 transition count 329
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 66 place count 166 transition count 306
Iterating global reduction 1 with 18 rules applied. Total rules applied 84 place count 166 transition count 306
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 94 place count 166 transition count 296
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 106 place count 154 transition count 280
Iterating global reduction 2 with 12 rules applied. Total rules applied 118 place count 154 transition count 280
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 123 place count 154 transition count 275
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 130 place count 147 transition count 261
Iterating global reduction 3 with 7 rules applied. Total rules applied 137 place count 147 transition count 261
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 142 place count 147 transition count 256
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 149 place count 140 transition count 232
Iterating global reduction 4 with 7 rules applied. Total rules applied 156 place count 140 transition count 232
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 159 place count 140 transition count 229
Discarding 6 places :
Symmetric choice reduction at 5 with 6 rule applications. Total rules 165 place count 134 transition count 206
Iterating global reduction 5 with 6 rules applied. Total rules applied 171 place count 134 transition count 206
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 173 place count 134 transition count 204
Applied a total of 173 rules in 23 ms. Remains 134 /206 variables (removed 72) and now considering 204/422 (removed 218) transitions.
// Phase 1: matrix 204 rows 134 cols
[2023-03-08 04:32:33] [INFO ] Computed 2 place invariants in 3 ms
[2023-03-08 04:32:33] [INFO ] Implicit Places using invariants in 73 ms returned []
[2023-03-08 04:32:33] [INFO ] Invariant cache hit.
[2023-03-08 04:32:33] [INFO ] State equation strengthened by 76 read => feed constraints.
[2023-03-08 04:32:33] [INFO ] Implicit Places using invariants and state equation in 273 ms returned []
Implicit Place search using SMT with State Equation took 348 ms to find 0 implicit places.
[2023-03-08 04:32:33] [INFO ] Invariant cache hit.
[2023-03-08 04:32:33] [INFO ] Dead Transitions using invariants and state equation in 83 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 134/206 places, 204/422 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 454 ms. Remains : 134/206 places, 204/422 transitions.
Stuttering acceptance computed with spot in 227 ms :[(OR (NOT p1) (NOT p0) (NOT p2)), (NOT p0), (OR (NOT p1) (NOT p2)), (NOT p1), (NOT p2)]
Running random walk in product with property : DBSingleClientW-PT-d2m07-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}, { cond=p1, acceptance={} source=0 dest: 3}, { cond=p1, acceptance={} source=0 dest: 4}], [{ 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=p1, acceptance={} source=2 dest: 3}, { cond=p1, acceptance={} source=2 dest: 4}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 2}, { cond=p1, acceptance={} source=3 dest: 3}], [{ cond=(NOT p2), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(OR (LT s1 1) (LT s97 1)), p0:(OR (LT s1 1) (LT s124 1)), p2:(OR (LT s1 1) (LT s127 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 27936 reset in 272 ms.
Product exploration explored 100000 steps with 28104 reset in 251 ms.
Computed a total of 5 stabilizing places and 18 stable transitions
Graph (complete) has 494 edges and 134 vertex of which 133 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 : [(AND p1 p0 p2), (X p1), (X p0), (X p2), (X (X p1)), (X (X p0)), (X (X p2))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 275 ms. Reduced automaton from 5 states, 12 edges and 3 AP (stutter sensitive) to 5 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 206 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (OR (NOT p1) (NOT p2)), (NOT p1), (NOT p2)]
Incomplete random walk after 10000 steps, including 2327 resets, run finished after 179 ms. (steps per millisecond=55 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 453 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 470 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 447 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 3) seen :0
Finished probabilistic random walk after 21991 steps, run visited all 3 properties in 213 ms. (steps per millisecond=103 )
Probabilistic random walk after 21991 steps, saw 10814 distinct states, run finished after 213 ms. (steps per millisecond=103 ) properties seen :3
Knowledge obtained : [(AND p1 p0 p2), (X p1), (X p0), (X p2), (X (X p1)), (X (X p0)), (X (X p2))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p2)), (F (NOT p1))]
Knowledge based reduction with 7 factoid took 388 ms. Reduced automaton from 5 states, 10 edges and 3 AP (stutter sensitive) to 5 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 206 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (OR (NOT p1) (NOT p2)), (NOT p1), (NOT p2)]
Stuttering acceptance computed with spot in 244 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (OR (NOT p1) (NOT p2)), (NOT p1), (NOT p2)]
Support contains 4 out of 134 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 134/134 places, 204/204 transitions.
Applied a total of 0 rules in 2 ms. Remains 134 /134 variables (removed 0) and now considering 204/204 (removed 0) transitions.
[2023-03-08 04:32:36] [INFO ] Invariant cache hit.
[2023-03-08 04:32:36] [INFO ] Implicit Places using invariants in 75 ms returned []
[2023-03-08 04:32:36] [INFO ] Invariant cache hit.
[2023-03-08 04:32:36] [INFO ] State equation strengthened by 76 read => feed constraints.
[2023-03-08 04:32:37] [INFO ] Implicit Places using invariants and state equation in 284 ms returned []
Implicit Place search using SMT with State Equation took 361 ms to find 0 implicit places.
[2023-03-08 04:32:37] [INFO ] Invariant cache hit.
[2023-03-08 04:32:37] [INFO ] Dead Transitions using invariants and state equation in 79 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 442 ms. Remains : 134/134 places, 204/204 transitions.
Computed a total of 5 stabilizing places and 18 stable transitions
Graph (complete) has 494 edges and 134 vertex of which 133 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 : [(AND p0 p1 p2), (X p1), (X p0), (X (X p1)), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 239 ms. Reduced automaton from 5 states, 10 edges and 3 AP (stutter sensitive) to 5 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 211 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (OR (NOT p1) (NOT p2)), (NOT p1), (NOT p2)]
Incomplete random walk after 10000 steps, including 2301 resets, run finished after 117 ms. (steps per millisecond=85 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 430 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 427 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 430 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 3) seen :0
Finished probabilistic random walk after 21991 steps, run visited all 3 properties in 132 ms. (steps per millisecond=166 )
Probabilistic random walk after 21991 steps, saw 10814 distinct states, run finished after 132 ms. (steps per millisecond=166 ) properties seen :3
Knowledge obtained : [(AND p0 p1 p2), (X p1), (X p0), (X (X p1)), (X (X p0))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p2)), (F (NOT p1))]
Knowledge based reduction with 5 factoid took 1274 ms. Reduced automaton from 5 states, 10 edges and 3 AP (stutter sensitive) to 5 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 186 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (OR (NOT p1) (NOT p2)), (NOT p1), (NOT p2)]
Stuttering acceptance computed with spot in 201 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (OR (NOT p1) (NOT p2)), (NOT p1), (NOT p2)]
Stuttering acceptance computed with spot in 186 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (OR (NOT p1) (NOT p2)), (NOT p1), (NOT p2)]
Product exploration explored 100000 steps with 23088 reset in 151 ms.
Product exploration explored 100000 steps with 23035 reset in 153 ms.
Applying partial POR strategy [false, true, false, false, true]
Stuttering acceptance computed with spot in 191 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (OR (NOT p1) (NOT p2)), (NOT p1), (NOT p2)]
Support contains 4 out of 134 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 134/134 places, 204/204 transitions.
Applied a total of 0 rules in 19 ms. Remains 134 /134 variables (removed 0) and now considering 204/204 (removed 0) transitions.
[2023-03-08 04:32:40] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-08 04:32:40] [INFO ] Invariant cache hit.
[2023-03-08 04:32:40] [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 113 ms. Remains : 134/134 places, 204/204 transitions.
Built C files in :
/tmp/ltsmin4719316954700808510
[2023-03-08 04:32:40] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4719316954700808510
Running compilation step : cd /tmp/ltsmin4719316954700808510;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 299 ms.
Running link step : cd /tmp/ltsmin4719316954700808510;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin4719316954700808510;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased15245801987006039308.hoa' '--buchi-type=spotba'
LTSmin run took 94 ms.
FORMULA DBSingleClientW-PT-d2m07-LTLFireability-07 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property DBSingleClientW-PT-d2m07-LTLFireability-07 finished in 7399 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0)&&F(p1)))'
Support contains 4 out of 206 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 206/206 places, 422/422 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 183 transition count 319
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 183 transition count 319
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 49 place count 183 transition count 316
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 67 place count 165 transition count 294
Iterating global reduction 1 with 18 rules applied. Total rules applied 85 place count 165 transition count 294
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 93 place count 165 transition count 286
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 106 place count 152 transition count 268
Iterating global reduction 2 with 13 rules applied. Total rules applied 119 place count 152 transition count 268
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 125 place count 152 transition count 262
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 133 place count 144 transition count 247
Iterating global reduction 3 with 8 rules applied. Total rules applied 141 place count 144 transition count 247
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 145 place count 144 transition count 243
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 152 place count 137 transition count 225
Iterating global reduction 4 with 7 rules applied. Total rules applied 159 place count 137 transition count 225
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 164 place count 137 transition count 220
Discarding 6 places :
Symmetric choice reduction at 5 with 6 rule applications. Total rules 170 place count 131 transition count 197
Iterating global reduction 5 with 6 rules applied. Total rules applied 176 place count 131 transition count 197
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 178 place count 131 transition count 195
Applied a total of 178 rules in 14 ms. Remains 131 /206 variables (removed 75) and now considering 195/422 (removed 227) transitions.
// Phase 1: matrix 195 rows 131 cols
[2023-03-08 04:32:40] [INFO ] Computed 2 place invariants in 3 ms
[2023-03-08 04:32:40] [INFO ] Implicit Places using invariants in 71 ms returned []
[2023-03-08 04:32:40] [INFO ] Invariant cache hit.
[2023-03-08 04:32:41] [INFO ] State equation strengthened by 70 read => feed constraints.
[2023-03-08 04:32:41] [INFO ] Implicit Places using invariants and state equation in 268 ms returned []
Implicit Place search using SMT with State Equation took 342 ms to find 0 implicit places.
[2023-03-08 04:32:41] [INFO ] Invariant cache hit.
[2023-03-08 04:32:41] [INFO ] Dead Transitions using invariants and state equation in 79 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 131/206 places, 195/422 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 436 ms. Remains : 131/206 places, 195/422 transitions.
Stuttering acceptance computed with spot in 121 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), true]
Running random walk in product with property : DBSingleClientW-PT-d2m07-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(AND (OR (LT s7 1) (LT s54 1)) (OR (LT s1 1) (LT s119 1))), p0:(AND (GEQ s1 1) (GEQ s119 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][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d2m07-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d2m07-LTLFireability-08 finished in 570 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0&&G((G(p1) U p2))&&X(p3))))'
Support contains 5 out of 206 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 206/206 places, 422/422 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 185 transition count 330
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 185 transition count 330
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 44 place count 185 transition count 328
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 61 place count 168 transition count 306
Iterating global reduction 1 with 17 rules applied. Total rules applied 78 place count 168 transition count 306
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 87 place count 168 transition count 297
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 98 place count 157 transition count 282
Iterating global reduction 2 with 11 rules applied. Total rules applied 109 place count 157 transition count 282
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 114 place count 157 transition count 277
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 121 place count 150 transition count 263
Iterating global reduction 3 with 7 rules applied. Total rules applied 128 place count 150 transition count 263
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 130 place count 150 transition count 261
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 134 place count 146 transition count 257
Iterating global reduction 4 with 4 rules applied. Total rules applied 138 place count 146 transition count 257
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 143 place count 146 transition count 252
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 148 place count 141 transition count 230
Iterating global reduction 5 with 5 rules applied. Total rules applied 153 place count 141 transition count 230
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 154 place count 141 transition count 229
Applied a total of 154 rules in 16 ms. Remains 141 /206 variables (removed 65) and now considering 229/422 (removed 193) transitions.
// Phase 1: matrix 229 rows 141 cols
[2023-03-08 04:32:41] [INFO ] Computed 2 place invariants in 5 ms
[2023-03-08 04:32:41] [INFO ] Implicit Places using invariants in 75 ms returned []
[2023-03-08 04:32:41] [INFO ] Invariant cache hit.
[2023-03-08 04:32:41] [INFO ] State equation strengthened by 96 read => feed constraints.
[2023-03-08 04:32:41] [INFO ] Implicit Places using invariants and state equation in 331 ms returned []
Implicit Place search using SMT with State Equation took 408 ms to find 0 implicit places.
[2023-03-08 04:32:41] [INFO ] Invariant cache hit.
[2023-03-08 04:32:42] [INFO ] Dead Transitions using invariants and state equation in 97 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 141/206 places, 229/422 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 523 ms. Remains : 141/206 places, 229/422 transitions.
Stuttering acceptance computed with spot in 358 ms :[(OR (NOT p0) (NOT p2) (NOT p3)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (NOT p2), (NOT p2), (NOT p3), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p3))]
Running random walk in product with property : DBSingleClientW-PT-d2m07-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(OR (NOT p0) (AND (NOT p2) (NOT p1))), acceptance={0, 1} source=0 dest: 0}, { cond=(AND p0 (NOT p2) p1), acceptance={1} source=0 dest: 1}, { cond=(AND p0 (NOT p2) p1), acceptance={0, 1} source=0 dest: 2}, { cond=(OR (AND p0 p2) (AND p0 p1)), acceptance={0} source=0 dest: 3}, { cond=(OR (AND p0 p2) (AND p0 p1)), acceptance={0, 1} source=0 dest: 4}], [{ cond=(OR (AND (NOT p0) (NOT p1)) (AND (NOT p2) (NOT p1))), acceptance={0, 1} source=1 dest: 0}, { cond=(OR (AND (NOT p0) p1) (AND (NOT p2) p1)), acceptance={1} source=1 dest: 1}, { cond=(AND p0 p2 (NOT p1)), acceptance={0} source=1 dest: 3}, { cond=(AND p0 p2 (NOT p1)), acceptance={0, 1} source=1 dest: 4}, { cond=(AND p0 p2 p1), acceptance={} source=1 dest: 5}, { cond=(AND p0 p2 p1), acceptance={1} source=1 dest: 6}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0, 1} source=2 dest: 0}, { cond=(AND (NOT p2) p1), acceptance={1} source=2 dest: 1}, { cond=(AND (NOT p2) p1), acceptance={0, 1} source=2 dest: 2}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0, 1} source=3 dest: 0}, { cond=(AND (NOT p2) p1), acceptance={1} source=3 dest: 1}, { cond=(AND (NOT p2) p1), acceptance={0, 1} source=3 dest: 2}, { cond=(OR p2 p1), acceptance={0} source=3 dest: 3}], [{ cond=(OR (AND (NOT p0) (NOT p3)) (AND (NOT p2) (NOT p1) (NOT p3))), acceptance={0, 1} source=4 dest: 0}, { cond=(AND p0 (NOT p2) p1 (NOT p3)), acceptance={1} source=4 dest: 1}, { cond=(AND p0 (NOT p2) p1 (NOT p3)), acceptance={0, 1} source=4 dest: 2}, { cond=(OR (AND p0 p2 (NOT p3)) (AND p0 p1 (NOT p3))), acceptance={0} source=4 dest: 3}, { cond=(OR (AND p0 p2 (NOT p3)) (AND p0 p1 (NOT p3))), acceptance={0, 1} source=4 dest: 4}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0, 1} source=5 dest: 0}, { cond=(AND (NOT p2) p1), acceptance={1} source=5 dest: 1}, { cond=(AND p2 (NOT p1)), acceptance={0} source=5 dest: 3}, { cond=(AND p2 p1), acceptance={} source=5 dest: 5}], [{ cond=(OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p1) (NOT p3))), acceptance={0, 1} source=6 dest: 0}, { cond=(OR (AND (NOT p0) p1 (NOT p3)) (AND (NOT p2) p1 (NOT p3))), acceptance={1} source=6 dest: 1}, { cond=(AND p0 p2 (NOT p1) (NOT p3)), acceptance={0} source=6 dest: 3}, { cond=(AND p0 p2 (NOT p1) (NOT p3)), acceptance={0, 1} source=6 dest: 4}, { cond=(AND p0 p2 p1 (NOT p3)), acceptance={} source=6 dest: 5}, { cond=(AND p0 p2 p1 (NOT p3)), acceptance={1} source=6 dest: 6}]], initial=0, aps=[p0:(OR (LT s1 1) (LT s136 1)), p2:(AND (GEQ s1 1) (GEQ s127 1)), p1:(AND (GEQ s1 1) (GEQ s133 1)), p3:(AND (GEQ s1 1) (GEQ s88 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 1 ms.
FORMULA DBSingleClientW-PT-d2m07-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d2m07-LTLFireability-09 finished in 904 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((F(p0)&&G(F(p1))&&F(p2)))))'
Support contains 4 out of 206 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 206/206 places, 422/422 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 183 transition count 318
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 183 transition count 318
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 50 place count 183 transition count 314
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 68 place count 165 transition count 292
Iterating global reduction 1 with 18 rules applied. Total rules applied 86 place count 165 transition count 292
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 95 place count 165 transition count 283
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 108 place count 152 transition count 266
Iterating global reduction 2 with 13 rules applied. Total rules applied 121 place count 152 transition count 266
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 126 place count 152 transition count 261
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 134 place count 144 transition count 245
Iterating global reduction 3 with 8 rules applied. Total rules applied 142 place count 144 transition count 245
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 149 place count 144 transition count 238
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 155 place count 138 transition count 222
Iterating global reduction 4 with 6 rules applied. Total rules applied 161 place count 138 transition count 222
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 164 place count 138 transition count 219
Discarding 6 places :
Symmetric choice reduction at 5 with 6 rule applications. Total rules 170 place count 132 transition count 196
Iterating global reduction 5 with 6 rules applied. Total rules applied 176 place count 132 transition count 196
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 178 place count 132 transition count 194
Applied a total of 178 rules in 15 ms. Remains 132 /206 variables (removed 74) and now considering 194/422 (removed 228) transitions.
// Phase 1: matrix 194 rows 132 cols
[2023-03-08 04:32:42] [INFO ] Computed 2 place invariants in 4 ms
[2023-03-08 04:32:42] [INFO ] Implicit Places using invariants in 66 ms returned []
[2023-03-08 04:32:42] [INFO ] Invariant cache hit.
[2023-03-08 04:32:42] [INFO ] State equation strengthened by 66 read => feed constraints.
[2023-03-08 04:32:42] [INFO ] Implicit Places using invariants and state equation in 281 ms returned []
Implicit Place search using SMT with State Equation took 349 ms to find 0 implicit places.
[2023-03-08 04:32:42] [INFO ] Invariant cache hit.
[2023-03-08 04:32:42] [INFO ] Dead Transitions using invariants and state equation in 77 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 132/206 places, 194/422 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 443 ms. Remains : 132/206 places, 194/422 transitions.
Stuttering acceptance computed with spot in 1530 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1) (NOT p2)), (NOT p0), (NOT p1), (NOT p1), (NOT p2)]
Running random walk in product with property : DBSingleClientW-PT-d2m07-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 3}, { cond=(NOT p1), acceptance={} source=2 dest: 4}, { cond=true, acceptance={} source=2 dest: 5}, { cond=(NOT p2), acceptance={} source=2 dest: 6}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=4 dest: 4}], [{ cond=(NOT p1), acceptance={} source=5 dest: 4}, { cond=true, acceptance={} source=5 dest: 5}], [{ cond=(NOT p2), acceptance={0} source=6 dest: 6}]], initial=0, aps=[p0:(OR (AND (GEQ s1 1) (GEQ s126 1)) (AND (GEQ s8 1) (GEQ s55 1))), p1:(AND (GEQ s1 1) (GEQ s126 1)), p2:(AND (GEQ s8 1) (GEQ s55 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 3 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d2m07-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d2m07-LTLFireability-10 finished in 1995 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(G(p0))&&F(!p1))))'
Support contains 4 out of 206 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 206/206 places, 422/422 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 183 transition count 322
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 183 transition count 322
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 49 place count 183 transition count 319
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 68 place count 164 transition count 298
Iterating global reduction 1 with 19 rules applied. Total rules applied 87 place count 164 transition count 298
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 97 place count 164 transition count 288
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 110 place count 151 transition count 270
Iterating global reduction 2 with 13 rules applied. Total rules applied 123 place count 151 transition count 270
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 130 place count 151 transition count 263
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 138 place count 143 transition count 247
Iterating global reduction 3 with 8 rules applied. Total rules applied 146 place count 143 transition count 247
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 151 place count 143 transition count 242
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 158 place count 136 transition count 218
Iterating global reduction 4 with 7 rules applied. Total rules applied 165 place count 136 transition count 218
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 167 place count 136 transition count 216
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 170 place count 133 transition count 213
Iterating global reduction 5 with 3 rules applied. Total rules applied 173 place count 133 transition count 213
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 175 place count 133 transition count 211
Applied a total of 175 rules in 29 ms. Remains 133 /206 variables (removed 73) and now considering 211/422 (removed 211) transitions.
// Phase 1: matrix 211 rows 133 cols
[2023-03-08 04:32:44] [INFO ] Computed 2 place invariants in 5 ms
[2023-03-08 04:32:44] [INFO ] Implicit Places using invariants in 72 ms returned []
[2023-03-08 04:32:44] [INFO ] Invariant cache hit.
[2023-03-08 04:32:44] [INFO ] State equation strengthened by 85 read => feed constraints.
[2023-03-08 04:32:44] [INFO ] Implicit Places using invariants and state equation in 279 ms returned []
Implicit Place search using SMT with State Equation took 353 ms to find 0 implicit places.
[2023-03-08 04:32:44] [INFO ] Redundant transitions in 3 ms returned []
[2023-03-08 04:32:44] [INFO ] Invariant cache hit.
[2023-03-08 04:32:44] [INFO ] Dead Transitions using invariants and state equation in 83 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 133/206 places, 211/422 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 482 ms. Remains : 133/206 places, 211/422 transitions.
Stuttering acceptance computed with spot in 106 ms :[(OR (NOT p0) p1), (NOT p0), p1]
Running random walk in product with property : DBSingleClientW-PT-d2m07-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p1, acceptance={} source=0 dest: 2}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (GEQ s1 1) (GEQ s98 1)), p1:(AND (GEQ s26 1) (GEQ s114 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d2m07-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d2m07-LTLFireability-11 finished in 611 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)||X((!p1||G(F(p2)))))))'
Support contains 4 out of 206 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 206/206 places, 422/422 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 184 transition count 330
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 184 transition count 330
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 46 place count 184 transition count 328
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 65 place count 165 transition count 304
Iterating global reduction 1 with 19 rules applied. Total rules applied 84 place count 165 transition count 304
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 94 place count 165 transition count 294
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 107 place count 152 transition count 276
Iterating global reduction 2 with 13 rules applied. Total rules applied 120 place count 152 transition count 276
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 127 place count 152 transition count 269
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 135 place count 144 transition count 254
Iterating global reduction 3 with 8 rules applied. Total rules applied 143 place count 144 transition count 254
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 148 place count 144 transition count 249
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 154 place count 138 transition count 233
Iterating global reduction 4 with 6 rules applied. Total rules applied 160 place count 138 transition count 233
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 166 place count 138 transition count 227
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 171 place count 133 transition count 205
Iterating global reduction 5 with 5 rules applied. Total rules applied 176 place count 133 transition count 205
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 177 place count 133 transition count 204
Applied a total of 177 rules in 18 ms. Remains 133 /206 variables (removed 73) and now considering 204/422 (removed 218) transitions.
// Phase 1: matrix 204 rows 133 cols
[2023-03-08 04:32:45] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-08 04:32:45] [INFO ] Implicit Places using invariants in 70 ms returned []
[2023-03-08 04:32:45] [INFO ] Invariant cache hit.
[2023-03-08 04:32:45] [INFO ] State equation strengthened by 78 read => feed constraints.
[2023-03-08 04:32:45] [INFO ] Implicit Places using invariants and state equation in 242 ms returned []
Implicit Place search using SMT with State Equation took 314 ms to find 0 implicit places.
[2023-03-08 04:32:45] [INFO ] Invariant cache hit.
[2023-03-08 04:32:45] [INFO ] Dead Transitions using invariants and state equation in 80 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 133/206 places, 204/422 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 414 ms. Remains : 133/206 places, 204/422 transitions.
Stuttering acceptance computed with spot in 138 ms :[(AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : DBSingleClientW-PT-d2m07-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(AND (GEQ s1 1) (GEQ s71 1)), p1:(OR (LT s1 1) (LT s131 1)), p2:(OR (LT s1 1) (LT s98 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 29737 reset in 188 ms.
Product exploration explored 100000 steps with 29787 reset in 185 ms.
Computed a total of 5 stabilizing places and 18 stable transitions
Graph (complete) has 491 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 18 stable transitions
Knowledge obtained : [(AND (NOT p0) p1 p2), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 861 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 4 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 497 ms :[(AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2))]
Incomplete random walk after 10000 steps, including 2298 resets, run finished after 135 ms. (steps per millisecond=74 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 474 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 446 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 413 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 444 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 471 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 464 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 6) seen :0
Finished probabilistic random walk after 73712 steps, run visited all 6 properties in 263 ms. (steps per millisecond=280 )
Probabilistic random walk after 73712 steps, saw 32576 distinct states, run finished after 264 ms. (steps per millisecond=279 ) properties seen :6
Knowledge obtained : [(AND (NOT p0) p1 p2), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(F (AND (NOT p2) (NOT p0) (NOT p1))), (F (AND (NOT p0) (NOT p1))), (F (AND (NOT p2) (NOT p0))), (F p0), (F (AND (NOT p2) (NOT p0) p1)), (F (NOT (AND (NOT p0) p1)))]
Knowledge based reduction with 6 factoid took 511 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 4 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 186 ms :[(AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 148 ms :[(AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2))]
Support contains 4 out of 133 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 133/133 places, 204/204 transitions.
Applied a total of 0 rules in 1 ms. Remains 133 /133 variables (removed 0) and now considering 204/204 (removed 0) transitions.
[2023-03-08 04:32:48] [INFO ] Invariant cache hit.
[2023-03-08 04:32:48] [INFO ] Implicit Places using invariants in 69 ms returned []
[2023-03-08 04:32:48] [INFO ] Invariant cache hit.
[2023-03-08 04:32:48] [INFO ] State equation strengthened by 78 read => feed constraints.
[2023-03-08 04:32:49] [INFO ] Implicit Places using invariants and state equation in 231 ms returned []
Implicit Place search using SMT with State Equation took 314 ms to find 0 implicit places.
[2023-03-08 04:32:49] [INFO ] Invariant cache hit.
[2023-03-08 04:32:49] [INFO ] Dead Transitions using invariants and state equation in 79 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 395 ms. Remains : 133/133 places, 204/204 transitions.
Computed a total of 5 stabilizing places and 18 stable transitions
Graph (complete) has 491 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 18 stable transitions
Knowledge obtained : [(AND (NOT p0) p1 p2), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p2) (NOT p0) p1))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 275 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 4 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 158 ms :[(AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2))]
Incomplete random walk after 10000 steps, including 2285 resets, run finished after 184 ms. (steps per millisecond=54 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 475 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 437 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 449 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 454 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 443 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 447 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 6) seen :0
Finished probabilistic random walk after 73712 steps, run visited all 6 properties in 305 ms. (steps per millisecond=241 )
Probabilistic random walk after 73712 steps, saw 32576 distinct states, run finished after 305 ms. (steps per millisecond=241 ) properties seen :6
Knowledge obtained : [(AND (NOT p0) p1 p2), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p2) (NOT p0) p1))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1) (NOT p2))), (F (AND (NOT p0) (NOT p1))), (F (AND (NOT p0) (NOT p2))), (F p0), (F (AND (NOT p0) p1 (NOT p2))), (F (NOT (AND (NOT p0) p1)))]
Knowledge based reduction with 6 factoid took 390 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 4 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 149 ms :[(AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 172 ms :[(AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 145 ms :[(AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2))]
Product exploration explored 100000 steps with 29754 reset in 174 ms.
Product exploration explored 100000 steps with 29793 reset in 173 ms.
Applying partial POR strategy [false, true, true, true]
Stuttering acceptance computed with spot in 180 ms :[(AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2))]
Support contains 4 out of 133 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 133/133 places, 204/204 transitions.
Applied a total of 0 rules in 17 ms. Remains 133 /133 variables (removed 0) and now considering 204/204 (removed 0) transitions.
[2023-03-08 04:32:51] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 04:32:51] [INFO ] Invariant cache hit.
[2023-03-08 04:32:52] [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 121 ms. Remains : 133/133 places, 204/204 transitions.
Built C files in :
/tmp/ltsmin9847200777029133895
[2023-03-08 04:32:52] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9847200777029133895
Running compilation step : cd /tmp/ltsmin9847200777029133895;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 308 ms.
Running link step : cd /tmp/ltsmin9847200777029133895;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin9847200777029133895;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased11054491357166928646.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 LTL mode, iteration 0 : 133/133 places, 204/204 transitions.
Applied a total of 0 rules in 4 ms. Remains 133 /133 variables (removed 0) and now considering 204/204 (removed 0) transitions.
[2023-03-08 04:33:07] [INFO ] Invariant cache hit.
[2023-03-08 04:33:07] [INFO ] Implicit Places using invariants in 79 ms returned []
[2023-03-08 04:33:07] [INFO ] Invariant cache hit.
[2023-03-08 04:33:07] [INFO ] State equation strengthened by 78 read => feed constraints.
[2023-03-08 04:33:07] [INFO ] Implicit Places using invariants and state equation in 255 ms returned []
Implicit Place search using SMT with State Equation took 336 ms to find 0 implicit places.
[2023-03-08 04:33:07] [INFO ] Invariant cache hit.
[2023-03-08 04:33:07] [INFO ] Dead Transitions using invariants and state equation in 85 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 426 ms. Remains : 133/133 places, 204/204 transitions.
Built C files in :
/tmp/ltsmin14813370161563063307
[2023-03-08 04:33:07] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14813370161563063307
Running compilation step : cd /tmp/ltsmin14813370161563063307;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 325 ms.
Running link step : cd /tmp/ltsmin14813370161563063307;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin14813370161563063307;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased17093418292710652145.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-03-08 04:33:22] [INFO ] Flatten gal took : 12 ms
[2023-03-08 04:33:22] [INFO ] Flatten gal took : 12 ms
[2023-03-08 04:33:22] [INFO ] Time to serialize gal into /tmp/LTL2765135393244231321.gal : 2 ms
[2023-03-08 04:33:22] [INFO ] Time to serialize properties into /tmp/LTL12735308259766686459.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.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL2765135393244231321.gal' '-t' 'CGAL' '-hoa' '/tmp/aut16727577712378055516.hoa' '-atoms' '/tmp/LTL12735308259766686459.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.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL12735308259766686459.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut16727577712378055516.hoa
Detected timeout of ITS tools.
[2023-03-08 04:33:37] [INFO ] Flatten gal took : 10 ms
[2023-03-08 04:33:37] [INFO ] Flatten gal took : 10 ms
[2023-03-08 04:33:37] [INFO ] Time to serialize gal into /tmp/LTL3482469788643678813.gal : 3 ms
[2023-03-08 04:33:37] [INFO ] Time to serialize properties into /tmp/LTL14790430974879917892.ltl : 3 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.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3482469788643678813.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14790430974879917892.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.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((G((F("((s1>=1)&&(l1667>=1))"))||(X(("((s1>=1)&&(l4272>=1))")||(G(F("((s1<1)||(l3092<1))"))))))))
Formula 0 simplified : F(G!"((s1>=1)&&(l1667>=1))" & X(!"((s1>=1)&&(l4272>=1))" & FG!"((s1<1)||(l3092<1))"))
Detected timeout of ITS tools.
[2023-03-08 04:33:52] [INFO ] Flatten gal took : 10 ms
[2023-03-08 04:33:52] [INFO ] Applying decomposition
[2023-03-08 04:33:52] [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.202303021504/bin/convert-linux64' '-i' '/tmp/graph3144205726449144048.txt' '-o' '/tmp/graph3144205726449144048.bin' '-w' '/tmp/graph3144205726449144048.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph3144205726449144048.bin' '-l' '-1' '-v' '-w' '/tmp/graph3144205726449144048.weights' '-q' '0' '-e' '0.001'
[2023-03-08 04:33:53] [INFO ] Decomposing Gal with order
[2023-03-08 04:33:53] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-08 04:33:53] [INFO ] Removed a total of 217 redundant transitions.
[2023-03-08 04:33:53] [INFO ] Flatten gal took : 52 ms
[2023-03-08 04:33:53] [INFO ] Fuse similar labels procedure discarded/fused a total of 134 labels/synchronizations in 12 ms.
[2023-03-08 04:33:53] [INFO ] Time to serialize gal into /tmp/LTL1261187534543160555.gal : 4 ms
[2023-03-08 04:33:53] [INFO ] Time to serialize properties into /tmp/LTL5144272771866645921.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.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1261187534543160555.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5144272771866645921.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((G((F("((i8.u4.s1>=1)&&(u2.l1667>=1))"))||(X(("((i8.u4.s1>=1)&&(i2.u23.l4272>=1))")||(G(F("((i8.u4.s1<1)||(u2.l3092<1))"))))))))
Formula 0 simplified : F(G!"((i8.u4.s1>=1)&&(u2.l1667>=1))" & X(!"((i8.u4.s1>=1)&&(i2.u23.l4272>=1))" & FG!"((i8.u4.s1<1)||(u2.l3092<1))"))
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin4345707804357235330
[2023-03-08 04:34:08] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4345707804357235330
Running compilation step : cd /tmp/ltsmin4345707804357235330;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 328 ms.
Running link step : cd /tmp/ltsmin4345707804357235330;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin4345707804357235330;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[]((<>((LTLAPp0==true))||X(((LTLAPp1==true)||[](<>((LTLAPp2==true)))))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property DBSingleClientW-PT-d2m07-LTLFireability-12 finished in 98296 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 206 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 206/206 places, 422/422 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 182 transition count 317
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 182 transition count 317
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 52 place count 182 transition count 313
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 71 place count 163 transition count 289
Iterating global reduction 1 with 19 rules applied. Total rules applied 90 place count 163 transition count 289
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 100 place count 163 transition count 279
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 113 place count 150 transition count 262
Iterating global reduction 2 with 13 rules applied. Total rules applied 126 place count 150 transition count 262
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 131 place count 150 transition count 257
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 139 place count 142 transition count 241
Iterating global reduction 3 with 8 rules applied. Total rules applied 147 place count 142 transition count 241
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 154 place count 142 transition count 234
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 161 place count 135 transition count 210
Iterating global reduction 4 with 7 rules applied. Total rules applied 168 place count 135 transition count 210
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 171 place count 135 transition count 207
Discarding 6 places :
Symmetric choice reduction at 5 with 6 rule applications. Total rules 177 place count 129 transition count 184
Iterating global reduction 5 with 6 rules applied. Total rules applied 183 place count 129 transition count 184
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 185 place count 129 transition count 182
Applied a total of 185 rules in 26 ms. Remains 129 /206 variables (removed 77) and now considering 182/422 (removed 240) transitions.
// Phase 1: matrix 182 rows 129 cols
[2023-03-08 04:34:23] [INFO ] Computed 2 place invariants in 2 ms
[2023-03-08 04:34:23] [INFO ] Implicit Places using invariants in 90 ms returned []
[2023-03-08 04:34:23] [INFO ] Invariant cache hit.
[2023-03-08 04:34:23] [INFO ] State equation strengthened by 57 read => feed constraints.
[2023-03-08 04:34:23] [INFO ] Implicit Places using invariants and state equation in 238 ms returned []
Implicit Place search using SMT with State Equation took 331 ms to find 0 implicit places.
[2023-03-08 04:34:23] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-08 04:34:23] [INFO ] Invariant cache hit.
[2023-03-08 04:34:23] [INFO ] Dead Transitions using invariants and state equation in 84 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 129/206 places, 182/422 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 449 ms. Remains : 129/206 places, 182/422 transitions.
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d2m07-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (LT s1 1) (LT s123 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 23080 reset in 133 ms.
Product exploration explored 100000 steps with 22982 reset in 139 ms.
Computed a total of 5 stabilizing places and 15 stable transitions
Graph (complete) has 465 edges and 129 vertex of which 128 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Computed a total of 5 stabilizing places and 15 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 98 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 2303 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 449 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Finished probabilistic random walk after 21157 steps, run visited all 1 properties in 39 ms. (steps per millisecond=542 )
Probabilistic random walk after 21157 steps, saw 10415 distinct states, run finished after 40 ms. (steps per millisecond=528 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 124 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Support contains 2 out of 129 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 129/129 places, 182/182 transitions.
Applied a total of 0 rules in 8 ms. Remains 129 /129 variables (removed 0) and now considering 182/182 (removed 0) transitions.
[2023-03-08 04:34:24] [INFO ] Invariant cache hit.
[2023-03-08 04:34:24] [INFO ] Implicit Places using invariants in 69 ms returned []
[2023-03-08 04:34:24] [INFO ] Invariant cache hit.
[2023-03-08 04:34:24] [INFO ] State equation strengthened by 57 read => feed constraints.
[2023-03-08 04:34:24] [INFO ] Implicit Places using invariants and state equation in 224 ms returned []
Implicit Place search using SMT with State Equation took 295 ms to find 0 implicit places.
[2023-03-08 04:34:24] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 04:34:24] [INFO ] Invariant cache hit.
[2023-03-08 04:34:24] [INFO ] Dead Transitions using invariants and state equation in 80 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 389 ms. Remains : 129/129 places, 182/182 transitions.
Computed a total of 5 stabilizing places and 15 stable transitions
Graph (complete) has 465 edges and 129 vertex of which 128 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 : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 92 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 2331 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 441 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Finished probabilistic random walk after 21157 steps, run visited all 1 properties in 36 ms. (steps per millisecond=587 )
Probabilistic random walk after 21157 steps, saw 10415 distinct states, run finished after 37 ms. (steps per millisecond=571 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 217 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Product exploration explored 100000 steps with 23049 reset in 136 ms.
Product exploration explored 100000 steps with 22993 reset in 142 ms.
Built C files in :
/tmp/ltsmin2385418125266946930
[2023-03-08 04:34:25] [INFO ] Computing symmetric may disable matrix : 182 transitions.
[2023-03-08 04:34:25] [INFO ] Computation of Complete disable matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-08 04:34:25] [INFO ] Computing symmetric may enable matrix : 182 transitions.
[2023-03-08 04:34:25] [INFO ] Computation of Complete enable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-08 04:34:25] [INFO ] Computing Do-Not-Accords matrix : 182 transitions.
[2023-03-08 04:34:25] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-08 04:34:25] [INFO ] Built C files in 44ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2385418125266946930
Running compilation step : cd /tmp/ltsmin2385418125266946930;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 377 ms.
Running link step : cd /tmp/ltsmin2385418125266946930;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin2385418125266946930;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased9929361148601709009.hoa' '--buchi-type=spotba'
LTSmin run took 224 ms.
FORMULA DBSingleClientW-PT-d2m07-LTLFireability-14 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property DBSingleClientW-PT-d2m07-LTLFireability-14 finished in 3104 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(!p0)||X(F(p1))))'
Support contains 3 out of 206 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 206/206 places, 422/422 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 183 transition count 324
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 183 transition count 324
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 50 place count 183 transition count 320
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 68 place count 165 transition count 297
Iterating global reduction 1 with 18 rules applied. Total rules applied 86 place count 165 transition count 297
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 96 place count 165 transition count 287
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 108 place count 153 transition count 271
Iterating global reduction 2 with 12 rules applied. Total rules applied 120 place count 153 transition count 271
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 125 place count 153 transition count 266
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 132 place count 146 transition count 255
Iterating global reduction 3 with 7 rules applied. Total rules applied 139 place count 146 transition count 255
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 146 place count 146 transition count 248
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 152 place count 140 transition count 225
Iterating global reduction 4 with 6 rules applied. Total rules applied 158 place count 140 transition count 225
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 161 place count 140 transition count 222
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 166 place count 135 transition count 200
Iterating global reduction 5 with 5 rules applied. Total rules applied 171 place count 135 transition count 200
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 173 place count 135 transition count 198
Applied a total of 173 rules in 11 ms. Remains 135 /206 variables (removed 71) and now considering 198/422 (removed 224) transitions.
// Phase 1: matrix 198 rows 135 cols
[2023-03-08 04:34:26] [INFO ] Computed 2 place invariants in 2 ms
[2023-03-08 04:34:26] [INFO ] Implicit Places using invariants in 76 ms returned []
[2023-03-08 04:34:26] [INFO ] Invariant cache hit.
[2023-03-08 04:34:26] [INFO ] State equation strengthened by 66 read => feed constraints.
[2023-03-08 04:34:26] [INFO ] Implicit Places using invariants and state equation in 256 ms returned []
Implicit Place search using SMT with State Equation took 334 ms to find 0 implicit places.
[2023-03-08 04:34:26] [INFO ] Invariant cache hit.
[2023-03-08 04:34:26] [INFO ] Dead Transitions using invariants and state equation in 92 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 135/206 places, 198/422 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 437 ms. Remains : 135/206 places, 198/422 transitions.
Stuttering acceptance computed with spot in 87 ms :[(NOT p1), (AND (NOT p1) p0), (AND (NOT p1) p0)]
Running random walk in product with property : DBSingleClientW-PT-d2m07-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=p0, acceptance={} source=1 dest: 0}, { cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 2}]], initial=1, aps=[p1:(AND (GEQ s1 1) (GEQ s126 1)), p0:(AND (GEQ s1 1) (GEQ s129 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][false, false, false]]
Product exploration explored 100000 steps with 23124 reset in 156 ms.
Product exploration explored 100000 steps with 22888 reset in 165 ms.
Computed a total of 5 stabilizing places and 16 stable transitions
Graph (complete) has 492 edges and 135 vertex of which 134 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 (NOT p1) (NOT p0)), (X (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT p1))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 207 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 123 ms :[(NOT p1), (AND (NOT p1) p0), (AND (NOT p1) p0)]
Incomplete random walk after 10000 steps, including 2258 resets, run finished after 101 ms. (steps per millisecond=99 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 437 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 437 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 445 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 3) seen :0
Finished probabilistic random walk after 18370 steps, run visited all 3 properties in 90 ms. (steps per millisecond=204 )
Probabilistic random walk after 18370 steps, saw 8586 distinct states, run finished after 90 ms. (steps per millisecond=204 ) properties seen :3
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT p1))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : [(F p1), (F (NOT (AND (NOT p0) (NOT p1)))), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 7 factoid took 301 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 118 ms :[(NOT p1), (AND (NOT p1) p0), (AND (NOT p1) p0)]
Stuttering acceptance computed with spot in 125 ms :[(NOT p1), (AND (NOT p1) p0), (AND (NOT p1) p0)]
Support contains 3 out of 135 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 135/135 places, 198/198 transitions.
Applied a total of 0 rules in 1 ms. Remains 135 /135 variables (removed 0) and now considering 198/198 (removed 0) transitions.
[2023-03-08 04:34:28] [INFO ] Invariant cache hit.
[2023-03-08 04:34:28] [INFO ] Implicit Places using invariants in 82 ms returned []
[2023-03-08 04:34:28] [INFO ] Invariant cache hit.
[2023-03-08 04:34:28] [INFO ] State equation strengthened by 66 read => feed constraints.
[2023-03-08 04:34:28] [INFO ] Implicit Places using invariants and state equation in 247 ms returned []
Implicit Place search using SMT with State Equation took 330 ms to find 0 implicit places.
[2023-03-08 04:34:28] [INFO ] Invariant cache hit.
[2023-03-08 04:34:28] [INFO ] Dead Transitions using invariants and state equation in 88 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 421 ms. Remains : 135/135 places, 198/198 transitions.
Computed a total of 5 stabilizing places and 16 stable transitions
Graph (complete) has 492 edges and 135 vertex of which 134 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 (NOT p1) (NOT p0)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT p1))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 210 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 107 ms :[(NOT p1), (AND (NOT p1) p0), (AND (NOT p1) p0)]
Incomplete random walk after 10000 steps, including 2290 resets, run finished after 104 ms. (steps per millisecond=96 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 456 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 453 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 483 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 3) seen :0
Finished probabilistic random walk after 18370 steps, run visited all 3 properties in 89 ms. (steps per millisecond=206 )
Probabilistic random walk after 18370 steps, saw 8586 distinct states, run finished after 89 ms. (steps per millisecond=206 ) properties seen :3
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT p1))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : [(F p1), (F (NOT (AND (NOT p0) (NOT p1)))), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 6 factoid took 267 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 111 ms :[(NOT p1), (AND (NOT p1) p0), (AND (NOT p1) p0)]
Stuttering acceptance computed with spot in 116 ms :[(NOT p1), (AND (NOT p1) p0), (AND (NOT p1) p0)]
Stuttering acceptance computed with spot in 90 ms :[(NOT p1), (AND (NOT p1) p0), (AND (NOT p1) p0)]
Product exploration explored 100000 steps with 22985 reset in 148 ms.
Product exploration explored 100000 steps with 22952 reset in 150 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 102 ms :[(NOT p1), (AND (NOT p1) p0), (AND (NOT p1) p0)]
Support contains 3 out of 135 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 135/135 places, 198/198 transitions.
Applied a total of 0 rules in 3 ms. Remains 135 /135 variables (removed 0) and now considering 198/198 (removed 0) transitions.
[2023-03-08 04:34:30] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-08 04:34:30] [INFO ] Invariant cache hit.
[2023-03-08 04:34:30] [INFO ] Dead Transitions using invariants and state equation in 72 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 99 ms. Remains : 135/135 places, 198/198 transitions.
Built C files in :
/tmp/ltsmin6946247843703992603
[2023-03-08 04:34:30] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6946247843703992603
Running compilation step : cd /tmp/ltsmin6946247843703992603;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 293 ms.
Running link step : cd /tmp/ltsmin6946247843703992603;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 27 ms.
Running LTSmin : cd /tmp/ltsmin6946247843703992603;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased2210911620827962052.hoa' '--buchi-type=spotba'
LTSmin run took 7224 ms.
FORMULA DBSingleClientW-PT-d2m07-LTLFireability-15 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property DBSingleClientW-PT-d2m07-LTLFireability-15 finished in 11904 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)||X((!p1||G(F(p2)))))))'
Found a Lengthening insensitive property : DBSingleClientW-PT-d2m07-LTLFireability-12
Stuttering acceptance computed with spot in 152 ms :[(AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2))]
Support contains 4 out of 206 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 206/206 places, 422/422 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 184 transition count 330
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 184 transition count 330
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 46 place count 184 transition count 328
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 65 place count 165 transition count 304
Iterating global reduction 1 with 19 rules applied. Total rules applied 84 place count 165 transition count 304
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 94 place count 165 transition count 294
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 107 place count 152 transition count 276
Iterating global reduction 2 with 13 rules applied. Total rules applied 120 place count 152 transition count 276
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 127 place count 152 transition count 269
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 135 place count 144 transition count 254
Iterating global reduction 3 with 8 rules applied. Total rules applied 143 place count 144 transition count 254
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 148 place count 144 transition count 249
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 154 place count 138 transition count 233
Iterating global reduction 4 with 6 rules applied. Total rules applied 160 place count 138 transition count 233
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 166 place count 138 transition count 227
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 171 place count 133 transition count 205
Iterating global reduction 5 with 5 rules applied. Total rules applied 176 place count 133 transition count 205
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 177 place count 133 transition count 204
Applied a total of 177 rules in 26 ms. Remains 133 /206 variables (removed 73) and now considering 204/422 (removed 218) transitions.
// Phase 1: matrix 204 rows 133 cols
[2023-03-08 04:34:38] [INFO ] Computed 2 place invariants in 4 ms
[2023-03-08 04:34:38] [INFO ] Implicit Places using invariants in 74 ms returned []
[2023-03-08 04:34:38] [INFO ] Invariant cache hit.
[2023-03-08 04:34:38] [INFO ] State equation strengthened by 78 read => feed constraints.
[2023-03-08 04:34:38] [INFO ] Implicit Places using invariants and state equation in 253 ms returned []
Implicit Place search using SMT with State Equation took 329 ms to find 0 implicit places.
[2023-03-08 04:34:38] [INFO ] Invariant cache hit.
[2023-03-08 04:34:38] [INFO ] Dead Transitions using invariants and state equation in 76 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 133/206 places, 204/422 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 432 ms. Remains : 133/206 places, 204/422 transitions.
Running random walk in product with property : DBSingleClientW-PT-d2m07-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(AND (GEQ s1 1) (GEQ s71 1)), p1:(OR (LT s1 1) (LT s131 1)), p2:(OR (LT s1 1) (LT s98 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 29807 reset in 171 ms.
Product exploration explored 100000 steps with 29798 reset in 173 ms.
Computed a total of 5 stabilizing places and 18 stable transitions
Graph (complete) has 491 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 18 stable transitions
Knowledge obtained : [(AND (NOT p0) p1 p2), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 306 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 4 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 126 ms :[(AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2))]
Incomplete random walk after 10000 steps, including 2315 resets, run finished after 228 ms. (steps per millisecond=43 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 441 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 425 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 450 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 455 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 424 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 463 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 6) seen :0
Finished probabilistic random walk after 73712 steps, run visited all 6 properties in 253 ms. (steps per millisecond=291 )
Probabilistic random walk after 73712 steps, saw 32576 distinct states, run finished after 254 ms. (steps per millisecond=290 ) properties seen :6
Knowledge obtained : [(AND (NOT p0) p1 p2), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(F (AND (NOT p2) (NOT p0) (NOT p1))), (F (AND (NOT p0) (NOT p1))), (F (AND (NOT p2) (NOT p0))), (F p0), (F (AND (NOT p2) (NOT p0) p1)), (F (NOT (AND (NOT p0) p1)))]
Knowledge based reduction with 6 factoid took 361 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 4 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 154 ms :[(AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 169 ms :[(AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2))]
Support contains 4 out of 133 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 133/133 places, 204/204 transitions.
Applied a total of 0 rules in 1 ms. Remains 133 /133 variables (removed 0) and now considering 204/204 (removed 0) transitions.
[2023-03-08 04:34:41] [INFO ] Invariant cache hit.
[2023-03-08 04:34:41] [INFO ] Implicit Places using invariants in 71 ms returned []
[2023-03-08 04:34:41] [INFO ] Invariant cache hit.
[2023-03-08 04:34:41] [INFO ] State equation strengthened by 78 read => feed constraints.
[2023-03-08 04:34:41] [INFO ] Implicit Places using invariants and state equation in 256 ms returned []
Implicit Place search using SMT with State Equation took 332 ms to find 0 implicit places.
[2023-03-08 04:34:41] [INFO ] Invariant cache hit.
[2023-03-08 04:34:41] [INFO ] Dead Transitions using invariants and state equation in 80 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 414 ms. Remains : 133/133 places, 204/204 transitions.
Computed a total of 5 stabilizing places and 18 stable transitions
Graph (complete) has 491 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 18 stable transitions
Knowledge obtained : [(AND (NOT p0) p1 p2), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p2) (NOT p0) p1))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 231 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 4 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 139 ms :[(AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2))]
Incomplete random walk after 10000 steps, including 2285 resets, run finished after 127 ms. (steps per millisecond=78 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 420 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 440 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 428 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 466 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 444 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 468 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 6) seen :0
Finished probabilistic random walk after 73712 steps, run visited all 6 properties in 277 ms. (steps per millisecond=266 )
Probabilistic random walk after 73712 steps, saw 32576 distinct states, run finished after 278 ms. (steps per millisecond=265 ) properties seen :6
Knowledge obtained : [(AND (NOT p0) p1 p2), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p2) (NOT p0) p1))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1) (NOT p2))), (F (AND (NOT p0) (NOT p1))), (F (AND (NOT p0) (NOT p2))), (F p0), (F (AND (NOT p0) p1 (NOT p2))), (F (NOT (AND (NOT p0) p1)))]
Knowledge based reduction with 6 factoid took 384 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 4 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 122 ms :[(AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 138 ms :[(AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 128 ms :[(AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2))]
Product exploration explored 100000 steps with 29815 reset in 175 ms.
Product exploration explored 100000 steps with 29790 reset in 181 ms.
Applying partial POR strategy [false, true, true, true]
Stuttering acceptance computed with spot in 137 ms :[(AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2))]
Support contains 4 out of 133 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 133/133 places, 204/204 transitions.
Applied a total of 0 rules in 16 ms. Remains 133 /133 variables (removed 0) and now considering 204/204 (removed 0) transitions.
[2023-03-08 04:34:44] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-08 04:34:44] [INFO ] Invariant cache hit.
[2023-03-08 04:34:44] [INFO ] Dead Transitions using invariants and state equation in 100 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 131 ms. Remains : 133/133 places, 204/204 transitions.
Built C files in :
/tmp/ltsmin2390479625766531463
[2023-03-08 04:34:44] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2390479625766531463
Running compilation step : cd /tmp/ltsmin2390479625766531463;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 310 ms.
Running link step : cd /tmp/ltsmin2390479625766531463;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin2390479625766531463;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased15647507754313993334.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 LTL mode, iteration 0 : 133/133 places, 204/204 transitions.
Applied a total of 0 rules in 4 ms. Remains 133 /133 variables (removed 0) and now considering 204/204 (removed 0) transitions.
[2023-03-08 04:34:59] [INFO ] Invariant cache hit.
[2023-03-08 04:34:59] [INFO ] Implicit Places using invariants in 72 ms returned []
[2023-03-08 04:34:59] [INFO ] Invariant cache hit.
[2023-03-08 04:34:59] [INFO ] State equation strengthened by 78 read => feed constraints.
[2023-03-08 04:34:59] [INFO ] Implicit Places using invariants and state equation in 259 ms returned []
Implicit Place search using SMT with State Equation took 338 ms to find 0 implicit places.
[2023-03-08 04:34:59] [INFO ] Invariant cache hit.
[2023-03-08 04:34:59] [INFO ] Dead Transitions using invariants and state equation in 89 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 433 ms. Remains : 133/133 places, 204/204 transitions.
Built C files in :
/tmp/ltsmin2454315873343984868
[2023-03-08 04:34:59] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2454315873343984868
Running compilation step : cd /tmp/ltsmin2454315873343984868;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 330 ms.
Running link step : cd /tmp/ltsmin2454315873343984868;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin2454315873343984868;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased4081286803580392433.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-03-08 04:35:15] [INFO ] Flatten gal took : 14 ms
[2023-03-08 04:35:15] [INFO ] Flatten gal took : 8 ms
[2023-03-08 04:35:15] [INFO ] Time to serialize gal into /tmp/LTL2259365610011316483.gal : 2 ms
[2023-03-08 04:35:15] [INFO ] Time to serialize properties into /tmp/LTL13839228810932663731.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.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL2259365610011316483.gal' '-t' 'CGAL' '-hoa' '/tmp/aut6324037603878829719.hoa' '-atoms' '/tmp/LTL13839228810932663731.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.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL13839228810932663731.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut6324037603878829719.hoa
Detected timeout of ITS tools.
[2023-03-08 04:35:30] [INFO ] Flatten gal took : 9 ms
[2023-03-08 04:35:30] [INFO ] Flatten gal took : 9 ms
[2023-03-08 04:35:30] [INFO ] Time to serialize gal into /tmp/LTL15204147325680214707.gal : 2 ms
[2023-03-08 04:35:30] [INFO ] Time to serialize properties into /tmp/LTL380426497858561701.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.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15204147325680214707.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL380426497858561701.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.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((G((F("((s1>=1)&&(l1667>=1))"))||(X(("((s1>=1)&&(l4272>=1))")||(G(F("((s1<1)||(l3092<1))"))))))))
Formula 0 simplified : F(G!"((s1>=1)&&(l1667>=1))" & X(!"((s1>=1)&&(l4272>=1))" & FG!"((s1<1)||(l3092<1))"))
Detected timeout of ITS tools.
[2023-03-08 04:35:45] [INFO ] Flatten gal took : 9 ms
[2023-03-08 04:35:45] [INFO ] Applying decomposition
[2023-03-08 04:35:45] [INFO ] Flatten gal took : 22 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph2826499314532743420.txt' '-o' '/tmp/graph2826499314532743420.bin' '-w' '/tmp/graph2826499314532743420.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph2826499314532743420.bin' '-l' '-1' '-v' '-w' '/tmp/graph2826499314532743420.weights' '-q' '0' '-e' '0.001'
[2023-03-08 04:35:45] [INFO ] Decomposing Gal with order
[2023-03-08 04:35:45] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-08 04:35:45] [INFO ] Removed a total of 174 redundant transitions.
[2023-03-08 04:35:45] [INFO ] Flatten gal took : 21 ms
[2023-03-08 04:35:45] [INFO ] Fuse similar labels procedure discarded/fused a total of 140 labels/synchronizations in 4 ms.
[2023-03-08 04:35:45] [INFO ] Time to serialize gal into /tmp/LTL11232300533393303635.gal : 26 ms
[2023-03-08 04:35:45] [INFO ] Time to serialize properties into /tmp/LTL1814822630027115709.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.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL11232300533393303635.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1814822630027115709.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((G((F("((i2.u0.s1>=1)&&(i2.u0.l1667>=1))"))||(X(("((i2.u0.s1>=1)&&(u14.l4272>=1))")||(G(F("((i2.u0.s1<1)||(i2.u0.l3092<1))"))))))))
Formula 0 simplified : F(G!"((i2.u0.s1>=1)&&(i2.u0.l1667>=1))" & X(!"((i2.u0.s1>=1)&&(u14.l4272>=1))" & FG!"((i2.u0.s1<1)||(i2.u0.l3092<1))"))
Reverse transition relation is NOT exact ! Due to transitions t1, t6, t96, t155, t206, t211, t301, t324, t344, t348, t349, t350, t351, t353, t358, t359, t3...822
Computing Next relation with stutter on 1.67049e+07 deadlock states
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin14939202214275447382
[2023-03-08 04:36:00] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14939202214275447382
Running compilation step : cd /tmp/ltsmin14939202214275447382;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 300 ms.
Running link step : cd /tmp/ltsmin14939202214275447382;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 25 ms.
Running LTSmin : cd /tmp/ltsmin14939202214275447382;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[]((<>((LTLAPp0==true))||X(((LTLAPp1==true)||[](<>((LTLAPp2==true)))))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property DBSingleClientW-PT-d2m07-LTLFireability-12 finished in 97283 ms.
[2023-03-08 04:36:15] [INFO ] Flatten gal took : 17 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin12182328230926088935
[2023-03-08 04:36:15] [INFO ] Computing symmetric may disable matrix : 422 transitions.
[2023-03-08 04:36:15] [INFO ] Applying decomposition
[2023-03-08 04:36:15] [INFO ] Computation of Complete disable matrix. took 8 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-08 04:36:15] [INFO ] Computing symmetric may enable matrix : 422 transitions.
[2023-03-08 04:36:15] [INFO ] Flatten gal took : 15 ms
[2023-03-08 04:36:15] [INFO ] Computation of Complete enable matrix. took 2 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.202303021504/bin/convert-linux64' '-i' '/tmp/graph7982418568862790032.txt' '-o' '/tmp/graph7982418568862790032.bin' '-w' '/tmp/graph7982418568862790032.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph7982418568862790032.bin' '-l' '-1' '-v' '-w' '/tmp/graph7982418568862790032.weights' '-q' '0' '-e' '0.001'
[2023-03-08 04:36:15] [INFO ] Decomposing Gal with order
[2023-03-08 04:36:15] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-08 04:36:15] [INFO ] Computing Do-Not-Accords matrix : 422 transitions.
[2023-03-08 04:36:15] [INFO ] Computation of Completed DNA matrix. took 16 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-08 04:36:15] [INFO ] Built C files in 93ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12182328230926088935
Running compilation step : cd /tmp/ltsmin12182328230926088935;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2023-03-08 04:36:15] [INFO ] Removed a total of 437 redundant transitions.
[2023-03-08 04:36:15] [INFO ] Flatten gal took : 43 ms
[2023-03-08 04:36:15] [INFO ] Fuse similar labels procedure discarded/fused a total of 314 labels/synchronizations in 10 ms.
[2023-03-08 04:36:15] [INFO ] Time to serialize gal into /tmp/LTLFireability9446702149930805127.gal : 3 ms
[2023-03-08 04:36:15] [INFO ] Time to serialize properties into /tmp/LTLFireability2490669145616499985.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.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability9446702149930805127.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability2490669145616499985.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((G((F("((i3.u0.s1>=1)&&(i3.u0.l1667>=1))"))||(X((!("((i3.u0.s1<1)||(i5.u25.l4272<1))"))||(G(F("((i3.u0.s1<1)||(i3.u0.l3092<1))")))))...158
Formula 0 simplified : F(G!"((i3.u0.s1>=1)&&(i3.u0.l1667>=1))" & X("((i3.u0.s1<1)||(i5.u25.l4272<1))" & FG!"((i3.u0.s1<1)||(i3.u0.l3092<1))"))
Compilation finished in 1217 ms.
Running link step : cd /tmp/ltsmin12182328230926088935;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin12182328230926088935;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[]((<>((LTLAPp0==true))||X((!(LTLAPp1==true)||[](<>((LTLAPp2==true)))))))' '--buchi-type=spotba'
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.001: Loading model from ./gal.so
pins2lts-mc-linux64( 1/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.000: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.000: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.007: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.011: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.011: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.027: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.043: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.043: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.131: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.131: LTL layer: formula: []((<>((LTLAPp0==true))||X((!(LTLAPp1==true)||[](<>((LTLAPp2==true)))))))
pins2lts-mc-linux64( 1/ 8), 0.131: "[]((<>((LTLAPp0==true))||X((!(LTLAPp1==true)||[](<>((LTLAPp2==true)))))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 1/ 8), 0.131: Using Spin LTL semantics
pins2lts-mc-linux64( 4/ 8), 0.160: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.162: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.166: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.168: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.174: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.177: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.184: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.186: Weak Buchi automaton detected, adding non-accepting as progress label.
pins2lts-mc-linux64( 0/ 8), 0.275: DFS-FIFO for weak LTL, using special progress label 426
pins2lts-mc-linux64( 0/ 8), 0.275: There are 427 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.275: State length is 207, there are 429 groups
pins2lts-mc-linux64( 0/ 8), 0.275: Running dfsfifo using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.275: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.275: Successor permutation: rr
pins2lts-mc-linux64( 0/ 8), 0.275: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 2/ 8), 0.300: ~1 levels ~960 states ~2664 transitions
pins2lts-mc-linux64( 2/ 8), 0.323: ~1 levels ~1920 states ~6384 transitions
pins2lts-mc-linux64( 2/ 8), 0.348: ~1 levels ~3840 states ~10816 transitions
pins2lts-mc-linux64( 2/ 8), 0.395: ~1 levels ~7680 states ~18784 transitions
pins2lts-mc-linux64( 2/ 8), 0.498: ~1 levels ~15360 states ~37848 transitions
pins2lts-mc-linux64( 5/ 8), 0.792: ~1 levels ~30720 states ~86592 transitions
pins2lts-mc-linux64( 5/ 8), 1.197: ~1 levels ~61440 states ~175704 transitions
pins2lts-mc-linux64( 5/ 8), 1.942: ~1 levels ~122880 states ~339504 transitions
pins2lts-mc-linux64( 2/ 8), 3.416: ~1 levels ~245760 states ~655200 transitions
pins2lts-mc-linux64( 2/ 8), 5.646: ~1 levels ~491520 states ~1402736 transitions
pins2lts-mc-linux64( 4/ 8), 9.462: ~1 levels ~983040 states ~2695336 transitions
pins2lts-mc-linux64( 4/ 8), 16.404: ~1 levels ~1966080 states ~5079096 transitions
pins2lts-mc-linux64( 2/ 8), 30.754: ~1 levels ~3932160 states ~10069152 transitions
pins2lts-mc-linux64( 2/ 8), 66.029: ~1 levels ~7864320 states ~20906976 transitions
pins2lts-mc-linux64( 4/ 8), 122.877: ~1 levels ~15728640 states ~37824096 transitions
pins2lts-mc-linux64( 5/ 8), 235.462: ~4 levels ~31457280 states ~77975872 transitions
pins2lts-mc-linux64( 4/ 8), 473.971: ~1 levels ~62914560 states ~175492968 transitions
pins2lts-mc-linux64( 2/ 8), 901.857: Error: tree roots table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 901.961:
pins2lts-mc-linux64( 0/ 8), 901.961: mean standard work distribution: 2.1% (states) 4.4% (transitions)
pins2lts-mc-linux64( 0/ 8), 901.961:
pins2lts-mc-linux64( 0/ 8), 901.961: Explored 115773535 states 357232559 transitions, fanout: 3.086
pins2lts-mc-linux64( 0/ 8), 901.961: Total exploration time 901.670 sec (901.580 sec minimum, 901.620 sec on average)
pins2lts-mc-linux64( 0/ 8), 901.961: States per second: 128399, Transitions per second: 396190
pins2lts-mc-linux64( 0/ 8), 901.961:
pins2lts-mc-linux64( 0/ 8), 901.961: Progress states detected: 133747489
pins2lts-mc-linux64( 0/ 8), 901.961: Redundant explorations: -13.7417
pins2lts-mc-linux64( 0/ 8), 901.961:
pins2lts-mc-linux64( 0/ 8), 901.961: Queue width: 8B, total height: 46234418, memory: 352.74MB
pins2lts-mc-linux64( 0/ 8), 901.961: Tree memory: 1159.3MB, 9.1 B/state, compr.: 1.1%
pins2lts-mc-linux64( 0/ 8), 901.961: Tree fill ratio (roots/leafs): 99.0%/52.0%
pins2lts-mc-linux64( 0/ 8), 901.961: Stored 424 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 901.961: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 901.961: Est. total memory use: 1512.1MB (~1376.7MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin12182328230926088935;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[]((<>((LTLAPp0==true))||X((!(LTLAPp1==true)||[](<>((LTLAPp2==true)))))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin12182328230926088935;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[]((<>((LTLAPp0==true))||X((!(LTLAPp1==true)||[](<>((LTLAPp2==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)
Detected timeout of ITS tools.
[2023-03-08 04:57:41] [INFO ] Flatten gal took : 268 ms
[2023-03-08 04:57:42] [INFO ] Time to serialize gal into /tmp/LTLFireability13602875639818440492.gal : 112 ms
[2023-03-08 04:57:42] [INFO ] Time to serialize properties into /tmp/LTLFireability16295460687108233342.ltl : 13 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.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability13602875639818440492.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability16295460687108233342.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.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...299
Read 1 LTL properties
Checking formula 0 : !((G((F("((s1>=1)&&(l1667>=1))"))||(X((!("((s1<1)||(l4272<1))"))||(G(F("((s1<1)||(l3092<1))"))))))))
Formula 0 simplified : F(G!"((s1>=1)&&(l1667>=1))" & X("((s1<1)||(l4272<1))" & FG!"((s1<1)||(l3092<1))"))
Detected timeout of ITS tools.
[2023-03-08 05:19:21] [INFO ] Flatten gal took : 166 ms
[2023-03-08 05:19:22] [INFO ] Input system was already deterministic with 422 transitions.
[2023-03-08 05:19:22] [INFO ] Transformed 206 places.
[2023-03-08 05:19:22] [INFO ] Transformed 422 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
[2023-03-08 05:19:22] [INFO ] Time to serialize gal into /tmp/LTLFireability5265258921743866165.gal : 24 ms
[2023-03-08 05:19:22] [INFO ] Time to serialize properties into /tmp/LTLFireability18405419617511633328.ltl : 18 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.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability5265258921743866165.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability18405419617511633328.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.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...343
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((G((F("((s1>=1)&&(l1667>=1))"))||(X((!("((s1<1)||(l4272<1))"))||(G(F("((s1<1)||(l3092<1))"))))))))
Formula 0 simplified : F(G!"((s1>=1)&&(l1667>=1))" & X("((s1<1)||(l4272<1))" & FG!"((s1<1)||(l3092<1))"))
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 10997504 kB
After kill :
MemTotal: 16393216 kB
MemFree: 15864736 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.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /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-d2m07"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
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-5348"
echo " Executing tool itstools"
echo " Input is DBSingleClientW-PT-d2m07, 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 r101-tall-167814475200316"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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