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.r329-tall-171662362500552.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 ResAllocation-PT-R100C002, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r329-tall-171662362500552
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 896K
-rw-r--r-- 1 mcc users 9.3K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 100K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.3K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.7K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K May 19 07:14 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 19 16:23 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 23 07:48 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Apr 23 07:48 LTLFireability.xml
-rw-r--r-- 1 mcc users 10K Apr 11 23:21 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 97K Apr 11 23:21 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.4K Apr 11 23:19 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 78K Apr 11 23:19 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 23 07:48 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 23 07:48 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 9 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 422K May 18 16:43 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 ResAllocation-PT-R100C002-LTLCardinality-00
FORMULA_NAME ResAllocation-PT-R100C002-LTLCardinality-01
FORMULA_NAME ResAllocation-PT-R100C002-LTLCardinality-02
FORMULA_NAME ResAllocation-PT-R100C002-LTLCardinality-03
FORMULA_NAME ResAllocation-PT-R100C002-LTLCardinality-04
FORMULA_NAME ResAllocation-PT-R100C002-LTLCardinality-05
FORMULA_NAME ResAllocation-PT-R100C002-LTLCardinality-06
FORMULA_NAME ResAllocation-PT-R100C002-LTLCardinality-07
FORMULA_NAME ResAllocation-PT-R100C002-LTLCardinality-08
FORMULA_NAME ResAllocation-PT-R100C002-LTLCardinality-09
FORMULA_NAME ResAllocation-PT-R100C002-LTLCardinality-10
FORMULA_NAME ResAllocation-PT-R100C002-LTLCardinality-11
FORMULA_NAME ResAllocation-PT-R100C002-LTLCardinality-12
FORMULA_NAME ResAllocation-PT-R100C002-LTLCardinality-13
FORMULA_NAME ResAllocation-PT-R100C002-LTLCardinality-14
FORMULA_NAME ResAllocation-PT-R100C002-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1716865917979

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=ResAllocation-PT-R100C002
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202304061127
[2024-05-28 03:11:59] [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-28 03:11:59] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 03:11:59] [INFO ] Load time of PNML (sax parser for PT used): 87 ms
[2024-05-28 03:11:59] [INFO ] Transformed 400 places.
[2024-05-28 03:11:59] [INFO ] Transformed 202 transitions.
[2024-05-28 03:11:59] [INFO ] Found NUPN structural information;
[2024-05-28 03:11:59] [INFO ] Parsed PT model containing 400 places and 202 transitions and 1000 arcs in 148 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 8 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA ResAllocation-PT-R100C002-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ResAllocation-PT-R100C002-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ResAllocation-PT-R100C002-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ResAllocation-PT-R100C002-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ResAllocation-PT-R100C002-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ResAllocation-PT-R100C002-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ResAllocation-PT-R100C002-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 38 out of 400 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 400/400 places, 202/202 transitions.
Applied a total of 0 rules in 42 ms. Remains 400 /400 variables (removed 0) and now considering 202/202 (removed 0) transitions.
// Phase 1: matrix 202 rows 400 cols
[2024-05-28 03:12:00] [INFO ] Computed 200 invariants in 15 ms
[2024-05-28 03:12:00] [INFO ] Implicit Places using invariants in 398 ms returned [201, 203, 205, 207, 209, 211, 213, 215, 221, 223, 225, 227, 229, 233, 235, 237, 239, 241, 243, 245, 249, 251, 253, 255, 257, 259, 261, 263, 265, 267, 269, 271, 273, 277, 279, 281, 283, 285, 287, 289, 291, 293, 295, 299, 301, 303, 305, 307, 309, 311, 315, 317, 319, 323, 325, 327, 329, 331, 333, 335, 337, 339, 341, 343, 345, 347, 349, 351, 353, 355, 357, 361, 363, 365, 367, 369, 371, 373, 375, 377, 379, 381, 383, 385, 387, 389, 391, 393, 395, 397, 399]
Discarding 91 places :
Implicit Place search using SMT only with invariants took 619 ms to find 91 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 309/400 places, 202/202 transitions.
Applied a total of 0 rules in 14 ms. Remains 309 /309 variables (removed 0) and now considering 202/202 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 677 ms. Remains : 309/400 places, 202/202 transitions.
Support contains 38 out of 309 places after structural reductions.
[2024-05-28 03:12:00] [INFO ] Flatten gal took : 45 ms
[2024-05-28 03:12:00] [INFO ] Flatten gal took : 23 ms
[2024-05-28 03:12:00] [INFO ] Input system was already deterministic with 202 transitions.
Incomplete random walk after 10000 steps, including 3 resets, run finished after 481 ms. (steps per millisecond=20 ) properties (out of 20) seen :13
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
// Phase 1: matrix 202 rows 309 cols
[2024-05-28 03:12:01] [INFO ] Computed 109 invariants in 11 ms
[2024-05-28 03:12:01] [INFO ] [Real]Absence check using 109 positive place invariants in 17 ms returned sat
[2024-05-28 03:12:01] [INFO ] After 413ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2024-05-28 03:12:01] [INFO ] [Nat]Absence check using 109 positive place invariants in 15 ms returned sat
[2024-05-28 03:12:02] [INFO ] After 219ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2024-05-28 03:12:02] [INFO ] Deduced a trap composed of 4 places in 46 ms of which 5 ms to minimize.
[2024-05-28 03:12:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 72 ms
[2024-05-28 03:12:02] [INFO ] Deduced a trap composed of 5 places in 23 ms of which 1 ms to minimize.
[2024-05-28 03:12:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 50 ms
[2024-05-28 03:12:02] [INFO ] After 523ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 112 ms.
[2024-05-28 03:12:02] [INFO ] After 799ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
Fused 7 Parikh solutions to 6 different solutions.
Parikh walk visited 6 properties in 95 ms.
Support contains 2 out of 309 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 309/309 places, 202/202 transitions.
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 0 with 4 rules applied. Total rules applied 4 place count 307 transition count 200
Free-agglomeration rule applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 6 place count 307 transition count 198
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 10 place count 303 transition count 198
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 3 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 14 place count 301 transition count 196
Free-agglomeration rule applied 2 times.
Iterating global reduction 1 with 2 rules applied. Total rules applied 16 place count 301 transition count 194
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 20 place count 297 transition count 194
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 4 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 24 place count 295 transition count 192
Free-agglomeration rule applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 26 place count 295 transition count 190
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 30 place count 291 transition count 190
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 3 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 34 place count 289 transition count 188
Free-agglomeration rule applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 36 place count 289 transition count 186
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 40 place count 285 transition count 186
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 4 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 44 place count 283 transition count 184
Free-agglomeration rule applied 2 times.
Iterating global reduction 4 with 2 rules applied. Total rules applied 46 place count 283 transition count 182
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 50 place count 279 transition count 182
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 54 place count 277 transition count 180
Free-agglomeration rule applied 2 times.
Iterating global reduction 5 with 2 rules applied. Total rules applied 56 place count 277 transition count 178
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 60 place count 273 transition count 178
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 3 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 64 place count 271 transition count 176
Free-agglomeration rule applied 2 times.
Iterating global reduction 6 with 2 rules applied. Total rules applied 66 place count 271 transition count 174
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 70 place count 267 transition count 174
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 4 rules applied. Total rules applied 74 place count 265 transition count 172
Free-agglomeration rule applied 2 times.
Iterating global reduction 7 with 2 rules applied. Total rules applied 76 place count 265 transition count 170
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 7 with 4 rules applied. Total rules applied 80 place count 261 transition count 170
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 8 with 5 rules applied. Total rules applied 85 place count 258 transition count 168
Free-agglomeration rule applied 2 times.
Iterating global reduction 8 with 2 rules applied. Total rules applied 87 place count 258 transition count 166
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 8 with 4 rules applied. Total rules applied 91 place count 254 transition count 166
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 3 places and 0 transitions.
Iterating global reduction 9 with 5 rules applied. Total rules applied 96 place count 251 transition count 164
Free-agglomeration rule applied 2 times.
Iterating global reduction 9 with 2 rules applied. Total rules applied 98 place count 251 transition count 162
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 9 with 4 rules applied. Total rules applied 102 place count 247 transition count 162
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 10 with 4 rules applied. Total rules applied 106 place count 245 transition count 160
Free-agglomeration rule applied 2 times.
Iterating global reduction 10 with 2 rules applied. Total rules applied 108 place count 245 transition count 158
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 10 with 4 rules applied. Total rules applied 112 place count 241 transition count 158
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 11 with 4 rules applied. Total rules applied 116 place count 239 transition count 156
Free-agglomeration rule applied 2 times.
Iterating global reduction 11 with 2 rules applied. Total rules applied 118 place count 239 transition count 154
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 11 with 4 rules applied. Total rules applied 122 place count 235 transition count 154
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 12 with 4 rules applied. Total rules applied 126 place count 233 transition count 152
Free-agglomeration rule applied 2 times.
Iterating global reduction 12 with 2 rules applied. Total rules applied 128 place count 233 transition count 150
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 12 with 4 rules applied. Total rules applied 132 place count 229 transition count 150
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 13 with 4 rules applied. Total rules applied 136 place count 227 transition count 148
Free-agglomeration rule applied 2 times.
Iterating global reduction 13 with 2 rules applied. Total rules applied 138 place count 227 transition count 146
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 13 with 4 rules applied. Total rules applied 142 place count 223 transition count 146
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 14 with 4 rules applied. Total rules applied 146 place count 221 transition count 144
Free-agglomeration rule applied 2 times.
Iterating global reduction 14 with 2 rules applied. Total rules applied 148 place count 221 transition count 142
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 14 with 4 rules applied. Total rules applied 152 place count 217 transition count 142
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 15 with 5 rules applied. Total rules applied 157 place count 214 transition count 140
Free-agglomeration rule applied 2 times.
Iterating global reduction 15 with 2 rules applied. Total rules applied 159 place count 214 transition count 138
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 15 with 4 rules applied. Total rules applied 163 place count 210 transition count 138
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 16 with 4 rules applied. Total rules applied 167 place count 208 transition count 136
Free-agglomeration rule applied 2 times.
Iterating global reduction 16 with 2 rules applied. Total rules applied 169 place count 208 transition count 134
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 16 with 4 rules applied. Total rules applied 173 place count 204 transition count 134
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 17 with 2 rules applied. Total rules applied 175 place count 203 transition count 133
Free-agglomeration rule applied 2 times.
Iterating global reduction 17 with 2 rules applied. Total rules applied 177 place count 203 transition count 131
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 17 with 3 rules applied. Total rules applied 180 place count 200 transition count 131
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 18 with 2 rules applied. Total rules applied 182 place count 199 transition count 130
Free-agglomeration rule applied 1 times.
Iterating global reduction 18 with 1 rules applied. Total rules applied 183 place count 199 transition count 129
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 18 with 2 rules applied. Total rules applied 185 place count 197 transition count 129
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 19 with 2 rules applied. Total rules applied 187 place count 196 transition count 128
Free-agglomeration rule applied 1 times.
Iterating global reduction 19 with 1 rules applied. Total rules applied 188 place count 196 transition count 127
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 19 with 2 rules applied. Total rules applied 190 place count 194 transition count 127
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 20 with 2 rules applied. Total rules applied 192 place count 193 transition count 126
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 20 with 1 rules applied. Total rules applied 193 place count 193 transition count 125
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 20 with 3 rules applied. Total rules applied 196 place count 190 transition count 125
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 21 with 2 rules applied. Total rules applied 198 place count 189 transition count 124
Free-agglomeration rule applied 1 times.
Iterating global reduction 21 with 1 rules applied. Total rules applied 199 place count 189 transition count 123
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 21 with 2 rules applied. Total rules applied 201 place count 187 transition count 123
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 22 with 2 rules applied. Total rules applied 203 place count 186 transition count 122
Free-agglomeration rule applied 1 times.
Iterating global reduction 22 with 1 rules applied. Total rules applied 204 place count 186 transition count 121
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 22 with 2 rules applied. Total rules applied 206 place count 184 transition count 121
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 23 with 2 rules applied. Total rules applied 208 place count 183 transition count 120
Free-agglomeration rule applied 1 times.
Iterating global reduction 23 with 1 rules applied. Total rules applied 209 place count 183 transition count 119
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 23 with 2 rules applied. Total rules applied 211 place count 181 transition count 119
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 24 with 2 rules applied. Total rules applied 213 place count 180 transition count 118
Free-agglomeration rule applied 1 times.
Iterating global reduction 24 with 1 rules applied. Total rules applied 214 place count 180 transition count 117
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 24 with 2 rules applied. Total rules applied 216 place count 178 transition count 117
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 25 with 2 rules applied. Total rules applied 218 place count 177 transition count 116
Free-agglomeration rule applied 1 times.
Iterating global reduction 25 with 1 rules applied. Total rules applied 219 place count 177 transition count 115
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 25 with 2 rules applied. Total rules applied 221 place count 175 transition count 115
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 26 with 2 rules applied. Total rules applied 223 place count 174 transition count 114
Free-agglomeration rule applied 1 times.
Iterating global reduction 26 with 1 rules applied. Total rules applied 224 place count 174 transition count 113
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 26 with 2 rules applied. Total rules applied 226 place count 172 transition count 113
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 27 with 2 rules applied. Total rules applied 228 place count 171 transition count 112
Free-agglomeration rule applied 1 times.
Iterating global reduction 27 with 1 rules applied. Total rules applied 229 place count 171 transition count 111
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 27 with 2 rules applied. Total rules applied 231 place count 169 transition count 111
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 28 with 2 rules applied. Total rules applied 233 place count 168 transition count 110
Free-agglomeration rule applied 1 times.
Iterating global reduction 28 with 1 rules applied. Total rules applied 234 place count 168 transition count 109
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 28 with 2 rules applied. Total rules applied 236 place count 166 transition count 109
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 29 with 2 rules applied. Total rules applied 238 place count 165 transition count 108
Free-agglomeration rule applied 1 times.
Iterating global reduction 29 with 1 rules applied. Total rules applied 239 place count 165 transition count 107
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 29 with 2 rules applied. Total rules applied 241 place count 163 transition count 107
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 30 with 2 rules applied. Total rules applied 243 place count 162 transition count 106
Free-agglomeration rule applied 1 times.
Iterating global reduction 30 with 1 rules applied. Total rules applied 244 place count 162 transition count 105
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 30 with 2 rules applied. Total rules applied 246 place count 160 transition count 105
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 31 with 2 rules applied. Total rules applied 248 place count 159 transition count 104
Free-agglomeration rule applied 1 times.
Iterating global reduction 31 with 1 rules applied. Total rules applied 249 place count 159 transition count 103
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 31 with 2 rules applied. Total rules applied 251 place count 157 transition count 103
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 32 with 2 rules applied. Total rules applied 253 place count 156 transition count 102
Free-agglomeration rule applied 1 times.
Iterating global reduction 32 with 1 rules applied. Total rules applied 254 place count 156 transition count 101
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 32 with 2 rules applied. Total rules applied 256 place count 154 transition count 101
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 33 with 2 rules applied. Total rules applied 258 place count 153 transition count 100
Free-agglomeration rule applied 1 times.
Iterating global reduction 33 with 1 rules applied. Total rules applied 259 place count 153 transition count 99
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 33 with 2 rules applied. Total rules applied 261 place count 151 transition count 99
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 34 with 2 rules applied. Total rules applied 263 place count 150 transition count 98
Free-agglomeration rule applied 1 times.
Iterating global reduction 34 with 1 rules applied. Total rules applied 264 place count 150 transition count 97
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 34 with 2 rules applied. Total rules applied 266 place count 148 transition count 97
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 35 with 2 rules applied. Total rules applied 268 place count 147 transition count 96
Free-agglomeration rule applied 1 times.
Iterating global reduction 35 with 1 rules applied. Total rules applied 269 place count 147 transition count 95
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 35 with 2 rules applied. Total rules applied 271 place count 145 transition count 95
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 36 with 2 rules applied. Total rules applied 273 place count 144 transition count 94
Free-agglomeration rule applied 1 times.
Iterating global reduction 36 with 1 rules applied. Total rules applied 274 place count 144 transition count 93
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 36 with 2 rules applied. Total rules applied 276 place count 142 transition count 93
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 37 with 2 rules applied. Total rules applied 278 place count 141 transition count 92
Free-agglomeration rule applied 1 times.
Iterating global reduction 37 with 1 rules applied. Total rules applied 279 place count 141 transition count 91
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 37 with 2 rules applied. Total rules applied 281 place count 139 transition count 91
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 38 with 2 rules applied. Total rules applied 283 place count 138 transition count 90
Free-agglomeration rule applied 1 times.
Iterating global reduction 38 with 1 rules applied. Total rules applied 284 place count 138 transition count 89
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 38 with 2 rules applied. Total rules applied 286 place count 136 transition count 89
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 39 with 2 rules applied. Total rules applied 288 place count 135 transition count 88
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 39 with 1 rules applied. Total rules applied 289 place count 135 transition count 87
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 39 with 3 rules applied. Total rules applied 292 place count 132 transition count 87
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 40 with 2 rules applied. Total rules applied 294 place count 131 transition count 86
Free-agglomeration rule applied 1 times.
Iterating global reduction 40 with 1 rules applied. Total rules applied 295 place count 131 transition count 85
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 40 with 2 rules applied. Total rules applied 297 place count 129 transition count 85
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 41 with 2 rules applied. Total rules applied 299 place count 128 transition count 84
Free-agglomeration rule applied 1 times.
Iterating global reduction 41 with 1 rules applied. Total rules applied 300 place count 128 transition count 83
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 41 with 2 rules applied. Total rules applied 302 place count 126 transition count 83
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 42 with 2 rules applied. Total rules applied 304 place count 125 transition count 82
Free-agglomeration rule applied 1 times.
Iterating global reduction 42 with 1 rules applied. Total rules applied 305 place count 125 transition count 81
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 42 with 2 rules applied. Total rules applied 307 place count 123 transition count 81
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 43 with 2 rules applied. Total rules applied 309 place count 122 transition count 80
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 43 with 1 rules applied. Total rules applied 310 place count 122 transition count 79
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 43 with 3 rules applied. Total rules applied 313 place count 119 transition count 79
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 44 with 2 rules applied. Total rules applied 315 place count 118 transition count 78
Free-agglomeration rule applied 1 times.
Iterating global reduction 44 with 1 rules applied. Total rules applied 316 place count 118 transition count 77
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 44 with 2 rules applied. Total rules applied 318 place count 116 transition count 77
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 45 with 2 rules applied. Total rules applied 320 place count 115 transition count 76
Free-agglomeration rule applied 1 times.
Iterating global reduction 45 with 1 rules applied. Total rules applied 321 place count 115 transition count 75
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 45 with 2 rules applied. Total rules applied 323 place count 113 transition count 75
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 46 with 2 rules applied. Total rules applied 325 place count 112 transition count 74
Free-agglomeration rule applied 1 times.
Iterating global reduction 46 with 1 rules applied. Total rules applied 326 place count 112 transition count 73
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 46 with 2 rules applied. Total rules applied 328 place count 110 transition count 73
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 47 with 2 rules applied. Total rules applied 330 place count 109 transition count 72
Free-agglomeration rule applied 1 times.
Iterating global reduction 47 with 1 rules applied. Total rules applied 331 place count 109 transition count 71
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 47 with 2 rules applied. Total rules applied 333 place count 107 transition count 71
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 48 with 2 rules applied. Total rules applied 335 place count 106 transition count 70
Free-agglomeration rule applied 1 times.
Iterating global reduction 48 with 1 rules applied. Total rules applied 336 place count 106 transition count 69
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 48 with 2 rules applied. Total rules applied 338 place count 104 transition count 69
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 49 with 2 rules applied. Total rules applied 340 place count 103 transition count 68
Free-agglomeration rule applied 1 times.
Iterating global reduction 49 with 1 rules applied. Total rules applied 341 place count 103 transition count 67
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 49 with 2 rules applied. Total rules applied 343 place count 101 transition count 67
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 50 with 2 rules applied. Total rules applied 345 place count 100 transition count 66
Free-agglomeration rule applied 1 times.
Iterating global reduction 50 with 1 rules applied. Total rules applied 346 place count 100 transition count 65
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 50 with 2 rules applied. Total rules applied 348 place count 98 transition count 65
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 51 with 2 rules applied. Total rules applied 350 place count 97 transition count 64
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 51 with 1 rules applied. Total rules applied 351 place count 97 transition count 63
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 51 with 3 rules applied. Total rules applied 354 place count 94 transition count 63
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 52 with 2 rules applied. Total rules applied 356 place count 93 transition count 62
Free-agglomeration rule applied 1 times.
Iterating global reduction 52 with 1 rules applied. Total rules applied 357 place count 93 transition count 61
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 52 with 2 rules applied. Total rules applied 359 place count 91 transition count 61
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 53 with 2 rules applied. Total rules applied 361 place count 90 transition count 60
Free-agglomeration rule applied 1 times.
Iterating global reduction 53 with 1 rules applied. Total rules applied 362 place count 90 transition count 59
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 53 with 2 rules applied. Total rules applied 364 place count 88 transition count 59
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 54 with 2 rules applied. Total rules applied 366 place count 87 transition count 58
Free-agglomeration rule applied 1 times.
Iterating global reduction 54 with 1 rules applied. Total rules applied 367 place count 87 transition count 57
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 54 with 2 rules applied. Total rules applied 369 place count 85 transition count 57
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 55 with 2 rules applied. Total rules applied 371 place count 84 transition count 56
Free-agglomeration rule applied 1 times.
Iterating global reduction 55 with 1 rules applied. Total rules applied 372 place count 84 transition count 55
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 55 with 2 rules applied. Total rules applied 374 place count 82 transition count 55
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 56 with 2 rules applied. Total rules applied 376 place count 81 transition count 54
Free-agglomeration rule applied 1 times.
Iterating global reduction 56 with 1 rules applied. Total rules applied 377 place count 81 transition count 53
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 56 with 2 rules applied. Total rules applied 379 place count 79 transition count 53
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 57 with 2 rules applied. Total rules applied 381 place count 78 transition count 52
Free-agglomeration rule applied 1 times.
Iterating global reduction 57 with 1 rules applied. Total rules applied 382 place count 78 transition count 51
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 57 with 2 rules applied. Total rules applied 384 place count 76 transition count 51
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 58 with 2 rules applied. Total rules applied 386 place count 75 transition count 50
Free-agglomeration rule applied 1 times.
Iterating global reduction 58 with 1 rules applied. Total rules applied 387 place count 75 transition count 49
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 58 with 2 rules applied. Total rules applied 389 place count 73 transition count 49
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 59 with 2 rules applied. Total rules applied 391 place count 72 transition count 48
Free-agglomeration rule applied 1 times.
Iterating global reduction 59 with 1 rules applied. Total rules applied 392 place count 72 transition count 47
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 59 with 2 rules applied. Total rules applied 394 place count 70 transition count 47
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 60 with 2 rules applied. Total rules applied 396 place count 69 transition count 46
Free-agglomeration rule applied 1 times.
Iterating global reduction 60 with 1 rules applied. Total rules applied 397 place count 69 transition count 45
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 60 with 2 rules applied. Total rules applied 399 place count 67 transition count 45
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 61 with 2 rules applied. Total rules applied 401 place count 66 transition count 44
Free-agglomeration rule applied 1 times.
Iterating global reduction 61 with 1 rules applied. Total rules applied 402 place count 66 transition count 43
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 61 with 2 rules applied. Total rules applied 404 place count 64 transition count 43
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 62 with 2 rules applied. Total rules applied 406 place count 63 transition count 42
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 62 with 1 rules applied. Total rules applied 407 place count 63 transition count 41
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 62 with 3 rules applied. Total rules applied 410 place count 60 transition count 41
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 63 with 2 rules applied. Total rules applied 412 place count 59 transition count 40
Free-agglomeration rule applied 1 times.
Iterating global reduction 63 with 1 rules applied. Total rules applied 413 place count 59 transition count 39
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 63 with 2 rules applied. Total rules applied 415 place count 57 transition count 39
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 64 with 2 rules applied. Total rules applied 417 place count 56 transition count 38
Free-agglomeration rule applied 1 times.
Iterating global reduction 64 with 1 rules applied. Total rules applied 418 place count 56 transition count 37
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 64 with 2 rules applied. Total rules applied 420 place count 54 transition count 37
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 65 with 2 rules applied. Total rules applied 422 place count 53 transition count 36
Free-agglomeration rule applied 1 times.
Iterating global reduction 65 with 1 rules applied. Total rules applied 423 place count 53 transition count 35
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 65 with 2 rules applied. Total rules applied 425 place count 51 transition count 35
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 66 with 2 rules applied. Total rules applied 427 place count 50 transition count 34
Free-agglomeration rule applied 1 times.
Iterating global reduction 66 with 1 rules applied. Total rules applied 428 place count 50 transition count 33
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 66 with 2 rules applied. Total rules applied 430 place count 48 transition count 33
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 67 with 2 rules applied. Total rules applied 432 place count 47 transition count 32
Free-agglomeration rule applied 1 times.
Iterating global reduction 67 with 1 rules applied. Total rules applied 433 place count 47 transition count 31
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 67 with 2 rules applied. Total rules applied 435 place count 45 transition count 31
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 68 with 2 rules applied. Total rules applied 437 place count 44 transition count 30
Free-agglomeration rule applied 1 times.
Iterating global reduction 68 with 1 rules applied. Total rules applied 438 place count 44 transition count 29
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 68 with 2 rules applied. Total rules applied 440 place count 42 transition count 29
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 69 with 2 rules applied. Total rules applied 442 place count 41 transition count 28
Free-agglomeration rule applied 1 times.
Iterating global reduction 69 with 1 rules applied. Total rules applied 443 place count 41 transition count 27
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 69 with 2 rules applied. Total rules applied 445 place count 39 transition count 27
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 70 with 2 rules applied. Total rules applied 447 place count 38 transition count 26
Free-agglomeration rule applied 1 times.
Iterating global reduction 70 with 1 rules applied. Total rules applied 448 place count 38 transition count 25
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 70 with 2 rules applied. Total rules applied 450 place count 36 transition count 25
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 71 with 2 rules applied. Total rules applied 452 place count 35 transition count 24
Free-agglomeration rule applied 1 times.
Iterating global reduction 71 with 1 rules applied. Total rules applied 453 place count 35 transition count 23
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 71 with 2 rules applied. Total rules applied 455 place count 33 transition count 23
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 72 with 2 rules applied. Total rules applied 457 place count 32 transition count 22
Free-agglomeration rule applied 1 times.
Iterating global reduction 72 with 1 rules applied. Total rules applied 458 place count 32 transition count 21
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 72 with 2 rules applied. Total rules applied 460 place count 30 transition count 21
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 73 with 2 rules applied. Total rules applied 462 place count 29 transition count 20
Free-agglomeration rule applied 1 times.
Iterating global reduction 73 with 1 rules applied. Total rules applied 463 place count 29 transition count 19
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 73 with 2 rules applied. Total rules applied 465 place count 27 transition count 19
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 74 with 2 rules applied. Total rules applied 467 place count 26 transition count 18
Free-agglomeration rule applied 1 times.
Iterating global reduction 74 with 1 rules applied. Total rules applied 468 place count 26 transition count 17
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 74 with 2 rules applied. Total rules applied 470 place count 24 transition count 17
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 75 with 2 rules applied. Total rules applied 472 place count 23 transition count 16
Free-agglomeration rule applied 1 times.
Iterating global reduction 75 with 1 rules applied. Total rules applied 473 place count 23 transition count 15
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 75 with 2 rules applied. Total rules applied 475 place count 21 transition count 15
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 76 with 2 rules applied. Total rules applied 477 place count 20 transition count 14
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 76 with 1 rules applied. Total rules applied 478 place count 20 transition count 13
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 76 with 3 rules applied. Total rules applied 481 place count 17 transition count 13
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 77 with 2 rules applied. Total rules applied 483 place count 16 transition count 12
Free-agglomeration rule applied 1 times.
Iterating global reduction 77 with 1 rules applied. Total rules applied 484 place count 16 transition count 11
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 77 with 2 rules applied. Total rules applied 486 place count 14 transition count 11
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 78 with 2 rules applied. Total rules applied 488 place count 13 transition count 10
Free-agglomeration rule applied 1 times.
Iterating global reduction 78 with 1 rules applied. Total rules applied 489 place count 13 transition count 9
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 78 with 2 rules applied. Total rules applied 491 place count 11 transition count 9
Applied a total of 491 rules in 441 ms. Remains 11 /309 variables (removed 298) and now considering 9/202 (removed 193) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 441 ms. Remains : 11/309 places, 9/202 transitions.
Finished random walk after 97 steps, including 16 resets, run visited all 1 properties in 1 ms. (steps per millisecond=97 )
Parikh walk visited 0 properties in 0 ms.
FORMULA ResAllocation-PT-R100C002-LTLCardinality-00 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 309 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 309/309 places, 202/202 transitions.
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 0 with 4 rules applied. Total rules applied 4 place count 307 transition count 200
Applied a total of 4 rules in 16 ms. Remains 307 /309 variables (removed 2) and now considering 200/202 (removed 2) transitions.
// Phase 1: matrix 200 rows 307 cols
[2024-05-28 03:12:03] [INFO ] Computed 109 invariants in 4 ms
[2024-05-28 03:12:03] [INFO ] Implicit Places using invariants in 190 ms returned [207, 209, 216, 225, 240, 252, 261, 266, 286]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 191 ms to find 9 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 298/309 places, 200/202 transitions.
Applied a total of 0 rules in 4 ms. Remains 298 /298 variables (removed 0) and now considering 200/200 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 211 ms. Remains : 298/309 places, 200/202 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 201 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ResAllocation-PT-R100C002-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s273 0) (EQ s98 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 460 reset in 425 ms.
Product exploration explored 100000 steps with 455 reset in 399 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 71 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 76 ms :[(NOT p0), (NOT p0)]
Finished random walk after 185 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=61 )
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 143 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 55 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 58 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 298 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 298/298 places, 200/200 transitions.
Applied a total of 0 rules in 4 ms. Remains 298 /298 variables (removed 0) and now considering 200/200 (removed 0) transitions.
// Phase 1: matrix 200 rows 298 cols
[2024-05-28 03:12:05] [INFO ] Computed 100 invariants in 1 ms
[2024-05-28 03:12:05] [INFO ] Implicit Places using invariants in 232 ms returned []
[2024-05-28 03:12:05] [INFO ] Invariant cache hit.
[2024-05-28 03:12:05] [INFO ] Implicit Places using invariants and state equation in 374 ms returned []
Implicit Place search using SMT with State Equation took 611 ms to find 0 implicit places.
[2024-05-28 03:12:05] [INFO ] Redundant transitions in 8 ms returned []
[2024-05-28 03:12:05] [INFO ] Invariant cache hit.
[2024-05-28 03:12:05] [INFO ] Dead Transitions using invariants and state equation in 129 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 757 ms. Remains : 298/298 places, 200/200 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 60 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
Finished random walk after 217 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=72 )
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 83 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 58 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 60 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 468 reset in 292 ms.
Product exploration explored 100000 steps with 466 reset in 348 ms.
Built C files in :
/tmp/ltsmin15800176138821816403
[2024-05-28 03:12:07] [INFO ] Computing symmetric may disable matrix : 200 transitions.
[2024-05-28 03:12:07] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 03:12:07] [INFO ] Computing symmetric may enable matrix : 200 transitions.
[2024-05-28 03:12:07] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 03:12:07] [INFO ] Computing Do-Not-Accords matrix : 200 transitions.
[2024-05-28 03:12:07] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 03:12:07] [INFO ] Built C files in 32ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15800176138821816403
Running compilation step : cd /tmp/ltsmin15800176138821816403;'/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 478 ms.
Running link step : cd /tmp/ltsmin15800176138821816403;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 42 ms.
Running LTSmin : cd /tmp/ltsmin15800176138821816403;'/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/stateBased4782878211695486745.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 298 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 298/298 places, 200/200 transitions.
Applied a total of 0 rules in 9 ms. Remains 298 /298 variables (removed 0) and now considering 200/200 (removed 0) transitions.
[2024-05-28 03:12:22] [INFO ] Invariant cache hit.
[2024-05-28 03:12:22] [INFO ] Implicit Places using invariants in 166 ms returned []
[2024-05-28 03:12:22] [INFO ] Invariant cache hit.
[2024-05-28 03:12:22] [INFO ] Implicit Places using invariants and state equation in 369 ms returned []
Implicit Place search using SMT with State Equation took 542 ms to find 0 implicit places.
[2024-05-28 03:12:22] [INFO ] Redundant transitions in 6 ms returned []
[2024-05-28 03:12:22] [INFO ] Invariant cache hit.
[2024-05-28 03:12:22] [INFO ] Dead Transitions using invariants and state equation in 129 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 698 ms. Remains : 298/298 places, 200/200 transitions.
Built C files in :
/tmp/ltsmin11248812280127988680
[2024-05-28 03:12:22] [INFO ] Computing symmetric may disable matrix : 200 transitions.
[2024-05-28 03:12:22] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 03:12:22] [INFO ] Computing symmetric may enable matrix : 200 transitions.
[2024-05-28 03:12:22] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 03:12:22] [INFO ] Computing Do-Not-Accords matrix : 200 transitions.
[2024-05-28 03:12:22] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 03:12:22] [INFO ] Built C files in 21ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11248812280127988680
Running compilation step : cd /tmp/ltsmin11248812280127988680;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 389 ms.
Running link step : cd /tmp/ltsmin11248812280127988680;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin11248812280127988680;'/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/stateBased10498524827594009739.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-28 03:12:38] [INFO ] Flatten gal took : 15 ms
[2024-05-28 03:12:38] [INFO ] Flatten gal took : 13 ms
[2024-05-28 03:12:38] [INFO ] Time to serialize gal into /tmp/LTL10334927206111697454.gal : 41 ms
[2024-05-28 03:12:38] [INFO ] Time to serialize properties into /tmp/LTL10845383885021454667.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL10334927206111697454.gal' '-t' 'CGAL' '-hoa' '/tmp/aut326796771496984835.hoa' '-atoms' '/tmp/LTL10845383885021454667.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/LTL10845383885021454667.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut326796771496984835.hoa
Reverse transition relation is NOT exact ! Due to transitions t99.t100, t102.t101, Intersection with reachable at each step enabled. (destroyed/reverse/in...182
Computing Next relation with stutter on 99 deadlock states
Detected timeout of ITS tools.
[2024-05-28 03:12:53] [INFO ] Flatten gal took : 12 ms
[2024-05-28 03:12:53] [INFO ] Flatten gal took : 12 ms
[2024-05-28 03:12:53] [INFO ] Time to serialize gal into /tmp/LTL17880132736839474230.gal : 3 ms
[2024-05-28 03:12:53] [INFO ] Time to serialize properties into /tmp/LTL5734183535207090768.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/LTL17880132736839474230.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5734183535207090768.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((G(F("((p_1_75==0)||(p_0_49==1))"))))
Formula 0 simplified : FG!"((p_1_75==0)||(p_0_49==1))"
Reverse transition relation is NOT exact ! Due to transitions t99.t100, t102.t101, Intersection with reachable at each step enabled. (destroyed/reverse/in...182
Computing Next relation with stutter on 99 deadlock states
Detected timeout of ITS tools.
[2024-05-28 03:13:08] [INFO ] Flatten gal took : 16 ms
[2024-05-28 03:13:08] [INFO ] Applying decomposition
[2024-05-28 03:13:08] [INFO ] Flatten gal took : 12 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/graph12440497896155866432.txt' '-o' '/tmp/graph12440497896155866432.bin' '-w' '/tmp/graph12440497896155866432.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph12440497896155866432.bin' '-l' '-1' '-v' '-w' '/tmp/graph12440497896155866432.weights' '-q' '0' '-e' '0.001'
[2024-05-28 03:13:08] [INFO ] Decomposing Gal with order
[2024-05-28 03:13:08] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 03:13:08] [INFO ] Flatten gal took : 91 ms
[2024-05-28 03:13:08] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 3 ms.
[2024-05-28 03:13:08] [INFO ] Time to serialize gal into /tmp/LTL9326240151258625841.gal : 5 ms
[2024-05-28 03:13:08] [INFO ] Time to serialize properties into /tmp/LTL12960699724147977544.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL9326240151258625841.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12960699724147977544.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((G(F("((i12.u75.p_1_75==0)||(i7.u49.p_0_49==1))"))))
Formula 0 simplified : FG!"((i12.u75.p_1_75==0)||(i7.u49.p_0_49==1))"
Reverse transition relation is NOT exact ! Due to transitions i0.t102_t101, i15.t99_t100, Intersection with reachable at each step enabled. (destroyed/rev...189
Computing Next relation with stutter on 99 deadlock states
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin3286524600480249899
[2024-05-28 03:13:23] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3286524600480249899
Running compilation step : cd /tmp/ltsmin3286524600480249899;'/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 334 ms.
Running link step : cd /tmp/ltsmin3286524600480249899;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin3286524600480249899;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](<>((LTLAPp0==true)))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property ResAllocation-PT-R100C002-LTLCardinality-04 finished in 95245 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)||(X((F(p2)&&G(p3)))&&p1))))'
Support contains 6 out of 309 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 309/309 places, 202/202 transitions.
Applied a total of 0 rules in 3 ms. Remains 309 /309 variables (removed 0) and now considering 202/202 (removed 0) transitions.
// Phase 1: matrix 202 rows 309 cols
[2024-05-28 03:13:38] [INFO ] Computed 109 invariants in 2 ms
[2024-05-28 03:13:38] [INFO ] Implicit Places using invariants in 169 ms returned [209, 211, 218, 227, 242, 254, 263, 288]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 170 ms to find 8 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 301/309 places, 202/202 transitions.
Applied a total of 0 rules in 2 ms. Remains 301 /301 variables (removed 0) and now considering 202/202 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 177 ms. Remains : 301/309 places, 202/202 transitions.
Stuttering acceptance computed with spot in 229 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p3))]
Running random walk in product with property : ResAllocation-PT-R100C002-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=(AND p0 (NOT p1)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=0 dest: 0}, { cond=(AND p0 p1), acceptance={0} source=0 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={0, 1} source=0 dest: 1}], [{ cond=(AND p0 (NOT p1) (NOT p3)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p0) (NOT p1) (NOT p3)), acceptance={0, 1} source=1 dest: 0}, { cond=(AND p0 p1 (NOT p3)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) p1 (NOT p3)), acceptance={0, 1} source=1 dest: 1}, { cond=(AND (NOT p2) p3), acceptance={} source=1 dest: 2}, { cond=(AND p0 p3), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p0) p3), acceptance={1} source=1 dest: 3}], [{ cond=(AND p0 (NOT p2)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0, 1} source=2 dest: 2}], [{ cond=(AND p0 (NOT p1) (NOT p3)), acceptance={0} source=3 dest: 0}, { cond=(AND (NOT p0) (NOT p1) (NOT p3)), acceptance={0, 1} source=3 dest: 0}, { cond=(AND p0 p1 (NOT p3)), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p0) p1 (NOT p3)), acceptance={0, 1} source=3 dest: 1}, { cond=(AND p0 p3), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p0) p3), acceptance={1} source=3 dest: 3}]], initial=0, aps=[p0:(OR (EQ s155 0) (EQ s261 1)), p1:(AND (EQ s243 0) (EQ s181 1)), p3:(AND (EQ s32 0) (EQ s159 1)), p2:(AND (EQ s261 0) (EQ s155 1))], nbAcceptance=2, 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 187 reset in 391 ms.
Product exploration explored 100000 steps with 192 reset in 406 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1 p3 (NOT p2)), (X (NOT (AND p0 p1 (NOT p3)))), (X (NOT (AND (NOT p0) p3))), (X (AND p0 p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND (NOT p2) p3)), (X (NOT (AND (NOT p0) p1 (NOT p3)))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 (NOT p1)))), (X (AND p0 p3)), (X (NOT (AND (NOT p0) (NOT p1) (NOT p3)))), (X (NOT (AND p0 (NOT p1) (NOT p3)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p2) p3))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND p0 p3))), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND p0 p1 (NOT p3))))), (X (X (NOT (AND (NOT p0) p3)))), (X (X (AND p0 p1))), (X (X (NOT (AND (NOT p0) p1 (NOT p3))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p3))))), (X (X (NOT (AND p0 (NOT p1) (NOT p3)))))]
False Knowledge obtained : []
Knowledge based reduction with 25 factoid took 144 ms. Reduced automaton from 4 states, 19 edges and 4 AP (stutter sensitive) to 4 states, 19 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 160 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p3))]
Incomplete random walk after 10000 steps, including 3 resets, run finished after 114 ms. (steps per millisecond=87 ) properties (out of 13) seen :12
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 202 rows 301 cols
[2024-05-28 03:13:40] [INFO ] Computed 101 invariants in 5 ms
[2024-05-28 03:13:40] [INFO ] After 60ms 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 p3 (NOT p2)), (X (NOT (AND p0 p1 (NOT p3)))), (X (NOT (AND (NOT p0) p3))), (X (AND p0 p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND (NOT p2) p3)), (X (NOT (AND (NOT p0) p1 (NOT p3)))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 (NOT p1)))), (X (AND p0 p3)), (X (NOT (AND (NOT p0) (NOT p1) (NOT p3)))), (X (NOT (AND p0 (NOT p1) (NOT p3)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p2) p3))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND p0 p3))), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND p0 p1 (NOT p3))))), (X (X (NOT (AND (NOT p0) p3)))), (X (X (AND p0 p1))), (X (X (NOT (AND (NOT p0) p1 (NOT p3))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p3))))), (X (X (NOT (AND p0 (NOT p1) (NOT p3))))), (G (NOT (AND (NOT p0) (NOT p2))))]
False Knowledge obtained : [(F (NOT (AND p3 (NOT p2)))), (F (AND (NOT p0) p1 (NOT p3))), (F (NOT (AND p0 p3))), (F (AND p0 (NOT p1) (NOT p3))), (F (AND (NOT p0) p1)), (F (AND p0 p1 (NOT p3))), (F (AND (NOT p0) (NOT p1) (NOT p3))), (F (AND p0 (NOT p1))), (F (NOT (AND p0 p1))), (F (AND (NOT p0) (NOT p1))), (F (NOT (AND p0 (NOT p2)))), (F (AND (NOT p0) p3))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 26 factoid took 542 ms. Reduced automaton from 4 states, 19 edges and 4 AP (stutter sensitive) to 2 states, 10 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 82 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p3))), (AND (NOT p0) (NOT p3))]
Stuttering acceptance computed with spot in 69 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p3))), (AND (NOT p0) (NOT p3))]
Support contains 6 out of 301 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 301/301 places, 202/202 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 299 transition count 200
Applied a total of 4 rules in 7 ms. Remains 299 /301 variables (removed 2) and now considering 200/202 (removed 2) transitions.
// Phase 1: matrix 200 rows 299 cols
[2024-05-28 03:13:41] [INFO ] Computed 101 invariants in 3 ms
[2024-05-28 03:13:41] [INFO ] Implicit Places using invariants in 200 ms returned []
[2024-05-28 03:13:41] [INFO ] Invariant cache hit.
[2024-05-28 03:13:41] [INFO ] Implicit Places using invariants and state equation in 377 ms returned []
Implicit Place search using SMT with State Equation took 580 ms to find 0 implicit places.
[2024-05-28 03:13:41] [INFO ] Redundant transitions in 7 ms returned []
[2024-05-28 03:13:41] [INFO ] Invariant cache hit.
[2024-05-28 03:13:41] [INFO ] Dead Transitions using invariants and state equation in 129 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 299/301 places, 200/202 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 734 ms. Remains : 299/301 places, 200/202 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1 p3), (X (NOT (AND p0 p1 (NOT p3)))), (X (NOT (AND (NOT p0) p3))), (X (AND p0 p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1 (NOT p3)))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 (NOT p1)))), (X (AND p0 p3)), (X (NOT (AND (NOT p0) (NOT p1) (NOT p3)))), (X (NOT (AND p0 (NOT p1) (NOT p3)))), (X (X (NOT (AND p0 p1 (NOT p3))))), (X (X (NOT (AND (NOT p0) p3)))), (X (X (AND p0 p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1 (NOT p3))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND p0 p3))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p3))))), (X (X (NOT (AND p0 (NOT p1) (NOT p3)))))]
False Knowledge obtained : []
Knowledge based reduction with 21 factoid took 208 ms. Reduced automaton from 2 states, 10 edges and 3 AP (stutter insensitive) to 2 states, 10 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 78 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p3))), (AND (NOT p0) (NOT p3))]
Finished random walk after 911 steps, including 0 resets, run visited all 10 properties in 11 ms. (steps per millisecond=82 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 p1 p3), (X (NOT (AND p0 p1 (NOT p3)))), (X (NOT (AND (NOT p0) p3))), (X (AND p0 p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1 (NOT p3)))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 (NOT p1)))), (X (AND p0 p3)), (X (NOT (AND (NOT p0) (NOT p1) (NOT p3)))), (X (NOT (AND p0 (NOT p1) (NOT p3)))), (X (X (NOT (AND p0 p1 (NOT p3))))), (X (X (NOT (AND (NOT p0) p3)))), (X (X (AND p0 p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1 (NOT p3))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND p0 p3))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p3))))), (X (X (NOT (AND p0 (NOT p1) (NOT p3)))))]
False Knowledge obtained : [(F (AND p0 (NOT p1) (NOT p3))), (F (AND (NOT p0) p1)), (F (NOT (AND p0 p3))), (F (AND (NOT p0) (NOT p1) (NOT p3))), (F (AND p0 (NOT p1))), (F (NOT (AND p0 p1))), (F (AND (NOT p0) (NOT p1))), (F (AND (NOT p0) p3)), (F (AND p0 p1 (NOT p3))), (F (AND (NOT p0) p1 (NOT p3)))]
Knowledge based reduction with 21 factoid took 734 ms. Reduced automaton from 2 states, 10 edges and 3 AP (stutter insensitive) to 2 states, 10 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 81 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p3))), (AND (NOT p0) (NOT p3))]
Stuttering acceptance computed with spot in 91 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p3))), (AND (NOT p0) (NOT p3))]
Stuttering acceptance computed with spot in 66 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p3))), (AND (NOT p0) (NOT p3))]
Product exploration explored 100000 steps with 38 reset in 394 ms.
Product exploration explored 100000 steps with 38 reset in 439 ms.
Built C files in :
/tmp/ltsmin1252629010550073390
[2024-05-28 03:13:44] [INFO ] Computing symmetric may disable matrix : 200 transitions.
[2024-05-28 03:13:44] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 03:13:44] [INFO ] Computing symmetric may enable matrix : 200 transitions.
[2024-05-28 03:13:44] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 03:13:44] [INFO ] Computing Do-Not-Accords matrix : 200 transitions.
[2024-05-28 03:13:44] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 03:13:44] [INFO ] Built C files in 15ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1252629010550073390
Running compilation step : cd /tmp/ltsmin1252629010550073390;'/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 400 ms.
Running link step : cd /tmp/ltsmin1252629010550073390;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin1252629010550073390;'/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/stateBased520188211825788086.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 6 out of 299 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 299/299 places, 200/200 transitions.
Applied a total of 0 rules in 11 ms. Remains 299 /299 variables (removed 0) and now considering 200/200 (removed 0) transitions.
[2024-05-28 03:13:59] [INFO ] Invariant cache hit.
[2024-05-28 03:13:59] [INFO ] Implicit Places using invariants in 164 ms returned []
[2024-05-28 03:13:59] [INFO ] Invariant cache hit.
[2024-05-28 03:13:59] [INFO ] Implicit Places using invariants and state equation in 361 ms returned []
Implicit Place search using SMT with State Equation took 527 ms to find 0 implicit places.
[2024-05-28 03:13:59] [INFO ] Redundant transitions in 5 ms returned []
[2024-05-28 03:13:59] [INFO ] Invariant cache hit.
[2024-05-28 03:13:59] [INFO ] Dead Transitions using invariants and state equation in 124 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 675 ms. Remains : 299/299 places, 200/200 transitions.
Built C files in :
/tmp/ltsmin8472296336740318582
[2024-05-28 03:13:59] [INFO ] Computing symmetric may disable matrix : 200 transitions.
[2024-05-28 03:13:59] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 03:13:59] [INFO ] Computing symmetric may enable matrix : 200 transitions.
[2024-05-28 03:13:59] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 03:13:59] [INFO ] Computing Do-Not-Accords matrix : 200 transitions.
[2024-05-28 03:13:59] [INFO ] Computation of Completed DNA matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 03:13:59] [INFO ] Built C files in 17ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8472296336740318582
Running compilation step : cd /tmp/ltsmin8472296336740318582;'/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/ltsmin8472296336740318582;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin8472296336740318582;'/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/stateBased5093233334965853172.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-28 03:14:15] [INFO ] Flatten gal took : 11 ms
[2024-05-28 03:14:15] [INFO ] Flatten gal took : 29 ms
[2024-05-28 03:14:15] [INFO ] Time to serialize gal into /tmp/LTL12319412699408585788.gal : 2 ms
[2024-05-28 03:14:15] [INFO ] Time to serialize properties into /tmp/LTL319123723925749479.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/LTL12319412699408585788.gal' '-t' 'CGAL' '-hoa' '/tmp/aut2634497809611694238.hoa' '-atoms' '/tmp/LTL319123723925749479.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...317
Loading property file /tmp/LTL319123723925749479.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut2634497809611694238.hoa
Reverse transition relation is NOT exact ! Due to transitions t99.t100, t102.t101, Intersection with reachable at each step enabled. (destroyed/reverse/in...182
Computing Next relation with stutter on 99 deadlock states
Detected timeout of ITS tools.
[2024-05-28 03:14:30] [INFO ] Flatten gal took : 10 ms
[2024-05-28 03:14:30] [INFO ] Flatten gal took : 9 ms
[2024-05-28 03:14:30] [INFO ] Time to serialize gal into /tmp/LTL5597117158345765244.gal : 2 ms
[2024-05-28 03:14:30] [INFO ] Time to serialize properties into /tmp/LTL6796869437127963628.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL5597117158345765244.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6796869437127963628.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((F((G("((r_0_77==0)||(r_1_60==1))"))||(("((p_1_43==0)&&(r_0_90==1))")&&(X((F("((r_1_60==0)&&(r_0_77==1))"))&&(G("((p_0_16==0)&&(r_0_...171
Formula 0 simplified : G(F!"((r_0_77==0)||(r_1_60==1))" & (!"((p_1_43==0)&&(r_0_90==1))" | X(G!"((r_1_60==0)&&(r_0_77==1))" | F!"((p_0_16==0)&&(r_0_79==1))...159
Reverse transition relation is NOT exact ! Due to transitions t99.t100, t102.t101, Intersection with reachable at each step enabled. (destroyed/reverse/in...182
Computing Next relation with stutter on 99 deadlock states
Detected timeout of ITS tools.
[2024-05-28 03:14:45] [INFO ] Flatten gal took : 13 ms
[2024-05-28 03:14:45] [INFO ] Applying decomposition
[2024-05-28 03:14:45] [INFO ] Flatten gal took : 9 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph14830804719323873889.txt' '-o' '/tmp/graph14830804719323873889.bin' '-w' '/tmp/graph14830804719323873889.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph14830804719323873889.bin' '-l' '-1' '-v' '-w' '/tmp/graph14830804719323873889.weights' '-q' '0' '-e' '0.001'
[2024-05-28 03:14:45] [INFO ] Decomposing Gal with order
[2024-05-28 03:14:45] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 03:14:45] [INFO ] Flatten gal took : 15 ms
[2024-05-28 03:14:45] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2024-05-28 03:14:45] [INFO ] Time to serialize gal into /tmp/LTL17717783949444691307.gal : 4 ms
[2024-05-28 03:14:45] [INFO ] Time to serialize properties into /tmp/LTL17184574218081290494.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/LTL17717783949444691307.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17184574218081290494.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !((F((G("((i11.u77.r_0_77==0)||(i8.u99.r_1_60==1))"))||(("((i5.u43.p_1_43==0)&&(i13.u90.r_0_90==1))")&&(X((F("((i8.u99.r_1_60==0)&&(i1...237
Formula 0 simplified : G(F!"((i11.u77.r_0_77==0)||(i8.u99.r_1_60==1))" & (!"((i5.u43.p_1_43==0)&&(i13.u90.r_0_90==1))" | X(G!"((i8.u99.r_1_60==0)&&(i11.u77...225
Reverse transition relation is NOT exact ! Due to transitions i0.i0.i0.t102_t101, i14.t99_t100, Intersection with reachable at each step enabled. (destroy...195
Computing Next relation with stutter on 99 deadlock states
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin13791452783268628947
[2024-05-28 03:15:00] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13791452783268628947
Running compilation step : cd /tmp/ltsmin13791452783268628947;'/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 349 ms.
Running link step : cd /tmp/ltsmin13791452783268628947;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin13791452783268628947;'/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))&&[]((LTLAPp3==true))))&&(LTLAPp1==true))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property ResAllocation-PT-R100C002-LTLCardinality-06 finished in 96718 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(p0))'
Support contains 2 out of 309 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 309/309 places, 202/202 transitions.
Applied a total of 0 rules in 3 ms. Remains 309 /309 variables (removed 0) and now considering 202/202 (removed 0) transitions.
// Phase 1: matrix 202 rows 309 cols
[2024-05-28 03:15:15] [INFO ] Computed 109 invariants in 1 ms
[2024-05-28 03:15:15] [INFO ] Implicit Places using invariants in 178 ms returned [209, 211, 218, 227, 242, 254, 263, 268, 288]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 180 ms to find 9 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 300/309 places, 202/202 transitions.
Applied a total of 0 rules in 3 ms. Remains 300 /300 variables (removed 0) and now considering 202/202 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 187 ms. Remains : 300/309 places, 202/202 transitions.
Stuttering acceptance computed with spot in 79 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : ResAllocation-PT-R100C002-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=1, aps=[p0:(OR (EQ s7 0) (EQ s69 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 406 ms.
Product exploration explored 100000 steps with 50000 reset in 427 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), true]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 16 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ResAllocation-PT-R100C002-LTLCardinality-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ResAllocation-PT-R100C002-LTLCardinality-07 finished in 1146 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(p0)&&(F(p1)||(!p2 U (p3||G(!p2))))))'
Support contains 8 out of 309 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 309/309 places, 202/202 transitions.
Applied a total of 0 rules in 4 ms. Remains 309 /309 variables (removed 0) and now considering 202/202 (removed 0) transitions.
[2024-05-28 03:15:16] [INFO ] Invariant cache hit.
[2024-05-28 03:15:16] [INFO ] Implicit Places using invariants in 176 ms returned [209, 211, 218, 227, 242, 254, 263, 268, 288]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 177 ms to find 9 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 300/309 places, 202/202 transitions.
Applied a total of 0 rules in 2 ms. Remains 300 /300 variables (removed 0) and now considering 202/202 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 184 ms. Remains : 300/309 places, 202/202 transitions.
Stuttering acceptance computed with spot in 191 ms :[(OR (NOT p0) (AND (NOT p1) p2 (NOT p3))), (NOT p0), (NOT p1), (AND (NOT p1) (NOT p3) p2), true]
Running random walk in product with property : ResAllocation-PT-R100C002-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) (NOT p3) p2), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p1) (NOT p3) (NOT p2)), acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={} source=1 dest: 4}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p3) p2), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p1) (NOT p3) (NOT p2)), acceptance={} source=3 dest: 3}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(AND (EQ s113 0) (EQ s142 1)), p3:(AND (OR (EQ s267 0) (EQ s185 1)) (NOT (OR (EQ s184 0) (EQ s158 1)))), p2:(OR (EQ s184 0) (EQ s158 1)), p0:(OR (EQ s0...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ResAllocation-PT-R100C002-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ResAllocation-PT-R100C002-LTLCardinality-08 finished in 392 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))))'
Support contains 3 out of 309 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 309/309 places, 202/202 transitions.
Applied a total of 0 rules in 4 ms. Remains 309 /309 variables (removed 0) and now considering 202/202 (removed 0) transitions.
[2024-05-28 03:15:16] [INFO ] Invariant cache hit.
[2024-05-28 03:15:17] [INFO ] Implicit Places using invariants in 177 ms returned [209, 211, 218, 242, 254, 263, 268, 288]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 180 ms to find 8 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 301/309 places, 202/202 transitions.
Applied a total of 0 rules in 2 ms. Remains 301 /301 variables (removed 0) and now considering 202/202 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 186 ms. Remains : 301/309 places, 202/202 transitions.
Stuttering acceptance computed with spot in 131 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ResAllocation-PT-R100C002-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(OR (EQ s224 0) (EQ s45 1) (EQ s7 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 525 steps with 0 reset in 6 ms.
FORMULA ResAllocation-PT-R100C002-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ResAllocation-PT-R100C002-LTLCardinality-09 finished in 336 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((((F(p2)||p1) U p3)||p0))))'
Support contains 5 out of 309 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 309/309 places, 202/202 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 307 transition count 200
Applied a total of 4 rules in 14 ms. Remains 307 /309 variables (removed 2) and now considering 200/202 (removed 2) transitions.
// Phase 1: matrix 200 rows 307 cols
[2024-05-28 03:15:17] [INFO ] Computed 109 invariants in 2 ms
[2024-05-28 03:15:17] [INFO ] Implicit Places using invariants in 164 ms returned [207, 225, 240, 252, 266, 286]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 165 ms to find 6 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 301/309 places, 200/202 transitions.
Applied a total of 0 rules in 5 ms. Remains 301 /301 variables (removed 0) and now considering 200/200 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 185 ms. Remains : 301/309 places, 200/202 transitions.
Stuttering acceptance computed with spot in 62 ms :[(AND (NOT p3) (NOT p0)), (AND (NOT p3) (NOT p0))]
Running random walk in product with property : ResAllocation-PT-R100C002-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p3) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p3) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p3:(OR (EQ s208 1) (EQ s215 0) (EQ s293 1)), p0:(OR (EQ s243 0) (EQ s257 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 38 reset in 363 ms.
Product exploration explored 100000 steps with 38 reset in 398 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p3 p0), (X (NOT (AND (NOT p3) (NOT p0)))), (X (X (NOT (AND (NOT p3) (NOT p0)))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 91 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 71 ms :[(AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3))]
Incomplete random walk after 10000 steps, including 3 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :0
Finished probabilistic random walk after 38867 steps, run visited all 1 properties in 171 ms. (steps per millisecond=227 )
Probabilistic random walk after 38867 steps, saw 27941 distinct states, run finished after 172 ms. (steps per millisecond=225 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p3 p0), (X (NOT (AND (NOT p3) (NOT p0)))), (X (X (NOT (AND (NOT p3) (NOT p0)))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p3)))]
Knowledge based reduction with 3 factoid took 87 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 84 ms :[(AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3))]
Stuttering acceptance computed with spot in 74 ms :[(AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3))]
Support contains 5 out of 301 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 301/301 places, 200/200 transitions.
Applied a total of 0 rules in 9 ms. Remains 301 /301 variables (removed 0) and now considering 200/200 (removed 0) transitions.
// Phase 1: matrix 200 rows 301 cols
[2024-05-28 03:15:18] [INFO ] Computed 103 invariants in 1 ms
[2024-05-28 03:15:19] [INFO ] Implicit Places using invariants in 164 ms returned []
[2024-05-28 03:15:19] [INFO ] Invariant cache hit.
[2024-05-28 03:15:19] [INFO ] Implicit Places using invariants and state equation in 389 ms returned []
Implicit Place search using SMT with State Equation took 555 ms to find 0 implicit places.
[2024-05-28 03:15:19] [INFO ] Redundant transitions in 2 ms returned []
[2024-05-28 03:15:19] [INFO ] Invariant cache hit.
[2024-05-28 03:15:19] [INFO ] Dead Transitions using invariants and state equation in 129 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 702 ms. Remains : 301/301 places, 200/200 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p3), (X (NOT (AND (NOT p0) (NOT p3)))), (X (X (NOT (AND (NOT p0) (NOT p3)))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 70 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 80 ms :[(AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3))]
Incomplete random walk after 10000 steps, including 3 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :0
Finished probabilistic random walk after 38867 steps, run visited all 1 properties in 169 ms. (steps per millisecond=229 )
Probabilistic random walk after 38867 steps, saw 27941 distinct states, run finished after 170 ms. (steps per millisecond=228 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 p3), (X (NOT (AND (NOT p0) (NOT p3)))), (X (X (NOT (AND (NOT p0) (NOT p3)))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p3)))]
Knowledge based reduction with 3 factoid took 87 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 64 ms :[(AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3))]
Stuttering acceptance computed with spot in 88 ms :[(AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3))]
Stuttering acceptance computed with spot in 97 ms :[(AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3))]
Product exploration explored 100000 steps with 38 reset in 353 ms.
Product exploration explored 100000 steps with 38 reset in 431 ms.
Built C files in :
/tmp/ltsmin4262873003278670985
[2024-05-28 03:15:21] [INFO ] Computing symmetric may disable matrix : 200 transitions.
[2024-05-28 03:15:21] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 03:15:21] [INFO ] Computing symmetric may enable matrix : 200 transitions.
[2024-05-28 03:15:21] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 03:15:21] [INFO ] Computing Do-Not-Accords matrix : 200 transitions.
[2024-05-28 03:15:21] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 03:15:21] [INFO ] Built C files in 12ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4262873003278670985
Running compilation step : cd /tmp/ltsmin4262873003278670985;'/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 402 ms.
Running link step : cd /tmp/ltsmin4262873003278670985;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 45 ms.
Running LTSmin : cd /tmp/ltsmin4262873003278670985;'/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/stateBased3610365870298138753.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 5 out of 301 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 301/301 places, 200/200 transitions.
Applied a total of 0 rules in 5 ms. Remains 301 /301 variables (removed 0) and now considering 200/200 (removed 0) transitions.
[2024-05-28 03:15:36] [INFO ] Invariant cache hit.
[2024-05-28 03:15:36] [INFO ] Implicit Places using invariants in 159 ms returned []
[2024-05-28 03:15:36] [INFO ] Invariant cache hit.
[2024-05-28 03:15:36] [INFO ] Implicit Places using invariants and state equation in 362 ms returned []
Implicit Place search using SMT with State Equation took 524 ms to find 0 implicit places.
[2024-05-28 03:15:36] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-28 03:15:36] [INFO ] Invariant cache hit.
[2024-05-28 03:15:36] [INFO ] Dead Transitions using invariants and state equation in 119 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 659 ms. Remains : 301/301 places, 200/200 transitions.
Built C files in :
/tmp/ltsmin13711888776243889005
[2024-05-28 03:15:37] [INFO ] Computing symmetric may disable matrix : 200 transitions.
[2024-05-28 03:15:37] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 03:15:37] [INFO ] Computing symmetric may enable matrix : 200 transitions.
[2024-05-28 03:15:37] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 03:15:37] [INFO ] Computing Do-Not-Accords matrix : 200 transitions.
[2024-05-28 03:15:37] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 03:15:37] [INFO ] Built C files in 16ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13711888776243889005
Running compilation step : cd /tmp/ltsmin13711888776243889005;'/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 410 ms.
Running link step : cd /tmp/ltsmin13711888776243889005;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin13711888776243889005;'/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/stateBased16424386545873273514.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-28 03:15:52] [INFO ] Flatten gal took : 10 ms
[2024-05-28 03:15:52] [INFO ] Flatten gal took : 8 ms
[2024-05-28 03:15:52] [INFO ] Time to serialize gal into /tmp/LTL17141048255866209841.gal : 2 ms
[2024-05-28 03:15:52] [INFO ] Time to serialize properties into /tmp/LTL6242229815893682155.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/LTL17141048255866209841.gal' '-t' 'CGAL' '-hoa' '/tmp/aut4273011223314062959.hoa' '-atoms' '/tmp/LTL6242229815893682155.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/LTL6242229815893682155.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut4273011223314062959.hoa
Reverse transition relation is NOT exact ! Due to transitions t99.t100, t102.t101, Intersection with reachable at each step enabled. (destroyed/reverse/in...182
Computing Next relation with stutter on 99 deadlock states
Detected timeout of ITS tools.
[2024-05-28 03:16:07] [INFO ] Flatten gal took : 10 ms
[2024-05-28 03:16:07] [INFO ] Flatten gal took : 9 ms
[2024-05-28 03:16:07] [INFO ] Time to serialize gal into /tmp/LTL1024949493925626041.gal : 2 ms
[2024-05-28 03:16:07] [INFO ] Time to serialize properties into /tmp/LTL12856668990476028128.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/LTL1024949493925626041.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12856668990476028128.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((G(F(("((p_1_43==0)||(r_1_56==1))")||((("((p_1_28==0)||(r_0_78==1))")||(F("((p_1_52==0)||(p_0_61==1))")))U("(((r_1_9==1)||(r_1_15==0...178
Formula 0 simplified : FG(!"((p_1_43==0)||(r_1_56==1))" & ((!"((p_1_28==0)||(r_0_78==1))" & G!"((p_1_52==0)||(p_0_61==1))") R !"(((r_1_9==1)||(r_1_15==0))|...171
Reverse transition relation is NOT exact ! Due to transitions t99.t100, t102.t101, Intersection with reachable at each step enabled. (destroyed/reverse/in...182
Computing Next relation with stutter on 99 deadlock states
Detected timeout of ITS tools.
[2024-05-28 03:16:22] [INFO ] Flatten gal took : 20 ms
[2024-05-28 03:16:22] [INFO ] Applying decomposition
[2024-05-28 03:16:22] [INFO ] Flatten gal took : 9 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph516936676849549616.txt' '-o' '/tmp/graph516936676849549616.bin' '-w' '/tmp/graph516936676849549616.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph516936676849549616.bin' '-l' '-1' '-v' '-w' '/tmp/graph516936676849549616.weights' '-q' '0' '-e' '0.001'
[2024-05-28 03:16:22] [INFO ] Decomposing Gal with order
[2024-05-28 03:16:22] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 03:16:22] [INFO ] Flatten gal took : 13 ms
[2024-05-28 03:16:22] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2024-05-28 03:16:22] [INFO ] Time to serialize gal into /tmp/LTL5773459307824825222.gal : 3 ms
[2024-05-28 03:16:22] [INFO ] Time to serialize properties into /tmp/LTL17945520486718012721.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL5773459307824825222.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17945520486718012721.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((G(F(("((i6.u43.p_1_43==0)||(i8.i0.i1.u102.r_1_56==1))")||((("((i4.i0.i0.u28.p_1_28==0)||(i12.u78.r_0_78==1))")||(F("((i7.u52.p_1_52...270
Formula 0 simplified : FG(!"((i6.u43.p_1_43==0)||(i8.i0.i1.u102.r_1_56==1))" & ((!"((i4.i0.i0.u28.p_1_28==0)||(i12.u78.r_0_78==1))" & G!"((i7.u52.p_1_52==0...263
Reverse transition relation is NOT exact ! Due to transitions i0.t102_t101, i14.i1.i1.t99_t100, Intersection with reachable at each step enabled. (destroy...195
Computing Next relation with stutter on 99 deadlock states
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin14327096950748252618
[2024-05-28 03:16:37] [INFO ] Built C files in 11ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14327096950748252618
Running compilation step : cd /tmp/ltsmin14327096950748252618;'/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 340 ms.
Running link step : cd /tmp/ltsmin14327096950748252618;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin14327096950748252618;'/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' '[](<>((((<>((LTLAPp2==true))||(LTLAPp1==true)) U (LTLAPp3==true))||(LTLAPp0==true))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property ResAllocation-PT-R100C002-LTLCardinality-11 finished in 95326 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((X(p1)&&p0)))'
Support contains 3 out of 309 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 309/309 places, 202/202 transitions.
Applied a total of 0 rules in 4 ms. Remains 309 /309 variables (removed 0) and now considering 202/202 (removed 0) transitions.
// Phase 1: matrix 202 rows 309 cols
[2024-05-28 03:16:52] [INFO ] Computed 109 invariants in 9 ms
[2024-05-28 03:16:52] [INFO ] Implicit Places using invariants in 182 ms returned [209, 211, 218, 227, 242, 254, 263, 268]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 183 ms to find 8 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 301/309 places, 202/202 transitions.
Applied a total of 0 rules in 2 ms. Remains 301 /301 variables (removed 0) and now considering 202/202 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 191 ms. Remains : 301/309 places, 202/202 transitions.
Stuttering acceptance computed with spot in 70 ms :[(OR (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : ResAllocation-PT-R100C002-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s41 0) (EQ s217 1)), p1:(EQ s280 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 2614 steps with 0 reset in 15 ms.
FORMULA ResAllocation-PT-R100C002-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ResAllocation-PT-R100C002-LTLCardinality-13 finished in 303 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 4 out of 309 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 309/309 places, 202/202 transitions.
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 0 with 4 rules applied. Total rules applied 4 place count 307 transition count 200
Applied a total of 4 rules in 9 ms. Remains 307 /309 variables (removed 2) and now considering 200/202 (removed 2) transitions.
// Phase 1: matrix 200 rows 307 cols
[2024-05-28 03:16:52] [INFO ] Computed 109 invariants in 1 ms
[2024-05-28 03:16:53] [INFO ] Implicit Places using invariants in 156 ms returned [209, 216, 225, 261, 266, 286]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 157 ms to find 6 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 301/309 places, 200/202 transitions.
Applied a total of 0 rules in 3 ms. Remains 301 /301 variables (removed 0) and now considering 200/200 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 170 ms. Remains : 301/309 places, 200/202 transitions.
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ResAllocation-PT-R100C002-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (OR (EQ s30 0) (EQ s249 1)) (OR (EQ s237 0) (EQ s207 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 53 reset in 410 ms.
Product exploration explored 100000 steps with 55 reset in 395 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 84 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 82 ms :[(NOT p0), (NOT p0)]
Finished random walk after 457 steps, including 0 resets, run visited all 1 properties in 6 ms. (steps per millisecond=76 )
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 88 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 61 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 55 ms :[(NOT p0), (NOT p0)]
Support contains 4 out of 301 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 301/301 places, 200/200 transitions.
Applied a total of 0 rules in 7 ms. Remains 301 /301 variables (removed 0) and now considering 200/200 (removed 0) transitions.
// Phase 1: matrix 200 rows 301 cols
[2024-05-28 03:16:54] [INFO ] Computed 103 invariants in 2 ms
[2024-05-28 03:16:54] [INFO ] Implicit Places using invariants in 150 ms returned []
[2024-05-28 03:16:54] [INFO ] Invariant cache hit.
[2024-05-28 03:16:54] [INFO ] Implicit Places using invariants and state equation in 367 ms returned []
Implicit Place search using SMT with State Equation took 521 ms to find 0 implicit places.
[2024-05-28 03:16:54] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-28 03:16:54] [INFO ] Invariant cache hit.
[2024-05-28 03:16:55] [INFO ] Dead Transitions using invariants and state equation in 137 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 678 ms. Remains : 301/301 places, 200/200 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 77 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 72 ms :[(NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 3 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 1) seen :0
Finished probabilistic random walk after 30530 steps, run visited all 1 properties in 115 ms. (steps per millisecond=265 )
Probabilistic random walk after 30530 steps, saw 23889 distinct states, run finished after 116 ms. (steps per millisecond=263 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 97 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 58 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 76 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 48 reset in 351 ms.
Product exploration explored 100000 steps with 51 reset in 398 ms.
Built C files in :
/tmp/ltsmin1128772752503009909
[2024-05-28 03:16:56] [INFO ] Computing symmetric may disable matrix : 200 transitions.
[2024-05-28 03:16:56] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 03:16:56] [INFO ] Computing symmetric may enable matrix : 200 transitions.
[2024-05-28 03:16:56] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 03:16:56] [INFO ] Computing Do-Not-Accords matrix : 200 transitions.
[2024-05-28 03:16:56] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 03:16:56] [INFO ] Built C files in 17ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1128772752503009909
Running compilation step : cd /tmp/ltsmin1128772752503009909;'/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 418 ms.
Running link step : cd /tmp/ltsmin1128772752503009909;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin1128772752503009909;'/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/stateBased15969460099843639204.hoa' '--buchi-type=spotba'
LTSmin run took 1093 ms.
FORMULA ResAllocation-PT-R100C002-LTLCardinality-14 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property ResAllocation-PT-R100C002-LTLCardinality-14 finished in 5156 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)))'
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)||(X((F(p2)&&G(p3)))&&p1))))'
Found a Shortening insensitive property : ResAllocation-PT-R100C002-LTLCardinality-06
Stuttering acceptance computed with spot in 184 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p3))]
Support contains 6 out of 309 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 309/309 places, 202/202 transitions.
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 0 with 4 rules applied. Total rules applied 4 place count 307 transition count 200
Applied a total of 4 rules in 14 ms. Remains 307 /309 variables (removed 2) and now considering 200/202 (removed 2) transitions.
// Phase 1: matrix 200 rows 307 cols
[2024-05-28 03:16:58] [INFO ] Computed 109 invariants in 1 ms
[2024-05-28 03:16:58] [INFO ] Implicit Places using invariants in 150 ms returned [207, 209, 216, 225, 240, 252, 261, 286]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 151 ms to find 8 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 299/309 places, 200/202 transitions.
Applied a total of 0 rules in 4 ms. Remains 299 /299 variables (removed 0) and now considering 200/200 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 170 ms. Remains : 299/309 places, 200/202 transitions.
Running random walk in product with property : ResAllocation-PT-R100C002-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=(AND p0 (NOT p1)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=0 dest: 0}, { cond=(AND p0 p1), acceptance={0} source=0 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={0, 1} source=0 dest: 1}], [{ cond=(AND p0 (NOT p1) (NOT p3)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p0) (NOT p1) (NOT p3)), acceptance={0, 1} source=1 dest: 0}, { cond=(AND p0 p1 (NOT p3)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) p1 (NOT p3)), acceptance={0, 1} source=1 dest: 1}, { cond=(AND (NOT p2) p3), acceptance={} source=1 dest: 2}, { cond=(AND p0 p3), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p0) p3), acceptance={1} source=1 dest: 3}], [{ cond=(AND p0 (NOT p2)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0, 1} source=2 dest: 2}], [{ cond=(AND p0 (NOT p1) (NOT p3)), acceptance={0} source=3 dest: 0}, { cond=(AND (NOT p0) (NOT p1) (NOT p3)), acceptance={0, 1} source=3 dest: 0}, { cond=(AND p0 p1 (NOT p3)), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p0) p1 (NOT p3)), acceptance={0, 1} source=3 dest: 1}, { cond=(AND p0 p3), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p0) p3), acceptance={1} source=3 dest: 3}]], initial=0, aps=[p0:(OR (EQ s155 0) (EQ s259 1)), p1:(AND (EQ s241 0) (EQ s181 1)), p3:(AND (EQ s32 0) (EQ s159 1)), p2:(AND (EQ s259 0) (EQ s155 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, cl-invariant], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 215 reset in 335 ms.
Product exploration explored 100000 steps with 213 reset in 386 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1 p3 (NOT p2)), (X (NOT (AND p0 p1 (NOT p3)))), (X (NOT (AND (NOT p0) p3))), (X (AND p0 p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND (NOT p2) p3)), (X (NOT (AND (NOT p0) p1 (NOT p3)))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 (NOT p1)))), (X (AND p0 p3)), (X (NOT (AND (NOT p0) (NOT p1) (NOT p3)))), (X (NOT (AND p0 (NOT p1) (NOT p3)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p2) p3))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND p0 p3))), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND p0 p1 (NOT p3))))), (X (X (NOT (AND (NOT p0) p3)))), (X (X (AND p0 p1))), (X (X (NOT (AND (NOT p0) p1 (NOT p3))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p3))))), (X (X (NOT (AND p0 (NOT p1) (NOT p3)))))]
False Knowledge obtained : []
Knowledge based reduction with 25 factoid took 153 ms. Reduced automaton from 4 states, 19 edges and 4 AP (stutter sensitive) to 4 states, 19 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 209 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p3))]
Incomplete random walk after 10000 steps, including 3 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 13) seen :12
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 200 rows 299 cols
[2024-05-28 03:16:59] [INFO ] Computed 101 invariants in 3 ms
[2024-05-28 03:16:59] [INFO ] After 54ms 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 p3 (NOT p2)), (X (NOT (AND p0 p1 (NOT p3)))), (X (NOT (AND (NOT p0) p3))), (X (AND p0 p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND (NOT p2) p3)), (X (NOT (AND (NOT p0) p1 (NOT p3)))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 (NOT p1)))), (X (AND p0 p3)), (X (NOT (AND (NOT p0) (NOT p1) (NOT p3)))), (X (NOT (AND p0 (NOT p1) (NOT p3)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p2) p3))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND p0 p3))), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND p0 p1 (NOT p3))))), (X (X (NOT (AND (NOT p0) p3)))), (X (X (AND p0 p1))), (X (X (NOT (AND (NOT p0) p1 (NOT p3))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p3))))), (X (X (NOT (AND p0 (NOT p1) (NOT p3))))), (G (NOT (AND (NOT p0) (NOT p2))))]
False Knowledge obtained : [(F (NOT (AND p3 (NOT p2)))), (F (AND (NOT p0) p1 (NOT p3))), (F (NOT (AND p0 p3))), (F (AND p0 (NOT p1) (NOT p3))), (F (AND (NOT p0) p1)), (F (AND p0 p1 (NOT p3))), (F (AND (NOT p0) (NOT p1) (NOT p3))), (F (AND p0 (NOT p1))), (F (NOT (AND p0 p1))), (F (AND (NOT p0) (NOT p1))), (F (NOT (AND p0 (NOT p2)))), (F (AND (NOT p0) p3))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 26 factoid took 515 ms. Reduced automaton from 4 states, 19 edges and 4 AP (stutter sensitive) to 2 states, 10 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 82 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p3))), (AND (NOT p0) (NOT p3))]
Stuttering acceptance computed with spot in 87 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p3))), (AND (NOT p0) (NOT p3))]
Support contains 6 out of 299 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 299/299 places, 200/200 transitions.
Applied a total of 0 rules in 7 ms. Remains 299 /299 variables (removed 0) and now considering 200/200 (removed 0) transitions.
[2024-05-28 03:17:00] [INFO ] Invariant cache hit.
[2024-05-28 03:17:00] [INFO ] Implicit Places using invariants in 154 ms returned []
[2024-05-28 03:17:00] [INFO ] Invariant cache hit.
[2024-05-28 03:17:01] [INFO ] Implicit Places using invariants and state equation in 371 ms returned []
Implicit Place search using SMT with State Equation took 532 ms to find 0 implicit places.
[2024-05-28 03:17:01] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-28 03:17:01] [INFO ] Invariant cache hit.
[2024-05-28 03:17:01] [INFO ] Dead Transitions using invariants and state equation in 120 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 671 ms. Remains : 299/299 places, 200/200 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1 p3), (X (NOT (AND p0 p1 (NOT p3)))), (X (NOT (AND (NOT p0) p3))), (X (AND p0 p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1 (NOT p3)))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 (NOT p1)))), (X (AND p0 p3)), (X (NOT (AND (NOT p0) (NOT p1) (NOT p3)))), (X (NOT (AND p0 (NOT p1) (NOT p3)))), (X (X (NOT (AND p0 p1 (NOT p3))))), (X (X (NOT (AND (NOT p0) p3)))), (X (X (AND p0 p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1 (NOT p3))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND p0 p3))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p3))))), (X (X (NOT (AND p0 (NOT p1) (NOT p3)))))]
False Knowledge obtained : []
Knowledge based reduction with 21 factoid took 273 ms. Reduced automaton from 2 states, 10 edges and 3 AP (stutter insensitive) to 2 states, 10 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 94 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p3))), (AND (NOT p0) (NOT p3))]
Finished random walk after 758 steps, including 0 resets, run visited all 10 properties in 20 ms. (steps per millisecond=37 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 p1 p3), (X (NOT (AND p0 p1 (NOT p3)))), (X (NOT (AND (NOT p0) p3))), (X (AND p0 p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1 (NOT p3)))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 (NOT p1)))), (X (AND p0 p3)), (X (NOT (AND (NOT p0) (NOT p1) (NOT p3)))), (X (NOT (AND p0 (NOT p1) (NOT p3)))), (X (X (NOT (AND p0 p1 (NOT p3))))), (X (X (NOT (AND (NOT p0) p3)))), (X (X (AND p0 p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1 (NOT p3))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND p0 p3))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p3))))), (X (X (NOT (AND p0 (NOT p1) (NOT p3)))))]
False Knowledge obtained : [(F (AND p0 (NOT p1) (NOT p3))), (F (AND (NOT p0) p1)), (F (NOT (AND p0 p3))), (F (AND (NOT p0) (NOT p1) (NOT p3))), (F (AND p0 (NOT p1))), (F (NOT (AND p0 p1))), (F (AND (NOT p0) (NOT p1))), (F (AND (NOT p0) p3)), (F (AND p0 p1 (NOT p3))), (F (AND (NOT p0) p1 (NOT p3)))]
Knowledge based reduction with 21 factoid took 749 ms. Reduced automaton from 2 states, 10 edges and 3 AP (stutter insensitive) to 2 states, 10 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 90 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p3))), (AND (NOT p0) (NOT p3))]
Stuttering acceptance computed with spot in 70 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p3))), (AND (NOT p0) (NOT p3))]
Stuttering acceptance computed with spot in 73 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p3))), (AND (NOT p0) (NOT p3))]
Product exploration explored 100000 steps with 38 reset in 388 ms.
Product exploration explored 100000 steps with 38 reset in 432 ms.
Built C files in :
/tmp/ltsmin1598160456288897333
[2024-05-28 03:17:03] [INFO ] Computing symmetric may disable matrix : 200 transitions.
[2024-05-28 03:17:03] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 03:17:03] [INFO ] Computing symmetric may enable matrix : 200 transitions.
[2024-05-28 03:17:03] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 03:17:03] [INFO ] Computing Do-Not-Accords matrix : 200 transitions.
[2024-05-28 03:17:03] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 03:17:03] [INFO ] Built C files in 12ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1598160456288897333
Running compilation step : cd /tmp/ltsmin1598160456288897333;'/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/ltsmin1598160456288897333;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin1598160456288897333;'/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/stateBased15663007000253215785.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 6 out of 299 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 299/299 places, 200/200 transitions.
Applied a total of 0 rules in 7 ms. Remains 299 /299 variables (removed 0) and now considering 200/200 (removed 0) transitions.
[2024-05-28 03:17:18] [INFO ] Invariant cache hit.
[2024-05-28 03:17:18] [INFO ] Implicit Places using invariants in 148 ms returned []
[2024-05-28 03:17:18] [INFO ] Invariant cache hit.
[2024-05-28 03:17:19] [INFO ] Implicit Places using invariants and state equation in 356 ms returned []
Implicit Place search using SMT with State Equation took 505 ms to find 0 implicit places.
[2024-05-28 03:17:19] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-28 03:17:19] [INFO ] Invariant cache hit.
[2024-05-28 03:17:19] [INFO ] Dead Transitions using invariants and state equation in 137 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 663 ms. Remains : 299/299 places, 200/200 transitions.
Built C files in :
/tmp/ltsmin8057826365344804173
[2024-05-28 03:17:19] [INFO ] Computing symmetric may disable matrix : 200 transitions.
[2024-05-28 03:17:19] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 03:17:19] [INFO ] Computing symmetric may enable matrix : 200 transitions.
[2024-05-28 03:17:19] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 03:17:19] [INFO ] Computing Do-Not-Accords matrix : 200 transitions.
[2024-05-28 03:17:19] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 03:17:19] [INFO ] Built C files in 16ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8057826365344804173
Running compilation step : cd /tmp/ltsmin8057826365344804173;'/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 402 ms.
Running link step : cd /tmp/ltsmin8057826365344804173;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin8057826365344804173;'/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/stateBased17687926967584890267.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-28 03:17:34] [INFO ] Flatten gal took : 7 ms
[2024-05-28 03:17:34] [INFO ] Flatten gal took : 6 ms
[2024-05-28 03:17:34] [INFO ] Time to serialize gal into /tmp/LTL8405237792551327629.gal : 1 ms
[2024-05-28 03:17:34] [INFO ] Time to serialize properties into /tmp/LTL12008819502549383055.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/LTL8405237792551327629.gal' '-t' 'CGAL' '-hoa' '/tmp/aut2339613198442424288.hoa' '-atoms' '/tmp/LTL12008819502549383055.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/LTL12008819502549383055.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut2339613198442424288.hoa
Reverse transition relation is NOT exact ! Due to transitions t99.t100, t102.t101, Intersection with reachable at each step enabled. (destroyed/reverse/in...182
Computing Next relation with stutter on 99 deadlock states
Detected timeout of ITS tools.
[2024-05-28 03:17:49] [INFO ] Flatten gal took : 7 ms
[2024-05-28 03:17:49] [INFO ] Flatten gal took : 7 ms
[2024-05-28 03:17:49] [INFO ] Time to serialize gal into /tmp/LTL1593803479113507166.gal : 1 ms
[2024-05-28 03:17:49] [INFO ] Time to serialize properties into /tmp/LTL15133497542006756946.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1593803479113507166.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15133497542006756946.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("((r_0_77==0)||(r_1_60==1))"))||(("((p_1_43==0)&&(r_0_90==1))")&&(X((F("((r_1_60==0)&&(r_0_77==1))"))&&(G("((p_0_16==0)&&(r_0_...171
Formula 0 simplified : G(F!"((r_0_77==0)||(r_1_60==1))" & (!"((p_1_43==0)&&(r_0_90==1))" | X(G!"((r_1_60==0)&&(r_0_77==1))" | F!"((p_0_16==0)&&(r_0_79==1))...159
Reverse transition relation is NOT exact ! Due to transitions t99.t100, t102.t101, Intersection with reachable at each step enabled. (destroyed/reverse/in...182
Computing Next relation with stutter on 99 deadlock states
Detected timeout of ITS tools.
[2024-05-28 03:18:04] [INFO ] Flatten gal took : 9 ms
[2024-05-28 03:18:04] [INFO ] Applying decomposition
[2024-05-28 03:18:04] [INFO ] Flatten gal took : 7 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/graph587605500253431861.txt' '-o' '/tmp/graph587605500253431861.bin' '-w' '/tmp/graph587605500253431861.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph587605500253431861.bin' '-l' '-1' '-v' '-w' '/tmp/graph587605500253431861.weights' '-q' '0' '-e' '0.001'
[2024-05-28 03:18:04] [INFO ] Decomposing Gal with order
[2024-05-28 03:18:04] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 03:18:04] [INFO ] Flatten gal took : 11 ms
[2024-05-28 03:18:04] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2024-05-28 03:18:04] [INFO ] Time to serialize gal into /tmp/LTL2638049467932116326.gal : 2 ms
[2024-05-28 03:18:04] [INFO ] Time to serialize properties into /tmp/LTL10301264130535736659.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL2638049467932116326.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10301264130535736659.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("((i11.u76.r_0_77==0)||(i8.u99.r_1_60==1))"))||(("((i5.i1.i0.u42.p_1_43==0)&&(i13.u89.r_0_90==1))")&&(X((F("((i8.u99.r_1_60==0...243
Formula 0 simplified : G(F!"((i11.u76.r_0_77==0)||(i8.u99.r_1_60==1))" & (!"((i5.i1.i0.u42.p_1_43==0)&&(i13.u89.r_0_90==1))" | X(G!"((i8.u99.r_1_60==0)&&(i...231
Reverse transition relation is NOT exact ! Due to transitions i0.t102_t101, i14.t99_t100, Intersection with reachable at each step enabled. (destroyed/rev...189
Computing Next relation with stutter on 99 deadlock states
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin11846897210854508082
[2024-05-28 03:18:19] [INFO ] Built C files in 10ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11846897210854508082
Running compilation step : cd /tmp/ltsmin11846897210854508082;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 355 ms.
Running link step : cd /tmp/ltsmin11846897210854508082;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin11846897210854508082;'/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))&&[]((LTLAPp3==true))))&&(LTLAPp1==true))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property ResAllocation-PT-R100C002-LTLCardinality-06 finished in 96548 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((((F(p2)||p1) U p3)||p0))))'
[2024-05-28 03:18:34] [INFO ] Flatten gal took : 10 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin9985363609357383346
[2024-05-28 03:18:34] [INFO ] Computing symmetric may disable matrix : 202 transitions.
[2024-05-28 03:18:34] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 03:18:34] [INFO ] Applying decomposition
[2024-05-28 03:18:34] [INFO ] Computing symmetric may enable matrix : 202 transitions.
[2024-05-28 03:18:34] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 03:18:34] [INFO ] Flatten gal took : 6 ms
[2024-05-28 03:18:34] [INFO ] Computing Do-Not-Accords matrix : 202 transitions.
[2024-05-28 03:18:34] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 03:18:34] [INFO ] Built C files in 18ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9985363609357383346
Running compilation step : cd /tmp/ltsmin9985363609357383346;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '240' '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'
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/graph12563569143447161566.txt' '-o' '/tmp/graph12563569143447161566.bin' '-w' '/tmp/graph12563569143447161566.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph12563569143447161566.bin' '-l' '-1' '-v' '-w' '/tmp/graph12563569143447161566.weights' '-q' '0' '-e' '0.001'
[2024-05-28 03:18:34] [INFO ] Decomposing Gal with order
[2024-05-28 03:18:34] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 03:18:34] [INFO ] Flatten gal took : 11 ms
[2024-05-28 03:18:34] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2024-05-28 03:18:34] [INFO ] Time to serialize gal into /tmp/LTLCardinality11983660184513794635.gal : 3 ms
[2024-05-28 03:18:34] [INFO ] Time to serialize properties into /tmp/LTLCardinality18011972212776401914.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/LTLCardinality11983660184513794635.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality18011972212776401914.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...278
Read 3 LTL properties
Checking formula 0 : !((G(F("((i10.u75.p_1_75==0)||(i6.i1.i1.u49.p_0_49==1))"))))
Formula 0 simplified : FG!"((i10.u75.p_1_75==0)||(i6.i1.i1.u49.p_0_49==1))"
Compilation finished in 400 ms.
Running link step : cd /tmp/ltsmin9985363609357383346;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin9985363609357383346;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[](<>((LTLAPp0==true)))' '--buchi-type=spotba'
Reverse transition relation is NOT exact ! Due to transitions i0.u0.t101, i14.u99.t100, Intersection with reachable at each step enabled. (destroyed/rever...187
Computing Next relation with stutter on 99 deadlock states
LTSmin run took 1186 ms.
FORMULA ResAllocation-PT-R100C002-LTLCardinality-04 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Running LTSmin : cd /tmp/ltsmin9985363609357383346;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>(([]((LTLAPp1==true))||(X((<>((LTLAPp3==true))&&[]((LTLAPp4==true))))&&(LTLAPp2==true))))' '--buchi-type=spotba'
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.001: Loading model from ./gal.so
pins2lts-mc-linux64( 0/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.005: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.005: LTL layer: formula: <>(([]((LTLAPp1==true))||(X((<>((LTLAPp3==true))&&[]((LTLAPp4==true))))&&(LTLAPp2==true))))
pins2lts-mc-linux64( 0/ 8), 0.005: "<>(([]((LTLAPp1==true))||(X((<>((LTLAPp3==true))&&[]((LTLAPp4==true))))&&(LTLAPp2==true))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 0/ 8), 0.005: Using Spin LTL semantics
pins2lts-mc-linux64( 7/ 8), 0.007: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.007: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.008: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.008: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.008: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.008: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.009: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.009: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.009: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.008: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.009: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.008: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.008: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.009: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.014: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.014: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.016: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.017: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.017: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.020: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.020: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.028: buchi has 9 states
pins2lts-mc-linux64( 0/ 8), 0.060: There are 212 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.060: State length is 310, there are 243 groups
pins2lts-mc-linux64( 0/ 8), 0.060: Running cndfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.060: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.060: Successor permutation: dynamic
pins2lts-mc-linux64( 0/ 8), 0.060: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 5/ 8), 0.126: [Blue] ~120 levels ~960 states ~3424 transitions
pins2lts-mc-linux64( 5/ 8), 0.174: [Blue] ~240 levels ~1920 states ~7096 transitions
pins2lts-mc-linux64( 5/ 8), 0.246: [Blue] ~480 levels ~3840 states ~15736 transitions
pins2lts-mc-linux64( 1/ 8), 0.362: [Blue] ~960 levels ~7680 states ~32800 transitions
pins2lts-mc-linux64( 2/ 8), 0.509: [Blue] ~1920 levels ~15360 states ~61424 transitions
pins2lts-mc-linux64( 2/ 8), 0.770: [Blue] ~3840 levels ~30720 states ~112952 transitions
pins2lts-mc-linux64( 2/ 8), 1.038: [Blue] ~3995 levels ~61440 states ~176640 transitions
pins2lts-mc-linux64( 2/ 8), 1.507: [Blue] ~3995 levels ~122880 states ~358272 transitions
pins2lts-mc-linux64( 2/ 8), 2.362: [Blue] ~3995 levels ~245760 states ~720064 transitions
pins2lts-mc-linux64( 2/ 8), 3.820: [Blue] ~3995 levels ~491520 states ~1442832 transitions
pins2lts-mc-linux64( 2/ 8), 6.368: [Blue] ~3995 levels ~983040 states ~3070808 transitions
pins2lts-mc-linux64( 2/ 8), 10.929: [Blue] ~3995 levels ~1966080 states ~6906776 transitions
pins2lts-mc-linux64( 2/ 8), 20.186: [Blue] ~3995 levels ~3932160 states ~14543456 transitions
pins2lts-mc-linux64( 2/ 8), 38.472: [Blue] ~3995 levels ~7864320 states ~29768712 transitions
pins2lts-mc-linux64( 2/ 8), 75.715: [Blue] ~3995 levels ~15728640 states ~59898224 transitions
pins2lts-mc-linux64( 5/ 8), 79.570: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 79.679:
pins2lts-mc-linux64( 0/ 8), 79.679: Explored 13379092 states 62673424 transitions, fanout: 4.684
pins2lts-mc-linux64( 0/ 8), 79.679: Total exploration time 79.610 sec (79.510 sec minimum, 79.535 sec on average)
pins2lts-mc-linux64( 0/ 8), 79.679: States per second: 168058, Transitions per second: 787256
pins2lts-mc-linux64( 0/ 8), 79.679:
pins2lts-mc-linux64( 0/ 8), 79.679: State space has 13444350 states, 272869 are accepting
pins2lts-mc-linux64( 0/ 8), 79.679: cndfs_1 (permutation: dynamic) stats:
pins2lts-mc-linux64( 0/ 8), 79.679: blue states: 13379092 (99.51%), transitions: 0 (per worker)
pins2lts-mc-linux64( 0/ 8), 79.679: red states: 0 (0.00%), bogus: 0 (0.00%), transitions: 0, waits: 0 (0.00 sec)
pins2lts-mc-linux64( 0/ 8), 79.679: all-red states: 1839751 (13.68%), bogus 43 (0.00%)
pins2lts-mc-linux64( 0/ 8), 79.679:
pins2lts-mc-linux64( 0/ 8), 79.679: Total memory used for local state coloring: 0.4MB
pins2lts-mc-linux64( 0/ 8), 79.679:
pins2lts-mc-linux64( 0/ 8), 79.679: Queue width: 8B, total height: 25471, memory: 0.19MB
pins2lts-mc-linux64( 0/ 8), 79.679: Tree memory: 358.6MB, 28.0 B/state, compr.: 2.3%
pins2lts-mc-linux64( 0/ 8), 79.679: Tree fill ratio (roots/leafs): 10.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 79.679: Stored 202 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 79.679: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 79.679: Est. total memory use: 358.8MB (~1024.2MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin9985363609357383346;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>(([]((LTLAPp1==true))||(X((<>((LTLAPp3==true))&&[]((LTLAPp4==true))))&&(LTLAPp2==true))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin9985363609357383346;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>(([]((LTLAPp1==true))||(X((<>((LTLAPp3==true))&&[]((LTLAPp4==true))))&&(LTLAPp2==true))))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:240)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:175)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:113)
at java.base/java.lang.Thread.run(Thread.java:833)
Detected timeout of ITS tools.
[2024-05-28 03:40:46] [INFO ] Applying decomposition
[2024-05-28 03:40:46] [INFO ] Flatten gal took : 7 ms
[2024-05-28 03:40:46] [INFO ] Decomposing Gal with order
[2024-05-28 03:40:46] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 03:40:46] [INFO ] Flatten gal took : 11 ms
[2024-05-28 03:40:46] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2024-05-28 03:40:46] [INFO ] Time to serialize gal into /tmp/LTLCardinality17370926961397395552.gal : 2 ms
[2024-05-28 03:40:46] [INFO ] Time to serialize properties into /tmp/LTLCardinality5940030335674686249.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality17370926961397395552.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality5940030335674686249.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 2 LTL properties
Checking formula 0 : !((F((G("((u23.r_0_77==0)||(u161.r_1_60==1))"))||(("((u57.p_1_43==0)&&(u10.r_0_90==1))")&&(X((F("((u161.r_1_60==0)&&(u23.r_0_77==1))")...205
Formula 0 simplified : G(F!"((u23.r_0_77==0)||(u161.r_1_60==1))" & (!"((u57.p_1_43==0)&&(u10.r_0_90==1))" | X(G!"((u161.r_1_60==0)&&(u23.r_0_77==1))" | F!"...193
Reverse transition relation is NOT exact ! Due to transitions u1.t100, u100.t101, Intersection with reachable at each step enabled. (destroyed/reverse/int...181
Computing Next relation with stutter on 99 deadlock states
10108 unique states visited
4127 strongly connected components in search stack
10110 transitions explored
10107 items max in DFS search stack
38869 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,388.735,12868800,1,0,3.06813e+07,256,2245,4.40243e+07,59,185,43980795
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA ResAllocation-PT-R100C002-LTLCardinality-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !((G(F(("((u57.p_1_43==0)||(u157.r_1_56==1))")||((("((u72.p_1_28==0)||(u22.r_0_78==1))")||(F("((u48.p_1_52==0)||(u39.p_0_61==1))")))U(...216
Formula 1 simplified : FG(!"((u57.p_1_43==0)||(u157.r_1_56==1))" & ((!"((u72.p_1_28==0)||(u22.r_0_78==1))" & G!"((u48.p_1_52==0)||(u39.p_0_61==1))") R !"((...209
Computing Next relation with stutter on 99 deadlock states
2 unique states visited
0 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
12226 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,511.026,12825592,1,0,3.06868e+07,256,2059,4.40302e+07,58,185,7538662
no accepting run found
Formula 1 is TRUE no accepting run found.
FORMULA ResAllocation-PT-R100C002-LTLCardinality-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Total runtime 2247499 ms.

BK_STOP 1716868167870

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
++ perl -pe 's/.*\.//g'
+ 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="ResAllocation-PT-R100C002"
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 ResAllocation-PT-R100C002, 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 r329-tall-171662362500552"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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