Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 544K
-rw-r--r-- 1 mcc users 6.7K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 73K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.8K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 44K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K May 19 07:08 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 19 15:41 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K May 19 07:15 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 19 18:08 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 12 08:24 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 144K Apr 12 08:24 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.1K Apr 12 08:23 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 60K Apr 12 08:23 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Apr 22 14:36 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K Apr 22 14:36 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 91K May 18 16:42 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1716336576923

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=gold2023
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DES-PT-20b
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202304061127
[2024-05-22 00:09:38] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-22 00:09:38] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 00:09:38] [INFO ] Load time of PNML (sax parser for PT used): 67 ms
[2024-05-22 00:09:38] [INFO ] Transformed 360 places.
[2024-05-22 00:09:38] [INFO ] Transformed 311 transitions.
[2024-05-22 00:09:38] [INFO ] Found NUPN structural information;
[2024-05-22 00:09:38] [INFO ] Parsed PT model containing 360 places and 311 transitions and 987 arcs in 135 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 7 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA DES-PT-20b-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-20b-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-20b-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-20b-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 40 out of 360 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 360/360 places, 311/311 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 358 transition count 311
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 21 place count 339 transition count 292
Iterating global reduction 1 with 19 rules applied. Total rules applied 40 place count 339 transition count 292
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 51 place count 328 transition count 281
Iterating global reduction 1 with 11 rules applied. Total rules applied 62 place count 328 transition count 281
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 70 place count 328 transition count 273
Applied a total of 70 rules in 74 ms. Remains 328 /360 variables (removed 32) and now considering 273/311 (removed 38) transitions.
// Phase 1: matrix 273 rows 328 cols
[2024-05-22 00:09:38] [INFO ] Computed 63 invariants in 22 ms
[2024-05-22 00:09:39] [INFO ] Implicit Places using invariants in 492 ms returned [27]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 515 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 327/360 places, 273/311 transitions.
Applied a total of 0 rules in 8 ms. Remains 327 /327 variables (removed 0) and now considering 273/273 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 597 ms. Remains : 327/360 places, 273/311 transitions.
Support contains 40 out of 327 places after structural reductions.
[2024-05-22 00:09:39] [INFO ] Flatten gal took : 52 ms
[2024-05-22 00:09:39] [INFO ] Flatten gal took : 20 ms
[2024-05-22 00:09:39] [INFO ] Input system was already deterministic with 273 transitions.
Incomplete random walk after 10000 steps, including 90 resets, run finished after 265 ms. (steps per millisecond=37 ) properties (out of 23) seen :20
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 11 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 273 rows 327 cols
[2024-05-22 00:09:39] [INFO ] Computed 62 invariants in 14 ms
[2024-05-22 00:09:40] [INFO ] After 92ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-22 00:09:40] [INFO ] [Nat]Absence check using 36 positive place invariants in 8 ms returned sat
[2024-05-22 00:09:40] [INFO ] [Nat]Absence check using 36 positive and 26 generalized place invariants in 13 ms returned sat
[2024-05-22 00:09:40] [INFO ] After 169ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-22 00:09:40] [INFO ] Deduced a trap composed of 38 places in 266 ms of which 195 ms to minimize.
[2024-05-22 00:09:40] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 314 ms
[2024-05-22 00:09:40] [INFO ] After 585ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 92 ms.
[2024-05-22 00:09:40] [INFO ] After 807ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 82 ms.
Support contains 8 out of 327 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 327/327 places, 273/273 transitions.
Graph (complete) has 681 edges and 327 vertex of which 321 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.1 ms
Discarding 6 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 0 with 17 rules applied. Total rules applied 18 place count 321 transition count 253
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 1 with 15 rules applied. Total rules applied 33 place count 306 transition count 253
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 33 place count 306 transition count 243
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 53 place count 296 transition count 243
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 59 place count 290 transition count 237
Iterating global reduction 2 with 6 rules applied. Total rules applied 65 place count 290 transition count 237
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 71 place count 284 transition count 231
Iterating global reduction 2 with 6 rules applied. Total rules applied 77 place count 284 transition count 231
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 6 rules applied. Total rules applied 83 place count 284 transition count 225
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 85 place count 283 transition count 224
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 85 place count 283 transition count 221
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 91 place count 280 transition count 221
Performed 73 Post agglomeration using F-continuation condition.Transition count delta: 73
Deduced a syphon composed of 73 places in 0 ms
Reduce places removed 73 places and 0 transitions.
Iterating global reduction 4 with 146 rules applied. Total rules applied 237 place count 207 transition count 148
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 241 place count 205 transition count 150
Free-agglomeration rule applied 2 times.
Iterating global reduction 4 with 2 rules applied. Total rules applied 243 place count 205 transition count 148
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 245 place count 203 transition count 148
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 5 with 2 rules applied. Total rules applied 247 place count 203 transition count 146
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 249 place count 201 transition count 146
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 6 with 2 rules applied. Total rules applied 251 place count 201 transition count 146
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 252 place count 200 transition count 145
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 253 place count 199 transition count 145
Applied a total of 253 rules in 92 ms. Remains 199 /327 variables (removed 128) and now considering 145/273 (removed 128) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 92 ms. Remains : 199/327 places, 145/273 transitions.
Incomplete random walk after 10000 steps, including 358 resets, run finished after 152 ms. (steps per millisecond=65 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 79 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 66 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 71 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 1126240 steps, run timeout after 3001 ms. (steps per millisecond=375 ) properties seen :{}
Probabilistic random walk after 1126240 steps, saw 155509 distinct states, run finished after 3002 ms. (steps per millisecond=375 ) properties seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 145 rows 199 cols
[2024-05-22 00:09:44] [INFO ] Computed 60 invariants in 5 ms
[2024-05-22 00:09:44] [INFO ] After 53ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-22 00:09:44] [INFO ] [Nat]Absence check using 36 positive place invariants in 8 ms returned sat
[2024-05-22 00:09:44] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 77 ms returned sat
[2024-05-22 00:09:44] [INFO ] After 116ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-22 00:09:44] [INFO ] Deduced a trap composed of 8 places in 38 ms of which 1 ms to minimize.
[2024-05-22 00:09:44] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 64 ms
[2024-05-22 00:09:44] [INFO ] After 242ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 37 ms.
[2024-05-22 00:09:44] [INFO ] After 446ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 48 ms.
Support contains 8 out of 199 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 199/199 places, 145/145 transitions.
Applied a total of 0 rules in 7 ms. Remains 199 /199 variables (removed 0) and now considering 145/145 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 199/199 places, 145/145 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 199/199 places, 145/145 transitions.
Applied a total of 0 rules in 6 ms. Remains 199 /199 variables (removed 0) and now considering 145/145 (removed 0) transitions.
[2024-05-22 00:09:44] [INFO ] Invariant cache hit.
[2024-05-22 00:09:44] [INFO ] Implicit Places using invariants in 154 ms returned []
[2024-05-22 00:09:45] [INFO ] Invariant cache hit.
[2024-05-22 00:09:45] [INFO ] Implicit Places using invariants and state equation in 197 ms returned []
Implicit Place search using SMT with State Equation took 363 ms to find 0 implicit places.
[2024-05-22 00:09:45] [INFO ] Redundant transitions in 3 ms returned []
[2024-05-22 00:09:45] [INFO ] Invariant cache hit.
[2024-05-22 00:09:45] [INFO ] Dead Transitions using invariants and state equation in 92 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 471 ms. Remains : 199/199 places, 145/145 transitions.
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 199 transition count 145
Applied a total of 1 rules in 17 ms. Remains 199 /199 variables (removed 0) and now considering 145/145 (removed 0) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 145 rows 199 cols
[2024-05-22 00:09:45] [INFO ] Computed 60 invariants in 5 ms
[2024-05-22 00:09:45] [INFO ] After 47ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-22 00:09:45] [INFO ] [Nat]Absence check using 36 positive place invariants in 5 ms returned sat
[2024-05-22 00:09:45] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 75 ms returned sat
[2024-05-22 00:09:45] [INFO ] After 106ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-22 00:09:45] [INFO ] Deduced a trap composed of 8 places in 39 ms of which 1 ms to minimize.
[2024-05-22 00:09:45] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 59 ms
[2024-05-22 00:09:45] [INFO ] Deduced a trap composed of 6 places in 58 ms of which 0 ms to minimize.
[2024-05-22 00:09:45] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 71 ms
[2024-05-22 00:09:45] [INFO ] After 292ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 40 ms.
[2024-05-22 00:09:45] [INFO ] After 499ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
FORMULA DES-PT-20b-LTLCardinality-05 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA DES-PT-20b-LTLCardinality-06 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 139 stabilizing places and 131 stable transitions
Graph (complete) has 681 edges and 327 vertex of which 321 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.7 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 6 out of 327 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 327/327 places, 273/273 transitions.
Graph (complete) has 681 edges and 327 vertex of which 321 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.1 ms
Discarding 6 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 0 with 12 rules applied. Total rules applied 13 place count 320 transition count 257
Reduce places removed 12 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 13 rules applied. Total rules applied 26 place count 308 transition count 256
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 27 place count 307 transition count 256
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 9 Pre rules applied. Total rules applied 27 place count 307 transition count 247
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 45 place count 298 transition count 247
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 50 place count 293 transition count 242
Iterating global reduction 3 with 5 rules applied. Total rules applied 55 place count 293 transition count 242
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 60 place count 288 transition count 237
Iterating global reduction 3 with 5 rules applied. Total rules applied 65 place count 288 transition count 237
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 5 rules applied. Total rules applied 70 place count 288 transition count 232
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 72 place count 287 transition count 231
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 72 place count 287 transition count 229
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 76 place count 285 transition count 229
Performed 75 Post agglomeration using F-continuation condition.Transition count delta: 75
Deduced a syphon composed of 75 places in 0 ms
Reduce places removed 75 places and 0 transitions.
Iterating global reduction 5 with 150 rules applied. Total rules applied 226 place count 210 transition count 154
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 230 place count 208 transition count 156
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 232 place count 206 transition count 154
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 233 place count 205 transition count 154
Applied a total of 233 rules in 55 ms. Remains 205 /327 variables (removed 122) and now considering 154/273 (removed 119) transitions.
// Phase 1: matrix 154 rows 205 cols
[2024-05-22 00:09:46] [INFO ] Computed 58 invariants in 3 ms
[2024-05-22 00:09:46] [INFO ] Implicit Places using invariants in 120 ms returned []
[2024-05-22 00:09:46] [INFO ] Invariant cache hit.
[2024-05-22 00:09:46] [INFO ] Implicit Places using invariants and state equation in 188 ms returned []
Implicit Place search using SMT with State Equation took 312 ms to find 0 implicit places.
[2024-05-22 00:09:46] [INFO ] Redundant transitions in 4 ms returned []
[2024-05-22 00:09:46] [INFO ] Invariant cache hit.
[2024-05-22 00:09:46] [INFO ] Dead Transitions using invariants and state equation in 99 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 205/327 places, 154/273 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 476 ms. Remains : 205/327 places, 154/273 transitions.
ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2Stuttering acceptance computed with spot in 271 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : DES-PT-20b-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (EQ s73 0) (EQ s39 1) (EQ s101 0) (EQ s94 1)), p1:(OR (EQ s185 0) (EQ s110 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 4522 reset in 342 ms.
Product exploration explored 100000 steps with 4569 reset in 287 ms.
Computed a total of 97 stabilizing places and 92 stable transitions
Computed a total of 97 stabilizing places and 92 stable transitions
Knowledge obtained : [(AND p0 p1), (X p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 98 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 119 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Incomplete random walk after 10000 steps, including 453 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 87 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-22 00:09:47] [INFO ] Invariant cache hit.
[2024-05-22 00:09:47] [INFO ] After 42ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-22 00:09:47] [INFO ] [Nat]Absence check using 33 positive place invariants in 4 ms returned sat
[2024-05-22 00:09:47] [INFO ] [Nat]Absence check using 33 positive and 25 generalized place invariants in 45 ms returned sat
[2024-05-22 00:09:48] [INFO ] After 70ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-22 00:09:48] [INFO ] After 91ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 19 ms.
[2024-05-22 00:09:48] [INFO ] After 213ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 4 out of 205 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 205/205 places, 154/154 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 205 transition count 153
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 5 place count 203 transition count 151
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 202 transition count 150
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 202 transition count 150
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 8 place count 202 transition count 149
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 8 place count 202 transition count 148
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 10 place count 201 transition count 148
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 12 place count 201 transition count 146
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 14 place count 199 transition count 146
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 15 place count 199 transition count 146
Applied a total of 15 rules in 27 ms. Remains 199 /205 variables (removed 6) and now considering 146/154 (removed 8) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 27 ms. Remains : 199/205 places, 146/154 transitions.
Incomplete random walk after 10000 steps, including 471 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 109 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1842226 steps, run timeout after 3001 ms. (steps per millisecond=613 ) properties seen :{}
Probabilistic random walk after 1842226 steps, saw 258580 distinct states, run finished after 3001 ms. (steps per millisecond=613 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 146 rows 199 cols
[2024-05-22 00:09:51] [INFO ] Computed 59 invariants in 6 ms
[2024-05-22 00:09:51] [INFO ] After 45ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-22 00:09:51] [INFO ] [Nat]Absence check using 35 positive place invariants in 8 ms returned sat
[2024-05-22 00:09:51] [INFO ] [Nat]Absence check using 35 positive and 24 generalized place invariants in 48 ms returned sat
[2024-05-22 00:09:51] [INFO ] After 75ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-22 00:09:51] [INFO ] After 100ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 15 ms.
[2024-05-22 00:09:51] [INFO ] After 236ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 3 ms.
Support contains 4 out of 199 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 199/199 places, 146/146 transitions.
Applied a total of 0 rules in 7 ms. Remains 199 /199 variables (removed 0) and now considering 146/146 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 199/199 places, 146/146 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 199/199 places, 146/146 transitions.
Applied a total of 0 rules in 4 ms. Remains 199 /199 variables (removed 0) and now considering 146/146 (removed 0) transitions.
[2024-05-22 00:09:51] [INFO ] Invariant cache hit.
[2024-05-22 00:09:51] [INFO ] Implicit Places using invariants in 114 ms returned []
[2024-05-22 00:09:51] [INFO ] Invariant cache hit.
[2024-05-22 00:09:51] [INFO ] Implicit Places using invariants and state equation in 186 ms returned []
Implicit Place search using SMT with State Equation took 302 ms to find 0 implicit places.
[2024-05-22 00:09:51] [INFO ] Redundant transitions in 4 ms returned []
[2024-05-22 00:09:51] [INFO ] Invariant cache hit.
[2024-05-22 00:09:51] [INFO ] Dead Transitions using invariants and state equation in 92 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 416 ms. Remains : 199/199 places, 146/146 transitions.
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 199 transition count 146
Applied a total of 1 rules in 8 ms. Remains 199 /199 variables (removed 0) and now considering 146/146 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 146 rows 199 cols
[2024-05-22 00:09:51] [INFO ] Computed 59 invariants in 2 ms
[2024-05-22 00:09:51] [INFO ] After 40ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-22 00:09:51] [INFO ] [Nat]Absence check using 35 positive place invariants in 4 ms returned sat
[2024-05-22 00:09:52] [INFO ] [Nat]Absence check using 35 positive and 24 generalized place invariants in 46 ms returned sat
[2024-05-22 00:09:52] [INFO ] After 77ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-22 00:09:52] [INFO ] After 99ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 26 ms.
[2024-05-22 00:09:52] [INFO ] After 233ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND p0 p1), (X p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 5 factoid took 112 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 116 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 95 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Support contains 6 out of 205 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 205/205 places, 154/154 transitions.
Applied a total of 0 rules in 10 ms. Remains 205 /205 variables (removed 0) and now considering 154/154 (removed 0) transitions.
// Phase 1: matrix 154 rows 205 cols
[2024-05-22 00:09:52] [INFO ] Computed 58 invariants in 4 ms
[2024-05-22 00:09:52] [INFO ] Implicit Places using invariants in 129 ms returned []
[2024-05-22 00:09:52] [INFO ] Invariant cache hit.
[2024-05-22 00:09:52] [INFO ] Implicit Places using invariants and state equation in 177 ms returned []
Implicit Place search using SMT with State Equation took 309 ms to find 0 implicit places.
[2024-05-22 00:09:52] [INFO ] Redundant transitions in 4 ms returned []
[2024-05-22 00:09:52] [INFO ] Invariant cache hit.
[2024-05-22 00:09:52] [INFO ] Dead Transitions using invariants and state equation in 99 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 430 ms. Remains : 205/205 places, 154/154 transitions.
Computed a total of 97 stabilizing places and 92 stable transitions
Computed a total of 97 stabilizing places and 92 stable transitions
Knowledge obtained : [(AND p0 p1), (X p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 78 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 101 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Incomplete random walk after 10000 steps, including 443 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 84 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-22 00:09:53] [INFO ] Invariant cache hit.
[2024-05-22 00:09:53] [INFO ] After 49ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-22 00:09:53] [INFO ] [Nat]Absence check using 33 positive place invariants in 3 ms returned sat
[2024-05-22 00:09:53] [INFO ] [Nat]Absence check using 33 positive and 25 generalized place invariants in 42 ms returned sat
[2024-05-22 00:09:53] [INFO ] After 61ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-22 00:09:53] [INFO ] After 85ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 24 ms.
[2024-05-22 00:09:53] [INFO ] After 203ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 5 ms.
Support contains 4 out of 205 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 205/205 places, 154/154 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 205 transition count 153
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 5 place count 203 transition count 151
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 202 transition count 150
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 202 transition count 150
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 8 place count 202 transition count 149
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 8 place count 202 transition count 148
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 10 place count 201 transition count 148
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 12 place count 201 transition count 146
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 14 place count 199 transition count 146
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 15 place count 199 transition count 146
Applied a total of 15 rules in 35 ms. Remains 199 /205 variables (removed 6) and now considering 146/154 (removed 8) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35 ms. Remains : 199/205 places, 146/154 transitions.
Incomplete random walk after 10000 steps, including 483 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 99 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1766835 steps, run timeout after 3001 ms. (steps per millisecond=588 ) properties seen :{}
Probabilistic random walk after 1766835 steps, saw 248149 distinct states, run finished after 3001 ms. (steps per millisecond=588 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 146 rows 199 cols
[2024-05-22 00:09:56] [INFO ] Computed 59 invariants in 4 ms
[2024-05-22 00:09:56] [INFO ] After 48ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-22 00:09:56] [INFO ] [Nat]Absence check using 35 positive place invariants in 4 ms returned sat
[2024-05-22 00:09:56] [INFO ] [Nat]Absence check using 35 positive and 24 generalized place invariants in 48 ms returned sat
[2024-05-22 00:09:56] [INFO ] After 82ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-22 00:09:56] [INFO ] After 108ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 14 ms.
[2024-05-22 00:09:56] [INFO ] After 232ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 4 out of 199 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 199/199 places, 146/146 transitions.
Applied a total of 0 rules in 4 ms. Remains 199 /199 variables (removed 0) and now considering 146/146 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 199/199 places, 146/146 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 199/199 places, 146/146 transitions.
Applied a total of 0 rules in 4 ms. Remains 199 /199 variables (removed 0) and now considering 146/146 (removed 0) transitions.
[2024-05-22 00:09:56] [INFO ] Invariant cache hit.
[2024-05-22 00:09:56] [INFO ] Implicit Places using invariants in 114 ms returned []
[2024-05-22 00:09:56] [INFO ] Invariant cache hit.
[2024-05-22 00:09:57] [INFO ] Implicit Places using invariants and state equation in 189 ms returned []
Implicit Place search using SMT with State Equation took 305 ms to find 0 implicit places.
[2024-05-22 00:09:57] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-22 00:09:57] [INFO ] Invariant cache hit.
[2024-05-22 00:09:57] [INFO ] Dead Transitions using invariants and state equation in 94 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 419 ms. Remains : 199/199 places, 146/146 transitions.
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 199 transition count 146
Applied a total of 1 rules in 21 ms. Remains 199 /199 variables (removed 0) and now considering 146/146 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 146 rows 199 cols
[2024-05-22 00:09:57] [INFO ] Computed 59 invariants in 3 ms
[2024-05-22 00:09:57] [INFO ] After 42ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-22 00:09:57] [INFO ] [Nat]Absence check using 35 positive place invariants in 4 ms returned sat
[2024-05-22 00:09:57] [INFO ] [Nat]Absence check using 35 positive and 24 generalized place invariants in 45 ms returned sat
[2024-05-22 00:09:57] [INFO ] After 69ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-22 00:09:57] [INFO ] After 96ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 24 ms.
[2024-05-22 00:09:57] [INFO ] After 223ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND p0 p1), (X p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 5 factoid took 104 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 122 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 127 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 101 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Product exploration explored 100000 steps with 4545 reset in 214 ms.
Product exploration explored 100000 steps with 4547 reset in 231 ms.
Built C files in :
/tmp/ltsmin12102748805405634620
[2024-05-22 00:09:58] [INFO ] Computing symmetric may disable matrix : 154 transitions.
[2024-05-22 00:09:58] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 00:09:58] [INFO ] Computing symmetric may enable matrix : 154 transitions.
[2024-05-22 00:09:58] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 00:09:58] [INFO ] Computing Do-Not-Accords matrix : 154 transitions.
[2024-05-22 00:09:58] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 00:09:58] [INFO ] Built C files in 36ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12102748805405634620
Running compilation step : cd /tmp/ltsmin12102748805405634620;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 424 ms.
Running link step : cd /tmp/ltsmin12102748805405634620;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin12102748805405634620;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased2248605610837715315.hoa' '--buchi-type=spotba'
LTSmin run took 953 ms.
FORMULA DES-PT-20b-LTLCardinality-00 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property DES-PT-20b-LTLCardinality-00 finished in 13807 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 327 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 327/327 places, 273/273 transitions.
Graph (complete) has 681 edges and 327 vertex of which 321 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.1 ms
Discarding 6 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 0 with 14 rules applied. Total rules applied 15 place count 320 transition count 255
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 1 with 14 rules applied. Total rules applied 29 place count 306 transition count 255
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 29 place count 306 transition count 245
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 49 place count 296 transition count 245
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 55 place count 290 transition count 239
Iterating global reduction 2 with 6 rules applied. Total rules applied 61 place count 290 transition count 239
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 67 place count 284 transition count 233
Iterating global reduction 2 with 6 rules applied. Total rules applied 73 place count 284 transition count 233
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 6 rules applied. Total rules applied 79 place count 284 transition count 227
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 81 place count 283 transition count 226
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 81 place count 283 transition count 223
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 87 place count 280 transition count 223
Performed 75 Post agglomeration using F-continuation condition.Transition count delta: 75
Deduced a syphon composed of 75 places in 0 ms
Reduce places removed 75 places and 0 transitions.
Iterating global reduction 4 with 150 rules applied. Total rules applied 237 place count 205 transition count 148
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 241 place count 203 transition count 150
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 243 place count 201 transition count 148
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 244 place count 200 transition count 148
Applied a total of 244 rules in 44 ms. Remains 200 /327 variables (removed 127) and now considering 148/273 (removed 125) transitions.
// Phase 1: matrix 148 rows 200 cols
[2024-05-22 00:10:00] [INFO ] Computed 58 invariants in 2 ms
[2024-05-22 00:10:00] [INFO ] Implicit Places using invariants in 117 ms returned []
[2024-05-22 00:10:00] [INFO ] Invariant cache hit.
[2024-05-22 00:10:00] [INFO ] Implicit Places using invariants and state equation in 210 ms returned []
Implicit Place search using SMT with State Equation took 345 ms to find 0 implicit places.
[2024-05-22 00:10:00] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-22 00:10:00] [INFO ] Invariant cache hit.
[2024-05-22 00:10:00] [INFO ] Dead Transitions using invariants and state equation in 80 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 200/327 places, 148/273 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 478 ms. Remains : 200/327 places, 148/273 transitions.
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Running random walk in product with property : DES-PT-20b-LTLCardinality-01 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 (EQ s153 0) (EQ s143 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 5444 reset in 205 ms.
Product exploration explored 100000 steps with 5421 reset in 215 ms.
Computed a total of 95 stabilizing places and 90 stable transitions
Computed a total of 95 stabilizing places and 90 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 78 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Finished random walk after 343 steps, including 19 resets, run visited all 1 properties in 2 ms. (steps per millisecond=171 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 101 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 48 ms :[(NOT p0)]
Support contains 2 out of 200 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 200/200 places, 148/148 transitions.
Applied a total of 0 rules in 10 ms. Remains 200 /200 variables (removed 0) and now considering 148/148 (removed 0) transitions.
[2024-05-22 00:10:01] [INFO ] Invariant cache hit.
[2024-05-22 00:10:01] [INFO ] Implicit Places using invariants in 132 ms returned []
[2024-05-22 00:10:01] [INFO ] Invariant cache hit.
[2024-05-22 00:10:01] [INFO ] Implicit Places using invariants and state equation in 175 ms returned []
Implicit Place search using SMT with State Equation took 309 ms to find 0 implicit places.
[2024-05-22 00:10:01] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-22 00:10:01] [INFO ] Invariant cache hit.
[2024-05-22 00:10:01] [INFO ] Dead Transitions using invariants and state equation in 90 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 418 ms. Remains : 200/200 places, 148/148 transitions.
Computed a total of 95 stabilizing places and 90 stable transitions
Computed a total of 95 stabilizing places and 90 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 67 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Finished random walk after 177 steps, including 8 resets, run visited all 1 properties in 2 ms. (steps per millisecond=88 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 96 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 25 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 146 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 46 ms :[(NOT p0)]
Product exploration explored 100000 steps with 5373 reset in 202 ms.
Product exploration explored 100000 steps with 5459 reset in 236 ms.
Built C files in :
/tmp/ltsmin8524934045493096461
[2024-05-22 00:10:02] [INFO ] Computing symmetric may disable matrix : 148 transitions.
[2024-05-22 00:10:02] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 00:10:02] [INFO ] Computing symmetric may enable matrix : 148 transitions.
[2024-05-22 00:10:02] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 00:10:02] [INFO ] Computing Do-Not-Accords matrix : 148 transitions.
[2024-05-22 00:10:02] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 00:10:02] [INFO ] Built C files in 17ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8524934045493096461
Running compilation step : cd /tmp/ltsmin8524934045493096461;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 302 ms.
Running link step : cd /tmp/ltsmin8524934045493096461;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin8524934045493096461;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased9231706138629042161.hoa' '--buchi-type=spotba'
LTSmin run took 384 ms.
FORMULA DES-PT-20b-LTLCardinality-01 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property DES-PT-20b-LTLCardinality-01 finished in 3364 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((!p0 U G(p0)))'
Support contains 2 out of 327 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 327/327 places, 273/273 transitions.
Graph (complete) has 681 edges and 327 vertex of which 325 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 0 with 14 rules applied. Total rules applied 15 place count 324 transition count 256
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 1 with 14 rules applied. Total rules applied 29 place count 310 transition count 256
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 9 Pre rules applied. Total rules applied 29 place count 310 transition count 247
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 47 place count 301 transition count 247
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 53 place count 295 transition count 241
Iterating global reduction 2 with 6 rules applied. Total rules applied 59 place count 295 transition count 241
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 65 place count 289 transition count 235
Iterating global reduction 2 with 6 rules applied. Total rules applied 71 place count 289 transition count 235
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 6 rules applied. Total rules applied 77 place count 289 transition count 229
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 79 place count 288 transition count 228
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 79 place count 288 transition count 225
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 85 place count 285 transition count 225
Performed 77 Post agglomeration using F-continuation condition.Transition count delta: 77
Deduced a syphon composed of 77 places in 0 ms
Reduce places removed 77 places and 0 transitions.
Iterating global reduction 4 with 154 rules applied. Total rules applied 239 place count 208 transition count 148
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 243 place count 206 transition count 150
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 245 place count 204 transition count 148
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 246 place count 203 transition count 148
Applied a total of 246 rules in 45 ms. Remains 203 /327 variables (removed 124) and now considering 148/273 (removed 125) transitions.
// Phase 1: matrix 148 rows 203 cols
[2024-05-22 00:10:03] [INFO ] Computed 61 invariants in 2 ms
[2024-05-22 00:10:03] [INFO ] Implicit Places using invariants in 145 ms returned []
[2024-05-22 00:10:03] [INFO ] Invariant cache hit.
[2024-05-22 00:10:03] [INFO ] Implicit Places using invariants and state equation in 180 ms returned []
Implicit Place search using SMT with State Equation took 330 ms to find 0 implicit places.
[2024-05-22 00:10:03] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-22 00:10:03] [INFO ] Invariant cache hit.
[2024-05-22 00:10:03] [INFO ] Dead Transitions using invariants and state equation in 108 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 203/327 places, 148/273 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 499 ms. Remains : 203/327 places, 148/273 transitions.
Stuttering acceptance computed with spot in 85 ms :[(NOT p0), true, (NOT p0)]
Running random walk in product with property : DES-PT-20b-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=p0, acceptance={0} source=2 dest: 0}, { cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=2, aps=[p0:(OR (EQ s124 0) (EQ s0 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Entered a terminal (fully accepting) state of product in 28 steps with 1 reset in 0 ms.
FORMULA DES-PT-20b-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-20b-LTLCardinality-03 finished in 606 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G((p0||G(p1))))))'
Support contains 2 out of 327 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 327/327 places, 273/273 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 326 transition count 273
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 7 place count 320 transition count 267
Iterating global reduction 1 with 6 rules applied. Total rules applied 13 place count 320 transition count 267
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 19 place count 314 transition count 261
Iterating global reduction 1 with 6 rules applied. Total rules applied 25 place count 314 transition count 261
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 30 place count 314 transition count 256
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 31 place count 313 transition count 255
Iterating global reduction 2 with 1 rules applied. Total rules applied 32 place count 313 transition count 255
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 33 place count 313 transition count 254
Applied a total of 33 rules in 22 ms. Remains 313 /327 variables (removed 14) and now considering 254/273 (removed 19) transitions.
// Phase 1: matrix 254 rows 313 cols
[2024-05-22 00:10:03] [INFO ] Computed 61 invariants in 5 ms
[2024-05-22 00:10:04] [INFO ] Implicit Places using invariants in 127 ms returned []
[2024-05-22 00:10:04] [INFO ] Invariant cache hit.
[2024-05-22 00:10:04] [INFO ] Implicit Places using invariants and state equation in 329 ms returned []
Implicit Place search using SMT with State Equation took 460 ms to find 0 implicit places.
[2024-05-22 00:10:04] [INFO ] Invariant cache hit.
[2024-05-22 00:10:04] [INFO ] Dead Transitions using invariants and state equation in 142 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 313/327 places, 254/273 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 625 ms. Remains : 313/327 places, 254/273 transitions.
Stuttering acceptance computed with spot in 167 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : DES-PT-20b-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 3}]], initial=4, aps=[p1:(OR (EQ s132 0) (EQ s147 1)), p0:(AND (EQ s147 0) (EQ s132 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]]
Entered a terminal (fully accepting) state of product in 40 steps with 0 reset in 0 ms.
FORMULA DES-PT-20b-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-20b-LTLCardinality-04 finished in 811 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 2 out of 327 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 327/327 places, 273/273 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 326 transition count 273
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 7 place count 320 transition count 267
Iterating global reduction 1 with 6 rules applied. Total rules applied 13 place count 320 transition count 267
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 19 place count 314 transition count 261
Iterating global reduction 1 with 6 rules applied. Total rules applied 25 place count 314 transition count 261
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 30 place count 314 transition count 256
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 31 place count 313 transition count 255
Iterating global reduction 2 with 1 rules applied. Total rules applied 32 place count 313 transition count 255
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 33 place count 313 transition count 254
Applied a total of 33 rules in 24 ms. Remains 313 /327 variables (removed 14) and now considering 254/273 (removed 19) transitions.
[2024-05-22 00:10:04] [INFO ] Invariant cache hit.
[2024-05-22 00:10:04] [INFO ] Implicit Places using invariants in 122 ms returned []
[2024-05-22 00:10:04] [INFO ] Invariant cache hit.
[2024-05-22 00:10:05] [INFO ] Implicit Places using invariants and state equation in 378 ms returned []
Implicit Place search using SMT with State Equation took 501 ms to find 0 implicit places.
[2024-05-22 00:10:05] [INFO ] Invariant cache hit.
[2024-05-22 00:10:05] [INFO ] Dead Transitions using invariants and state equation in 129 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 313/327 places, 254/273 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 669 ms. Remains : 313/327 places, 254/273 transitions.
Stuttering acceptance computed with spot in 89 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : DES-PT-20b-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (EQ s74 0) (EQ s185 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][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA DES-PT-20b-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-20b-LTLCardinality-07 finished in 776 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((G(p0)||X(p1))))'
Support contains 5 out of 327 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 327/327 places, 273/273 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 326 transition count 273
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 6 place count 321 transition count 268
Iterating global reduction 1 with 5 rules applied. Total rules applied 11 place count 321 transition count 268
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 16 place count 316 transition count 263
Iterating global reduction 1 with 5 rules applied. Total rules applied 21 place count 316 transition count 263
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 25 place count 316 transition count 259
Applied a total of 25 rules in 20 ms. Remains 316 /327 variables (removed 11) and now considering 259/273 (removed 14) transitions.
// Phase 1: matrix 259 rows 316 cols
[2024-05-22 00:10:05] [INFO ] Computed 61 invariants in 5 ms
[2024-05-22 00:10:05] [INFO ] Implicit Places using invariants in 140 ms returned []
[2024-05-22 00:10:05] [INFO ] Invariant cache hit.
[2024-05-22 00:10:05] [INFO ] Implicit Places using invariants and state equation in 299 ms returned []
Implicit Place search using SMT with State Equation took 442 ms to find 0 implicit places.
[2024-05-22 00:10:05] [INFO ] Invariant cache hit.
[2024-05-22 00:10:06] [INFO ] Dead Transitions using invariants and state equation in 153 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 316/327 places, 259/273 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 618 ms. Remains : 316/327 places, 259/273 transitions.
Stuttering acceptance computed with spot in 168 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : DES-PT-20b-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=p0, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 2}, { cond=(AND p0 p1), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 2}, { cond=(AND p0 p1), acceptance={} source=3 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 4}], [{ cond=(NOT p0), acceptance={} source=4 dest: 0}, { cond=p0, acceptance={} source=4 dest: 4}]], initial=1, aps=[p0:(AND (OR (EQ s144 0) (AND (EQ s106 0) (EQ s195 1))) (EQ s144 0)), p1:(OR (EQ s205 0) (EQ s5 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 668 steps with 4 reset in 6 ms.
FORMULA DES-PT-20b-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-20b-LTLCardinality-08 finished in 816 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((X(p1)||p0))))'
Support contains 3 out of 327 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 327/327 places, 273/273 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 326 transition count 273
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 7 place count 320 transition count 267
Iterating global reduction 1 with 6 rules applied. Total rules applied 13 place count 320 transition count 267
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 19 place count 314 transition count 261
Iterating global reduction 1 with 6 rules applied. Total rules applied 25 place count 314 transition count 261
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 30 place count 314 transition count 256
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 31 place count 313 transition count 255
Iterating global reduction 2 with 1 rules applied. Total rules applied 32 place count 313 transition count 255
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 33 place count 313 transition count 254
Applied a total of 33 rules in 23 ms. Remains 313 /327 variables (removed 14) and now considering 254/273 (removed 19) transitions.
// Phase 1: matrix 254 rows 313 cols
[2024-05-22 00:10:06] [INFO ] Computed 61 invariants in 5 ms
[2024-05-22 00:10:06] [INFO ] Implicit Places using invariants in 130 ms returned []
[2024-05-22 00:10:06] [INFO ] Invariant cache hit.
[2024-05-22 00:10:06] [INFO ] Implicit Places using invariants and state equation in 331 ms returned []
Implicit Place search using SMT with State Equation took 464 ms to find 0 implicit places.
[2024-05-22 00:10:06] [INFO ] Invariant cache hit.
[2024-05-22 00:10:06] [INFO ] Dead Transitions using invariants and state equation in 135 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 313/327 places, 254/273 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 624 ms. Remains : 313/327 places, 254/273 transitions.
Stuttering acceptance computed with spot in 203 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : DES-PT-20b-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (EQ s18 0) (EQ s271 1)), p1:(EQ s161 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 256 ms.
Product exploration explored 100000 steps with 50000 reset in 205 ms.
Computed a total of 136 stabilizing places and 129 stable transitions
Graph (complete) has 647 edges and 313 vertex of which 308 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.1 ms
Computed a total of 136 stabilizing places and 129 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X p0), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 15 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DES-PT-20b-LTLCardinality-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DES-PT-20b-LTLCardinality-10 finished in 1329 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&F(G((X(p2)||p1)))))'
Support contains 4 out of 327 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 327/327 places, 273/273 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 326 transition count 273
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 7 place count 320 transition count 267
Iterating global reduction 1 with 6 rules applied. Total rules applied 13 place count 320 transition count 267
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 19 place count 314 transition count 261
Iterating global reduction 1 with 6 rules applied. Total rules applied 25 place count 314 transition count 261
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 30 place count 314 transition count 256
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 31 place count 313 transition count 255
Iterating global reduction 2 with 1 rules applied. Total rules applied 32 place count 313 transition count 255
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 33 place count 313 transition count 254
Applied a total of 33 rules in 26 ms. Remains 313 /327 variables (removed 14) and now considering 254/273 (removed 19) transitions.
[2024-05-22 00:10:07] [INFO ] Invariant cache hit.
[2024-05-22 00:10:07] [INFO ] Implicit Places using invariants in 135 ms returned []
[2024-05-22 00:10:07] [INFO ] Invariant cache hit.
[2024-05-22 00:10:08] [INFO ] Implicit Places using invariants and state equation in 335 ms returned []
Implicit Place search using SMT with State Equation took 471 ms to find 0 implicit places.
[2024-05-22 00:10:08] [INFO ] Invariant cache hit.
[2024-05-22 00:10:08] [INFO ] Dead Transitions using invariants and state equation in 136 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 313/327 places, 254/273 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 634 ms. Remains : 313/327 places, 254/273 transitions.
Stuttering acceptance computed with spot in 143 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : DES-PT-20b-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}, { cond=(NOT p1), acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 3}], [{ cond=(NOT p2), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(OR (EQ s311 0) (EQ s135 1)), p1:(OR (EQ s286 0) (EQ s82 1)), p2:(OR (EQ s286 0) (EQ s82 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 1199 reset in 164 ms.
Product exploration explored 100000 steps with 1182 reset in 179 ms.
Computed a total of 136 stabilizing places and 129 stable transitions
Graph (complete) has 647 edges and 313 vertex of which 308 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.1 ms
Computed a total of 136 stabilizing places and 129 stable transitions
Knowledge obtained : [(AND p0 p1 p2), (X p0), (X p1), (X p2), (X (NOT (AND (NOT p1) (NOT p2)))), true, (X (X p0)), (X (X p1)), (X (X p2)), (X (X (NOT (AND (NOT p1) (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 99 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter sensitive) to 2 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 65 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Finished random walk after 59 steps, including 0 resets, run visited all 3 properties in 3 ms. (steps per millisecond=19 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 p1 p2), (X p0), (X p1), (X p2), (X (NOT (AND (NOT p1) (NOT p2)))), true, (X (X p0)), (X (X p1)), (X (X p2)), (X (X (NOT (AND (NOT p1) (NOT p2)))))]
False Knowledge obtained : [(F (NOT p1)), (F (AND (NOT p1) (NOT p2))), (F (NOT p2))]
Knowledge based reduction with 10 factoid took 167 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter sensitive) to 2 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 67 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 86 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Support contains 2 out of 313 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 313/313 places, 254/254 transitions.
Applied a total of 0 rules in 7 ms. Remains 313 /313 variables (removed 0) and now considering 254/254 (removed 0) transitions.
[2024-05-22 00:10:09] [INFO ] Invariant cache hit.
[2024-05-22 00:10:09] [INFO ] Implicit Places using invariants in 130 ms returned []
[2024-05-22 00:10:09] [INFO ] Invariant cache hit.
[2024-05-22 00:10:09] [INFO ] Implicit Places using invariants and state equation in 330 ms returned []
Implicit Place search using SMT with State Equation took 468 ms to find 0 implicit places.
[2024-05-22 00:10:09] [INFO ] Invariant cache hit.
[2024-05-22 00:10:09] [INFO ] Dead Transitions using invariants and state equation in 131 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 608 ms. Remains : 313/313 places, 254/254 transitions.
Computed a total of 136 stabilizing places and 129 stable transitions
Graph (complete) has 647 edges and 313 vertex of which 308 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.1 ms
Computed a total of 136 stabilizing places and 129 stable transitions
Knowledge obtained : [(AND p1 p2), (X p2), (X (NOT (AND (NOT p1) (NOT p2)))), true, (X (X p1)), (X (X p2)), (X (X (NOT (AND (NOT p1) (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 100 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter sensitive) to 2 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 90 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Finished random walk after 61 steps, including 0 resets, run visited all 3 properties in 2 ms. (steps per millisecond=30 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p1 p2), (X p2), (X (NOT (AND (NOT p1) (NOT p2)))), true, (X (X p1)), (X (X p2)), (X (X (NOT (AND (NOT p1) (NOT p2)))))]
False Knowledge obtained : [(F (NOT p1)), (F (AND (NOT p2) (NOT p1))), (F (NOT p2))]
Knowledge based reduction with 7 factoid took 146 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter sensitive) to 2 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 79 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 73 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 74 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 1180 reset in 167 ms.
Product exploration explored 100000 steps with 1195 reset in 178 ms.
Built C files in :
/tmp/ltsmin1847754214426545224
[2024-05-22 00:10:11] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1847754214426545224
Running compilation step : cd /tmp/ltsmin1847754214426545224;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 415 ms.
Running link step : cd /tmp/ltsmin1847754214426545224;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin1847754214426545224;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased15419583533827265251.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 313 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 313/313 places, 254/254 transitions.
Applied a total of 0 rules in 8 ms. Remains 313 /313 variables (removed 0) and now considering 254/254 (removed 0) transitions.
[2024-05-22 00:10:26] [INFO ] Invariant cache hit.
[2024-05-22 00:10:26] [INFO ] Implicit Places using invariants in 136 ms returned []
[2024-05-22 00:10:26] [INFO ] Invariant cache hit.
[2024-05-22 00:10:26] [INFO ] Implicit Places using invariants and state equation in 346 ms returned []
Implicit Place search using SMT with State Equation took 499 ms to find 0 implicit places.
[2024-05-22 00:10:26] [INFO ] Invariant cache hit.
[2024-05-22 00:10:26] [INFO ] Dead Transitions using invariants and state equation in 137 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 647 ms. Remains : 313/313 places, 254/254 transitions.
Built C files in :
/tmp/ltsmin6344158802969617871
[2024-05-22 00:10:26] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6344158802969617871
Running compilation step : cd /tmp/ltsmin6344158802969617871;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 390 ms.
Running link step : cd /tmp/ltsmin6344158802969617871;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin6344158802969617871;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased4877165346905069642.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-22 00:10:42] [INFO ] Flatten gal took : 15 ms
[2024-05-22 00:10:42] [INFO ] Flatten gal took : 14 ms
[2024-05-22 00:10:42] [INFO ] Time to serialize gal into /tmp/LTL7594430473821308768.gal : 4 ms
[2024-05-22 00:10:42] [INFO ] Time to serialize properties into /tmp/LTL13979788205532953800.prop : 8 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL7594430473821308768.gal' '-t' 'CGAL' '-hoa' '/tmp/aut1233072332914200059.hoa' '-atoms' '/tmp/LTL13979788205532953800.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

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

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !(((F("((p358==0)||(p165==1))"))&&(F(G(("((p330==0)||(p84==1))")||(X("((p330==0)||(p84==1))")))))))
Formula 0 simplified : G!"((p358==0)||(p165==1))" | GF(!"((p330==0)||(p84==1))" & X!"((p330==0)||(p84==1))")
Detected timeout of ITS tools.
[2024-05-22 00:11:12] [INFO ] Flatten gal took : 26 ms
[2024-05-22 00:11:12] [INFO ] Applying decomposition
[2024-05-22 00:11:12] [INFO ] Flatten gal took : 14 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph15638217073722573197.txt' '-o' '/tmp/graph15638217073722573197.bin' '-w' '/tmp/graph15638217073722573197.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph15638217073722573197.bin' '-l' '-1' '-v' '-w' '/tmp/graph15638217073722573197.weights' '-q' '0' '-e' '0.001'
[2024-05-22 00:11:12] [INFO ] Decomposing Gal with order
[2024-05-22 00:11:12] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 00:11:12] [INFO ] Removed a total of 12 redundant transitions.
[2024-05-22 00:11:12] [INFO ] Flatten gal took : 58 ms
[2024-05-22 00:11:12] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 6 ms.
[2024-05-22 00:11:12] [INFO ] Time to serialize gal into /tmp/LTL7588395469068397587.gal : 5 ms
[2024-05-22 00:11:12] [INFO ] Time to serialize properties into /tmp/LTL11594352323798341976.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL7588395469068397587.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11594352323798341976.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !(((F("((i11.u75.p358==0)||(i4.u23.p165==1))"))&&(F(G(("((i9.u67.p330==0)||(i2.u8.p84==1))")||(X("((i9.u67.p330==0)||(i2.u8.p84==1))")...161
Formula 0 simplified : G!"((i11.u75.p358==0)||(i4.u23.p165==1))" | GF(!"((i9.u67.p330==0)||(i2.u8.p84==1))" & X!"((i9.u67.p330==0)||(i2.u8.p84==1))")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin17060401774438270100
[2024-05-22 00:11:27] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17060401774438270100
Running compilation step : cd /tmp/ltsmin17060401774438270100;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 399 ms.
Running link step : cd /tmp/ltsmin17060401774438270100;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin17060401774438270100;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '(<>((LTLAPp0==true))&&<>([]((X((LTLAPp2==true))||(LTLAPp1==true)))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property DES-PT-20b-LTLCardinality-11 finished in 95013 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((F(p1)||p0))))'
Support contains 2 out of 327 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 327/327 places, 273/273 transitions.
Graph (complete) has 681 edges and 327 vertex of which 321 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.1 ms
Discarding 6 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 0 with 14 rules applied. Total rules applied 15 place count 320 transition count 255
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 1 with 14 rules applied. Total rules applied 29 place count 306 transition count 255
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 29 place count 306 transition count 245
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 49 place count 296 transition count 245
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 55 place count 290 transition count 239
Iterating global reduction 2 with 6 rules applied. Total rules applied 61 place count 290 transition count 239
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 67 place count 284 transition count 233
Iterating global reduction 2 with 6 rules applied. Total rules applied 73 place count 284 transition count 233
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 6 rules applied. Total rules applied 79 place count 284 transition count 227
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 81 place count 283 transition count 226
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 81 place count 283 transition count 223
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 87 place count 280 transition count 223
Performed 75 Post agglomeration using F-continuation condition.Transition count delta: 75
Deduced a syphon composed of 75 places in 0 ms
Reduce places removed 75 places and 0 transitions.
Iterating global reduction 4 with 150 rules applied. Total rules applied 237 place count 205 transition count 148
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 241 place count 203 transition count 150
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 243 place count 201 transition count 148
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 244 place count 200 transition count 148
Applied a total of 244 rules in 35 ms. Remains 200 /327 variables (removed 127) and now considering 148/273 (removed 125) transitions.
// Phase 1: matrix 148 rows 200 cols
[2024-05-22 00:11:42] [INFO ] Computed 58 invariants in 3 ms
[2024-05-22 00:11:42] [INFO ] Implicit Places using invariants in 125 ms returned []
[2024-05-22 00:11:42] [INFO ] Invariant cache hit.
[2024-05-22 00:11:43] [INFO ] Implicit Places using invariants and state equation in 193 ms returned []
Implicit Place search using SMT with State Equation took 321 ms to find 0 implicit places.
[2024-05-22 00:11:43] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-22 00:11:43] [INFO ] Invariant cache hit.
[2024-05-22 00:11:43] [INFO ] Dead Transitions using invariants and state equation in 85 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 200/327 places, 148/273 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 448 ms. Remains : 200/327 places, 148/273 transitions.
Stuttering acceptance computed with spot in 71 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : DES-PT-20b-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s137 0) (EQ s44 1)), p1:(OR (EQ s137 0) (EQ s44 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 8199 reset in 229 ms.
Product exploration explored 100000 steps with 8144 reset in 239 ms.
Computed a total of 97 stabilizing places and 92 stable transitions
Computed a total of 97 stabilizing places and 92 stable transitions
Detected a total of 97/200 stabilizing places and 92/148 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND p0 p1), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
Knowledge based reduction with 5 factoid took 242 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 95 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 492 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 91 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-22 00:11:44] [INFO ] Invariant cache hit.
[2024-05-22 00:11:44] [INFO ] After 33ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 p1), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (G (NOT (AND p0 (NOT p1))))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 6 factoid took 302 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 67 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 64 ms :[(NOT p1), (NOT p1)]
Support contains 2 out of 200 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 200/200 places, 148/148 transitions.
Applied a total of 0 rules in 10 ms. Remains 200 /200 variables (removed 0) and now considering 148/148 (removed 0) transitions.
[2024-05-22 00:11:44] [INFO ] Invariant cache hit.
[2024-05-22 00:11:44] [INFO ] Implicit Places using invariants in 120 ms returned []
[2024-05-22 00:11:44] [INFO ] Invariant cache hit.
[2024-05-22 00:11:44] [INFO ] Implicit Places using invariants and state equation in 198 ms returned []
Implicit Place search using SMT with State Equation took 319 ms to find 0 implicit places.
[2024-05-22 00:11:44] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-22 00:11:44] [INFO ] Invariant cache hit.
[2024-05-22 00:11:44] [INFO ] Dead Transitions using invariants and state equation in 89 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 424 ms. Remains : 200/200 places, 148/148 transitions.
Computed a total of 97 stabilizing places and 92 stable transitions
Computed a total of 97 stabilizing places and 92 stable transitions
Detected a total of 97/200 stabilizing places and 92/148 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p1, (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (X (NOT p1))), (X (X p1))]
Knowledge based reduction with 2 factoid took 169 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 64 ms :[(NOT p1), (NOT p1)]
Finished random walk after 2 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=1 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p1, (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (X (NOT p1))), (X (X p1)), (F (NOT p1))]
Knowledge based reduction with 2 factoid took 234 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 64 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 75 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 73 ms :[(NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 8101 reset in 207 ms.
Product exploration explored 100000 steps with 8257 reset in 226 ms.
Built C files in :
/tmp/ltsmin6519347839758459503
[2024-05-22 00:11:46] [INFO ] Computing symmetric may disable matrix : 148 transitions.
[2024-05-22 00:11:46] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 00:11:46] [INFO ] Computing symmetric may enable matrix : 148 transitions.
[2024-05-22 00:11:46] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 00:11:46] [INFO ] Computing Do-Not-Accords matrix : 148 transitions.
[2024-05-22 00:11:46] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 00:11:46] [INFO ] Built C files in 11ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6519347839758459503
Running compilation step : cd /tmp/ltsmin6519347839758459503;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 315 ms.
Running link step : cd /tmp/ltsmin6519347839758459503;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin6519347839758459503;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased10548504210255768927.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 200 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 200/200 places, 148/148 transitions.
Applied a total of 0 rules in 17 ms. Remains 200 /200 variables (removed 0) and now considering 148/148 (removed 0) transitions.
[2024-05-22 00:12:01] [INFO ] Invariant cache hit.
[2024-05-22 00:12:01] [INFO ] Implicit Places using invariants in 130 ms returned []
[2024-05-22 00:12:01] [INFO ] Invariant cache hit.
[2024-05-22 00:12:01] [INFO ] Implicit Places using invariants and state equation in 196 ms returned []
Implicit Place search using SMT with State Equation took 328 ms to find 0 implicit places.
[2024-05-22 00:12:01] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-22 00:12:01] [INFO ] Invariant cache hit.
[2024-05-22 00:12:01] [INFO ] Dead Transitions using invariants and state equation in 88 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 440 ms. Remains : 200/200 places, 148/148 transitions.
Built C files in :
/tmp/ltsmin1469101405247339267
[2024-05-22 00:12:01] [INFO ] Computing symmetric may disable matrix : 148 transitions.
[2024-05-22 00:12:01] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 00:12:01] [INFO ] Computing symmetric may enable matrix : 148 transitions.
[2024-05-22 00:12:01] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 00:12:01] [INFO ] Computing Do-Not-Accords matrix : 148 transitions.
[2024-05-22 00:12:01] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 00:12:01] [INFO ] Built C files in 16ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1469101405247339267
Running compilation step : cd /tmp/ltsmin1469101405247339267;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 315 ms.
Running link step : cd /tmp/ltsmin1469101405247339267;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin1469101405247339267;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased15911246784751910474.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-22 00:12:16] [INFO ] Flatten gal took : 14 ms
[2024-05-22 00:12:16] [INFO ] Flatten gal took : 12 ms
[2024-05-22 00:12:16] [INFO ] Time to serialize gal into /tmp/LTL6040598462089742989.gal : 2 ms
[2024-05-22 00:12:16] [INFO ] Time to serialize properties into /tmp/LTL14480103208982417427.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL6040598462089742989.gal' '-t' 'CGAL' '-hoa' '/tmp/aut14439003822520311761.hoa' '-atoms' '/tmp/LTL14480103208982417427.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

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

its-ltl command run as :

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

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((F(G(("((i7.i0.u29.p255==0)||(u10.p52==1))")||(F("((i7.i0.u29.p255==0)||(u10.p52==1))"))))))
Formula 0 simplified : FG!"((i7.i0.u29.p255==0)||(u10.p52==1))"
Reverse transition relation is NOT exact ! Due to transitions t266_t80, t53_t55_t57_t59_t61_t63, t7_t49_t40, t233_t35, t232_t26, t108_t109_t131_t272_t137_t...655
Computing Next relation with stutter on 2.94147e+07 deadlock states
128 unique states visited
0 strongly connected components in search stack
129 transitions explored
65 items max in DFS search stack
1149 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,11.5276,334120,1,0,608554,31153,1807,1.68616e+06,2430,134179,740895
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA DES-PT-20b-LTLCardinality-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Treatment of property DES-PT-20b-LTLCardinality-14 finished in 78203 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0 U X((G(p2)||p1)))))'
Support contains 5 out of 327 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 327/327 places, 273/273 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 326 transition count 273
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 6 place count 321 transition count 268
Iterating global reduction 1 with 5 rules applied. Total rules applied 11 place count 321 transition count 268
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 16 place count 316 transition count 263
Iterating global reduction 1 with 5 rules applied. Total rules applied 21 place count 316 transition count 263
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 25 place count 316 transition count 259
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 26 place count 315 transition count 258
Iterating global reduction 2 with 1 rules applied. Total rules applied 27 place count 315 transition count 258
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 28 place count 315 transition count 257
Applied a total of 28 rules in 16 ms. Remains 315 /327 variables (removed 12) and now considering 257/273 (removed 16) transitions.
// Phase 1: matrix 257 rows 315 cols
[2024-05-22 00:13:00] [INFO ] Computed 61 invariants in 6 ms
[2024-05-22 00:13:01] [INFO ] Implicit Places using invariants in 148 ms returned []
[2024-05-22 00:13:01] [INFO ] Invariant cache hit.
[2024-05-22 00:13:01] [INFO ] Implicit Places using invariants and state equation in 340 ms returned []
Implicit Place search using SMT with State Equation took 488 ms to find 0 implicit places.
[2024-05-22 00:13:01] [INFO ] Invariant cache hit.
[2024-05-22 00:13:01] [INFO ] Dead Transitions using invariants and state equation in 145 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 315/327 places, 257/273 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 650 ms. Remains : 315/327 places, 257/273 transitions.
Stuttering acceptance computed with spot in 168 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2)), true, (NOT p2)]
Running random walk in product with property : DES-PT-20b-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p1) p2), acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 1}, { cond=(AND p0 (NOT p1) p2), acceptance={} source=2 dest: 2}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p2), acceptance={} source=4 dest: 3}, { cond=p2, acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(EQ s121 1), p1:(OR (EQ s308 0) (EQ s199 1)), p2:(OR (EQ s102 0) (EQ s112 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 33340 reset in 180 ms.
Product exploration explored 100000 steps with 33079 reset in 172 ms.
Computed a total of 136 stabilizing places and 129 stable transitions
Graph (complete) has 652 edges and 315 vertex of which 310 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.1 ms
Computed a total of 136 stabilizing places and 129 stable transitions
Knowledge obtained : [(AND (NOT p0) p1 p2), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1) p2))), (X (NOT (AND (NOT p1) p2))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), true, (X (X p2)), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 137 ms. Reduced automaton from 5 states, 11 edges and 3 AP (stutter sensitive) to 5 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 169 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2)), true, (NOT p2)]
Finished random walk after 8957 steps, including 79 resets, run visited all 7 properties in 69 ms. (steps per millisecond=129 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) p1 p2), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1) p2))), (X (NOT (AND (NOT p1) p2))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), true, (X (X p2)), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2)))))]
False Knowledge obtained : [(F (AND (NOT p1) p2 p0)), (F (AND (NOT p1) (NOT p0))), (F (NOT p2)), (F (AND (NOT p1) (NOT p2) p0)), (F p0), (F (AND (NOT p1) p2)), (F (AND (NOT p1) (NOT p2)))]
Knowledge based reduction with 13 factoid took 368 ms. Reduced automaton from 5 states, 11 edges and 3 AP (stutter sensitive) to 5 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 310 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2)), true, (NOT p2)]
Stuttering acceptance computed with spot in 161 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2)), true, (NOT p2)]
Support contains 5 out of 315 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 315/315 places, 257/257 transitions.
Applied a total of 0 rules in 5 ms. Remains 315 /315 variables (removed 0) and now considering 257/257 (removed 0) transitions.
[2024-05-22 00:13:03] [INFO ] Invariant cache hit.
[2024-05-22 00:13:03] [INFO ] Implicit Places using invariants in 127 ms returned []
[2024-05-22 00:13:03] [INFO ] Invariant cache hit.
[2024-05-22 00:13:03] [INFO ] Implicit Places using invariants and state equation in 320 ms returned []
Implicit Place search using SMT with State Equation took 461 ms to find 0 implicit places.
[2024-05-22 00:13:03] [INFO ] Invariant cache hit.
[2024-05-22 00:13:03] [INFO ] Dead Transitions using invariants and state equation in 127 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 595 ms. Remains : 315/315 places, 257/257 transitions.
Computed a total of 136 stabilizing places and 129 stable transitions
Graph (complete) has 652 edges and 315 vertex of which 310 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.0 ms
Computed a total of 136 stabilizing places and 129 stable transitions
Knowledge obtained : [(AND (NOT p0) p1 p2), (X (NOT (AND (NOT p1) (NOT p2) p0))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p1) p2))), (X (NOT (AND (NOT p1) p2 p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p2) p0)))), true, (X (X p2)), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND (NOT p1) p2 p0)))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 131 ms. Reduced automaton from 5 states, 11 edges and 3 AP (stutter sensitive) to 5 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 180 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2)), true, (NOT p2)]
Finished random walk after 8864 steps, including 81 resets, run visited all 7 properties in 23 ms. (steps per millisecond=385 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) p1 p2), (X (NOT (AND (NOT p1) (NOT p2) p0))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p1) p2))), (X (NOT (AND (NOT p1) p2 p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p2) p0)))), true, (X (X p2)), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND (NOT p1) p2 p0)))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : [(F (AND p0 p2 (NOT p1))), (F (AND (NOT p0) (NOT p1))), (F (NOT p2)), (F (AND p0 (NOT p2) (NOT p1))), (F p0), (F (AND p2 (NOT p1))), (F (AND (NOT p2) (NOT p1)))]
Knowledge based reduction with 13 factoid took 401 ms. Reduced automaton from 5 states, 11 edges and 3 AP (stutter sensitive) to 5 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 149 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2)), true, (NOT p2)]
Stuttering acceptance computed with spot in 145 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2)), true, (NOT p2)]
Stuttering acceptance computed with spot in 168 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2)), true, (NOT p2)]
Product exploration explored 100000 steps with 33333 reset in 171 ms.
Product exploration explored 100000 steps with 33324 reset in 187 ms.
Applying partial POR strategy [false, true, false, true, true]
Stuttering acceptance computed with spot in 145 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2)), true, (NOT p2)]
Support contains 5 out of 315 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 315/315 places, 257/257 transitions.
Graph (complete) has 652 edges and 315 vertex of which 310 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.0 ms
Discarding 5 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 12 rules applied. Total rules applied 13 place count 310 transition count 254
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 7 Pre rules applied. Total rules applied 13 place count 310 transition count 256
Deduced a syphon composed of 19 places in 0 ms
Iterating global reduction 1 with 7 rules applied. Total rules applied 20 place count 310 transition count 256
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 25 place count 305 transition count 251
Deduced a syphon composed of 14 places in 0 ms
Iterating global reduction 1 with 5 rules applied. Total rules applied 30 place count 305 transition count 251
Performed 76 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 90 places in 1 ms
Iterating global reduction 1 with 76 rules applied. Total rules applied 106 place count 305 transition count 254
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 115 place count 296 transition count 245
Deduced a syphon composed of 81 places in 0 ms
Iterating global reduction 1 with 9 rules applied. Total rules applied 124 place count 296 transition count 245
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -28
Deduced a syphon composed of 87 places in 0 ms
Iterating global reduction 1 with 6 rules applied. Total rules applied 130 place count 296 transition count 273
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 132 place count 294 transition count 267
Deduced a syphon composed of 85 places in 1 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 134 place count 294 transition count 267
Deduced a syphon composed of 85 places in 0 ms
Applied a total of 134 rules in 71 ms. Remains 294 /315 variables (removed 21) and now considering 267/257 (removed -10) transitions.
[2024-05-22 00:13:05] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 267 rows 294 cols
[2024-05-22 00:13:05] [INFO ] Computed 59 invariants in 2 ms
[2024-05-22 00:13:06] [INFO ] Dead Transitions using invariants and state equation in 322 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 294/315 places, 267/257 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 405 ms. Remains : 294/315 places, 267/257 transitions.
Built C files in :
/tmp/ltsmin13197775260011393070
[2024-05-22 00:13:06] [INFO ] Built C files in 24ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13197775260011393070
Running compilation step : cd /tmp/ltsmin13197775260011393070;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 396 ms.
Running link step : cd /tmp/ltsmin13197775260011393070;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 26 ms.
Running LTSmin : cd /tmp/ltsmin13197775260011393070;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased430902354803571378.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 5 out of 315 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 315/315 places, 257/257 transitions.
Applied a total of 0 rules in 13 ms. Remains 315 /315 variables (removed 0) and now considering 257/257 (removed 0) transitions.
// Phase 1: matrix 257 rows 315 cols
[2024-05-22 00:13:21] [INFO ] Computed 61 invariants in 3 ms
[2024-05-22 00:13:21] [INFO ] Implicit Places using invariants in 202 ms returned []
[2024-05-22 00:13:21] [INFO ] Invariant cache hit.
[2024-05-22 00:13:21] [INFO ] Implicit Places using invariants and state equation in 360 ms returned []
Implicit Place search using SMT with State Equation took 567 ms to find 0 implicit places.
[2024-05-22 00:13:21] [INFO ] Invariant cache hit.
[2024-05-22 00:13:21] [INFO ] Dead Transitions using invariants and state equation in 137 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 718 ms. Remains : 315/315 places, 257/257 transitions.
Built C files in :
/tmp/ltsmin8509809816519947966
[2024-05-22 00:13:21] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8509809816519947966
Running compilation step : cd /tmp/ltsmin8509809816519947966;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 391 ms.
Running link step : cd /tmp/ltsmin8509809816519947966;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin8509809816519947966;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased10097431040455644721.hoa' '--buchi-type=spotba'
LTSmin run took 370 ms.
FORMULA DES-PT-20b-LTLCardinality-15 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property DES-PT-20b-LTLCardinality-15 finished in 21930 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&F(G((X(p2)||p1)))))'
Found a Lengthening insensitive property : DES-PT-20b-LTLCardinality-11
Stuttering acceptance computed with spot in 144 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Support contains 4 out of 327 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 327/327 places, 273/273 transitions.
Graph (complete) has 681 edges and 327 vertex of which 321 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.2 ms
Discarding 6 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 0 with 12 rules applied. Total rules applied 13 place count 320 transition count 257
Reduce places removed 12 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 13 rules applied. Total rules applied 26 place count 308 transition count 256
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 27 place count 307 transition count 256
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 10 Pre rules applied. Total rules applied 27 place count 307 transition count 246
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 47 place count 297 transition count 246
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 53 place count 291 transition count 240
Iterating global reduction 3 with 6 rules applied. Total rules applied 59 place count 291 transition count 240
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 65 place count 285 transition count 234
Iterating global reduction 3 with 6 rules applied. Total rules applied 71 place count 285 transition count 234
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 6 rules applied. Total rules applied 77 place count 285 transition count 228
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 79 place count 284 transition count 227
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 3 Pre rules applied. Total rules applied 79 place count 284 transition count 224
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 5 with 6 rules applied. Total rules applied 85 place count 281 transition count 224
Performed 75 Post agglomeration using F-continuation condition.Transition count delta: 75
Deduced a syphon composed of 75 places in 0 ms
Reduce places removed 75 places and 0 transitions.
Iterating global reduction 5 with 150 rules applied. Total rules applied 235 place count 206 transition count 149
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 239 place count 204 transition count 151
Partial Post-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 241 place count 204 transition count 151
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 243 place count 202 transition count 149
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 244 place count 201 transition count 149
Applied a total of 244 rules in 42 ms. Remains 201 /327 variables (removed 126) and now considering 149/273 (removed 124) transitions.
// Phase 1: matrix 149 rows 201 cols
[2024-05-22 00:13:23] [INFO ] Computed 58 invariants in 3 ms
[2024-05-22 00:13:23] [INFO ] Implicit Places using invariants in 123 ms returned []
[2024-05-22 00:13:23] [INFO ] Invariant cache hit.
[2024-05-22 00:13:23] [INFO ] Implicit Places using invariants and state equation in 204 ms returned []
Implicit Place search using SMT with State Equation took 347 ms to find 0 implicit places.
[2024-05-22 00:13:23] [INFO ] Invariant cache hit.
[2024-05-22 00:13:23] [INFO ] Dead Transitions using invariants and state equation in 91 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 201/327 places, 149/273 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 480 ms. Remains : 201/327 places, 149/273 transitions.
Running random walk in product with property : DES-PT-20b-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}, { cond=(NOT p1), acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 3}], [{ cond=(NOT p2), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(OR (EQ s199 0) (EQ s96 1)), p1:(OR (EQ s180 0) (EQ s75 1)), p2:(OR (EQ s180 0) (EQ s75 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, sl-invariant], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 6546 reset in 209 ms.
Product exploration explored 100000 steps with 6583 reset in 224 ms.
Computed a total of 96 stabilizing places and 91 stable transitions
Computed a total of 96 stabilizing places and 91 stable transitions
Knowledge obtained : [(AND p0 p1 p2), (X p0), (X p1), (X p2), (X (NOT (AND (NOT p1) (NOT p2)))), true, (X (X p1)), (X (X p2)), (X (X (NOT (AND (NOT p1) (NOT p2)))))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 9 factoid took 153 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter sensitive) to 2 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 62 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Finished random walk after 4 steps, including 0 resets, run visited all 3 properties in 2 ms. (steps per millisecond=2 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 p1 p2), (X p0), (X p1), (X p2), (X (NOT (AND (NOT p1) (NOT p2)))), true, (X (X p1)), (X (X p2)), (X (X (NOT (AND (NOT p1) (NOT p2)))))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F (NOT p1)), (F (AND (NOT p1) (NOT p2))), (F (NOT p2))]
Knowledge based reduction with 9 factoid took 194 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter sensitive) to 2 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 62 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 71 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Support contains 2 out of 201 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 201/201 places, 149/149 transitions.
Applied a total of 0 rules in 3 ms. Remains 201 /201 variables (removed 0) and now considering 149/149 (removed 0) transitions.
[2024-05-22 00:13:24] [INFO ] Invariant cache hit.
[2024-05-22 00:13:24] [INFO ] Implicit Places using invariants in 112 ms returned []
[2024-05-22 00:13:24] [INFO ] Invariant cache hit.
[2024-05-22 00:13:24] [INFO ] Implicit Places using invariants and state equation in 190 ms returned []
Implicit Place search using SMT with State Equation took 304 ms to find 0 implicit places.
[2024-05-22 00:13:24] [INFO ] Invariant cache hit.
[2024-05-22 00:13:24] [INFO ] Dead Transitions using invariants and state equation in 85 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 393 ms. Remains : 201/201 places, 149/149 transitions.
Computed a total of 96 stabilizing places and 91 stable transitions
Computed a total of 96 stabilizing places and 91 stable transitions
Knowledge obtained : [(AND p1 p2), (X p2), (X (NOT (AND (NOT p1) (NOT p2)))), true, (X (X p1)), (X (X p2)), (X (X (NOT (AND (NOT p1) (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 182 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter sensitive) to 2 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 75 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Finished random walk after 9 steps, including 0 resets, run visited all 3 properties in 2 ms. (steps per millisecond=4 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p1 p2), (X p2), (X (NOT (AND (NOT p1) (NOT p2)))), true, (X (X p1)), (X (X p2)), (X (X (NOT (AND (NOT p1) (NOT p2)))))]
False Knowledge obtained : [(F (NOT p1)), (F (AND (NOT p2) (NOT p1))), (F (NOT p2))]
Knowledge based reduction with 7 factoid took 130 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter sensitive) to 2 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 60 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 67 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 68 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 6586 reset in 200 ms.
Product exploration explored 100000 steps with 6522 reset in 216 ms.
Built C files in :
/tmp/ltsmin18188688843776796346
[2024-05-22 00:13:26] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18188688843776796346
Running compilation step : cd /tmp/ltsmin18188688843776796346;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 275 ms.
Running link step : cd /tmp/ltsmin18188688843776796346;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin18188688843776796346;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased10544019714213798457.hoa' '--buchi-type=spotba'
LTSmin run took 5320 ms.
Treatment of property DES-PT-20b-LTLCardinality-11 finished in 8899 ms.
FORMULA DES-PT-20b-LTLCardinality-11 FALSE TECHNIQUES LENGTHENING_INSENSITIVE
[2024-05-22 00:13:31] [INFO ] Flatten gal took : 10 ms
All properties solved without resorting to exhaustive model-checking.
Total runtime 233327 ms.

BK_STOP 1716336812630

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

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

tar xzf /home/mcc/BenchKit/INPUTS/DES-PT-20b.tgz
mv DES-PT-20b execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "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 [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.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 '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
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 ;