Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 952K
-rw-r--r-- 1 mcc users 7.0K Jun 7 17:12 CTLCardinality.txt
-rw-r--r-- 1 mcc users 73K Jun 7 17:12 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K Jun 7 17:12 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K Jun 7 17:12 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Jun 6 15:24 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Jun 6 15:24 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Jun 6 15:24 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Jun 6 15:24 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 6 12:11 NewModel
-rw-r--r-- 1 mcc users 15K Jun 7 17:13 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 167K Jun 7 17:13 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Jun 7 17:13 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 97K Jun 7 17:13 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Jun 6 15:24 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Jun 6 15:24 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 6 12:11 equiv_col
-rw-r--r-- 1 mcc users 6 Jun 6 12:11 instance
-rw-r--r-- 1 mcc users 6 Jun 6 12:11 iscolored
-rw-r--r-- 1 mcc users 432K Jun 6 12:11 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-d1m10-LTLFireability-00
FORMULA_NAME DBSingleClientW-PT-d1m10-LTLFireability-01
FORMULA_NAME DBSingleClientW-PT-d1m10-LTLFireability-02
FORMULA_NAME DBSingleClientW-PT-d1m10-LTLFireability-03
FORMULA_NAME DBSingleClientW-PT-d1m10-LTLFireability-04
FORMULA_NAME DBSingleClientW-PT-d1m10-LTLFireability-05
FORMULA_NAME DBSingleClientW-PT-d1m10-LTLFireability-06
FORMULA_NAME DBSingleClientW-PT-d1m10-LTLFireability-07
FORMULA_NAME DBSingleClientW-PT-d1m10-LTLFireability-08
FORMULA_NAME DBSingleClientW-PT-d1m10-LTLFireability-09
FORMULA_NAME DBSingleClientW-PT-d1m10-LTLFireability-10
FORMULA_NAME DBSingleClientW-PT-d1m10-LTLFireability-11
FORMULA_NAME DBSingleClientW-PT-d1m10-LTLFireability-12
FORMULA_NAME DBSingleClientW-PT-d1m10-LTLFireability-13
FORMULA_NAME DBSingleClientW-PT-d1m10-LTLFireability-14
FORMULA_NAME DBSingleClientW-PT-d1m10-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1654780546150

