Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.0M
-rw-r--r-- 1 mcc users 8.0K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 89K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.8K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 64K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K Apr 22 14:36 LTLCardinality.txt
-rw-r--r-- 1 mcc users 21K Apr 22 14:36 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 19 07:15 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 18:07 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 12 12:52 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 128K Apr 12 12:52 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.5K Apr 12 12:51 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 70K Apr 12 12:51 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:36 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:36 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 6 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 1.6M May 18 16:42 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME DBSingleClientW-PT-d2m09-LTLFireability-00
FORMULA_NAME DBSingleClientW-PT-d2m09-LTLFireability-01
FORMULA_NAME DBSingleClientW-PT-d2m09-LTLFireability-02
FORMULA_NAME DBSingleClientW-PT-d2m09-LTLFireability-03
FORMULA_NAME DBSingleClientW-PT-d2m09-LTLFireability-04
FORMULA_NAME DBSingleClientW-PT-d2m09-LTLFireability-05
FORMULA_NAME DBSingleClientW-PT-d2m09-LTLFireability-06
FORMULA_NAME DBSingleClientW-PT-d2m09-LTLFireability-07
FORMULA_NAME DBSingleClientW-PT-d2m09-LTLFireability-08
FORMULA_NAME DBSingleClientW-PT-d2m09-LTLFireability-09
FORMULA_NAME DBSingleClientW-PT-d2m09-LTLFireability-10
FORMULA_NAME DBSingleClientW-PT-d2m09-LTLFireability-11
FORMULA_NAME DBSingleClientW-PT-d2m09-LTLFireability-12
FORMULA_NAME DBSingleClientW-PT-d2m09-LTLFireability-13
FORMULA_NAME DBSingleClientW-PT-d2m09-LTLFireability-14
FORMULA_NAME DBSingleClientW-PT-d2m09-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716329717123

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=gold2023
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DBSingleClientW-PT-d2m09
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2024-05-21 22:15:18] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-21 22:15:18] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 22:15:18] [INFO ] Load time of PNML (sax parser for PT used): 172 ms
[2024-05-21 22:15:18] [INFO ] Transformed 4763 places.
[2024-05-21 22:15:18] [INFO ] Transformed 2478 transitions.
[2024-05-21 22:15:18] [INFO ] Parsed PT model containing 4763 places and 2478 transitions and 9912 arcs in 349 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 12 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
Deduced a syphon composed of 3580 places in 16 ms
Reduce places removed 3580 places and 0 transitions.
FORMULA DBSingleClientW-PT-d2m09-LTLFireability-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m09-LTLFireability-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m09-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m09-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m09-LTLFireability-11 FALSE 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 376 places :
Symmetric choice reduction at 1 with 376 rule applications. Total rules 621 place count 761 transition count 1349
Iterating global reduction 1 with 376 rules applied. Total rules applied 997 place count 761 transition count 1349
Ensure Unique test removed 36 transitions
Reduce isomorphic transitions removed 36 transitions.
Iterating post reduction 1 with 36 rules applied. Total rules applied 1033 place count 761 transition count 1313
Discarding 299 places :
Symmetric choice reduction at 2 with 299 rule applications. Total rules 1332 place count 462 transition count 1014
Iterating global reduction 2 with 299 rules applied. Total rules applied 1631 place count 462 transition count 1014
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 1637 place count 462 transition count 1008
Discarding 223 places :
Symmetric choice reduction at 3 with 223 rule applications. Total rules 1860 place count 239 transition count 696
Iterating global reduction 3 with 223 rules applied. Total rules applied 2083 place count 239 transition count 696
Ensure Unique test removed 227 transitions
Reduce isomorphic transitions removed 227 transitions.
Iterating post reduction 3 with 227 rules applied. Total rules applied 2310 place count 239 transition count 469
Discarding 16 places :
Symmetric choice reduction at 4 with 16 rule applications. Total rules 2326 place count 223 transition count 438
Iterating global reduction 4 with 16 rules applied. Total rules applied 2342 place count 223 transition count 438
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 2346 place count 223 transition count 434
Discarding 11 places :
Symmetric choice reduction at 5 with 11 rule applications. Total rules 2357 place count 212 transition count 423
Iterating global reduction 5 with 11 rules applied. Total rules applied 2368 place count 212 transition count 423
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 2370 place count 212 transition count 421
Discarding 10 places :
Symmetric choice reduction at 6 with 10 rule applications. Total rules 2380 place count 202 transition count 411
Iterating global reduction 6 with 10 rules applied. Total rules applied 2390 place count 202 transition count 411
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 6 with 7 rules applied. Total rules applied 2397 place count 202 transition count 404
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 2399 place count 200 transition count 400
Iterating global reduction 7 with 2 rules applied. Total rules applied 2401 place count 200 transition count 400
Applied a total of 2401 rules in 191 ms. Remains 200 /1183 variables (removed 983) and now considering 400/2478 (removed 2078) transitions.
// Phase 1: matrix 400 rows 200 cols
[2024-05-21 22:15:19] [INFO ] Computed 2 invariants in 23 ms
[2024-05-21 22:15:19] [INFO ] Implicit Places using invariants in 268 ms returned []
[2024-05-21 22:15:19] [INFO ] Invariant cache hit.
[2024-05-21 22:15:19] [INFO ] State equation strengthened by 209 read => feed constraints.
[2024-05-21 22:15:20] [INFO ] Implicit Places using invariants and state equation in 591 ms returned []
Implicit Place search using SMT with State Equation took 883 ms to find 0 implicit places.
[2024-05-21 22:15:20] [INFO ] Invariant cache hit.
[2024-05-21 22:15:20] [INFO ] Dead Transitions using invariants and state equation in 169 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 200/1183 places, 400/2478 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1244 ms. Remains : 200/1183 places, 400/2478 transitions.
Support contains 29 out of 200 places after structural reductions.
[2024-05-21 22:15:20] [INFO ] Flatten gal took : 52 ms
[2024-05-21 22:15:20] [INFO ] Flatten gal took : 27 ms
[2024-05-21 22:15:20] [INFO ] Input system was already deterministic with 400 transitions.
Support contains 28 out of 200 places (down from 29) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 2300 resets, run finished after 572 ms. (steps per millisecond=17 ) properties (out of 26) seen :1
Incomplete Best-First random walk after 1000 steps, including 51 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 91 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 108 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 94 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 98 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 48 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1000 steps, including 39 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 36 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 48 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 47 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1000 steps, including 47 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1000 steps, including 104 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 40 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 90 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 41 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 41 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1000 steps, including 94 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 52 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 43 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 48 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 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 51 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 43 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 46 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 9 ms. (steps per millisecond=111 ) properties (out of 25) seen :0
Finished probabilistic random walk after 27357 steps, run visited all 25 properties in 288 ms. (steps per millisecond=94 )
Probabilistic random walk after 27357 steps, saw 12213 distinct states, run finished after 288 ms. (steps per millisecond=94 ) properties seen :25
Parikh walk visited 0 properties in 1 ms.
Computed a total of 5 stabilizing places and 33 stable transitions
Graph (complete) has 806 edges and 200 vertex of which 199 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.10 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G((p1||X(X(p2))))))))'
Support contains 5 out of 200 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 200/200 places, 400/400 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 180 transition count 321
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 180 transition count 321
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 41 place count 180 transition count 320
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 59 place count 162 transition count 296
Iterating global reduction 1 with 18 rules applied. Total rules applied 77 place count 162 transition count 296
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 1 with 14 rules applied. Total rules applied 91 place count 162 transition count 282
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 103 place count 150 transition count 257
Iterating global reduction 2 with 12 rules applied. Total rules applied 115 place count 150 transition count 257
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 118 place count 150 transition count 254
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 128 place count 140 transition count 235
Iterating global reduction 3 with 10 rules applied. Total rules applied 138 place count 140 transition count 235
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 3 with 11 rules applied. Total rules applied 149 place count 140 transition count 224
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 152 place count 137 transition count 221
Iterating global reduction 4 with 3 rules applied. Total rules applied 155 place count 137 transition count 221
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 158 place count 137 transition count 218
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 159 place count 136 transition count 217
Iterating global reduction 5 with 1 rules applied. Total rules applied 160 place count 136 transition count 217
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 163 place count 136 transition count 214
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 165 place count 134 transition count 202
Iterating global reduction 6 with 2 rules applied. Total rules applied 167 place count 134 transition count 202
Applied a total of 167 rules in 25 ms. Remains 134 /200 variables (removed 66) and now considering 202/400 (removed 198) transitions.
// Phase 1: matrix 202 rows 134 cols
[2024-05-21 22:15:22] [INFO ] Computed 2 invariants in 2 ms
[2024-05-21 22:15:22] [INFO ] Implicit Places using invariants in 105 ms returned []
[2024-05-21 22:15:22] [INFO ] Invariant cache hit.
[2024-05-21 22:15:22] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-05-21 22:15:22] [INFO ] Implicit Places using invariants and state equation in 294 ms returned []
Implicit Place search using SMT with State Equation took 401 ms to find 0 implicit places.
[2024-05-21 22:15:22] [INFO ] Invariant cache hit.
[2024-05-21 22:15:22] [INFO ] Dead Transitions using invariants and state equation in 201 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 134/200 places, 202/400 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 630 ms. Remains : 134/200 places, 202/400 transitions.
ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2Stuttering acceptance computed with spot in 350 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : DBSingleClientW-PT-d2m09-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 4}, { cond=true, acceptance={} source=3 dest: 5}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=4 dest: 4}, { cond=(NOT p2), acceptance={} source=4 dest: 5}], [{ cond=(NOT p2), acceptance={} source=5 dest: 2}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=5 dest: 3}]], initial=0, aps=[p0:(OR (LT s1 1) (LT s72 1)), p1:(AND (OR (LT s16 1) (LT s55 1)) (OR (LT s1 1) (LT s128 1))), p2:(OR (LT s16 1) (LT s55 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 23052 reset in 299 ms.
Product exploration explored 100000 steps with 22956 reset in 216 ms.
Computed a total of 5 stabilizing places and 17 stable transitions
Graph (complete) has 492 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 17 stable transitions
Knowledge obtained : [(AND p0 p1 p2), (X p1), (X p0), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X p0)), (X (X p2))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 133 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 207 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Incomplete random walk after 10000 steps, including 2255 resets, run finished after 232 ms. (steps per millisecond=43 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 417 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 953 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 886 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 982 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 4) seen :0
Finished probabilistic random walk after 17291 steps, run visited all 4 properties in 121 ms. (steps per millisecond=142 )
Probabilistic random walk after 17291 steps, saw 8562 distinct states, run finished after 121 ms. (steps per millisecond=142 ) properties seen :4
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 p1 p2), (X p1), (X p0), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X p0)), (X (X p2))]
False Knowledge obtained : [(F (NOT p2)), (F (NOT p0)), (F (AND (NOT p1) (NOT p2))), (F (NOT p1))]
Knowledge based reduction with 6 factoid took 212 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 199 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 218 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Support contains 5 out of 134 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 134/134 places, 202/202 transitions.
Applied a total of 0 rules in 5 ms. Remains 134 /134 variables (removed 0) and now considering 202/202 (removed 0) transitions.
[2024-05-21 22:15:25] [INFO ] Invariant cache hit.
[2024-05-21 22:15:25] [INFO ] Implicit Places using invariants in 64 ms returned []
[2024-05-21 22:15:25] [INFO ] Invariant cache hit.
[2024-05-21 22:15:25] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-05-21 22:15:25] [INFO ] Implicit Places using invariants and state equation in 271 ms returned []
Implicit Place search using SMT with State Equation took 337 ms to find 0 implicit places.
[2024-05-21 22:15:25] [INFO ] Invariant cache hit.
[2024-05-21 22:15:25] [INFO ] Dead Transitions using invariants and state equation in 80 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 423 ms. Remains : 134/134 places, 202/202 transitions.
Computed a total of 5 stabilizing places and 17 stable transitions
Graph (complete) has 492 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 17 stable transitions
Knowledge obtained : [(AND p0 p1 p2), (X p1), (X p0), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X p0)), (X (X p2))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 103 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 283 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Incomplete random walk after 10000 steps, including 2271 resets, run finished after 112 ms. (steps per millisecond=89 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 414 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 913 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 1018 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 943 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 4) seen :0
Finished probabilistic random walk after 17291 steps, run visited all 4 properties in 143 ms. (steps per millisecond=120 )
Probabilistic random walk after 17291 steps, saw 8562 distinct states, run finished after 143 ms. (steps per millisecond=120 ) properties seen :4
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 p1 p2), (X p1), (X p0), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X p0)), (X (X p2))]
False Knowledge obtained : [(F (NOT p2)), (F (NOT p0)), (F (AND (NOT p1) (NOT p2))), (F (NOT p1))]
Knowledge based reduction with 6 factoid took 197 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 212 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 212 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 215 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 23053 reset in 162 ms.
Product exploration explored 100000 steps with 22914 reset in 207 ms.
Applying partial POR strategy [false, true, false, false, false, false]
Stuttering acceptance computed with spot in 212 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Support contains 5 out of 134 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 134/134 places, 202/202 transitions.
Applied a total of 0 rules in 25 ms. Remains 134 /134 variables (removed 0) and now considering 202/202 (removed 0) transitions.
[2024-05-21 22:15:28] [INFO ] Redundant transitions in 7 ms returned []
[2024-05-21 22:15:28] [INFO ] Invariant cache hit.
[2024-05-21 22:15:28] [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 119 ms. Remains : 134/134 places, 202/202 transitions.
Built C files in :
/tmp/ltsmin10432944103314974571
[2024-05-21 22:15:28] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10432944103314974571
Running compilation step : cd /tmp/ltsmin10432944103314974571;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 390 ms.
Running link step : cd /tmp/ltsmin10432944103314974571;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 47 ms.
Running LTSmin : cd /tmp/ltsmin10432944103314974571;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased11294520629835090839.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 5 out of 134 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 134/134 places, 202/202 transitions.
Applied a total of 0 rules in 3 ms. Remains 134 /134 variables (removed 0) and now considering 202/202 (removed 0) transitions.
[2024-05-21 22:15:43] [INFO ] Invariant cache hit.
[2024-05-21 22:15:43] [INFO ] Implicit Places using invariants in 76 ms returned []
[2024-05-21 22:15:43] [INFO ] Invariant cache hit.
[2024-05-21 22:15:43] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-05-21 22:15:43] [INFO ] Implicit Places using invariants and state equation in 260 ms returned []
Implicit Place search using SMT with State Equation took 338 ms to find 0 implicit places.
[2024-05-21 22:15:43] [INFO ] Invariant cache hit.
[2024-05-21 22:15:43] [INFO ] Dead Transitions using invariants and state equation in 91 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 434 ms. Remains : 134/134 places, 202/202 transitions.
Built C files in :
/tmp/ltsmin10951083555849222331
[2024-05-21 22:15:43] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10951083555849222331
Running compilation step : cd /tmp/ltsmin10951083555849222331;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 316 ms.
Running link step : cd /tmp/ltsmin10951083555849222331;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin10951083555849222331;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased16684859533906673518.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-21 22:15:58] [INFO ] Flatten gal took : 12 ms
[2024-05-21 22:15:58] [INFO ] Flatten gal took : 11 ms
[2024-05-21 22:15:58] [INFO ] Time to serialize gal into /tmp/LTL14148499494266416286.gal : 3 ms
[2024-05-21 22:15:58] [INFO ] Time to serialize properties into /tmp/LTL4269754011727613067.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14148499494266416286.gal' '-t' 'CGAL' '-hoa' '/tmp/aut4118057256048589046.hoa' '-atoms' '/tmp/LTL4269754011727613067.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

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

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((G((F("((s1<1)||(l1713<1))"))&&(F(G(("(((p261<1)||(l0<1))&&((s1<1)||(l4107<1)))")||(X(X("((p261<1)||(l0<1))")))))))))
Formula 0 simplified : F(G!"((s1<1)||(l1713<1))" | GF(!"(((p261<1)||(l0<1))&&((s1<1)||(l4107<1)))" & XX!"((p261<1)||(l0<1))"))
Detected timeout of ITS tools.
[2024-05-21 22:16:29] [INFO ] Flatten gal took : 13 ms
[2024-05-21 22:16:29] [INFO ] Applying decomposition
[2024-05-21 22:16:29] [INFO ] Flatten gal took : 10 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph590642877911368408.txt' '-o' '/tmp/graph590642877911368408.bin' '-w' '/tmp/graph590642877911368408.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph590642877911368408.bin' '-l' '-1' '-v' '-w' '/tmp/graph590642877911368408.weights' '-q' '0' '-e' '0.001'
[2024-05-21 22:16:29] [INFO ] Decomposing Gal with order
[2024-05-21 22:16:29] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 22:16:29] [INFO ] Removed a total of 213 redundant transitions.
[2024-05-21 22:16:29] [INFO ] Flatten gal took : 60 ms
[2024-05-21 22:16:29] [INFO ] Fuse similar labels procedure discarded/fused a total of 140 labels/synchronizations in 11 ms.
[2024-05-21 22:16:29] [INFO ] Time to serialize gal into /tmp/LTL14932358765444775499.gal : 25 ms
[2024-05-21 22:16:29] [INFO ] Time to serialize properties into /tmp/LTL12209447652826835939.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14932358765444775499.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12209447652826835939.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !((G((F("((i4.u1.s1<1)||(u6.l1713<1))"))&&(F(G(("(((i2.u7.p261<1)||(i4.u1.l0<1))&&((i4.u1.s1<1)||(i2.u19.l4107<1)))")||(X(X("((i2.u7.p...186
Formula 0 simplified : F(G!"((i4.u1.s1<1)||(u6.l1713<1))" | GF(!"(((i2.u7.p261<1)||(i4.u1.l0<1))&&((i4.u1.s1<1)||(i2.u19.l4107<1)))" & XX!"((i2.u7.p261<1)|...172
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin15075473391584415317
[2024-05-21 22:16:44] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15075473391584415317
Running compilation step : cd /tmp/ltsmin15075473391584415317;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 309 ms.
Running link step : cd /tmp/ltsmin15075473391584415317;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin15075473391584415317;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[]((<>((LTLAPp0==true))&&<>([](((LTLAPp1==true)||X(X((LTLAPp2==true))))))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property DBSingleClientW-PT-d2m09-LTLFireability-00 finished in 97401 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((G(F((!p0||G(!p1)))) U p2))))'
Support contains 5 out of 200 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 200/200 places, 400/400 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 180 transition count 314
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 180 transition count 314
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 42 place count 180 transition count 312
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 59 place count 163 transition count 289
Iterating global reduction 1 with 17 rules applied. Total rules applied 76 place count 163 transition count 289
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 87 place count 163 transition count 278
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 98 place count 152 transition count 259
Iterating global reduction 2 with 11 rules applied. Total rules applied 109 place count 152 transition count 259
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 112 place count 152 transition count 256
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 123 place count 141 transition count 233
Iterating global reduction 3 with 11 rules applied. Total rules applied 134 place count 141 transition count 233
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 140 place count 141 transition count 227
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 144 place count 137 transition count 223
Iterating global reduction 4 with 4 rules applied. Total rules applied 148 place count 137 transition count 223
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 137 transition count 219
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 153 place count 136 transition count 218
Iterating global reduction 5 with 1 rules applied. Total rules applied 154 place count 136 transition count 218
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 157 place count 136 transition count 215
Applied a total of 157 rules in 26 ms. Remains 136 /200 variables (removed 64) and now considering 215/400 (removed 185) transitions.
// Phase 1: matrix 215 rows 136 cols
[2024-05-21 22:16:59] [INFO ] Computed 2 invariants in 3 ms
[2024-05-21 22:16:59] [INFO ] Implicit Places using invariants in 129 ms returned []
[2024-05-21 22:16:59] [INFO ] Invariant cache hit.
[2024-05-21 22:16:59] [INFO ] State equation strengthened by 90 read => feed constraints.
[2024-05-21 22:16:59] [INFO ] Implicit Places using invariants and state equation in 337 ms returned []
Implicit Place search using SMT with State Equation took 468 ms to find 0 implicit places.
[2024-05-21 22:16:59] [INFO ] Invariant cache hit.
[2024-05-21 22:17:00] [INFO ] Dead Transitions using invariants and state equation in 95 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 136/200 places, 215/400 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 605 ms. Remains : 136/200 places, 215/400 transitions.
Stuttering acceptance computed with spot in 196 ms :[(NOT p2), (NOT p2), (NOT p2), (AND p1 p0), (AND p1 p0)]
Running random walk in product with property : DBSingleClientW-PT-d2m09-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p2), acceptance={0} source=2 dest: 2}, { cond=(NOT p2), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p2) p1 p0), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={} source=3 dest: 3}, { cond=(AND p1 p0), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p1) p0), acceptance={} source=4 dest: 4}, { cond=(AND p1 p0), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p2:(AND (GEQ s1 1) (GEQ s80 1)), p1:(AND (GEQ s8 1) (GEQ s55 1)), p0:(AND (GEQ s9 1) (GEQ s55 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]]
Stuttering criterion allowed to conclude after 6 steps with 0 reset in 1 ms.
FORMULA DBSingleClientW-PT-d2m09-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d2m09-LTLFireability-01 finished in 831 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((p0||F(p1)))))'
Support contains 3 out of 200 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 200/200 places, 400/400 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 179 transition count 328
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 179 transition count 328
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 45 place count 179 transition count 325
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 64 place count 160 transition count 300
Iterating global reduction 1 with 19 rules applied. Total rules applied 83 place count 160 transition count 300
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 1 with 15 rules applied. Total rules applied 98 place count 160 transition count 285
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 110 place count 148 transition count 259
Iterating global reduction 2 with 12 rules applied. Total rules applied 122 place count 148 transition count 259
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 126 place count 148 transition count 255
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 137 place count 137 transition count 229
Iterating global reduction 3 with 11 rules applied. Total rules applied 148 place count 137 transition count 229
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 137 transition count 224
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 157 place count 133 transition count 220
Iterating global reduction 4 with 4 rules applied. Total rules applied 161 place count 133 transition count 220
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 165 place count 133 transition count 216
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 166 place count 132 transition count 215
Iterating global reduction 5 with 1 rules applied. Total rules applied 167 place count 132 transition count 215
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 170 place count 132 transition count 212
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 173 place count 129 transition count 192
Iterating global reduction 6 with 3 rules applied. Total rules applied 176 place count 129 transition count 192
Applied a total of 176 rules in 26 ms. Remains 129 /200 variables (removed 71) and now considering 192/400 (removed 208) transitions.
// Phase 1: matrix 192 rows 129 cols
[2024-05-21 22:17:00] [INFO ] Computed 2 invariants in 2 ms
[2024-05-21 22:17:00] [INFO ] Implicit Places using invariants in 65 ms returned []
[2024-05-21 22:17:00] [INFO ] Invariant cache hit.
[2024-05-21 22:17:00] [INFO ] State equation strengthened by 70 read => feed constraints.
[2024-05-21 22:17:00] [INFO ] Implicit Places using invariants and state equation in 223 ms returned []
Implicit Place search using SMT with State Equation took 298 ms to find 0 implicit places.
[2024-05-21 22:17:00] [INFO ] Invariant cache hit.
[2024-05-21 22:17:00] [INFO ] Dead Transitions using invariants and state equation in 75 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 129/200 places, 192/400 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 401 ms. Remains : 129/200 places, 192/400 transitions.
Stuttering acceptance computed with spot in 86 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : DBSingleClientW-PT-d2m09-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (GEQ s1 1) (GEQ s92 1)), p1:(AND (GEQ s1 1) (GEQ s120 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 6 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d2m09-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d2m09-LTLFireability-03 finished in 500 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F((G(p1)||G(p2)||p0)))))'
Support contains 4 out of 200 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 200/200 places, 400/400 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 180 transition count 320
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 180 transition count 320
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 42 place count 180 transition count 318
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 59 place count 163 transition count 295
Iterating global reduction 1 with 17 rules applied. Total rules applied 76 place count 163 transition count 295
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 1 with 14 rules applied. Total rules applied 90 place count 163 transition count 281
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 100 place count 153 transition count 261
Iterating global reduction 2 with 10 rules applied. Total rules applied 110 place count 153 transition count 261
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 113 place count 153 transition count 258
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 122 place count 144 transition count 241
Iterating global reduction 3 with 9 rules applied. Total rules applied 131 place count 144 transition count 241
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 136 place count 144 transition count 236
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 139 place count 141 transition count 233
Iterating global reduction 4 with 3 rules applied. Total rules applied 142 place count 141 transition count 233
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 146 place count 141 transition count 229
Applied a total of 146 rules in 17 ms. Remains 141 /200 variables (removed 59) and now considering 229/400 (removed 171) transitions.
// Phase 1: matrix 229 rows 141 cols
[2024-05-21 22:17:00] [INFO ] Computed 2 invariants in 2 ms
[2024-05-21 22:17:00] [INFO ] Implicit Places using invariants in 71 ms returned []
[2024-05-21 22:17:00] [INFO ] Invariant cache hit.
[2024-05-21 22:17:00] [INFO ] State equation strengthened by 97 read => feed constraints.
[2024-05-21 22:17:01] [INFO ] Implicit Places using invariants and state equation in 320 ms returned []
Implicit Place search using SMT with State Equation took 392 ms to find 0 implicit places.
[2024-05-21 22:17:01] [INFO ] Invariant cache hit.
[2024-05-21 22:17:01] [INFO ] Dead Transitions using invariants and state equation in 90 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 141/200 places, 229/400 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 500 ms. Remains : 141/200 places, 229/400 transitions.
Stuttering acceptance computed with spot in 105 ms :[(AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2))]
Running random walk in product with property : DBSingleClientW-PT-d2m09-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(AND p1 (NOT p0) p2), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0) p2), acceptance={0} source=0 dest: 0}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={1} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={0, 1} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p1:(OR (LT s1 1) (LT s91 1)), p0:(OR (LT s1 1) (LT s98 1)), p2:(OR (LT s1 1) (LT s132 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 284 ms.
Product exploration explored 100000 steps with 33333 reset in 239 ms.
Computed a total of 5 stabilizing places and 21 stable transitions
Graph (complete) has 528 edges and 141 vertex of which 140 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 5 stabilizing places and 21 stable transitions
Knowledge obtained : [(AND p1 p0 p2), (X (X (NOT (AND (NOT p1) (NOT p0) p2)))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X (NOT (AND p1 (NOT p0) p2)))), (X (X (NOT (AND p1 (NOT p0) (NOT p2)))))]
False Knowledge obtained : []
Property proved to be true thanks to conjunction of knowledge (Minato strategy)
Knowledge based reduction with 5 factoid took 76 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DBSingleClientW-PT-d2m09-LTLFireability-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DBSingleClientW-PT-d2m09-LTLFireability-07 finished in 1224 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 200 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 200/200 places, 400/400 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 178 transition count 312
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 178 transition count 312
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 178 transition count 310
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 65 place count 159 transition count 285
Iterating global reduction 1 with 19 rules applied. Total rules applied 84 place count 159 transition count 285
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 1 with 14 rules applied. Total rules applied 98 place count 159 transition count 271
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 111 place count 146 transition count 244
Iterating global reduction 2 with 13 rules applied. Total rules applied 124 place count 146 transition count 244
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 128 place count 146 transition count 240
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 140 place count 134 transition count 212
Iterating global reduction 3 with 12 rules applied. Total rules applied 152 place count 134 transition count 212
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 158 place count 134 transition count 206
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 162 place count 130 transition count 202
Iterating global reduction 4 with 4 rules applied. Total rules applied 166 place count 130 transition count 202
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 170 place count 130 transition count 198
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 171 place count 129 transition count 197
Iterating global reduction 5 with 1 rules applied. Total rules applied 172 place count 129 transition count 197
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 175 place count 129 transition count 194
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 177 place count 127 transition count 182
Iterating global reduction 6 with 2 rules applied. Total rules applied 179 place count 127 transition count 182
Applied a total of 179 rules in 40 ms. Remains 127 /200 variables (removed 73) and now considering 182/400 (removed 218) transitions.
// Phase 1: matrix 182 rows 127 cols
[2024-05-21 22:17:02] [INFO ] Computed 2 invariants in 1 ms
[2024-05-21 22:17:02] [INFO ] Implicit Places using invariants in 112 ms returned []
[2024-05-21 22:17:02] [INFO ] Invariant cache hit.
[2024-05-21 22:17:02] [INFO ] State equation strengthened by 61 read => feed constraints.
[2024-05-21 22:17:02] [INFO ] Implicit Places using invariants and state equation in 236 ms returned []
Implicit Place search using SMT with State Equation took 350 ms to find 0 implicit places.
[2024-05-21 22:17:02] [INFO ] Redundant transitions in 5 ms returned []
[2024-05-21 22:17:02] [INFO ] Invariant cache hit.
[2024-05-21 22:17:02] [INFO ] Dead Transitions using invariants and state equation in 73 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 127/200 places, 182/400 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 495 ms. Remains : 127/200 places, 182/400 transitions.
Stuttering acceptance computed with spot in 58 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d2m09-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (LT s8 1) (LT s53 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 23032 reset in 122 ms.
Product exploration explored 100000 steps with 23026 reset in 129 ms.
Computed a total of 5 stabilizing places and 16 stable transitions
Graph (complete) has 460 edges and 127 vertex of which 126 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 5 stabilizing places and 16 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 68 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 56 ms :[(NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2294 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 910 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Finished probabilistic random walk after 20774 steps, run visited all 1 properties in 37 ms. (steps per millisecond=561 )
Probabilistic random walk after 20774 steps, saw 10293 distinct states, run finished after 38 ms. (steps per millisecond=546 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 95 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 58 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 127 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 127/127 places, 182/182 transitions.
Applied a total of 0 rules in 14 ms. Remains 127 /127 variables (removed 0) and now considering 182/182 (removed 0) transitions.
[2024-05-21 22:17:03] [INFO ] Invariant cache hit.
[2024-05-21 22:17:03] [INFO ] Implicit Places using invariants in 63 ms returned []
[2024-05-21 22:17:03] [INFO ] Invariant cache hit.
[2024-05-21 22:17:03] [INFO ] State equation strengthened by 61 read => feed constraints.
[2024-05-21 22:17:03] [INFO ] Implicit Places using invariants and state equation in 218 ms returned []
Implicit Place search using SMT with State Equation took 294 ms to find 0 implicit places.
[2024-05-21 22:17:03] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-21 22:17:03] [INFO ] Invariant cache hit.
[2024-05-21 22:17:03] [INFO ] Dead Transitions using invariants and state equation in 74 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 410 ms. Remains : 127/127 places, 182/182 transitions.
Computed a total of 5 stabilizing places and 16 stable transitions
Graph (complete) has 460 edges and 127 vertex of which 126 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 : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 57 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 62 ms :[(NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2324 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 944 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Finished probabilistic random walk after 20774 steps, run visited all 1 properties in 33 ms. (steps per millisecond=629 )
Probabilistic random walk after 20774 steps, saw 10293 distinct states, run finished after 33 ms. (steps per millisecond=629 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 93 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 62 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 62 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 22881 reset in 126 ms.
Product exploration explored 100000 steps with 22843 reset in 129 ms.
Built C files in :
/tmp/ltsmin15282894486193229987
[2024-05-21 22:17:04] [INFO ] Computing symmetric may disable matrix : 182 transitions.
[2024-05-21 22:17:04] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 22:17:04] [INFO ] Computing symmetric may enable matrix : 182 transitions.
[2024-05-21 22:17:04] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 22:17:04] [INFO ] Computing Do-Not-Accords matrix : 182 transitions.
[2024-05-21 22:17:04] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 22:17:04] [INFO ] Built C files in 24ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15282894486193229987
Running compilation step : cd /tmp/ltsmin15282894486193229987;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 355 ms.
Running link step : cd /tmp/ltsmin15282894486193229987;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin15282894486193229987;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased13030933301047144805.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 127 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 127/127 places, 182/182 transitions.
Applied a total of 0 rules in 12 ms. Remains 127 /127 variables (removed 0) and now considering 182/182 (removed 0) transitions.
[2024-05-21 22:17:19] [INFO ] Invariant cache hit.
[2024-05-21 22:17:19] [INFO ] Implicit Places using invariants in 63 ms returned []
[2024-05-21 22:17:19] [INFO ] Invariant cache hit.
[2024-05-21 22:17:19] [INFO ] State equation strengthened by 61 read => feed constraints.
[2024-05-21 22:17:19] [INFO ] Implicit Places using invariants and state equation in 245 ms returned []
Implicit Place search using SMT with State Equation took 311 ms to find 0 implicit places.
[2024-05-21 22:17:19] [INFO ] Redundant transitions in 2 ms returned []
[2024-05-21 22:17:19] [INFO ] Invariant cache hit.
[2024-05-21 22:17:19] [INFO ] Dead Transitions using invariants and state equation in 84 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 432 ms. Remains : 127/127 places, 182/182 transitions.
Built C files in :
/tmp/ltsmin2275552344172339019
[2024-05-21 22:17:20] [INFO ] Computing symmetric may disable matrix : 182 transitions.
[2024-05-21 22:17:20] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 22:17:20] [INFO ] Computing symmetric may enable matrix : 182 transitions.
[2024-05-21 22:17:20] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 22:17:20] [INFO ] Computing Do-Not-Accords matrix : 182 transitions.
[2024-05-21 22:17:20] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 22:17:20] [INFO ] Built C files in 23ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2275552344172339019
Running compilation step : cd /tmp/ltsmin2275552344172339019;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 348 ms.
Running link step : cd /tmp/ltsmin2275552344172339019;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin2275552344172339019;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased2353460270354944945.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-21 22:17:35] [INFO ] Flatten gal took : 10 ms
[2024-05-21 22:17:35] [INFO ] Flatten gal took : 8 ms
[2024-05-21 22:17:35] [INFO ] Time to serialize gal into /tmp/LTL133198499500579964.gal : 1 ms
[2024-05-21 22:17:35] [INFO ] Time to serialize properties into /tmp/LTL11365916969680185108.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL133198499500579964.gal' '-t' 'CGAL' '-hoa' '/tmp/aut8630005091367592394.hoa' '-atoms' '/tmp/LTL11365916969680185108.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...317
Loading property file /tmp/LTL11365916969680185108.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut8630005091367592394.hoa
Detected timeout of ITS tools.
[2024-05-21 22:17:50] [INFO ] Flatten gal took : 8 ms
[2024-05-21 22:17:50] [INFO ] Flatten gal took : 8 ms
[2024-05-21 22:17:50] [INFO ] Time to serialize gal into /tmp/LTL12814316843264621437.gal : 1 ms
[2024-05-21 22:17:50] [INFO ] Time to serialize properties into /tmp/LTL2821593692521463356.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL12814316843264621437.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2821593692521463356.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((G(F("((p228<1)||(l0<1))"))))
Formula 0 simplified : FG!"((p228<1)||(l0<1))"
Detected timeout of ITS tools.
[2024-05-21 22:18:05] [INFO ] Flatten gal took : 7 ms
[2024-05-21 22:18:05] [INFO ] Applying decomposition
[2024-05-21 22:18:05] [INFO ] Flatten gal took : 8 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph1744405617263297019.txt' '-o' '/tmp/graph1744405617263297019.bin' '-w' '/tmp/graph1744405617263297019.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph1744405617263297019.bin' '-l' '-1' '-v' '-w' '/tmp/graph1744405617263297019.weights' '-q' '0' '-e' '0.001'
[2024-05-21 22:18:05] [INFO ] Decomposing Gal with order
[2024-05-21 22:18:05] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 22:18:05] [INFO ] Removed a total of 218 redundant transitions.
[2024-05-21 22:18:05] [INFO ] Flatten gal took : 19 ms
[2024-05-21 22:18:05] [INFO ] Fuse similar labels procedure discarded/fused a total of 129 labels/synchronizations in 5 ms.
[2024-05-21 22:18:05] [INFO ] Time to serialize gal into /tmp/LTL13319916201383660584.gal : 2 ms
[2024-05-21 22:18:05] [INFO ] Time to serialize properties into /tmp/LTL1294902083703983983.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL13319916201383660584.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1294902083703983983.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((G(F("((i5.u12.p228<1)||(i4.u2.l0<1))"))))
Formula 0 simplified : FG!"((i5.u12.p228<1)||(i4.u2.l0<1))"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin11835737831870972636
[2024-05-21 22:18:20] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11835737831870972636
Running compilation step : cd /tmp/ltsmin11835737831870972636;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 277 ms.
Running link step : cd /tmp/ltsmin11835737831870972636;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 24 ms.
Running LTSmin : cd /tmp/ltsmin11835737831870972636;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](<>((LTLAPp0==true)))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property DBSingleClientW-PT-d2m09-LTLFireability-08 finished in 93458 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)||X(G(p1)))))'
Support contains 3 out of 200 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 200/200 places, 400/400 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 178 transition count 321
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 178 transition count 321
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 47 place count 178 transition count 318
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 67 place count 158 transition count 292
Iterating global reduction 1 with 20 rules applied. Total rules applied 87 place count 158 transition count 292
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 103 place count 158 transition count 276
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 115 place count 146 transition count 256
Iterating global reduction 2 with 12 rules applied. Total rules applied 127 place count 146 transition count 256
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 131 place count 146 transition count 252
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 143 place count 134 transition count 224
Iterating global reduction 3 with 12 rules applied. Total rules applied 155 place count 134 transition count 224
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 161 place count 134 transition count 218
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 165 place count 130 transition count 214
Iterating global reduction 4 with 4 rules applied. Total rules applied 169 place count 130 transition count 214
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 173 place count 130 transition count 210
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 174 place count 129 transition count 209
Iterating global reduction 5 with 1 rules applied. Total rules applied 175 place count 129 transition count 209
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 178 place count 129 transition count 206
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 181 place count 126 transition count 186
Iterating global reduction 6 with 3 rules applied. Total rules applied 184 place count 126 transition count 186
Applied a total of 184 rules in 17 ms. Remains 126 /200 variables (removed 74) and now considering 186/400 (removed 214) transitions.
// Phase 1: matrix 186 rows 126 cols
[2024-05-21 22:18:35] [INFO ] Computed 2 invariants in 2 ms
[2024-05-21 22:18:35] [INFO ] Implicit Places using invariants in 60 ms returned []
[2024-05-21 22:18:35] [INFO ] Invariant cache hit.
[2024-05-21 22:18:35] [INFO ] State equation strengthened by 67 read => feed constraints.
[2024-05-21 22:18:35] [INFO ] Implicit Places using invariants and state equation in 230 ms returned []
Implicit Place search using SMT with State Equation took 292 ms to find 0 implicit places.
[2024-05-21 22:18:35] [INFO ] Invariant cache hit.
[2024-05-21 22:18:35] [INFO ] Dead Transitions using invariants and state equation in 70 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 126/200 places, 186/400 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 380 ms. Remains : 126/200 places, 186/400 transitions.
Stuttering acceptance computed with spot in 171 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : DBSingleClientW-PT-d2m09-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 1}, { cond=(AND p0 p1), acceptance={} source=2 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 0}, { cond=p0, acceptance={} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 5}], [{ cond=(NOT p0), acceptance={} source=5 dest: 1}, { cond=p0, acceptance={} source=5 dest: 2}]], initial=4, aps=[p1:(AND (GEQ s1 1) (GEQ s91 1)), p0:(OR (LT s1 1) (LT s92 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 22899 reset in 143 ms.
Product exploration explored 100000 steps with 22954 reset in 143 ms.
Computed a total of 5 stabilizing places and 17 stable transitions
Graph (complete) has 460 edges and 126 vertex of which 125 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 5 stabilizing places and 17 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X p0), (X (X (NOT p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 p1))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 7 factoid took 92 ms. Reduced automaton from 6 states, 12 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 34 ms :[true, (NOT p0)]
Incomplete random walk after 10000 steps, including 2342 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 453 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Finished probabilistic random walk after 14627 steps, run visited all 1 properties in 25 ms. (steps per millisecond=585 )
Probabilistic random walk after 14627 steps, saw 7153 distinct states, run finished after 25 ms. (steps per millisecond=585 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p1) p0), (X p0), (X (X (NOT p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 p1))))]
False Knowledge obtained : [(F (NOT p0))]
Property proved to be false thanks to negative knowledge :(F (NOT p0))
Knowledge based reduction with 7 factoid took 120 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA DBSingleClientW-PT-d2m09-LTLFireability-09 FALSE TECHNIQUES KNOWLEDGE
Treatment of property DBSingleClientW-PT-d2m09-LTLFireability-09 finished in 1172 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0||G(p1))))'
Support contains 4 out of 200 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 200/200 places, 400/400 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 179 transition count 313
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 179 transition count 313
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 179 transition count 311
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 62 place count 161 transition count 291
Iterating global reduction 1 with 18 rules applied. Total rules applied 80 place count 161 transition count 291
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 1 with 14 rules applied. Total rules applied 94 place count 161 transition count 277
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 106 place count 149 transition count 251
Iterating global reduction 2 with 12 rules applied. Total rules applied 118 place count 149 transition count 251
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 122 place count 149 transition count 247
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 133 place count 138 transition count 220
Iterating global reduction 3 with 11 rules applied. Total rules applied 144 place count 138 transition count 220
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 149 place count 138 transition count 215
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 153 place count 134 transition count 211
Iterating global reduction 4 with 4 rules applied. Total rules applied 157 place count 134 transition count 211
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 161 place count 134 transition count 207
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 162 place count 133 transition count 206
Iterating global reduction 5 with 1 rules applied. Total rules applied 163 place count 133 transition count 206
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 166 place count 133 transition count 203
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 169 place count 130 transition count 183
Iterating global reduction 6 with 3 rules applied. Total rules applied 172 place count 130 transition count 183
Applied a total of 172 rules in 28 ms. Remains 130 /200 variables (removed 70) and now considering 183/400 (removed 217) transitions.
// Phase 1: matrix 183 rows 130 cols
[2024-05-21 22:18:36] [INFO ] Computed 2 invariants in 2 ms
[2024-05-21 22:18:36] [INFO ] Implicit Places using invariants in 67 ms returned []
[2024-05-21 22:18:36] [INFO ] Invariant cache hit.
[2024-05-21 22:18:36] [INFO ] State equation strengthened by 54 read => feed constraints.
[2024-05-21 22:18:37] [INFO ] Implicit Places using invariants and state equation in 256 ms returned []
Implicit Place search using SMT with State Equation took 339 ms to find 0 implicit places.
[2024-05-21 22:18:37] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-21 22:18:37] [INFO ] Invariant cache hit.
[2024-05-21 22:18:37] [INFO ] Dead Transitions using invariants and state equation in 81 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 130/200 places, 183/400 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 471 ms. Remains : 130/200 places, 183/400 transitions.
Stuttering acceptance computed with spot in 159 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : DBSingleClientW-PT-d2m09-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=2, aps=[p1:(OR (LT s1 1) (LT s114 1)), p0:(AND (GEQ s54 1) (GEQ s91 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Entered a terminal (fully accepting) state of product in 12973 steps with 2984 reset in 23 ms.
FORMULA DBSingleClientW-PT-d2m09-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d2m09-LTLFireability-10 finished in 666 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(X((p0 U ((p1 U p2) U p3))))||X((X(p1) U p0))))'
Support contains 6 out of 200 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 200/200 places, 400/400 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 180 transition count 328
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 180 transition count 328
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 42 place count 180 transition count 326
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 59 place count 163 transition count 304
Iterating global reduction 1 with 17 rules applied. Total rules applied 76 place count 163 transition count 304
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 1 with 14 rules applied. Total rules applied 90 place count 163 transition count 290
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 101 place count 152 transition count 267
Iterating global reduction 2 with 11 rules applied. Total rules applied 112 place count 152 transition count 267
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 114 place count 152 transition count 265
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 124 place count 142 transition count 239
Iterating global reduction 3 with 10 rules applied. Total rules applied 134 place count 142 transition count 239
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 3 with 16 rules applied. Total rules applied 150 place count 142 transition count 223
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 152 place count 140 transition count 221
Iterating global reduction 4 with 2 rules applied. Total rules applied 154 place count 140 transition count 221
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 155 place count 140 transition count 220
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 156 place count 139 transition count 219
Iterating global reduction 5 with 1 rules applied. Total rules applied 157 place count 139 transition count 219
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 160 place count 139 transition count 216
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 162 place count 137 transition count 203
Iterating global reduction 6 with 2 rules applied. Total rules applied 164 place count 137 transition count 203
Applied a total of 164 rules in 17 ms. Remains 137 /200 variables (removed 63) and now considering 203/400 (removed 197) transitions.
// Phase 1: matrix 203 rows 137 cols
[2024-05-21 22:18:37] [INFO ] Computed 2 invariants in 2 ms
[2024-05-21 22:18:37] [INFO ] Implicit Places using invariants in 68 ms returned []
[2024-05-21 22:18:37] [INFO ] Invariant cache hit.
[2024-05-21 22:18:37] [INFO ] State equation strengthened by 70 read => feed constraints.
[2024-05-21 22:18:37] [INFO ] Implicit Places using invariants and state equation in 275 ms returned []
Implicit Place search using SMT with State Equation took 354 ms to find 0 implicit places.
[2024-05-21 22:18:37] [INFO ] Invariant cache hit.
[2024-05-21 22:18:37] [INFO ] Dead Transitions using invariants and state equation in 88 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 137/200 places, 203/400 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 459 ms. Remains : 137/200 places, 203/400 transitions.
Stuttering acceptance computed with spot in 356 ms :[(AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p3))), true, (NOT p3), (NOT p3), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p3))), (NOT p2)]
Running random walk in product with property : DBSingleClientW-PT-d2m09-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p3) (NOT p2) (NOT p1)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p0) (NOT p3) p2 (NOT p1)), acceptance={} source=2 dest: 4}, { cond=(AND p0 (NOT p3) (NOT p1)), acceptance={} source=2 dest: 5}, { cond=(AND (NOT p0) (NOT p3) (NOT p2) p1), acceptance={} source=2 dest: 6}, { cond=(AND (NOT p0) (NOT p3) p1), acceptance={} source=2 dest: 7}], [{ cond=true, acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p3) (NOT p2) (NOT p1)), acceptance={} source=4 dest: 3}, { cond=(OR (AND (NOT p3) p2) (AND (NOT p3) p1)), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p3) (NOT p2) p1), acceptance={} source=4 dest: 8}], [{ cond=(AND (NOT p0) (NOT p3) (NOT p2) (NOT p1)), acceptance={} source=5 dest: 3}, { cond=(OR (AND (NOT p0) (NOT p3) p2) (AND (NOT p0) (NOT p3) p1)), acceptance={} source=5 dest: 4}, { cond=(AND p0 (NOT p3)), acceptance={} source=5 dest: 5}, { cond=(AND (NOT p0) (NOT p3) (NOT p2) p1), acceptance={} source=5 dest: 8}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=6 dest: 3}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=6 dest: 6}], [{ cond=(AND (NOT p3) (NOT p2) (NOT p1)), acceptance={} source=7 dest: 3}, { cond=(AND (NOT p3) p2 (NOT p1)), acceptance={} source=7 dest: 4}, { cond=(AND (NOT p0) (NOT p3) (NOT p2) p1), acceptance={} source=7 dest: 6}, { cond=(AND (NOT p0) (NOT p3) p1), acceptance={} source=7 dest: 7}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=8 dest: 3}, { cond=(AND (NOT p2) p1), acceptance={} source=8 dest: 8}]], initial=0, aps=[p0:(AND (GEQ s1 1) (GEQ s98 1)), p3:(AND (GEQ s1 1) (GEQ s130 1)), p2:(AND (GEQ s8 1) (GEQ s57 1)), p1:(AND (GEQ s1 1) (GEQ s131 1))], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d2m09-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d2m09-LTLFireability-12 finished in 843 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0||G(p1))))'
Support contains 3 out of 200 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 200/200 places, 400/400 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 179 transition count 325
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 179 transition count 325
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 179 transition count 323
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 62 place count 161 transition count 299
Iterating global reduction 1 with 18 rules applied. Total rules applied 80 place count 161 transition count 299
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 92 place count 161 transition count 287
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 103 place count 150 transition count 263
Iterating global reduction 2 with 11 rules applied. Total rules applied 114 place count 150 transition count 263
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 118 place count 150 transition count 259
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 128 place count 140 transition count 235
Iterating global reduction 3 with 10 rules applied. Total rules applied 138 place count 140 transition count 235
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 142 place count 140 transition count 231
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 146 place count 136 transition count 227
Iterating global reduction 4 with 4 rules applied. Total rules applied 150 place count 136 transition count 227
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 154 place count 136 transition count 223
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 155 place count 135 transition count 222
Iterating global reduction 5 with 1 rules applied. Total rules applied 156 place count 135 transition count 222
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 159 place count 135 transition count 219
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 162 place count 132 transition count 199
Iterating global reduction 6 with 3 rules applied. Total rules applied 165 place count 132 transition count 199
Applied a total of 165 rules in 26 ms. Remains 132 /200 variables (removed 68) and now considering 199/400 (removed 201) transitions.
// Phase 1: matrix 199 rows 132 cols
[2024-05-21 22:18:38] [INFO ] Computed 2 invariants in 1 ms
[2024-05-21 22:18:38] [INFO ] Implicit Places using invariants in 59 ms returned []
[2024-05-21 22:18:38] [INFO ] Invariant cache hit.
[2024-05-21 22:18:38] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-05-21 22:18:38] [INFO ] Implicit Places using invariants and state equation in 268 ms returned []
Implicit Place search using SMT with State Equation took 340 ms to find 0 implicit places.
[2024-05-21 22:18:38] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-21 22:18:38] [INFO ] Invariant cache hit.
[2024-05-21 22:18:38] [INFO ] Dead Transitions using invariants and state equation in 74 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 132/200 places, 199/400 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 446 ms. Remains : 132/200 places, 199/400 transitions.
Stuttering acceptance computed with spot in 34 ms :[(AND (NOT p1) (NOT p0))]
Running random walk in product with property : DBSingleClientW-PT-d2m09-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p1:(OR (LT s1 1) (LT s120 1)), p0:(AND (GEQ s1 1) (GEQ s118 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 23043 reset in 152 ms.
Product exploration explored 100000 steps with 22889 reset in 157 ms.
Computed a total of 5 stabilizing places and 19 stable transitions
Graph (complete) has 486 edges and 132 vertex of which 131 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 5 stabilizing places and 19 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X (AND p1 (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 81 ms. Reduced automaton from 1 states, 2 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 34 ms :[(AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 2296 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 443 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 440 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 2) seen :0
Finished probabilistic random walk after 21078 steps, run visited all 2 properties in 115 ms. (steps per millisecond=183 )
Probabilistic random walk after 21078 steps, saw 10408 distinct states, run finished after 115 ms. (steps per millisecond=183 ) properties seen :2
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p1 (NOT p0)), (X (AND p1 (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) p1))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 5 factoid took 126 ms. Reduced automaton from 1 states, 2 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 33 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 30 ms :[(AND (NOT p0) (NOT p1))]
Support contains 3 out of 132 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 132/132 places, 199/199 transitions.
Applied a total of 0 rules in 5 ms. Remains 132 /132 variables (removed 0) and now considering 199/199 (removed 0) transitions.
[2024-05-21 22:18:39] [INFO ] Invariant cache hit.
[2024-05-21 22:18:39] [INFO ] Implicit Places using invariants in 63 ms returned []
[2024-05-21 22:18:39] [INFO ] Invariant cache hit.
[2024-05-21 22:18:39] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-05-21 22:18:39] [INFO ] Implicit Places using invariants and state equation in 246 ms returned []
Implicit Place search using SMT with State Equation took 311 ms to find 0 implicit places.
[2024-05-21 22:18:39] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-21 22:18:39] [INFO ] Invariant cache hit.
[2024-05-21 22:18:39] [INFO ] Dead Transitions using invariants and state equation in 76 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 401 ms. Remains : 132/132 places, 199/199 transitions.
Computed a total of 5 stabilizing places and 19 stable transitions
Graph (complete) has 486 edges and 132 vertex of which 131 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Computed a total of 5 stabilizing places and 19 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 78 ms. Reduced automaton from 1 states, 2 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 28 ms :[(AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 2307 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 445 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 447 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 2) seen :0
Finished probabilistic random walk after 21078 steps, run visited all 2 properties in 78 ms. (steps per millisecond=270 )
Probabilistic random walk after 21078 steps, saw 10408 distinct states, run finished after 78 ms. (steps per millisecond=270 ) properties seen :2
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) p1), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) p1))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 5 factoid took 109 ms. Reduced automaton from 1 states, 2 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 33 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 30 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 45 ms :[(AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 22986 reset in 164 ms.
Product exploration explored 100000 steps with 23064 reset in 168 ms.
Built C files in :
/tmp/ltsmin1825348670160430873
[2024-05-21 22:18:40] [INFO ] Computing symmetric may disable matrix : 199 transitions.
[2024-05-21 22:18:40] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 22:18:40] [INFO ] Computing symmetric may enable matrix : 199 transitions.
[2024-05-21 22:18:40] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 22:18:40] [INFO ] Computing Do-Not-Accords matrix : 199 transitions.
[2024-05-21 22:18:40] [INFO ] Computation of Completed DNA matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 22:18:40] [INFO ] Built C files in 22ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1825348670160430873
Running compilation step : cd /tmp/ltsmin1825348670160430873;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 389 ms.
Running link step : cd /tmp/ltsmin1825348670160430873;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin1825348670160430873;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased4405441549154280832.hoa' '--buchi-type=spotba'
LTSmin run took 3968 ms.
FORMULA DBSingleClientW-PT-d2m09-LTLFireability-13 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property DBSingleClientW-PT-d2m09-LTLFireability-13 finished in 7092 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||X(((p2 U p0)&&p1))))'
Support contains 4 out of 200 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 200/200 places, 400/400 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 180 transition count 326
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 180 transition count 326
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 41 place count 180 transition count 325
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 59 place count 162 transition count 301
Iterating global reduction 1 with 18 rules applied. Total rules applied 77 place count 162 transition count 301
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 1 with 13 rules applied. Total rules applied 90 place count 162 transition count 288
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 101 place count 151 transition count 263
Iterating global reduction 2 with 11 rules applied. Total rules applied 112 place count 151 transition count 263
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 116 place count 151 transition count 259
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 125 place count 142 transition count 243
Iterating global reduction 3 with 9 rules applied. Total rules applied 134 place count 142 transition count 243
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 138 place count 142 transition count 239
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 142 place count 138 transition count 235
Iterating global reduction 4 with 4 rules applied. Total rules applied 146 place count 138 transition count 235
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 150 place count 138 transition count 231
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 151 place count 137 transition count 230
Iterating global reduction 5 with 1 rules applied. Total rules applied 152 place count 137 transition count 230
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 155 place count 137 transition count 227
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 158 place count 134 transition count 207
Iterating global reduction 6 with 3 rules applied. Total rules applied 161 place count 134 transition count 207
Applied a total of 161 rules in 12 ms. Remains 134 /200 variables (removed 66) and now considering 207/400 (removed 193) transitions.
// Phase 1: matrix 207 rows 134 cols
[2024-05-21 22:18:45] [INFO ] Computed 2 invariants in 2 ms
[2024-05-21 22:18:45] [INFO ] Implicit Places using invariants in 67 ms returned []
[2024-05-21 22:18:45] [INFO ] Invariant cache hit.
[2024-05-21 22:18:45] [INFO ] State equation strengthened by 81 read => feed constraints.
[2024-05-21 22:18:45] [INFO ] Implicit Places using invariants and state equation in 287 ms returned []
Implicit Place search using SMT with State Equation took 356 ms to find 0 implicit places.
[2024-05-21 22:18:45] [INFO ] Invariant cache hit.
[2024-05-21 22:18:45] [INFO ] Dead Transitions using invariants and state equation in 82 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 134/200 places, 207/400 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 452 ms. Remains : 134/200 places, 207/400 transitions.
Stuttering acceptance computed with spot in 196 ms :[true, (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d2m09-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(OR (AND (NOT p0) (NOT p2)) (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) p1 p2), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p0) p2), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 1}, { cond=p0, acceptance={} source=3 dest: 4}], [{ cond=(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), acceptance={} source=4 dest: 0}, { cond=(AND (NOT p0) p1 p2), acceptance={} source=4 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=4 dest: 5}], [{ cond=(NOT p0), acceptance={} source=5 dest: 0}, { cond=p0, acceptance={} source=5 dest: 5}]], initial=3, aps=[p0:(AND (GEQ s1 1) (GEQ s68 1)), p2:(AND (GEQ s1 1) (GEQ s119 1)), p1:(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, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d2m09-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d2m09-LTLFireability-14 finished in 663 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)||X(F(p1)))))'
Support contains 4 out of 200 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 200/200 places, 400/400 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 179 transition count 320
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 179 transition count 320
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 179 transition count 318
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 62 place count 161 transition count 295
Iterating global reduction 1 with 18 rules applied. Total rules applied 80 place count 161 transition count 295
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 1 with 14 rules applied. Total rules applied 94 place count 161 transition count 281
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 106 place count 149 transition count 256
Iterating global reduction 2 with 12 rules applied. Total rules applied 118 place count 149 transition count 256
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 122 place count 149 transition count 252
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 133 place count 138 transition count 225
Iterating global reduction 3 with 11 rules applied. Total rules applied 144 place count 138 transition count 225
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 3 with 11 rules applied. Total rules applied 155 place count 138 transition count 214
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 158 place count 135 transition count 211
Iterating global reduction 4 with 3 rules applied. Total rules applied 161 place count 135 transition count 211
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 135 transition count 208
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 165 place count 134 transition count 207
Iterating global reduction 5 with 1 rules applied. Total rules applied 166 place count 134 transition count 207
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 169 place count 134 transition count 204
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 171 place count 132 transition count 192
Iterating global reduction 6 with 2 rules applied. Total rules applied 173 place count 132 transition count 192
Applied a total of 173 rules in 23 ms. Remains 132 /200 variables (removed 68) and now considering 192/400 (removed 208) transitions.
// Phase 1: matrix 192 rows 132 cols
[2024-05-21 22:18:45] [INFO ] Computed 2 invariants in 1 ms
[2024-05-21 22:18:46] [INFO ] Implicit Places using invariants in 69 ms returned []
[2024-05-21 22:18:46] [INFO ] Invariant cache hit.
[2024-05-21 22:18:46] [INFO ] State equation strengthened by 65 read => feed constraints.
[2024-05-21 22:18:46] [INFO ] Implicit Places using invariants and state equation in 227 ms returned []
Implicit Place search using SMT with State Equation took 310 ms to find 0 implicit places.
[2024-05-21 22:18:46] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-21 22:18:46] [INFO ] Invariant cache hit.
[2024-05-21 22:18:46] [INFO ] Dead Transitions using invariants and state equation in 75 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 132/200 places, 192/400 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 417 ms. Remains : 132/200 places, 192/400 transitions.
Stuttering acceptance computed with spot in 66 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : DBSingleClientW-PT-d2m09-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (GEQ s1 1) (GEQ s126 1)), p1:(AND (GEQ s8 1) (GEQ s55 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 7 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d2m09-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d2m09-LTLFireability-15 finished in 501 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G((p1||X(X(p2))))))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
[2024-05-21 22:18:46] [INFO ] Flatten gal took : 20 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin9176123026124701069
[2024-05-21 22:18:46] [INFO ] Computing symmetric may disable matrix : 400 transitions.
[2024-05-21 22:18:46] [INFO ] Applying decomposition
[2024-05-21 22:18:46] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 22:18:46] [INFO ] Flatten gal took : 17 ms
[2024-05-21 22:18:46] [INFO ] Computing symmetric may enable matrix : 400 transitions.
[2024-05-21 22:18:46] [INFO ] Computation of Complete enable matrix. took 8 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph89624233885256441.txt' '-o' '/tmp/graph89624233885256441.bin' '-w' '/tmp/graph89624233885256441.weights'
[2024-05-21 22:18:46] [INFO ] Computing Do-Not-Accords matrix : 400 transitions.
[2024-05-21 22:18:46] [INFO ] Computation of Completed DNA matrix. took 9 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph89624233885256441.bin' '-l' '-1' '-v' '-w' '/tmp/graph89624233885256441.weights' '-q' '0' '-e' '0.001'
[2024-05-21 22:18:46] [INFO ] Decomposing Gal with order
[2024-05-21 22:18:46] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 22:18:46] [INFO ] Built C files in 98ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9176123026124701069
Running compilation step : cd /tmp/ltsmin9176123026124701069;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '360' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2024-05-21 22:18:46] [INFO ] Removed a total of 410 redundant transitions.
[2024-05-21 22:18:46] [INFO ] Flatten gal took : 42 ms
[2024-05-21 22:18:46] [INFO ] Fuse similar labels procedure discarded/fused a total of 276 labels/synchronizations in 20 ms.
[2024-05-21 22:18:46] [INFO ] Time to serialize gal into /tmp/LTLFireability3229473324456418156.gal : 4 ms
[2024-05-21 22:18:46] [INFO ] Time to serialize properties into /tmp/LTLFireability3551557269384950617.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability3229473324456418156.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability3551557269384950617.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 2 LTL properties
Checking formula 0 : !((G((F("((i0.i0.u1.s1<1)||(i2.u8.l1713<1))"))&&(F(G(("(((i4.u7.p261<1)||(i0.i0.u1.l0<1))&&((i0.i0.u1.s1<1)||(i8.u21.l4107<1)))")||(X(...201
Formula 0 simplified : F(G!"((i0.i0.u1.s1<1)||(i2.u8.l1713<1))" | GF(!"(((i4.u7.p261<1)||(i0.i0.u1.l0<1))&&((i0.i0.u1.s1<1)||(i8.u21.l4107<1)))" & XX!"((i4...187
Compilation finished in 900 ms.
Running link step : cd /tmp/ltsmin9176123026124701069;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin9176123026124701069;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[]((<>((LTLAPp0==true))&&<>([](((LTLAPp1==true)||X(X((LTLAPp2==true))))))))' '--buchi-type=spotba'
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.002: Loading model from ./gal.so
pins2lts-mc-linux64( 0/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.006: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.006: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.005: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.005: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.012: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.012: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.013: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.013: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.024: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.024: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.036: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.036: LTL layer: formula: []((<>((LTLAPp0==true))&&<>([](((LTLAPp1==true)||X(X((LTLAPp2==true))))))))
pins2lts-mc-linux64( 1/ 8), 0.036: "[]((<>((LTLAPp0==true))&&<>([](((LTLAPp1==true)||X(X((LTLAPp2==true))))))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 1/ 8), 0.036: Using Spin LTL semantics
pins2lts-mc-linux64( 6/ 8), 0.040: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.040: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.041: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.041: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.044: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.049: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.062: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.082: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.081: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.085: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.086: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.139: There are 405 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.139: State length is 201, there are 412 groups
pins2lts-mc-linux64( 0/ 8), 0.139: Running cndfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.139: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.139: Successor permutation: dynamic
pins2lts-mc-linux64( 0/ 8), 0.139: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 6/ 8), 0.148: [Blue] ~45 levels ~960 states ~3112 transitions
pins2lts-mc-linux64( 4/ 8), 0.187: [Blue] ~40 levels ~1920 states ~5480 transitions
pins2lts-mc-linux64( 6/ 8), 0.240: [Blue] ~46 levels ~3840 states ~8928 transitions
pins2lts-mc-linux64( 6/ 8), 0.363: [Blue] ~46 levels ~7680 states ~16888 transitions
pins2lts-mc-linux64( 6/ 8), 0.603: [Blue] ~70 levels ~15360 states ~34088 transitions
pins2lts-mc-linux64( 5/ 8), 1.131: [Blue] ~62 levels ~30720 states ~65288 transitions
pins2lts-mc-linux64( 5/ 8), 1.891: [Blue] ~87 levels ~61440 states ~134480 transitions
pins2lts-mc-linux64( 5/ 8), 3.976: [Blue] ~106 levels ~122880 states ~265832 transitions
pins2lts-mc-linux64( 5/ 8), 7.523: [Blue] ~164 levels ~245760 states ~539488 transitions
pins2lts-mc-linux64( 4/ 8), 13.784: [Blue] ~295 levels ~491520 states ~1053560 transitions
pins2lts-mc-linux64( 4/ 8), 25.833: [Blue] ~591 levels ~983040 states ~2137392 transitions
pins2lts-mc-linux64( 5/ 8), 39.867: [Blue] ~1384 levels ~1966080 states ~4669192 transitions
pins2lts-mc-linux64( 6/ 8), 56.846: [Blue] ~5156 levels ~3932160 states ~8859952 transitions
pins2lts-mc-linux64( 3/ 8), 93.156: [Blue] ~74 levels ~7864320 states ~17263448 transitions
pins2lts-mc-linux64( 0/ 8), 164.737: [Blue] ~12386 levels ~15728640 states ~37056984 transitions
pins2lts-mc-linux64( 5/ 8), 315.020: [Blue] ~12474 levels ~31457280 states ~92856752 transitions
pins2lts-mc-linux64( 7/ 8), 579.076: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 579.159:
pins2lts-mc-linux64( 0/ 8), 579.159: Explored 59342358 states 169246435 transitions, fanout: 2.852
pins2lts-mc-linux64( 0/ 8), 579.159: Total exploration time 578.980 sec (578.900 sec minimum, 578.941 sec on average)
pins2lts-mc-linux64( 0/ 8), 579.159: States per second: 102495, Transitions per second: 292318
pins2lts-mc-linux64( 0/ 8), 579.159:
pins2lts-mc-linux64( 0/ 8), 579.159: State space has 62572797 states, 1829211 are accepting
pins2lts-mc-linux64( 0/ 8), 579.159: cndfs_1 (permutation: dynamic) stats:
pins2lts-mc-linux64( 0/ 8), 579.159: blue states: 59342358 (94.84%), transitions: 0 (per worker)
pins2lts-mc-linux64( 0/ 8), 579.159: red states: 0 (0.00%), bogus: 0 (0.00%), transitions: 0, waits: 0 (0.00 sec)
pins2lts-mc-linux64( 0/ 8), 579.159: all-red states: 4193767 (6.70%), bogus 539 (0.00%)
pins2lts-mc-linux64( 0/ 8), 579.159:
pins2lts-mc-linux64( 0/ 8), 579.159: Total memory used for local state coloring: 42.0MB
pins2lts-mc-linux64( 0/ 8), 579.159:
pins2lts-mc-linux64( 0/ 8), 579.159: Queue width: 8B, total height: 2755412, memory: 21.02MB
pins2lts-mc-linux64( 0/ 8), 579.159: Tree memory: 733.4MB, 12.3 B/state, compr.: 1.5%
pins2lts-mc-linux64( 0/ 8), 579.159: Tree fill ratio (roots/leafs): 46.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 579.159: Stored 402 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 579.159: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 579.159: Est. total memory use: 754.4MB (~1045.0MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin9176123026124701069;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[]((<>((LTLAPp0==true))&&<>([](((LTLAPp1==true)||X(X((LTLAPp2==true))))))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin9176123026124701069;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[]((<>((LTLAPp0==true))&&<>([](((LTLAPp1==true)||X(X((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.
[2024-05-21 22:40:10] [INFO ] Flatten gal took : 261 ms
[2024-05-21 22:40:10] [INFO ] Time to serialize gal into /tmp/LTLFireability14463360602567859446.gal : 29 ms
[2024-05-21 22:40:10] [INFO ] Time to serialize properties into /tmp/LTLFireability6180970121722097024.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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability14463360602567859446.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability6180970121722097024.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...298
Read 2 LTL properties
Checking formula 0 : !((G((F("((s1<1)||(l1713<1))"))&&(F(G(("(((p261<1)||(l0<1))&&((s1<1)||(l4107<1)))")||(X(X("((p261<1)||(l0<1))")))))))))
Formula 0 simplified : F(G!"((s1<1)||(l1713<1))" | GF(!"(((p261<1)||(l0<1))&&((s1<1)||(l4107<1)))" & XX!"((p261<1)||(l0<1))"))
Detected timeout of ITS tools.
[2024-05-21 23:01:39] [INFO ] Flatten gal took : 186 ms
[2024-05-21 23:01:40] [INFO ] Input system was already deterministic with 400 transitions.
[2024-05-21 23:01:40] [INFO ] Transformed 200 places.
[2024-05-21 23:01:40] [INFO ] Transformed 400 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2024-05-21 23:01:40] [INFO ] Time to serialize gal into /tmp/LTLFireability14451793535437967314.gal : 6 ms
[2024-05-21 23:01:40] [INFO ] Time to serialize properties into /tmp/LTLFireability1193568521606131321.ltl : 4 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability14451793535437967314.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability1193568521606131321.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...343
Read 2 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((G((F("((s1<1)||(l1713<1))"))&&(F(G(("(((p261<1)||(l0<1))&&((s1<1)||(l4107<1)))")||(X(X("((p261<1)||(l0<1))")))))))))
Formula 0 simplified : F(G!"((s1<1)||(l1713<1))" | GF(!"(((p261<1)||(l0<1))&&((s1<1)||(l4107<1)))" & XX!"((p261<1)||(l0<1))"))
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 11123048 kB
After kill :
MemTotal: 16393216 kB
MemFree: 15975544 kB

BK_TIME_CONFINEMENT_REACHED

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

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="DBSingleClientW-PT-d2m09"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="gold2023"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool gold2023"
echo " Input is DBSingleClientW-PT-d2m09, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r109-tall-171624208400368"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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