Running Version 202205111006
[2022-06-09 13:15:47] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-06-09 13:15:47] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-09 13:15:47] [INFO ] Load time of PNML (sax parser for PT used): 131 ms
[2022-06-09 13:15:47] [INFO ] Transformed 1440 places.
[2022-06-09 13:15:47] [INFO ] Transformed 672 transitions.
[2022-06-09 13:15:47] [INFO ] Parsed PT model containing 1440 places and 672 transitions in 233 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
Deduced a syphon composed of 1093 places in 5 ms
Reduce places removed 1093 places and 0 transitions.
FORMULA DBSingleClientW-PT-d1m10-LTLFireability-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m10-LTLFireability-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m10-LTLFireability-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m10-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 30 out of 347 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 347/347 places, 672/672 transitions.
Reduce places removed 21 places and 0 transitions.
Ensure Unique test removed 80 transitions
Reduce isomorphic transitions removed 80 transitions.
Iterating post reduction 0 with 101 rules applied. Total rules applied 101 place count 326 transition count 592
Discarding 82 places :
Symmetric choice reduction at 1 with 82 rule applications. Total rules 183 place count 244 transition count 400
Iterating global reduction 1 with 82 rules applied. Total rules applied 265 place count 244 transition count 400
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 277 place count 244 transition count 388
Discarding 64 places :
Symmetric choice reduction at 2 with 64 rule applications. Total rules 341 place count 180 transition count 324
Iterating global reduction 2 with 64 rules applied. Total rules applied 405 place count 180 transition count 324
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 407 place count 180 transition count 322
Discarding 32 places :
Symmetric choice reduction at 3 with 32 rule applications. Total rules 439 place count 148 transition count 274
Iterating global reduction 3 with 32 rules applied. Total rules applied 471 place count 148 transition count 274
Ensure Unique test removed 27 transitions
Reduce isomorphic transitions removed 27 transitions.
Iterating post reduction 3 with 27 rules applied. Total rules applied 498 place count 148 transition count 247
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 504 place count 142 transition count 238
Iterating global reduction 4 with 6 rules applied. Total rules applied 510 place count 142 transition count 238
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 513 place count 139 transition count 235
Iterating global reduction 4 with 3 rules applied. Total rules applied 516 place count 139 transition count 235
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 517 place count 139 transition count 234
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 519 place count 137 transition count 232
Iterating global reduction 5 with 2 rules applied. Total rules applied 521 place count 137 transition count 232
Applied a total of 521 rules in 75 ms. Remains 137 /347 variables (removed 210) and now considering 232/672 (removed 440) transitions.
// Phase 1: matrix 232 rows 137 cols
[2022-06-09 13:15:47] [INFO ] Computed 2 place invariants in 15 ms
[2022-06-09 13:15:47] [INFO ] Implicit Places using invariants in 218 ms returned []
// Phase 1: matrix 232 rows 137 cols
[2022-06-09 13:15:48] [INFO ] Computed 2 place invariants in 7 ms
[2022-06-09 13:15:48] [INFO ] State equation strengthened by 108 read => feed constraints.
[2022-06-09 13:15:48] [INFO ] Implicit Places using invariants and state equation in 324 ms returned []
Implicit Place search using SMT with State Equation took 570 ms to find 0 implicit places.
// Phase 1: matrix 232 rows 137 cols
[2022-06-09 13:15:48] [INFO ] Computed 2 place invariants in 2 ms
[2022-06-09 13:15:48] [INFO ] Dead Transitions using invariants and state equation in 123 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 137/347 places, 232/672 transitions.
Finished structural reductions, in 1 iterations. Remains : 137/347 places, 232/672 transitions.
Support contains 30 out of 137 places after structural reductions.
[2022-06-09 13:15:49] [INFO ] Flatten gal took : 43 ms
[2022-06-09 13:15:49] [INFO ] Flatten gal took : 19 ms
[2022-06-09 13:15:49] [INFO ] Input system was already deterministic with 232 transitions.
Incomplete random walk after 10000 steps, including 2292 resets, run finished after 570 ms. (steps per millisecond=17 ) properties (out of 27) seen :7
Incomplete Best-First random walk after 1001 steps, including 51 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 40 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1000 steps, including 50 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1000 steps, including 52 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 102 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1000 steps, including 110 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 103 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 46 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 20) 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 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 94 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1000 steps, including 200 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 41 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 40 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 50 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 98 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 57 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 52 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 51 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 35 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 56 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 20) seen :0
Running SMT prover for 20 properties.
// Phase 1: matrix 232 rows 137 cols
[2022-06-09 13:15:49] [INFO ] Computed 2 place invariants in 2 ms
[2022-06-09 13:15:50] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2022-06-09 13:15:50] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2022-06-09 13:15:50] [INFO ] After 231ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:19
[2022-06-09 13:15:50] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2022-06-09 13:15:50] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-09 13:15:50] [INFO ] After 442ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :19
[2022-06-09 13:15:50] [INFO ] State equation strengthened by 108 read => feed constraints.
[2022-06-09 13:15:51] [INFO ] After 628ms SMT Verify possible using 108 Read/Feed constraints in natural domain returned unsat :1 sat :19
[2022-06-09 13:15:52] [INFO ] After 1251ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :19
Attempting to minimize the solution found.
Minimization took 580 ms.
[2022-06-09 13:15:52] [INFO ] After 2434ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :19
Fused 20 Parikh solutions to 18 different solutions.
Parikh walk visited 1 properties in 159 ms.
Support contains 23 out of 137 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 137/137 places, 232/232 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 134 transition count 221
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 134 transition count 221
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 133 transition count 220
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 133 transition count 220
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 132 transition count 218
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 132 transition count 218
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 11 place count 132 transition count 217
Applied a total of 11 rules in 29 ms. Remains 132 /137 variables (removed 5) and now considering 217/232 (removed 15) transitions.
Finished structural reductions, in 1 iterations. Remains : 132/137 places, 217/232 transitions.
Incomplete random walk after 10000 steps, including 2274 resets, run finished after 374 ms. (steps per millisecond=26 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 52 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1000 steps, including 53 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 39 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 102 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 106 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 91 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 46 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 18) seen :2
Incomplete Best-First random walk after 1001 steps, including 36 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 102 resets, run finished after 13 ms. (steps per millisecond=76 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 200 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 44 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 42 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 101 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 44 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 45 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 53 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 44 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 62 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 16) seen :0
Running SMT prover for 16 properties.
// Phase 1: matrix 217 rows 132 cols
[2022-06-09 13:15:53] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 13:15:53] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2022-06-09 13:15:53] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-09 13:15:53] [INFO ] After 170ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:16
[2022-06-09 13:15:53] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2022-06-09 13:15:53] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-09 13:15:54] [INFO ] After 373ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :16
[2022-06-09 13:15:54] [INFO ] State equation strengthened by 97 read => feed constraints.
[2022-06-09 13:15:54] [INFO ] After 549ms SMT Verify possible using 97 Read/Feed constraints in natural domain returned unsat :0 sat :16
[2022-06-09 13:15:55] [INFO ] After 1264ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :16
Attempting to minimize the solution found.
Minimization took 554 ms.
[2022-06-09 13:15:56] [INFO ] After 2311ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :16
Parikh walk visited 0 properties in 345 ms.
Support contains 21 out of 132 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 132/132 places, 217/217 transitions.
Applied a total of 0 rules in 13 ms. Remains 132 /132 variables (removed 0) and now considering 217/217 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 132/132 places, 217/217 transitions.
Incomplete random walk after 10000 steps, including 2280 resets, run finished after 194 ms. (steps per millisecond=51 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 46 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 41 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 49 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 95 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 37 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 42 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 115 resets, run finished after 13 ms. (steps per millisecond=76 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 200 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 45 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 47 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 94 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 43 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 44 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 54 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 45 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 38 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 16) seen :0
Finished probabilistic random walk after 74064 steps, run visited all 16 properties in 180 ms. (steps per millisecond=411 )
Probabilistic random walk after 74064 steps, saw 31027 distinct states, run finished after 180 ms. (steps per millisecond=411 ) properties seen :16
FORMULA DBSingleClientW-PT-d1m10-LTLFireability-00 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 11 simplifications.
Computed a total of 5 stabilizing places and 5 stable transitions
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(X(X(G(p0))))))'
Support contains 2 out of 137 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 137/137 places, 232/232 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 121 transition count 181
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 121 transition count 181
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 35 place count 121 transition count 178
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 46 place count 110 transition count 162
Iterating global reduction 1 with 11 rules applied. Total rules applied 57 place count 110 transition count 162
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 63 place count 110 transition count 156
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 73 place count 100 transition count 136
Iterating global reduction 2 with 10 rules applied. Total rules applied 83 place count 100 transition count 136
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 84 place count 100 transition count 135
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 90 place count 94 transition count 124
Iterating global reduction 3 with 6 rules applied. Total rules applied 96 place count 94 transition count 124
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 102 place count 94 transition count 118
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 105 place count 91 transition count 115
Iterating global reduction 4 with 3 rules applied. Total rules applied 108 place count 91 transition count 115
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 110 place count 89 transition count 113
Iterating global reduction 4 with 2 rules applied. Total rules applied 112 place count 89 transition count 113
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 113 place count 88 transition count 111
Iterating global reduction 4 with 1 rules applied. Total rules applied 114 place count 88 transition count 111
Applied a total of 114 rules in 11 ms. Remains 88 /137 variables (removed 49) and now considering 111/232 (removed 121) transitions.
// Phase 1: matrix 111 rows 88 cols
[2022-06-09 13:15:57] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 13:15:57] [INFO ] Implicit Places using invariants in 136 ms returned []
// Phase 1: matrix 111 rows 88 cols
[2022-06-09 13:15:57] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 13:15:57] [INFO ] State equation strengthened by 35 read => feed constraints.
[2022-06-09 13:15:57] [INFO ] Implicit Places using invariants and state equation in 230 ms returned []
Implicit Place search using SMT with State Equation took 368 ms to find 0 implicit places.
// Phase 1: matrix 111 rows 88 cols
[2022-06-09 13:15:57] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 13:15:57] [INFO ] Dead Transitions using invariants and state equation in 55 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 88/137 places, 111/232 transitions.
Finished structural reductions, in 1 iterations. Remains : 88/137 places, 111/232 transitions.
Stuttering acceptance computed with spot in 260 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d1m10-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 2}]], initial=3, aps=[p0:(OR (LT s1 1) (LT s83 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][false, false, false, false, false]]
Product exploration explored 100000 steps with 22851 reset in 278 ms.
Product exploration explored 100000 steps with 23051 reset in 162 ms.
Computed a total of 5 stabilizing places and 5 stable transitions
Computed a total of 5 stabilizing places and 5 stable transitions
Knowledge obtained : [p0, true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 83 ms. Reduced automaton from 5 states, 6 edges and 1 AP to 5 states, 6 edges and 1 AP.
Stuttering acceptance computed with spot in 147 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2264 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 458 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Finished probabilistic random walk after 16873 steps, run visited all 1 properties in 29 ms. (steps per millisecond=581 )
Probabilistic random walk after 16873 steps, saw 8118 distinct states, run finished after 29 ms. (steps per millisecond=581 ) properties seen :1
Knowledge obtained : [p0, true]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 89 ms. Reduced automaton from 5 states, 6 edges and 1 AP to 5 states, 6 edges and 1 AP.
Stuttering acceptance computed with spot in 122 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 146 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 88 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 88/88 places, 111/111 transitions.
Applied a total of 0 rules in 2 ms. Remains 88 /88 variables (removed 0) and now considering 111/111 (removed 0) transitions.
// Phase 1: matrix 111 rows 88 cols
[2022-06-09 13:15:59] [INFO ] Computed 2 place invariants in 2 ms
[2022-06-09 13:15:59] [INFO ] Implicit Places using invariants in 68 ms returned []
// Phase 1: matrix 111 rows 88 cols
[2022-06-09 13:15:59] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 13:15:59] [INFO ] State equation strengthened by 35 read => feed constraints.
[2022-06-09 13:15:59] [INFO ] Implicit Places using invariants and state equation in 135 ms returned []
Implicit Place search using SMT with State Equation took 205 ms to find 0 implicit places.
// Phase 1: matrix 111 rows 88 cols
[2022-06-09 13:15:59] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 13:15:59] [INFO ] Dead Transitions using invariants and state equation in 80 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 88/88 places, 111/111 transitions.
Computed a total of 5 stabilizing places and 5 stable transitions
Computed a total of 5 stabilizing places and 5 stable transitions
Knowledge obtained : [p0, true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 1249 ms. Reduced automaton from 5 states, 6 edges and 1 AP to 5 states, 6 edges and 1 AP.
Stuttering acceptance computed with spot in 166 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2302 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 463 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Finished probabilistic random walk after 16873 steps, run visited all 1 properties in 99 ms. (steps per millisecond=170 )
Probabilistic random walk after 16873 steps, saw 8118 distinct states, run finished after 99 ms. (steps per millisecond=170 ) properties seen :1
Knowledge obtained : [p0, true]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 101 ms. Reduced automaton from 5 states, 6 edges and 1 AP to 5 states, 6 edges and 1 AP.
Stuttering acceptance computed with spot in 147 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 123 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 144 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 22888 reset in 105 ms.
Product exploration explored 100000 steps with 23014 reset in 202 ms.
Applying partial POR strategy [true, true, false, false, false]
Stuttering acceptance computed with spot in 144 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 88 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 88/88 places, 111/111 transitions.
Applied a total of 0 rules in 7 ms. Remains 88 /88 variables (removed 0) and now considering 111/111 (removed 0) transitions.
[2022-06-09 13:16:02] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 111 rows 88 cols
[2022-06-09 13:16:02] [INFO ] Computed 2 place invariants in 4 ms
[2022-06-09 13:16:02] [INFO ] Dead Transitions using invariants and state equation in 53 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 88/88 places, 111/111 transitions.
Product exploration explored 100000 steps with 23119 reset in 194 ms.
Product exploration explored 100000 steps with 23046 reset in 197 ms.
Built C files in :
/tmp/ltsmin16196562767193111643
[2022-06-09 13:16:02] [INFO ] Built C files in 15ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16196562767193111643
Running compilation step : cd /tmp/ltsmin16196562767193111643;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 275 ms.
Running link step : cd /tmp/ltsmin16196562767193111643;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 40 ms.
Running LTSmin : cd /tmp/ltsmin16196562767193111643;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased12628458301370463964.hoa' '--buchi-type=spotba'
LTSmin run took 465 ms.
FORMULA DBSingleClientW-PT-d1m10-LTLFireability-02 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property DBSingleClientW-PT-d1m10-LTLFireability-02 finished in 6152 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 137 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 137/137 places, 232/232 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 121 transition count 181
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 121 transition count 181
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 34 place count 121 transition count 179
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 46 place count 109 transition count 162
Iterating global reduction 1 with 12 rules applied. Total rules applied 58 place count 109 transition count 162
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 64 place count 109 transition count 156
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 75 place count 98 transition count 134
Iterating global reduction 2 with 11 rules applied. Total rules applied 86 place count 98 transition count 134
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 88 place count 98 transition count 132
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 95 place count 91 transition count 120
Iterating global reduction 3 with 7 rules applied. Total rules applied 102 place count 91 transition count 120
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 106 place count 91 transition count 116
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 110 place count 87 transition count 112
Iterating global reduction 4 with 4 rules applied. Total rules applied 114 place count 87 transition count 112
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 116 place count 87 transition count 110
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 118 place count 85 transition count 108
Iterating global reduction 5 with 2 rules applied. Total rules applied 120 place count 85 transition count 108
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 121 place count 84 transition count 106
Iterating global reduction 5 with 1 rules applied. Total rules applied 122 place count 84 transition count 106
Applied a total of 122 rules in 26 ms. Remains 84 /137 variables (removed 53) and now considering 106/232 (removed 126) transitions.
// Phase 1: matrix 106 rows 84 cols
[2022-06-09 13:16:03] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 13:16:03] [INFO ] Implicit Places using invariants in 47 ms returned []
// Phase 1: matrix 106 rows 84 cols
[2022-06-09 13:16:03] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 13:16:03] [INFO ] State equation strengthened by 36 read => feed constraints.
[2022-06-09 13:16:03] [INFO ] Implicit Places using invariants and state equation in 125 ms returned []
Implicit Place search using SMT with State Equation took 173 ms to find 0 implicit places.
[2022-06-09 13:16:03] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 106 rows 84 cols
[2022-06-09 13:16:03] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 13:16:03] [INFO ] Dead Transitions using invariants and state equation in 59 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 84/137 places, 106/232 transitions.
Finished structural reductions, in 1 iterations. Remains : 84/137 places, 106/232 transitions.
Stuttering acceptance computed with spot in 59 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d1m10-LTLFireability-03 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 s1 1) (LT s37 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 23188 reset in 181 ms.
Product exploration explored 100000 steps with 23172 reset in 137 ms.
Computed a total of 5 stabilizing places and 5 stable transitions
Computed a total of 5 stabilizing places and 5 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 114 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 57 ms :[(NOT p0), (NOT p0)]
Finished random walk after 115 steps, including 23 resets, run visited all 1 properties in 2 ms. (steps per millisecond=57 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 116 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 64 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 1033 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 84 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 84/84 places, 106/106 transitions.
Applied a total of 0 rules in 11 ms. Remains 84 /84 variables (removed 0) and now considering 106/106 (removed 0) transitions.
// Phase 1: matrix 106 rows 84 cols
[2022-06-09 13:16:05] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 13:16:05] [INFO ] Implicit Places using invariants in 51 ms returned []
// Phase 1: matrix 106 rows 84 cols
[2022-06-09 13:16:05] [INFO ] Computed 2 place invariants in 4 ms
[2022-06-09 13:16:05] [INFO ] State equation strengthened by 36 read => feed constraints.
[2022-06-09 13:16:05] [INFO ] Implicit Places using invariants and state equation in 121 ms returned []
Implicit Place search using SMT with State Equation took 174 ms to find 0 implicit places.
[2022-06-09 13:16:05] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 106 rows 84 cols
[2022-06-09 13:16:05] [INFO ] Computed 2 place invariants in 7 ms
[2022-06-09 13:16:05] [INFO ] Dead Transitions using invariants and state equation in 54 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 84/84 places, 106/106 transitions.
Computed a total of 5 stabilizing places and 5 stable transitions
Computed a total of 5 stabilizing places and 5 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 208 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 56 ms :[(NOT p0), (NOT p0)]
Finished random walk after 38 steps, including 7 resets, run visited all 1 properties in 1 ms. (steps per millisecond=38 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 101 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 59 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 84 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 23127 reset in 109 ms.
Product exploration explored 100000 steps with 23280 reset in 149 ms.
Built C files in :
/tmp/ltsmin17184206239177750723
[2022-06-09 13:16:06] [INFO ] Computing symmetric may disable matrix : 106 transitions.
[2022-06-09 13:16:06] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-09 13:16:06] [INFO ] Computing symmetric may enable matrix : 106 transitions.
[2022-06-09 13:16:06] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-09 13:16:06] [INFO ] Computing Do-Not-Accords matrix : 106 transitions.
[2022-06-09 13:16:06] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-09 13:16:06] [INFO ] Built C files in 13ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17184206239177750723
Running compilation step : cd /tmp/ltsmin17184206239177750723;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 218 ms.
Running link step : cd /tmp/ltsmin17184206239177750723;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin17184206239177750723;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased17082266129907517029.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 84 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 84/84 places, 106/106 transitions.
Applied a total of 0 rules in 17 ms. Remains 84 /84 variables (removed 0) and now considering 106/106 (removed 0) transitions.
// Phase 1: matrix 106 rows 84 cols
[2022-06-09 13:16:21] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 13:16:21] [INFO ] Implicit Places using invariants in 54 ms returned []
// Phase 1: matrix 106 rows 84 cols
[2022-06-09 13:16:21] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 13:16:21] [INFO ] State equation strengthened by 36 read => feed constraints.
[2022-06-09 13:16:21] [INFO ] Implicit Places using invariants and state equation in 115 ms returned []
Implicit Place search using SMT with State Equation took 170 ms to find 0 implicit places.
[2022-06-09 13:16:21] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 106 rows 84 cols
[2022-06-09 13:16:21] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 13:16:22] [INFO ] Dead Transitions using invariants and state equation in 53 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 84/84 places, 106/106 transitions.
Built C files in :
/tmp/ltsmin16136773724701494435
[2022-06-09 13:16:22] [INFO ] Computing symmetric may disable matrix : 106 transitions.
[2022-06-09 13:16:22] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-09 13:16:22] [INFO ] Computing symmetric may enable matrix : 106 transitions.
[2022-06-09 13:16:22] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-09 13:16:22] [INFO ] Computing Do-Not-Accords matrix : 106 transitions.
[2022-06-09 13:16:22] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-09 13:16:22] [INFO ] Built C files in 12ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16136773724701494435
Running compilation step : cd /tmp/ltsmin16136773724701494435;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 211 ms.
Running link step : cd /tmp/ltsmin16136773724701494435;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 26 ms.
Running LTSmin : cd /tmp/ltsmin16136773724701494435;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased9532308417453288242.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-06-09 13:16:37] [INFO ] Flatten gal took : 7 ms
[2022-06-09 13:16:37] [INFO ] Flatten gal took : 7 ms
[2022-06-09 13:16:37] [INFO ] Time to serialize gal into /tmp/LTL9098890273670380835.gal : 485 ms
[2022-06-09 13:16:37] [INFO ] Time to serialize properties into /tmp/LTL15025254774548383220.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL9098890273670380835.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15025254774548383220.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL9098890...267
Read 1 LTL properties
Checking formula 0 : !((G(F("((s1<1)||(l36<1))"))))
Formula 0 simplified : !GF"((s1<1)||(l36<1))"
Detected timeout of ITS tools.
[2022-06-09 13:16:52] [INFO ] Flatten gal took : 7 ms
[2022-06-09 13:16:52] [INFO ] Applying decomposition
[2022-06-09 13:16:52] [INFO ] Flatten gal took : 6 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph861928104473749235.txt' '-o' '/tmp/graph861928104473749235.bin' '-w' '/tmp/graph861928104473749235.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph861928104473749235.bin' '-l' '-1' '-v' '-w' '/tmp/graph861928104473749235.weights' '-q' '0' '-e' '0.001'
[2022-06-09 13:16:52] [INFO ] Decomposing Gal with order
[2022-06-09 13:16:52] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-09 13:16:52] [INFO ] Removed a total of 115 redundant transitions.
[2022-06-09 13:16:52] [INFO ] Flatten gal took : 41 ms
[2022-06-09 13:16:52] [INFO ] Fuse similar labels procedure discarded/fused a total of 82 labels/synchronizations in 6 ms.
[2022-06-09 13:16:52] [INFO ] Time to serialize gal into /tmp/LTL10999920998488610520.gal : 2 ms
[2022-06-09 13:16:52] [INFO ] Time to serialize properties into /tmp/LTL2548669151330255912.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL10999920998488610520.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2548669151330255912.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1099992...246
Read 1 LTL properties
Checking formula 0 : !((G(F("((i1.u1.s1<1)||(i0.u10.l36<1))"))))
Formula 0 simplified : !GF"((i1.u1.s1<1)||(i0.u10.l36<1))"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin7656550773928378445
[2022-06-09 13:17:07] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7656550773928378445
Running compilation step : cd /tmp/ltsmin7656550773928378445;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 179 ms.
Running link step : cd /tmp/ltsmin7656550773928378445;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 26 ms.
Running LTSmin : cd /tmp/ltsmin7656550773928378445;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/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-d1m10-LTLFireability-03 finished in 79687 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((false U (F(p0)||p1)))'
Support contains 4 out of 137 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 137/137 places, 232/232 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 122 transition count 184
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 122 transition count 184
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 31 place count 122 transition count 183
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 43 place count 110 transition count 166
Iterating global reduction 1 with 12 rules applied. Total rules applied 55 place count 110 transition count 166
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 62 place count 110 transition count 159
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 72 place count 100 transition count 138
Iterating global reduction 2 with 10 rules applied. Total rules applied 82 place count 100 transition count 138
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 84 place count 100 transition count 136
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 90 place count 94 transition count 126
Iterating global reduction 3 with 6 rules applied. Total rules applied 96 place count 94 transition count 126
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 99 place count 94 transition count 123
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 103 place count 90 transition count 119
Iterating global reduction 4 with 4 rules applied. Total rules applied 107 place count 90 transition count 119
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 109 place count 90 transition count 117
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 111 place count 88 transition count 115
Iterating global reduction 5 with 2 rules applied. Total rules applied 113 place count 88 transition count 115
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 114 place count 87 transition count 113
Iterating global reduction 5 with 1 rules applied. Total rules applied 115 place count 87 transition count 113
Applied a total of 115 rules in 31 ms. Remains 87 /137 variables (removed 50) and now considering 113/232 (removed 119) transitions.
// Phase 1: matrix 113 rows 87 cols
[2022-06-09 13:17:23] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 13:17:23] [INFO ] Implicit Places using invariants in 56 ms returned []
// Phase 1: matrix 113 rows 87 cols
[2022-06-09 13:17:23] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 13:17:23] [INFO ] State equation strengthened by 40 read => feed constraints.
[2022-06-09 13:17:23] [INFO ] Implicit Places using invariants and state equation in 142 ms returned []
Implicit Place search using SMT with State Equation took 201 ms to find 0 implicit places.
[2022-06-09 13:17:23] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 113 rows 87 cols
[2022-06-09 13:17:23] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 13:17:23] [INFO ] Dead Transitions using invariants and state equation in 65 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 87/137 places, 113/232 transitions.
Finished structural reductions, in 1 iterations. Remains : 87/137 places, 113/232 transitions.
Stuttering acceptance computed with spot in 55 ms :[(NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : DBSingleClientW-PT-d1m10-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 0}]], initial=1, aps=[p0:(AND (GEQ s1 1) (GEQ s59 1)), p1:(AND (GEQ s28 1) (GEQ s33 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d1m10-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d1m10-LTLFireability-05 finished in 380 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((F(G(p0))&&F(!p0)&&p0)))'
Support contains 2 out of 137 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 137/137 places, 232/232 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 120 transition count 176
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 120 transition count 176
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 36 place count 120 transition count 174
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 48 place count 108 transition count 157
Iterating global reduction 1 with 12 rules applied. Total rules applied 60 place count 108 transition count 157
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 66 place count 108 transition count 151
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 77 place count 97 transition count 129
Iterating global reduction 2 with 11 rules applied. Total rules applied 88 place count 97 transition count 129
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 90 place count 97 transition count 127
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 97 place count 90 transition count 115
Iterating global reduction 3 with 7 rules applied. Total rules applied 104 place count 90 transition count 115
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 108 place count 90 transition count 111
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 112 place count 86 transition count 107
Iterating global reduction 4 with 4 rules applied. Total rules applied 116 place count 86 transition count 107
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 118 place count 86 transition count 105
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 120 place count 84 transition count 103
Iterating global reduction 5 with 2 rules applied. Total rules applied 122 place count 84 transition count 103
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 123 place count 83 transition count 101
Iterating global reduction 5 with 1 rules applied. Total rules applied 124 place count 83 transition count 101
Applied a total of 124 rules in 28 ms. Remains 83 /137 variables (removed 54) and now considering 101/232 (removed 131) transitions.
// Phase 1: matrix 101 rows 83 cols
[2022-06-09 13:17:23] [INFO ] Computed 2 place invariants in 0 ms
[2022-06-09 13:17:23] [INFO ] Implicit Places using invariants in 41 ms returned []
// Phase 1: matrix 101 rows 83 cols
[2022-06-09 13:17:23] [INFO ] Computed 2 place invariants in 5 ms
[2022-06-09 13:17:23] [INFO ] State equation strengthened by 31 read => feed constraints.
[2022-06-09 13:17:23] [INFO ] Implicit Places using invariants and state equation in 103 ms returned []
Implicit Place search using SMT with State Equation took 145 ms to find 0 implicit places.
[2022-06-09 13:17:23] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 101 rows 83 cols
[2022-06-09 13:17:23] [INFO ] Computed 2 place invariants in 3 ms
[2022-06-09 13:17:23] [INFO ] Dead Transitions using invariants and state equation in 49 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 83/137 places, 101/232 transitions.
Finished structural reductions, in 1 iterations. Remains : 83/137 places, 101/232 transitions.
Stuttering acceptance computed with spot in 114 ms :[true, (NOT p0), true, p0]
Running random walk in product with property : DBSingleClientW-PT-d1m10-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}, { cond=p0, acceptance={} source=0 dest: 3}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}, { cond=p0, acceptance={} source=2 dest: 3}], [{ cond=p0, acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(OR (LT s1 1) (LT s75 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 3 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d1m10-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d1m10-LTLFireability-06 finished in 355 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((G((G(p1)&&F(X(F(p2)))))||G(p3)||p0)))'
Support contains 6 out of 137 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 137/137 places, 232/232 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 122 transition count 184
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 122 transition count 184
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 32 place count 122 transition count 182
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 44 place count 110 transition count 165
Iterating global reduction 1 with 12 rules applied. Total rules applied 56 place count 110 transition count 165
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 63 place count 110 transition count 158
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 74 place count 99 transition count 136
Iterating global reduction 2 with 11 rules applied. Total rules applied 85 place count 99 transition count 136
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 87 place count 99 transition count 134
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 94 place count 92 transition count 122
Iterating global reduction 3 with 7 rules applied. Total rules applied 101 place count 92 transition count 122
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 105 place count 92 transition count 118
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 109 place count 88 transition count 114
Iterating global reduction 4 with 4 rules applied. Total rules applied 113 place count 88 transition count 114
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 114 place count 88 transition count 113
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 116 place count 86 transition count 111
Iterating global reduction 5 with 2 rules applied. Total rules applied 118 place count 86 transition count 111
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 119 place count 85 transition count 109
Iterating global reduction 5 with 1 rules applied. Total rules applied 120 place count 85 transition count 109
Applied a total of 120 rules in 11 ms. Remains 85 /137 variables (removed 52) and now considering 109/232 (removed 123) transitions.
// Phase 1: matrix 109 rows 85 cols
[2022-06-09 13:17:23] [INFO ] Computed 2 place invariants in 0 ms
[2022-06-09 13:17:23] [INFO ] Implicit Places using invariants in 55 ms returned []
// Phase 1: matrix 109 rows 85 cols
[2022-06-09 13:17:23] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 13:17:23] [INFO ] State equation strengthened by 37 read => feed constraints.
[2022-06-09 13:17:23] [INFO ] Implicit Places using invariants and state equation in 130 ms returned []
Implicit Place search using SMT with State Equation took 187 ms to find 0 implicit places.
// Phase 1: matrix 109 rows 85 cols
[2022-06-09 13:17:23] [INFO ] Computed 2 place invariants in 5 ms
[2022-06-09 13:17:24] [INFO ] Dead Transitions using invariants and state equation in 66 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 85/137 places, 109/232 transitions.
Finished structural reductions, in 1 iterations. Remains : 85/137 places, 109/232 transitions.
Stuttering acceptance computed with spot in 305 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3))), true, (NOT p2), (NOT p3), (OR (NOT p2) (NOT p1)), (OR (AND (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p3)))]
Running random walk in product with property : DBSingleClientW-PT-d1m10-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p3) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) (NOT p3) p1 (NOT p2)), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p0) p3 (NOT p1)), acceptance={} source=1 dest: 4}, { cond=(AND (NOT p0) (NOT p3) p1), acceptance={} source=1 dest: 5}, { cond=(AND (NOT p0) p3 p1), acceptance={} source=1 dest: 6}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p2), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p3), acceptance={} source=4 dest: 2}, { cond=p3, acceptance={} source=4 dest: 4}], [{ cond=(NOT p1), acceptance={} source=5 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={} source=5 dest: 3}, { cond=p1, acceptance={} source=5 dest: 5}], [{ cond=(AND (NOT p3) (NOT p1)), acceptance={} source=6 dest: 2}, { cond=(AND (NOT p3) p1 (NOT p2)), acceptance={} source=6 dest: 3}, { cond=(AND p3 (NOT p1)), acceptance={} source=6 dest: 4}, { cond=(AND (NOT p3) p1), acceptance={} source=6 dest: 5}, { cond=(AND p3 p1), acceptance={} source=6 dest: 6}]], initial=0, aps=[p0:(OR (LT s10 1) (LT s65 1)), p3:(AND (GEQ s1 1) (GEQ s61 1)), p1:(AND (GEQ s26 1) (GEQ s33 1)), p2:(AND (GEQ s10 1) (GEQ s65 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 175 ms.
Product exploration explored 100000 steps with 50000 reset in 179 ms.
Computed a total of 5 stabilizing places and 5 stable transitions
Computed a total of 5 stabilizing places and 5 stable transitions
Knowledge obtained : [(AND p0 (NOT p3) (NOT p1) (NOT p2)), (X (NOT (AND (NOT p0) (NOT p3) p1))), (X (NOT (AND (NOT p0) (NOT p3) (NOT p1)))), (X (NOT (AND (NOT p0) p3 p1))), (X (NOT (AND (NOT p0) (NOT p3) p1 (NOT p2)))), (X (NOT (AND (NOT p0) p3 (NOT p1)))), true, (X (X (AND (NOT p3) (NOT p1)))), (X (X (NOT (AND (NOT p3) p1)))), (X (X (NOT p2))), (X (X (NOT p1))), (X (X (NOT (AND p3 p1)))), (X (X (NOT (AND (NOT p3) p1 (NOT p2))))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT p3))), (X (X (NOT (AND p3 (NOT p1)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT (AND (NOT p0) p3 (NOT p1))))
Knowledge based reduction with 16 factoid took 296 ms. Reduced automaton from 7 states, 18 edges and 4 AP to 1 states, 0 edges and 0 AP.
FORMULA DBSingleClientW-PT-d1m10-LTLFireability-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DBSingleClientW-PT-d1m10-LTLFireability-08 finished in 1258 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(((F(p1)&&p0) U !(G(F(G(X((p2 U p3))))) U p4)))'
Support contains 8 out of 137 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 137/137 places, 232/232 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 123 transition count 180
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 123 transition count 180
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 29 place count 123 transition count 179
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 39 place count 113 transition count 165
Iterating global reduction 1 with 10 rules applied. Total rules applied 49 place count 113 transition count 165
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 53 place count 113 transition count 161
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 62 place count 104 transition count 147
Iterating global reduction 2 with 9 rules applied. Total rules applied 71 place count 104 transition count 147
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 73 place count 104 transition count 145
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 79 place count 98 transition count 135
Iterating global reduction 3 with 6 rules applied. Total rules applied 85 place count 98 transition count 135
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 88 place count 98 transition count 132
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 92 place count 94 transition count 128
Iterating global reduction 4 with 4 rules applied. Total rules applied 96 place count 94 transition count 128
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 98 place count 94 transition count 126
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 100 place count 92 transition count 124
Iterating global reduction 5 with 2 rules applied. Total rules applied 102 place count 92 transition count 124
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 103 place count 91 transition count 122
Iterating global reduction 5 with 1 rules applied. Total rules applied 104 place count 91 transition count 122
Applied a total of 104 rules in 25 ms. Remains 91 /137 variables (removed 46) and now considering 122/232 (removed 110) transitions.
// Phase 1: matrix 122 rows 91 cols
[2022-06-09 13:17:25] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 13:17:25] [INFO ] Implicit Places using invariants in 54 ms returned []
// Phase 1: matrix 122 rows 91 cols
[2022-06-09 13:17:25] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 13:17:25] [INFO ] State equation strengthened by 45 read => feed constraints.
[2022-06-09 13:17:25] [INFO ] Implicit Places using invariants and state equation in 113 ms returned []
Implicit Place search using SMT with State Equation took 168 ms to find 0 implicit places.
[2022-06-09 13:17:25] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 122 rows 91 cols
[2022-06-09 13:17:25] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 13:17:25] [INFO ] Dead Transitions using invariants and state equation in 51 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 91/137 places, 122/232 transitions.
Finished structural reductions, in 1 iterations. Remains : 91/137 places, 122/232 transitions.
Stuttering acceptance computed with spot in 470 ms :[p4, true, (NOT p1), (AND p3 p4), (AND p3 p4), (AND p3 p4), (AND p3 p4), p3, p3, (AND (NOT p1) p3), (AND (NOT p1) p3)]
Running random walk in product with property : DBSingleClientW-PT-d1m10-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(AND p4 p0), acceptance={0, 1} source=0 dest: 0}, { cond=(AND p4 (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND p4 p0 (NOT p1)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p4) (NOT p0)), acceptance={} source=0 dest: 3}, { cond=(AND (NOT p4) p0), acceptance={} source=0 dest: 4}, { cond=(AND p3 (NOT p4) p0), acceptance={} source=0 dest: 6}], [{ cond=true, acceptance={0, 1} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0, 1} source=2 dest: 2}], [{ cond=(NOT p4), acceptance={} source=3 dest: 3}, { cond=(OR (AND p2 p4) (AND p3 p4)), acceptance={} source=3 dest: 7}, { cond=p4, acceptance={} source=3 dest: 8}], [{ cond=(AND (NOT p4) (NOT p0)), acceptance={} source=4 dest: 3}, { cond=p0, acceptance={} source=4 dest: 4}, { cond=(OR (AND p2 p4 p0) (AND p3 p0)), acceptance={} source=4 dest: 6}, { cond=(OR (AND p2 p4 (NOT p0)) (AND p3 p4 (NOT p0))), acceptance={} source=4 dest: 7}, { cond=(AND p4 (NOT p0)), acceptance={} source=4 dest: 8}, { cond=(AND p4 p0 (NOT p1)), acceptance={} source=4 dest: 9}, { cond=(OR (AND p2 p4 p0 (NOT p1)) (AND p3 p4 p0 (NOT p1))), acceptance={} source=4 dest: 10}], [{ cond=(OR (AND p2 (NOT p4)) (AND p3 (NOT p4))), acceptance={} source=5 dest: 5}, { cond=(OR (AND p2 p4) (AND p3 p4)), acceptance={} source=5 dest: 7}], [{ cond=(OR (AND p2 (NOT p4) (NOT p0)) (AND p3 (NOT p4) (NOT p0))), acceptance={} source=6 dest: 5}, { cond=(AND p2 (NOT p3) (NOT p4) p0), acceptance={} source=6 dest: 6}, { cond=(AND p3 (NOT p4) p0), acceptance={0} source=6 dest: 6}, { cond=(AND p2 (NOT p3) p4 p0), acceptance={1} source=6 dest: 6}, { cond=(AND p3 p4 p0), acceptance={0, 1} source=6 dest: 6}, { cond=(OR (AND p2 p4 (NOT p0)) (AND p3 p4 (NOT p0))), acceptance={} source=6 dest: 7}, { cond=(OR (AND p2 p4 p0 (NOT p1)) (AND p3 p4 p0 (NOT p1))), acceptance={} source=6 dest: 10}], [{ cond=(AND p2 (NOT p3)), acceptance={1} source=7 dest: 7}, { cond=p3, acceptance={0, 1} source=7 dest: 7}], [{ cond=(OR p2 p3), acceptance={} source=8 dest: 7}, { cond=true, acceptance={} source=8 dest: 8}], [{ cond=(NOT p1), acceptance={} source=9 dest: 9}, { cond=(OR (AND p2 (NOT p1)) (AND p3 (NOT p1))), acceptance={} source=9 dest: 10}], [{ cond=(AND p2 (NOT p3) (NOT p1)), acceptance={1} source=10 dest: 10}, { cond=(AND p3 (NOT p1)), acceptance={0, 1} source=10 dest: 10}]], initial=0, aps=[p4:(AND (GEQ s1 1) (GEQ s77 1)), p0:(AND (GEQ s1 1) (GEQ s82 1)), p1:(AND (GEQ s1 1) (GEQ s75 1)), p3:(AND (GEQ s2 1) (GEQ s88 1)), p2:(AND (GEQ s7 1) (GE...], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null, null, null, null, null, null, null][true, true, true, true, true, true, true, true, true, true, true]]
Product exploration explored 100000 steps with 23009 reset in 276 ms.
Product exploration explored 100000 steps with 22902 reset in 228 ms.
Computed a total of 5 stabilizing places and 5 stable transitions
Computed a total of 5 stabilizing places and 5 stable transitions
Knowledge obtained : [(AND (NOT p4) (NOT p0) (NOT p1) (NOT p3) (NOT p2)), (X (NOT (AND p3 p4 p0))), (X (NOT (AND p4 p0))), (X (NOT (AND p4 (NOT p0)))), (X (AND (NOT p4) (NOT p0))), (X (NOT (AND p3 (NOT p4) p0))), (X (NOT (AND p4 p0 (NOT p1)))), (X (NOT (OR (AND p2 p4 p0 (NOT p1)) (AND p3 p4 p0 (NOT p1))))), (X (NOT (AND p2 (NOT p3) (NOT p4) p0))), (X (NOT p1)), (X (NOT (OR (AND p2 p4) (AND p3 p4)))), (X (NOT (OR (AND p2 (NOT p4) (NOT p0)) (AND p3 (NOT p4) (NOT p0))))), (X (NOT (AND (NOT p4) p0))), (X (NOT (OR (AND p2 p4 (NOT p0)) (AND p3 p4 (NOT p0))))), (X (NOT (AND p2 (NOT p3) p4 p0))), (X (NOT p0)), (X (NOT p4)), (X (NOT (OR (AND p2 p4 p0) (AND p3 p0)))), (X (X (NOT p3))), (X (X (NOT (OR p2 p3)))), (X (X (NOT (AND p4 (NOT p0))))), (X (X (AND (NOT p4) (NOT p0)))), (X (X (NOT (AND p4 p0 (NOT p1))))), (X (X (NOT (AND p2 (NOT p3))))), (X (X (NOT (AND p2 (NOT p3) (NOT p1))))), true, (X (X (NOT p1))), (X (X (NOT (OR (AND p2 (NOT p4) (NOT p0)) (AND p3 (NOT p4) (NOT p0)))))), (X (X (NOT (OR (AND p2 (NOT p4)) (AND p3 (NOT p4)))))), (X (X (NOT (OR (AND p2 p4 (NOT p0)) (AND p3 p4 (NOT p0)))))), (X (X (NOT (AND p2 (NOT p3) p4 p0)))), (X (X (NOT (OR (AND p2 p4 p0) (AND p3 p0))))), (X (X (NOT (AND p3 (NOT p1))))), (X (X (NOT (AND p3 p4 p0)))), (X (X (NOT (OR (AND p2 (NOT p1)) (AND p3 (NOT p1)))))), (X (X (NOT (AND p4 p0)))), (X (X (NOT (AND p3 (NOT p4) p0)))), (X (X (NOT (OR (AND p2 p4 p0 (NOT p1)) (AND p3 p4 p0 (NOT p1)))))), (X (X (NOT (AND p2 (NOT p3) (NOT p4) p0)))), (X (X (NOT (OR (AND p2 p4) (AND p3 p4))))), (X (X (NOT (AND (NOT p4) p0)))), (X (X (NOT p0))), (X (X (NOT p4)))]
False Knowledge obtained : []
Knowledge based reduction with 43 factoid took 2576 ms. Reduced automaton from 11 states, 35 edges and 5 AP to 4 states, 8 edges and 3 AP.
Stuttering acceptance computed with spot in 147 ms :[(AND p3 p4), (AND p3 p4), p3, p3]
Incomplete random walk after 10000 steps, including 2276 resets, run finished after 242 ms. (steps per millisecond=41 ) properties (out of 5) seen :1
Incomplete Best-First random walk after 10000 steps, including 492 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 960 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 2000 resets, run finished after 107 ms. (steps per millisecond=93 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 959 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 122 rows 91 cols
[2022-06-09 13:17:29] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 13:17:29] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2022-06-09 13:17:29] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-09 13:17:29] [INFO ] After 27ms SMT Verify possible using state equation in real domain returned unsat :1 sat :1 real:2
[2022-06-09 13:17:29] [INFO ] State equation strengthened by 45 read => feed constraints.
[2022-06-09 13:17:29] [INFO ] After 8ms SMT Verify possible using 45 Read/Feed constraints in real domain returned unsat :1 sat :0 real:3
[2022-06-09 13:17:29] [INFO ] After 70ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:3
[2022-06-09 13:17:29] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2022-06-09 13:17:29] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2022-06-09 13:17:29] [INFO ] After 46ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :3
[2022-06-09 13:17:29] [INFO ] After 27ms SMT Verify possible using 45 Read/Feed constraints in natural domain returned unsat :1 sat :3
[2022-06-09 13:17:29] [INFO ] After 61ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :3
Attempting to minimize the solution found.
Minimization took 27 ms.
[2022-06-09 13:17:29] [INFO ] After 174ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :3
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 8 ms.
Support contains 4 out of 91 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 91/91 places, 122/122 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 89 transition count 119
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 89 transition count 119
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 6 place count 87 transition count 116
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 87 transition count 116
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 10 place count 87 transition count 114
Applied a total of 10 rules in 13 ms. Remains 87 /91 variables (removed 4) and now considering 114/122 (removed 8) transitions.
Finished structural reductions, in 1 iterations. Remains : 87/91 places, 114/122 transitions.
Incomplete random walk after 10000 steps, including 2271 resets, run finished after 108 ms. (steps per millisecond=92 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 982 resets, run finished after 95 ms. (steps per millisecond=105 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 2000 resets, run finished after 93 ms. (steps per millisecond=107 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 968 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 3) seen :0
Finished probabilistic random walk after 16324 steps, run visited all 3 properties in 72 ms. (steps per millisecond=226 )
Probabilistic random walk after 16324 steps, saw 7819 distinct states, run finished after 72 ms. (steps per millisecond=226 ) properties seen :3
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p4) (NOT p0) (NOT p1) (NOT p3) (NOT p2)), (X (NOT (AND p3 p4 p0))), (X (NOT (AND p4 p0))), (X (NOT (AND p4 (NOT p0)))), (X (AND (NOT p4) (NOT p0))), (X (NOT (AND p3 (NOT p4) p0))), (X (NOT (AND p4 p0 (NOT p1)))), (X (NOT (OR (AND p2 p4 p0 (NOT p1)) (AND p3 p4 p0 (NOT p1))))), (X (NOT (AND p2 (NOT p3) (NOT p4) p0))), (X (NOT p1)), (X (NOT (OR (AND p2 p4) (AND p3 p4)))), (X (NOT (OR (AND p2 (NOT p4) (NOT p0)) (AND p3 (NOT p4) (NOT p0))))), (X (NOT (AND (NOT p4) p0))), (X (NOT (OR (AND p2 p4 (NOT p0)) (AND p3 p4 (NOT p0))))), (X (NOT (AND p2 (NOT p3) p4 p0))), (X (NOT p0)), (X (NOT p4)), (X (NOT (OR (AND p2 p4 p0) (AND p3 p0)))), (X (X (NOT p3))), (X (X (NOT (OR p2 p3)))), (X (X (NOT (AND p4 (NOT p0))))), (X (X (AND (NOT p4) (NOT p0)))), (X (X (NOT (AND p4 p0 (NOT p1))))), (X (X (NOT (AND p2 (NOT p3))))), (X (X (NOT (AND p2 (NOT p3) (NOT p1))))), true, (X (X (NOT p1))), (X (X (NOT (OR (AND p2 (NOT p4) (NOT p0)) (AND p3 (NOT p4) (NOT p0)))))), (X (X (NOT (OR (AND p2 (NOT p4)) (AND p3 (NOT p4)))))), (X (X (NOT (OR (AND p2 p4 (NOT p0)) (AND p3 p4 (NOT p0)))))), (X (X (NOT (AND p2 (NOT p3) p4 p0)))), (X (X (NOT (OR (AND p2 p4 p0) (AND p3 p0))))), (X (X (NOT (AND p3 (NOT p1))))), (X (X (NOT (AND p3 p4 p0)))), (X (X (NOT (OR (AND p2 (NOT p1)) (AND p3 (NOT p1)))))), (X (X (NOT (AND p4 p0)))), (X (X (NOT (AND p3 (NOT p4) p0)))), (X (X (NOT (OR (AND p2 p4 p0 (NOT p1)) (AND p3 p4 p0 (NOT p1)))))), (X (X (NOT (AND p2 (NOT p3) (NOT p4) p0)))), (X (X (NOT (OR (AND p2 p4) (AND p3 p4))))), (X (X (NOT (AND (NOT p4) p0)))), (X (X (NOT p0))), (X (X (NOT p4))), (G (NOT (OR (AND p2 p4) (AND p3 p4))))]
False Knowledge obtained : [(F (OR p2 p3)), (F p3), (F p4), (F (AND p2 (NOT p3)))]
Knowledge based reduction with 44 factoid took 2393 ms. Reduced automaton from 4 states, 8 edges and 3 AP to 4 states, 7 edges and 3 AP.
Stuttering acceptance computed with spot in 136 ms :[(AND p3 p4), (AND p3 p4), p3, p3]
Stuttering acceptance computed with spot in 152 ms :[(AND p3 p4), (AND p3 p4), p3, p3]
Support contains 6 out of 91 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 91/91 places, 122/122 transitions.
Applied a total of 0 rules in 2 ms. Remains 91 /91 variables (removed 0) and now considering 122/122 (removed 0) transitions.
// Phase 1: matrix 122 rows 91 cols
[2022-06-09 13:17:32] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 13:17:32] [INFO ] Implicit Places using invariants in 54 ms returned []
// Phase 1: matrix 122 rows 91 cols
[2022-06-09 13:17:33] [INFO ] Computed 2 place invariants in 6 ms
[2022-06-09 13:17:33] [INFO ] State equation strengthened by 45 read => feed constraints.
[2022-06-09 13:17:33] [INFO ] Implicit Places using invariants and state equation in 127 ms returned []
Implicit Place search using SMT with State Equation took 183 ms to find 0 implicit places.
// Phase 1: matrix 122 rows 91 cols
[2022-06-09 13:17:33] [INFO ] Computed 2 place invariants in 0 ms
[2022-06-09 13:17:33] [INFO ] Dead Transitions using invariants and state equation in 60 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 91/91 places, 122/122 transitions.
Computed a total of 5 stabilizing places and 5 stable transitions
Computed a total of 5 stabilizing places and 5 stable transitions
Knowledge obtained : [(AND (NOT p4) (NOT p2) (NOT p3)), (X (NOT p4)), true, (X (X (NOT (OR p2 p3)))), (X (X (NOT p4)))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 161 ms. Reduced automaton from 4 states, 7 edges and 3 AP to 4 states, 7 edges and 3 AP.
Stuttering acceptance computed with spot in 185 ms :[(AND p3 p4), (AND p3 p4), p3, p3]
Incomplete random walk after 10000 steps, including 2290 resets, run finished after 219 ms. (steps per millisecond=45 ) properties (out of 4) seen :1
Incomplete Best-First random walk after 10000 steps, including 952 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 2000 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 1012 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 122 rows 91 cols
[2022-06-09 13:17:33] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 13:17:33] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2022-06-09 13:17:33] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2022-06-09 13:17:34] [INFO ] After 30ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:2
[2022-06-09 13:17:34] [INFO ] State equation strengthened by 45 read => feed constraints.
[2022-06-09 13:17:34] [INFO ] After 8ms SMT Verify possible using 45 Read/Feed constraints in real domain returned unsat :0 sat :0 real:3
[2022-06-09 13:17:34] [INFO ] After 76ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2022-06-09 13:17:34] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2022-06-09 13:17:34] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-09 13:17:34] [INFO ] After 50ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2022-06-09 13:17:34] [INFO ] After 29ms SMT Verify possible using 45 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2022-06-09 13:17:34] [INFO ] After 65ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 25 ms.
[2022-06-09 13:17:34] [INFO ] After 179ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 14 ms.
Support contains 4 out of 91 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 91/91 places, 122/122 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 89 transition count 119
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 89 transition count 119
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 6 place count 87 transition count 116
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 87 transition count 116
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 10 place count 87 transition count 114
Applied a total of 10 rules in 6 ms. Remains 87 /91 variables (removed 4) and now considering 114/122 (removed 8) transitions.
Finished structural reductions, in 1 iterations. Remains : 87/91 places, 114/122 transitions.
Incomplete random walk after 10000 steps, including 2294 resets, run finished after 176 ms. (steps per millisecond=56 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 951 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 2000 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 1006 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 3) seen :0
Finished probabilistic random walk after 16324 steps, run visited all 3 properties in 124 ms. (steps per millisecond=131 )
Probabilistic random walk after 16324 steps, saw 7819 distinct states, run finished after 124 ms. (steps per millisecond=131 ) properties seen :3
Knowledge obtained : [(AND (NOT p4) (NOT p2) (NOT p3)), (X (NOT p4)), true, (X (X (NOT (OR p2 p3)))), (X (X (NOT p4)))]
False Knowledge obtained : [(F (OR p2 p3)), (F p4), (F p3), (F (AND p2 (NOT p3)))]
Knowledge based reduction with 5 factoid took 309 ms. Reduced automaton from 4 states, 7 edges and 3 AP to 4 states, 7 edges and 3 AP.
Stuttering acceptance computed with spot in 220 ms :[(AND p3 p4), (AND p3 p4), p3, p3]
Stuttering acceptance computed with spot in 204 ms :[(AND p3 p4), (AND p3 p4), p3, p3]
Stuttering acceptance computed with spot in 152 ms :[(AND p3 p4), (AND p3 p4), p3, p3]
Product exploration explored 100000 steps with 23053 reset in 120 ms.
Product exploration explored 100000 steps with 22941 reset in 132 ms.
Applying partial POR strategy [false, true, true, true]
Stuttering acceptance computed with spot in 138 ms :[(AND p3 p4), (AND p3 p4), p3, p3]
Support contains 6 out of 91 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 91/91 places, 122/122 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 89 transition count 119
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 89 transition count 119
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 6 place count 87 transition count 116
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 87 transition count 116
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 10 place count 87 transition count 114
Applied a total of 10 rules in 10 ms. Remains 87 /91 variables (removed 4) and now considering 114/122 (removed 8) transitions.
[2022-06-09 13:17:36] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 114 rows 87 cols
[2022-06-09 13:17:36] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 13:17:36] [INFO ] Dead Transitions using invariants and state equation in 87 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 87/91 places, 114/122 transitions.
Finished structural reductions, in 1 iterations. Remains : 87/91 places, 114/122 transitions.
Product exploration explored 100000 steps with 22955 reset in 318 ms.
Product exploration explored 100000 steps with 22974 reset in 229 ms.
Built C files in :
/tmp/ltsmin9864293567452641563
[2022-06-09 13:17:36] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9864293567452641563
Running compilation step : cd /tmp/ltsmin9864293567452641563;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 232 ms.
Running link step : cd /tmp/ltsmin9864293567452641563;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 25 ms.
Running LTSmin : cd /tmp/ltsmin9864293567452641563;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased10391481129004992544.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 6 out of 91 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 91/91 places, 122/122 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 89 transition count 119
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 89 transition count 119
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 6 place count 87 transition count 116
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 87 transition count 116
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 10 place count 87 transition count 114
Applied a total of 10 rules in 4 ms. Remains 87 /91 variables (removed 4) and now considering 114/122 (removed 8) transitions.
// Phase 1: matrix 114 rows 87 cols
[2022-06-09 13:17:52] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 13:17:52] [INFO ] Implicit Places using invariants in 62 ms returned []
// Phase 1: matrix 114 rows 87 cols
[2022-06-09 13:17:52] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 13:17:52] [INFO ] State equation strengthened by 41 read => feed constraints.
[2022-06-09 13:17:52] [INFO ] Implicit Places using invariants and state equation in 134 ms returned []
Implicit Place search using SMT with State Equation took 198 ms to find 0 implicit places.
// Phase 1: matrix 114 rows 87 cols
[2022-06-09 13:17:52] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 13:17:52] [INFO ] Dead Transitions using invariants and state equation in 61 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 87/91 places, 114/122 transitions.
Finished structural reductions, in 1 iterations. Remains : 87/91 places, 114/122 transitions.
Built C files in :
/tmp/ltsmin15828678900670299486
[2022-06-09 13:17:52] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15828678900670299486
Running compilation step : cd /tmp/ltsmin15828678900670299486;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 408 ms.
Running link step : cd /tmp/ltsmin15828678900670299486;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin15828678900670299486;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased14760691183880909743.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-06-09 13:18:07] [INFO ] Flatten gal took : 7 ms
[2022-06-09 13:18:07] [INFO ] Flatten gal took : 24 ms
[2022-06-09 13:18:07] [INFO ] Time to serialize gal into /tmp/LTL215715175114941753.gal : 6 ms
[2022-06-09 13:18:07] [INFO ] Time to serialize properties into /tmp/LTL14641166835269040775.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL215715175114941753.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14641166835269040775.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL2157151...266
Read 1 LTL properties
Checking formula 0 : !(((((F("((s1>=1)&&(l941>=1))"))&&("(s1>=1)"))&&("(l1023>=1)"))U(!((G(F(G(X(("((p18>=1)&&(l0>=1))")U("((s2>=1)&&(l1258>=1))"))))))U("(...180
Formula 0 simplified : !(("(l1023>=1)" & "(s1>=1)" & F"((s1>=1)&&(l941>=1))") U !(GFGX("((p18>=1)&&(l0>=1))" U "((s2>=1)&&(l1258>=1))") U "((s1>=1)&&(l954>...162
Detected timeout of ITS tools.
[2022-06-09 13:18:23] [INFO ] Flatten gal took : 7 ms
[2022-06-09 13:18:23] [INFO ] Applying decomposition
[2022-06-09 13:18:23] [INFO ] Flatten gal took : 7 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph1968294424258256387.txt' '-o' '/tmp/graph1968294424258256387.bin' '-w' '/tmp/graph1968294424258256387.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph1968294424258256387.bin' '-l' '-1' '-v' '-w' '/tmp/graph1968294424258256387.weights' '-q' '0' '-e' '0.001'
[2022-06-09 13:18:23] [INFO ] Decomposing Gal with order
[2022-06-09 13:18:23] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-09 13:18:23] [INFO ] Removed a total of 120 redundant transitions.
[2022-06-09 13:18:23] [INFO ] Flatten gal took : 24 ms
[2022-06-09 13:18:23] [INFO ] Fuse similar labels procedure discarded/fused a total of 89 labels/synchronizations in 10 ms.
[2022-06-09 13:18:23] [INFO ] Time to serialize gal into /tmp/LTL1435925382725733405.gal : 2 ms
[2022-06-09 13:18:23] [INFO ] Time to serialize properties into /tmp/LTL15324325442364165192.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1435925382725733405.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15324325442364165192.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1435925...246
Read 1 LTL properties
Checking formula 0 : !(((((F("((u1.s1>=1)&&(i5.u12.l941>=1))"))&&("(u1.s1>=1)"))&&("(i6.i0.u16.l1023>=1)"))U(!((G(F(G(X(("((u1.p18>=1)&&(u1.l0>=1))")U("((u...232
Formula 0 simplified : !(("(i6.i0.u16.l1023>=1)" & "(u1.s1>=1)" & F"((u1.s1>=1)&&(i5.u12.l941>=1))") U !(GFGX("((u1.p18>=1)&&(u1.l0>=1))" U "((u1.s2>=1)&&(...214
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin10725318810405589035
[2022-06-09 13:18:38] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10725318810405589035
Running compilation step : cd /tmp/ltsmin10725318810405589035;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 205 ms.
Running link step : cd /tmp/ltsmin10725318810405589035;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin10725318810405589035;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '((<>((LTLAPp1==true))&&(LTLAPp0==true)) U !([](<>([](X(((LTLAPp2==true) U (LTLAPp3==true)))))) U (LTLAPp4==true)))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property DBSingleClientW-PT-d1m10-LTLFireability-09 finished in 88257 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||p1)))'
Support contains 3 out of 137 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 137/137 places, 232/232 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 122 transition count 186
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 122 transition count 186
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 34 place count 122 transition count 182
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 44 place count 112 transition count 167
Iterating global reduction 1 with 10 rules applied. Total rules applied 54 place count 112 transition count 167
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 60 place count 112 transition count 161
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 69 place count 103 transition count 143
Iterating global reduction 2 with 9 rules applied. Total rules applied 78 place count 103 transition count 143
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 79 place count 103 transition count 142
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 84 place count 98 transition count 132
Iterating global reduction 3 with 5 rules applied. Total rules applied 89 place count 98 transition count 132
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 97 place count 98 transition count 124
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 99 place count 96 transition count 122
Iterating global reduction 4 with 2 rules applied. Total rules applied 101 place count 96 transition count 122
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 103 place count 94 transition count 120
Iterating global reduction 4 with 2 rules applied. Total rules applied 105 place count 94 transition count 120
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 106 place count 93 transition count 118
Iterating global reduction 4 with 1 rules applied. Total rules applied 107 place count 93 transition count 118
Applied a total of 107 rules in 12 ms. Remains 93 /137 variables (removed 44) and now considering 118/232 (removed 114) transitions.
// Phase 1: matrix 118 rows 93 cols
[2022-06-09 13:18:53] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 13:18:53] [INFO ] Implicit Places using invariants in 49 ms returned []
// Phase 1: matrix 118 rows 93 cols
[2022-06-09 13:18:53] [INFO ] Computed 2 place invariants in 2 ms
[2022-06-09 13:18:53] [INFO ] State equation strengthened by 38 read => feed constraints.
[2022-06-09 13:18:53] [INFO ] Implicit Places using invariants and state equation in 123 ms returned []
Implicit Place search using SMT with State Equation took 174 ms to find 0 implicit places.
[2022-06-09 13:18:53] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 118 rows 93 cols
[2022-06-09 13:18:53] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 13:18:53] [INFO ] Dead Transitions using invariants and state equation in 53 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 93/137 places, 118/232 transitions.
Finished structural reductions, in 1 iterations. Remains : 93/137 places, 118/232 transitions.
Stuttering acceptance computed with spot in 32 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : DBSingleClientW-PT-d1m10-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s1 1) (GEQ s87 1)), p1:(AND (GEQ s1 1) (GEQ s88 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 3 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d1m10-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d1m10-LTLFireability-10 finished in 303 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 137 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 137/137 places, 232/232 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 121 transition count 181
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 121 transition count 181
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 35 place count 121 transition count 178
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 46 place count 110 transition count 162
Iterating global reduction 1 with 11 rules applied. Total rules applied 57 place count 110 transition count 162
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 63 place count 110 transition count 156
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 73 place count 100 transition count 136
Iterating global reduction 2 with 10 rules applied. Total rules applied 83 place count 100 transition count 136
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 85 place count 100 transition count 134
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 91 place count 94 transition count 123
Iterating global reduction 3 with 6 rules applied. Total rules applied 97 place count 94 transition count 123
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 103 place count 94 transition count 117
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 106 place count 91 transition count 114
Iterating global reduction 4 with 3 rules applied. Total rules applied 109 place count 91 transition count 114
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 111 place count 89 transition count 112
Iterating global reduction 4 with 2 rules applied. Total rules applied 113 place count 89 transition count 112
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 114 place count 88 transition count 110
Iterating global reduction 4 with 1 rules applied. Total rules applied 115 place count 88 transition count 110
Applied a total of 115 rules in 15 ms. Remains 88 /137 variables (removed 49) and now considering 110/232 (removed 122) transitions.
// Phase 1: matrix 110 rows 88 cols
[2022-06-09 13:18:53] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 13:18:53] [INFO ] Implicit Places using invariants in 44 ms returned []
// Phase 1: matrix 110 rows 88 cols
[2022-06-09 13:18:53] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 13:18:53] [INFO ] State equation strengthened by 34 read => feed constraints.
[2022-06-09 13:18:53] [INFO ] Implicit Places using invariants and state equation in 115 ms returned []
Implicit Place search using SMT with State Equation took 161 ms to find 0 implicit places.
[2022-06-09 13:18:53] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 110 rows 88 cols
[2022-06-09 13:18:53] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 13:18:53] [INFO ] Dead Transitions using invariants and state equation in 59 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 88/137 places, 110/232 transitions.
Finished structural reductions, in 1 iterations. Remains : 88/137 places, 110/232 transitions.
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d1m10-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (LT s1 1) (LT s83 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 22974 reset in 109 ms.
Product exploration explored 100000 steps with 22991 reset in 112 ms.
Computed a total of 5 stabilizing places and 5 stable transitions
Computed a total of 5 stabilizing places and 5 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 102 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 44 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 2304 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 506 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Finished probabilistic random walk after 16863 steps, run visited all 1 properties in 23 ms. (steps per millisecond=733 )
Probabilistic random walk after 16863 steps, saw 8118 distinct states, run finished after 23 ms. (steps per millisecond=733 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 142 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Support contains 2 out of 88 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 88/88 places, 110/110 transitions.
Applied a total of 0 rules in 7 ms. Remains 88 /88 variables (removed 0) and now considering 110/110 (removed 0) transitions.
// Phase 1: matrix 110 rows 88 cols
[2022-06-09 13:18:54] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 13:18:54] [INFO ] Implicit Places using invariants in 47 ms returned []
// Phase 1: matrix 110 rows 88 cols
[2022-06-09 13:18:54] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 13:18:54] [INFO ] State equation strengthened by 34 read => feed constraints.
[2022-06-09 13:18:54] [INFO ] Implicit Places using invariants and state equation in 115 ms returned []
Implicit Place search using SMT with State Equation took 164 ms to find 0 implicit places.
[2022-06-09 13:18:54] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 110 rows 88 cols
[2022-06-09 13:18:54] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 13:18:54] [INFO ] Dead Transitions using invariants and state equation in 51 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 88/88 places, 110/110 transitions.
Computed a total of 5 stabilizing places and 5 stable transitions
Computed a total of 5 stabilizing places and 5 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 107 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 2276 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 466 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Finished probabilistic random walk after 16863 steps, run visited all 1 properties in 23 ms. (steps per millisecond=733 )
Probabilistic random walk after 16863 steps, saw 8118 distinct states, run finished after 23 ms. (steps per millisecond=733 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 119 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
Product exploration explored 100000 steps with 22942 reset in 123 ms.
Product exploration explored 100000 steps with 22871 reset in 125 ms.
Built C files in :
/tmp/ltsmin16345576087379382849
[2022-06-09 13:18:55] [INFO ] Computing symmetric may disable matrix : 110 transitions.
[2022-06-09 13:18:55] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-09 13:18:55] [INFO ] Computing symmetric may enable matrix : 110 transitions.
[2022-06-09 13:18:55] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-09 13:18:55] [INFO ] Computing Do-Not-Accords matrix : 110 transitions.
[2022-06-09 13:18:55] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-09 13:18:55] [INFO ] Built C files in 15ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16345576087379382849
Running compilation step : cd /tmp/ltsmin16345576087379382849;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 227 ms.
Running link step : cd /tmp/ltsmin16345576087379382849;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 25 ms.
Running LTSmin : cd /tmp/ltsmin16345576087379382849;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased7039954734822928144.hoa' '--buchi-type=spotba'
LTSmin run took 174 ms.
FORMULA DBSingleClientW-PT-d1m10-LTLFireability-12 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property DBSingleClientW-PT-d1m10-LTLFireability-12 finished in 2275 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U !(X(F(p1))||p2)))'
Support contains 5 out of 137 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 137/137 places, 232/232 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 123 transition count 183
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 123 transition count 183
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 30 place count 123 transition count 181
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 39 place count 114 transition count 168
Iterating global reduction 1 with 9 rules applied. Total rules applied 48 place count 114 transition count 168
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 52 place count 114 transition count 164
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 61 place count 105 transition count 149
Iterating global reduction 2 with 9 rules applied. Total rules applied 70 place count 105 transition count 149
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 72 place count 105 transition count 147
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 78 place count 99 transition count 139
Iterating global reduction 3 with 6 rules applied. Total rules applied 84 place count 99 transition count 139
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 88 place count 99 transition count 135
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 91 place count 96 transition count 132
Iterating global reduction 4 with 3 rules applied. Total rules applied 94 place count 96 transition count 132
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 96 place count 96 transition count 130
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 97 place count 95 transition count 129
Iterating global reduction 5 with 1 rules applied. Total rules applied 98 place count 95 transition count 129
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 99 place count 94 transition count 127
Iterating global reduction 5 with 1 rules applied. Total rules applied 100 place count 94 transition count 127
Applied a total of 100 rules in 5 ms. Remains 94 /137 variables (removed 43) and now considering 127/232 (removed 105) transitions.
// Phase 1: matrix 127 rows 94 cols
[2022-06-09 13:18:55] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 13:18:55] [INFO ] Implicit Places using invariants in 53 ms returned []
// Phase 1: matrix 127 rows 94 cols
[2022-06-09 13:18:55] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 13:18:55] [INFO ] State equation strengthened by 46 read => feed constraints.
[2022-06-09 13:18:56] [INFO ] Implicit Places using invariants and state equation in 124 ms returned []
Implicit Place search using SMT with State Equation took 178 ms to find 0 implicit places.
// Phase 1: matrix 127 rows 94 cols
[2022-06-09 13:18:56] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 13:18:56] [INFO ] Dead Transitions using invariants and state equation in 81 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 94/137 places, 127/232 transitions.
Finished structural reductions, in 1 iterations. Remains : 94/137 places, 127/232 transitions.
Stuttering acceptance computed with spot in 110 ms :[(OR p1 p2), true, p1, p1]
Running random walk in product with property : DBSingleClientW-PT-d1m10-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(AND p2 p0), acceptance={0} source=0 dest: 0}, { cond=(AND p2 (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p2) p0), acceptance={0} source=0 dest: 3}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 1}, { cond=(NOT p1), acceptance={} source=2 dest: 2}], [{ cond=(AND p2 p0 p1), acceptance={0} source=3 dest: 0}, { cond=(AND p2 (NOT p0) p1), acceptance={} source=3 dest: 1}, { cond=(OR (AND (NOT p2) (NOT p0)) (AND (NOT p0) (NOT p1))), acceptance={} source=3 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p2) p0 p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p2:(AND (GEQ s7 1) (GEQ s36 1)), p0:(AND (GEQ s1 1) (GEQ s75 1) (GEQ s89 1)), p1:(AND (GEQ s1 1) (GEQ s75 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2547 steps with 601 reset in 4 ms.
FORMULA DBSingleClientW-PT-d1m10-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d1m10-LTLFireability-13 finished in 391 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(X((F(p0)||p1)))&&(G(X(p2))||X(p1)))))'
Support contains 4 out of 137 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 137/137 places, 232/232 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 123 transition count 187
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 123 transition count 187
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 30 place count 123 transition count 185
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 39 place count 114 transition count 171
Iterating global reduction 1 with 9 rules applied. Total rules applied 48 place count 114 transition count 171
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 52 place count 114 transition count 167
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 59 place count 107 transition count 152
Iterating global reduction 2 with 7 rules applied. Total rules applied 66 place count 107 transition count 152
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 68 place count 107 transition count 150
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 72 place count 103 transition count 145
Iterating global reduction 3 with 4 rules applied. Total rules applied 76 place count 103 transition count 145
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 79 place count 103 transition count 142
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 81 place count 101 transition count 140
Iterating global reduction 4 with 2 rules applied. Total rules applied 83 place count 101 transition count 140
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 85 place count 101 transition count 138
Applied a total of 85 rules in 8 ms. Remains 101 /137 variables (removed 36) and now considering 138/232 (removed 94) transitions.
// Phase 1: matrix 138 rows 101 cols
[2022-06-09 13:18:56] [INFO ] Computed 2 place invariants in 2 ms
[2022-06-09 13:18:56] [INFO ] Implicit Places using invariants in 54 ms returned []
// Phase 1: matrix 138 rows 101 cols
[2022-06-09 13:18:56] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 13:18:56] [INFO ] State equation strengthened by 50 read => feed constraints.
[2022-06-09 13:18:56] [INFO ] Implicit Places using invariants and state equation in 160 ms returned []
Implicit Place search using SMT with State Equation took 225 ms to find 0 implicit places.
// Phase 1: matrix 138 rows 101 cols
[2022-06-09 13:18:56] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 13:18:56] [INFO ] Dead Transitions using invariants and state equation in 56 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 101/137 places, 138/232 transitions.
Finished structural reductions, in 1 iterations. Remains : 101/137 places, 138/232 transitions.
Stuttering acceptance computed with spot in 166 ms :[(NOT p2), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (NOT p2) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1))), true]
Running random walk in product with property : DBSingleClientW-PT-d1m10-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=p2, acceptance={} source=0 dest: 0}, { cond=(NOT p2), acceptance={} source=0 dest: 5}], [{ cond=(AND p0 (NOT p1) p2), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=1 dest: 5}], [{ cond=(OR (AND p0 p2) (AND p1 p2)), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={0} source=2 dest: 2}, { cond=(NOT p2), acceptance={0} source=2 dest: 5}], [{ cond=true, acceptance={} source=3 dest: 1}], [{ cond=true, acceptance={} source=4 dest: 3}], [{ cond=true, acceptance={0} source=5 dest: 5}]], initial=4, aps=[p2:(AND (GEQ s1 1) (GEQ s95 1)), p0:(OR (LT s1 1) (LT s62 1)), p1:(AND (GEQ s1 1) (GEQ s89 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 2 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d1m10-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d1m10-LTLFireability-14 finished in 474 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((!p0 U (G(!p0)||p1)))))'
Support contains 4 out of 137 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 137/137 places, 232/232 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 122 transition count 182
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 122 transition count 182
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 32 place count 122 transition count 180
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 42 place count 112 transition count 168
Iterating global reduction 1 with 10 rules applied. Total rules applied 52 place count 112 transition count 168
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 57 place count 112 transition count 163
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 66 place count 103 transition count 143
Iterating global reduction 2 with 9 rules applied. Total rules applied 75 place count 103 transition count 143
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 77 place count 103 transition count 141
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 82 place count 98 transition count 132
Iterating global reduction 3 with 5 rules applied. Total rules applied 87 place count 98 transition count 132
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 88 place count 98 transition count 131
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 92 place count 94 transition count 127
Iterating global reduction 4 with 4 rules applied. Total rules applied 96 place count 94 transition count 127
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 98 place count 94 transition count 125
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 100 place count 92 transition count 123
Iterating global reduction 5 with 2 rules applied. Total rules applied 102 place count 92 transition count 123
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 103 place count 91 transition count 121
Iterating global reduction 5 with 1 rules applied. Total rules applied 104 place count 91 transition count 121
Applied a total of 104 rules in 16 ms. Remains 91 /137 variables (removed 46) and now considering 121/232 (removed 111) transitions.
// Phase 1: matrix 121 rows 91 cols
[2022-06-09 13:18:56] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 13:18:56] [INFO ] Implicit Places using invariants in 54 ms returned []
// Phase 1: matrix 121 rows 91 cols
[2022-06-09 13:18:56] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 13:18:56] [INFO ] State equation strengthened by 40 read => feed constraints.
[2022-06-09 13:18:56] [INFO ] Implicit Places using invariants and state equation in 122 ms returned []
Implicit Place search using SMT with State Equation took 195 ms to find 0 implicit places.
[2022-06-09 13:18:56] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 121 rows 91 cols
[2022-06-09 13:18:56] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 13:18:56] [INFO ] Dead Transitions using invariants and state equation in 60 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 91/137 places, 121/232 transitions.
Finished structural reductions, in 1 iterations. Remains : 91/137 places, 121/232 transitions.
Stuttering acceptance computed with spot in 55 ms :[(AND (NOT p1) p0), (AND (NOT p1) p0)]
Running random walk in product with property : DBSingleClientW-PT-d1m10-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(AND (NOT (AND (GEQ s34 1) (GEQ s57 1))) (NOT (AND (GEQ s1 1) (GEQ s82 1)))), p0:(AND (GEQ s1 1) (GEQ s82 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 23009 reset in 141 ms.
Product exploration explored 100000 steps with 22819 reset in 127 ms.
Computed a total of 5 stabilizing places and 5 stable transitions
Computed a total of 5 stabilizing places and 5 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 166 ms. Reduced automaton from 2 states, 4 edges and 2 AP to 2 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 60 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
Incomplete random walk after 10000 steps, including 2306 resets, run finished after 104 ms. (steps per millisecond=96 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 490 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 470 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 2) seen :0
Finished probabilistic random walk after 23005 steps, run visited all 2 properties in 65 ms. (steps per millisecond=353 )
Probabilistic random walk after 23005 steps, saw 10638 distinct states, run finished after 66 ms. (steps per millisecond=348 ) properties seen :2
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : [(F (AND p0 (NOT p1))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 5 factoid took 214 ms. Reduced automaton from 2 states, 4 edges and 2 AP to 2 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 73 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 57 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
Support contains 4 out of 91 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 91/91 places, 121/121 transitions.
Applied a total of 0 rules in 2 ms. Remains 91 /91 variables (removed 0) and now considering 121/121 (removed 0) transitions.
// Phase 1: matrix 121 rows 91 cols
[2022-06-09 13:18:58] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 13:18:58] [INFO ] Implicit Places using invariants in 46 ms returned []
// Phase 1: matrix 121 rows 91 cols
[2022-06-09 13:18:58] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 13:18:58] [INFO ] State equation strengthened by 40 read => feed constraints.
[2022-06-09 13:18:58] [INFO ] Implicit Places using invariants and state equation in 123 ms returned []
Implicit Place search using SMT with State Equation took 171 ms to find 0 implicit places.
[2022-06-09 13:18:58] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 121 rows 91 cols
[2022-06-09 13:18:58] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 13:18:58] [INFO ] Dead Transitions using invariants and state equation in 57 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 91/91 places, 121/121 transitions.
Computed a total of 5 stabilizing places and 5 stable transitions
Computed a total of 5 stabilizing places and 5 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 149 ms. Reduced automaton from 2 states, 4 edges and 2 AP to 2 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 52 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
Incomplete random walk after 10000 steps, including 2278 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 456 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 466 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 2) seen :0
Finished probabilistic random walk after 23005 steps, run visited all 2 properties in 77 ms. (steps per millisecond=298 )
Probabilistic random walk after 23005 steps, saw 10638 distinct states, run finished after 77 ms. (steps per millisecond=298 ) properties seen :2
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : [(F (AND p0 (NOT p1))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 5 factoid took 197 ms. Reduced automaton from 2 states, 4 edges and 2 AP to 2 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 60 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 56 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 66 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
Product exploration explored 100000 steps with 23018 reset in 113 ms.
Product exploration explored 100000 steps with 22864 reset in 114 ms.
Built C files in :
/tmp/ltsmin14247736827364049938
[2022-06-09 13:18:59] [INFO ] Computing symmetric may disable matrix : 121 transitions.
[2022-06-09 13:18:59] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-09 13:18:59] [INFO ] Computing symmetric may enable matrix : 121 transitions.
[2022-06-09 13:18:59] [INFO ] Computation of Complete enable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-09 13:18:59] [INFO ] Computing Do-Not-Accords matrix : 121 transitions.
[2022-06-09 13:18:59] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-09 13:18:59] [INFO ] Built C files in 18ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14247736827364049938
Running compilation step : cd /tmp/ltsmin14247736827364049938;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 231 ms.
Running link step : cd /tmp/ltsmin14247736827364049938;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin14247736827364049938;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased1922283550962942622.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 91 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 91/91 places, 121/121 transitions.
Applied a total of 0 rules in 7 ms. Remains 91 /91 variables (removed 0) and now considering 121/121 (removed 0) transitions.
// Phase 1: matrix 121 rows 91 cols
[2022-06-09 13:19:14] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 13:19:14] [INFO ] Implicit Places using invariants in 66 ms returned []
// Phase 1: matrix 121 rows 91 cols
[2022-06-09 13:19:14] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 13:19:14] [INFO ] State equation strengthened by 40 read => feed constraints.
[2022-06-09 13:19:14] [INFO ] Implicit Places using invariants and state equation in 128 ms returned []
Implicit Place search using SMT with State Equation took 195 ms to find 0 implicit places.
[2022-06-09 13:19:14] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 121 rows 91 cols
[2022-06-09 13:19:14] [INFO ] Computed 2 place invariants in 2 ms
[2022-06-09 13:19:14] [INFO ] Dead Transitions using invariants and state equation in 62 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 91/91 places, 121/121 transitions.
Built C files in :
/tmp/ltsmin8455478850514760500
[2022-06-09 13:19:14] [INFO ] Computing symmetric may disable matrix : 121 transitions.
[2022-06-09 13:19:14] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-09 13:19:14] [INFO ] Computing symmetric may enable matrix : 121 transitions.
[2022-06-09 13:19:14] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-09 13:19:14] [INFO ] Computing Do-Not-Accords matrix : 121 transitions.
[2022-06-09 13:19:14] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-09 13:19:14] [INFO ] Built C files in 14ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8455478850514760500
Running compilation step : cd /tmp/ltsmin8455478850514760500;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 233 ms.
Running link step : cd /tmp/ltsmin8455478850514760500;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin8455478850514760500;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased6025282868081830873.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-06-09 13:19:30] [INFO ] Flatten gal took : 7 ms
[2022-06-09 13:19:30] [INFO ] Flatten gal took : 6 ms
[2022-06-09 13:19:30] [INFO ] Time to serialize gal into /tmp/LTL14991053966313515021.gal : 1 ms
[2022-06-09 13:19:30] [INFO ] Time to serialize properties into /tmp/LTL836120504064144397.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14991053966313515021.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL836120504064144397.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1499105...266
Read 1 LTL properties
Checking formula 0 : !((G(F((!("((s1>=1)&&(l1024>=1))"))U((G(!("((s1>=1)&&(l1024>=1))")))||("((!((p122>=1)&&(l506>=1)))&&(!((s1>=1)&&(l1024>=1))))"))))))
Formula 0 simplified : !GF(!"((s1>=1)&&(l1024>=1))" U ("((!((p122>=1)&&(l506>=1)))&&(!((s1>=1)&&(l1024>=1))))" | G!"((s1>=1)&&(l1024>=1))"))
Detected timeout of ITS tools.
[2022-06-09 13:19:45] [INFO ] Flatten gal took : 6 ms
[2022-06-09 13:19:45] [INFO ] Applying decomposition
[2022-06-09 13:19:45] [INFO ] Flatten gal took : 6 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph1148158126465803261.txt' '-o' '/tmp/graph1148158126465803261.bin' '-w' '/tmp/graph1148158126465803261.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph1148158126465803261.bin' '-l' '-1' '-v' '-w' '/tmp/graph1148158126465803261.weights' '-q' '0' '-e' '0.001'
[2022-06-09 13:19:45] [INFO ] Decomposing Gal with order
[2022-06-09 13:19:45] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-09 13:19:45] [INFO ] Removed a total of 108 redundant transitions.
[2022-06-09 13:19:45] [INFO ] Flatten gal took : 13 ms
[2022-06-09 13:19:45] [INFO ] Fuse similar labels procedure discarded/fused a total of 62 labels/synchronizations in 4 ms.
[2022-06-09 13:19:45] [INFO ] Time to serialize gal into /tmp/LTL11784322321749201829.gal : 2 ms
[2022-06-09 13:19:45] [INFO ] Time to serialize properties into /tmp/LTL6971904527374497531.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL11784322321749201829.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6971904527374497531.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1178432...246
Read 1 LTL properties
Checking formula 0 : !((G(F((!("((i5.u2.s1>=1)&&(i0.u12.l1024>=1))"))U((G(!("((i5.u2.s1>=1)&&(i0.u12.l1024>=1))")))||("((!((i5.u2.p122>=1)&&(i3.u8.l506>=1)...204
Formula 0 simplified : !GF(!"((i5.u2.s1>=1)&&(i0.u12.l1024>=1))" U ("((!((i5.u2.p122>=1)&&(i3.u8.l506>=1)))&&(!((i5.u2.s1>=1)&&(i0.u12.l1024>=1))))" | G!"(...191
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin11689512798291183490
[2022-06-09 13:20:00] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11689512798291183490
Running compilation step : cd /tmp/ltsmin11689512798291183490;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 220 ms.
Running link step : cd /tmp/ltsmin11689512798291183490;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin11689512798291183490;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](<>((!(LTLAPp0==true) U ([](!(LTLAPp0==true))||(LTLAPp1==true)))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property DBSingleClientW-PT-d1m10-LTLFireability-15 finished in 78534 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(((F(p1)&&p0) U !(G(F(G(X((p2 U p3))))) U p4)))'
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((!p0 U (G(!p0)||p1)))))'
[2022-06-09 13:20:15] [INFO ] Flatten gal took : 11 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin1647153341370301201
[2022-06-09 13:20:15] [INFO ] Computing symmetric may disable matrix : 232 transitions.
[2022-06-09 13:20:15] [INFO ] Applying decomposition
[2022-06-09 13:20:15] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-09 13:20:15] [INFO ] Computing symmetric may enable matrix : 232 transitions.
[2022-06-09 13:20:15] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-09 13:20:15] [INFO ] Flatten gal took : 14 ms
[2022-06-09 13:20:15] [INFO ] Computing Do-Not-Accords matrix : 232 transitions.
[2022-06-09 13:20:15] [INFO ] Computation of Completed DNA matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-09 13:20:15] [INFO ] Built C files in 32ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1647153341370301201
Running compilation step : cd /tmp/ltsmin1647153341370301201;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '240' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph3576671805567437744.txt' '-o' '/tmp/graph3576671805567437744.bin' '-w' '/tmp/graph3576671805567437744.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph3576671805567437744.bin' '-l' '-1' '-v' '-w' '/tmp/graph3576671805567437744.weights' '-q' '0' '-e' '0.001'
[2022-06-09 13:20:15] [INFO ] Decomposing Gal with order
[2022-06-09 13:20:15] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-09 13:20:15] [INFO ] Removed a total of 226 redundant transitions.
[2022-06-09 13:20:15] [INFO ] Flatten gal took : 27 ms
[2022-06-09 13:20:15] [INFO ] Fuse similar labels procedure discarded/fused a total of 199 labels/synchronizations in 12 ms.
[2022-06-09 13:20:15] [INFO ] Time to serialize gal into /tmp/LTLFireability3741808422114175558.gal : 2 ms
[2022-06-09 13:20:15] [INFO ] Time to serialize properties into /tmp/LTLFireability1295300075254404103.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability3741808422114175558.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability1295300075254404103.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireabi...267
Read 3 LTL properties
Checking formula 0 : !((G(F("((i0.u0.s1<1)||(u14.l36<1))"))))
Formula 0 simplified : !GF"((i0.u0.s1<1)||(u14.l36<1))"
Compilation finished in 449 ms.
Running link step : cd /tmp/ltsmin1647153341370301201;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin1647153341370301201;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[](<>((LTLAPp0==true)))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>1200 s) on command cd /tmp/ltsmin1647153341370301201;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[](<>((LTLAPp0==true)))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin1647153341370301201;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '((<>((LTLAPp2==true))&&(LTLAPp1==true)) U !([](<>([](X(((LTLAPp3==true) U (LTLAPp4==true)))))) U (LTLAPp5==true)))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2022-06-09 13:41:45] [INFO ] Flatten gal took : 26 ms
[2022-06-09 13:41:45] [INFO ] Time to serialize gal into /tmp/LTLFireability722594290508043103.gal : 2 ms
[2022-06-09 13:41:45] [INFO ] Time to serialize properties into /tmp/LTLFireability14936086625845114005.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability722594290508043103.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability14936086625845114005.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireabi...288
Read 3 LTL properties
Checking formula 0 : !((G(F("((s1<1)||(l36<1))"))))
Formula 0 simplified : !GF"((s1<1)||(l36<1))"
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.003: Loading model from ./gal.so
pins2lts-mc-linux64( 3/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.003: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.006: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.006: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.003: LTL layer: formula: ((<>((LTLAPp2==true))&&(LTLAPp1==true)) U !([](<>([](X(((LTLAPp3==true) U (LTLAPp4==true)))))) U (LTLAPp5==true)))
pins2lts-mc-linux64( 3/ 8), 0.004: "((<>((LTLAPp2==true))&&(LTLAPp1==true)) U !([](<>([](X(((LTLAPp3==true) U (LTLAPp4==true)))))) U (LTLAPp5==true)))" is not a file, parsing as formula...
pins2lts-mc-linux64( 1/ 8), 0.005: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.004: Using Spin LTL semantics
pins2lts-mc-linux64( 5/ 8), 0.006: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.006: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.005: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.005: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.006: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.006: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.007: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.011: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.012: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.011: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.014: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.015: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.048: There are 241 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.048: State length is 138, there are 300 groups
pins2lts-mc-linux64( 0/ 8), 0.048: Running cndfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.048: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.048: Successor permutation: dynamic
pins2lts-mc-linux64( 0/ 8), 0.048: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 2/ 8), 0.073: [Blue] ~43 levels ~960 states ~3072 transitions
pins2lts-mc-linux64( 1/ 8), 0.085: [Blue] ~66 levels ~1920 states ~4624 transitions
pins2lts-mc-linux64( 1/ 8), 0.105: [Blue] ~98 levels ~3840 states ~8704 transitions
pins2lts-mc-linux64( 1/ 8), 0.133: [Blue] ~136 levels ~7680 states ~16824 transitions
pins2lts-mc-linux64( 1/ 8), 0.198: [Blue] ~136 levels ~15360 states ~34736 transitions
pins2lts-mc-linux64( 5/ 8), 0.336: [Blue] ~236 levels ~30720 states ~69016 transitions
pins2lts-mc-linux64( 6/ 8), 0.593: [Blue] ~107 levels ~61440 states ~133920 transitions
pins2lts-mc-linux64( 6/ 8), 1.109: [Blue] ~107 levels ~122880 states ~278592 transitions
pins2lts-mc-linux64( 6/ 8), 1.969: [Blue] ~107 levels ~245760 states ~562112 transitions
pins2lts-mc-linux64( 2/ 8), 3.188: [Blue] ~45 levels ~491520 states ~1120144 transitions
pins2lts-mc-linux64( 6/ 8), 5.201: [Blue] ~107 levels ~983040 states ~2223416 transitions
pins2lts-mc-linux64( 6/ 8), 8.789: [Blue] ~107 levels ~1966080 states ~4578776 transitions
pins2lts-mc-linux64( 2/ 8), 15.574: [Blue] ~4797 levels ~3932160 states ~9389816 transitions
pins2lts-mc-linux64( 6/ 8), 29.368: [Blue] ~107 levels ~7864320 states ~18429392 transitions
pins2lts-mc-linux64( 3/ 8), 57.421: [Blue] ~2844 levels ~15728640 states ~36450648 transitions
pins2lts-mc-linux64( 3/ 8), 115.595: [Blue] ~18513 levels ~31457280 states ~83533664 transitions
pins2lts-mc-linux64( 3/ 8), 233.807: [Blue] ~21093 levels ~62914560 states ~175425368 transitions
pins2lts-mc-linux64( 3/ 8), 469.808: [Blue] ~47925 levels ~125829120 states ~361030912 transitions
pins2lts-mc-linux64( 4/ 8), 521.095: Error: tree roots table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 521.115:
pins2lts-mc-linux64( 0/ 8), 521.115: Explored 132557305 states 412754870 transitions, fanout: 3.114
pins2lts-mc-linux64( 0/ 8), 521.115: Total exploration time 521.050 sec (521.020 sec minimum, 521.034 sec on average)
pins2lts-mc-linux64( 0/ 8), 521.115: States per second: 254404, Transitions per second: 792160
pins2lts-mc-linux64( 0/ 8), 521.115:
pins2lts-mc-linux64( 0/ 8), 521.115: State space has 134208867 states, 235181 are accepting
pins2lts-mc-linux64( 0/ 8), 521.115: cndfs_1 (permutation: dynamic) stats:
pins2lts-mc-linux64( 0/ 8), 521.115: blue states: 132557305 (98.77%), transitions: 0 (per worker)
pins2lts-mc-linux64( 0/ 8), 521.115: red states: 0 (0.00%), bogus: 0 (0.00%), transitions: 0, waits: 0 (0.00 sec)
pins2lts-mc-linux64( 0/ 8), 521.115: all-red states: 235181 (0.18%), bogus 13 (0.00%)
pins2lts-mc-linux64( 0/ 8), 521.115:
pins2lts-mc-linux64( 0/ 8), 521.115: Total memory used for local state coloring: 61.2MB
pins2lts-mc-linux64( 0/ 8), 521.115:
pins2lts-mc-linux64( 0/ 8), 521.115: Queue width: 8B, total height: 4011566, memory: 30.61MB
pins2lts-mc-linux64( 0/ 8), 521.115: Tree memory: 1122.2MB, 8.8 B/state, compr.: 1.6%
pins2lts-mc-linux64( 0/ 8), 521.115: Tree fill ratio (roots/leafs): 99.0%/38.0%
pins2lts-mc-linux64( 0/ 8), 521.115: Stored 239 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 521.115: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 521.115: Est. total memory use: 1152.9MB (~1054.6MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin1647153341370301201;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '((<>((LTLAPp2==true))&&(LTLAPp1==true)) U !([](<>([](X(((LTLAPp3==true) U (LTLAPp4==true)))))) U (LTLAPp5==true)))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin1647153341370301201;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '((<>((LTLAPp2==true))&&(LTLAPp1==true)) U !([](<>([](X(((LTLAPp3==true) U (LTLAPp4==true)))))) U (LTLAPp5==true)))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:242)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:177)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:115)
at java.base/java.lang.Thread.run(Thread.java:829)
Detected timeout of ITS tools.
[2022-06-09 14:03:18] [INFO ] Flatten gal took : 1302 ms
[2022-06-09 14:03:23] [INFO ] Input system was already deterministic with 232 transitions.
[2022-06-09 14:03:24] [INFO ] Transformed 137 places.
[2022-06-09 14:03:24] [INFO ] Transformed 232 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/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//..//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
[2022-06-09 14:03:24] [INFO ] Time to serialize gal into /tmp/LTLFireability13812937824817521708.gal : 60 ms
[2022-06-09 14:03:24] [INFO ] Time to serialize properties into /tmp/LTLFireability2219207038847469132.ltl : 164 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability13812937824817521708.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability2219207038847469132.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireabi...334
Read 3 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((G(F("((s1<1)||(l36<1))"))))
Formula 0 simplified : !GF"((s1<1)||(l36<1))"

BK_TIME_CONFINEMENT_REACHED

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

+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination LTLFireability -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m

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-d1m10"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is DBSingleClientW-PT-d1m10, 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 r312-tall-165472282000236"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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