Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 828K
-rw-r--r-- 1 mcc users 8.8K Feb 25 15:36 CTLCardinality.txt
-rw-r--r-- 1 mcc users 95K Feb 25 15:36 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K Feb 25 15:34 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K Feb 25 15:34 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.7K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.0K Feb 25 16:45 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 16:45 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Feb 25 16:45 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K Feb 25 16:45 LTLFireability.xml
-rw-r--r-- 1 mcc users 6.6K Feb 25 15:39 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 55K Feb 25 15:39 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.1K Feb 25 15:38 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 64K Feb 25 15:38 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 16:45 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:45 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 9 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 422K Mar 5 18:23 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 1679035001963

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=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 202303021504
[2023-03-17 06:36:43] [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]
[2023-03-17 06:36:43] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-17 06:36:43] [INFO ] Load time of PNML (sax parser for PT used): 80 ms
[2023-03-17 06:36:43] [INFO ] Transformed 400 places.
[2023-03-17 06:36:43] [INFO ] Transformed 202 transitions.
[2023-03-17 06:36:43] [INFO ] Parsed PT model containing 400 places and 202 transitions and 1000 arcs in 141 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 7 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
FORMULA ResAllocation-PT-R100C002-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ResAllocation-PT-R100C002-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ResAllocation-PT-R100C002-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ResAllocation-PT-R100C002-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ResAllocation-PT-R100C002-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 48 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 36 ms. Remains 400 /400 variables (removed 0) and now considering 202/202 (removed 0) transitions.
// Phase 1: matrix 202 rows 400 cols
[2023-03-17 06:36:43] [INFO ] Computed 200 place invariants in 16 ms
[2023-03-17 06:36:44] [INFO ] Implicit Places using invariants in 557 ms returned [201, 203, 205, 207, 211, 213, 215, 217, 221, 227, 229, 233, 237, 241, 243, 245, 247, 249, 251, 253, 255, 257, 259, 261, 263, 265, 267, 269, 271, 273, 275, 277, 279, 283, 285, 287, 291, 293, 295, 297, 301, 303, 305, 307, 309, 315, 317, 319, 321, 327, 329, 331, 335, 341, 343, 345, 347, 351, 353, 355, 357, 359, 361, 363, 365, 369, 371, 373, 375, 377, 379, 383, 385, 387, 389, 391, 395, 397, 399]
Discarding 79 places :
Implicit Place search using SMT only with invariants took 581 ms to find 79 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 321/400 places, 202/202 transitions.
Applied a total of 0 rules in 14 ms. Remains 321 /321 variables (removed 0) and now considering 202/202 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 633 ms. Remains : 321/400 places, 202/202 transitions.
Support contains 48 out of 321 places after structural reductions.
[2023-03-17 06:36:44] [INFO ] Flatten gal took : 44 ms
[2023-03-17 06:36:44] [INFO ] Flatten gal took : 18 ms
[2023-03-17 06:36:44] [INFO ] Input system was already deterministic with 202 transitions.
Support contains 45 out of 321 places (down from 48) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 3 resets, run finished after 414 ms. (steps per millisecond=24 ) properties (out of 26) seen :10
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 16) seen :0
Running SMT prover for 16 properties.
// Phase 1: matrix 202 rows 321 cols
[2023-03-17 06:36:45] [INFO ] Computed 121 place invariants in 5 ms
[2023-03-17 06:36:45] [INFO ] [Real]Absence check using 121 positive place invariants in 14 ms returned sat
[2023-03-17 06:36:45] [INFO ] After 158ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0 real:14
[2023-03-17 06:36:45] [INFO ] [Nat]Absence check using 121 positive place invariants in 17 ms returned sat
[2023-03-17 06:36:45] [INFO ] After 197ms SMT Verify possible using state equation in natural domain returned unsat :8 sat :8
[2023-03-17 06:36:45] [INFO ] Deduced a trap composed of 4 places in 136 ms of which 3 ms to minimize.
[2023-03-17 06:36:45] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 159 ms
[2023-03-17 06:36:46] [INFO ] After 556ms SMT Verify possible using trap constraints in natural domain returned unsat :8 sat :8
Attempting to minimize the solution found.
Minimization took 110 ms.
[2023-03-17 06:36:46] [INFO ] After 852ms SMT Verify possible using all constraints in natural domain returned unsat :8 sat :8
Fused 16 Parikh solutions to 8 different solutions.
Parikh walk visited 4 properties in 89 ms.
Support contains 10 out of 321 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 321/321 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 319 transition count 200
Free-agglomeration rule applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 6 place count 319 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 315 transition count 198
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 1 with 4 rules applied. Total rules applied 14 place count 313 transition count 196
Free-agglomeration rule applied 2 times.
Iterating global reduction 1 with 2 rules applied. Total rules applied 16 place count 313 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 309 transition count 194
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 2 with 4 rules applied. Total rules applied 24 place count 307 transition count 192
Free-agglomeration rule applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 26 place count 307 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 303 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 301 transition count 188
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 35 place count 301 transition count 187
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 37 place count 299 transition count 187
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 2 places and 0 transitions.
Iterating global reduction 4 with 3 rules applied. Total rules applied 40 place count 297 transition count 186
Free-agglomeration rule applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 41 place count 297 transition count 185
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 43 place count 295 transition count 185
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 5 with 2 rules applied. Total rules applied 45 place count 294 transition count 184
Free-agglomeration rule applied 1 times.
Iterating global reduction 5 with 1 rules applied. Total rules applied 46 place count 294 transition count 183
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 48 place count 292 transition count 183
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 50 place count 291 transition count 182
Free-agglomeration rule applied 1 times.
Iterating global reduction 6 with 1 rules applied. Total rules applied 51 place count 291 transition count 181
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 53 place count 289 transition count 181
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 7 with 2 rules applied. Total rules applied 55 place count 288 transition count 180
Free-agglomeration rule applied 1 times.
Iterating global reduction 7 with 1 rules applied. Total rules applied 56 place count 288 transition count 179
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 58 place count 286 transition count 179
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 8 with 2 rules applied. Total rules applied 60 place count 285 transition count 178
Free-agglomeration rule applied 1 times.
Iterating global reduction 8 with 1 rules applied. Total rules applied 61 place count 285 transition count 177
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 8 with 2 rules applied. Total rules applied 63 place count 283 transition count 177
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 2 places and 0 transitions.
Iterating global reduction 9 with 3 rules applied. Total rules applied 66 place count 281 transition count 176
Free-agglomeration rule applied 1 times.
Iterating global reduction 9 with 1 rules applied. Total rules applied 67 place count 281 transition count 175
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 9 with 2 rules applied. Total rules applied 69 place count 279 transition count 175
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 10 with 2 rules applied. Total rules applied 71 place count 278 transition count 174
Free-agglomeration rule applied 1 times.
Iterating global reduction 10 with 1 rules applied. Total rules applied 72 place count 278 transition count 173
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 10 with 2 rules applied. Total rules applied 74 place count 276 transition count 173
Free-agglomeration rule applied 1 times.
Iterating global reduction 11 with 1 rules applied. Total rules applied 75 place count 276 transition count 172
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 11 with 1 rules applied. Total rules applied 76 place count 275 transition count 172
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 12 with 1 rules applied. Total rules applied 77 place count 275 transition count 171
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 12 with 3 rules applied. Total rules applied 80 place count 272 transition count 171
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 13 with 2 rules applied. Total rules applied 82 place count 271 transition count 170
Free-agglomeration rule applied 1 times.
Iterating global reduction 13 with 1 rules applied. Total rules applied 83 place count 271 transition count 169
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 13 with 2 rules applied. Total rules applied 85 place count 269 transition count 169
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 14 with 2 rules applied. Total rules applied 87 place count 268 transition count 168
Free-agglomeration rule applied 1 times.
Iterating global reduction 14 with 1 rules applied. Total rules applied 88 place count 268 transition count 167
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 14 with 2 rules applied. Total rules applied 90 place count 266 transition count 167
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 15 with 2 rules applied. Total rules applied 92 place count 265 transition count 166
Free-agglomeration rule applied 1 times.
Iterating global reduction 15 with 1 rules applied. Total rules applied 93 place count 265 transition count 165
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 15 with 2 rules applied. Total rules applied 95 place count 263 transition count 165
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 16 with 2 rules applied. Total rules applied 97 place count 262 transition count 164
Free-agglomeration rule applied 1 times.
Iterating global reduction 16 with 1 rules applied. Total rules applied 98 place count 262 transition count 163
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 16 with 2 rules applied. Total rules applied 100 place count 260 transition count 163
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 17 with 2 rules applied. Total rules applied 102 place count 259 transition count 162
Free-agglomeration rule applied 1 times.
Iterating global reduction 17 with 1 rules applied. Total rules applied 103 place count 259 transition count 161
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 17 with 2 rules applied. Total rules applied 105 place count 257 transition count 161
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 18 with 2 rules applied. Total rules applied 107 place count 256 transition count 160
Applied a total of 107 rules in 302 ms. Remains 256 /321 variables (removed 65) and now considering 160/202 (removed 42) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 302 ms. Remains : 256/321 places, 160/202 transitions.
Incomplete random walk after 10000 steps, including 6 resets, run finished after 167 ms. (steps per millisecond=59 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 4) 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 4) 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 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 727122 steps, run timeout after 3001 ms. (steps per millisecond=242 ) properties seen :{1=1, 2=1}
Probabilistic random walk after 727122 steps, saw 182279 distinct states, run finished after 3001 ms. (steps per millisecond=242 ) properties seen :2
Running SMT prover for 2 properties.
// Phase 1: matrix 160 rows 256 cols
[2023-03-17 06:36:49] [INFO ] Computed 98 place invariants in 6 ms
[2023-03-17 06:36:49] [INFO ] After 55ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-17 06:36:49] [INFO ] [Nat]Absence check using 98 positive place invariants in 11 ms returned sat
[2023-03-17 06:36:50] [INFO ] After 89ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-17 06:36:50] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 1 ms to minimize.
[2023-03-17 06:36:50] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 55 ms
[2023-03-17 06:36:50] [INFO ] After 171ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 26 ms.
[2023-03-17 06:36:50] [INFO ] After 257ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 7 ms.
Support contains 6 out of 256 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 256/256 places, 160/160 transitions.
Applied a total of 0 rules in 6 ms. Remains 256 /256 variables (removed 0) and now considering 160/160 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 256/256 places, 160/160 transitions.
Incomplete random walk after 10000 steps, including 6 resets, run finished after 97 ms. (steps per millisecond=103 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 732678 steps, run timeout after 3001 ms. (steps per millisecond=244 ) properties seen :{}
Probabilistic random walk after 732678 steps, saw 183390 distinct states, run finished after 3001 ms. (steps per millisecond=244 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-17 06:36:53] [INFO ] Invariant cache hit.
[2023-03-17 06:36:53] [INFO ] After 62ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-17 06:36:53] [INFO ] [Nat]Absence check using 98 positive place invariants in 12 ms returned sat
[2023-03-17 06:36:53] [INFO ] After 98ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-17 06:36:53] [INFO ] After 133ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 25 ms.
[2023-03-17 06:36:53] [INFO ] After 231ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 9 ms.
Support contains 6 out of 256 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 256/256 places, 160/160 transitions.
Applied a total of 0 rules in 12 ms. Remains 256 /256 variables (removed 0) and now considering 160/160 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 256/256 places, 160/160 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 256/256 places, 160/160 transitions.
Applied a total of 0 rules in 9 ms. Remains 256 /256 variables (removed 0) and now considering 160/160 (removed 0) transitions.
[2023-03-17 06:36:53] [INFO ] Invariant cache hit.
[2023-03-17 06:36:53] [INFO ] Implicit Places using invariants in 122 ms returned [165, 168, 171, 193, 198, 211, 213, 219, 221, 226, 229, 237, 247]
Discarding 13 places :
Implicit Place search using SMT only with invariants took 124 ms to find 13 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 243/256 places, 160/160 transitions.
Applied a total of 0 rules in 4 ms. Remains 243 /243 variables (removed 0) and now considering 160/160 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 140 ms. Remains : 243/256 places, 160/160 transitions.
Incomplete random walk after 10000 steps, including 6 resets, run finished after 114 ms. (steps per millisecond=87 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 835093 steps, run timeout after 3001 ms. (steps per millisecond=278 ) properties seen :{}
Probabilistic random walk after 835093 steps, saw 204825 distinct states, run finished after 3001 ms. (steps per millisecond=278 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 160 rows 243 cols
[2023-03-17 06:36:56] [INFO ] Computed 85 place invariants in 5 ms
[2023-03-17 06:36:56] [INFO ] After 53ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-17 06:36:57] [INFO ] [Nat]Absence check using 85 positive place invariants in 11 ms returned sat
[2023-03-17 06:36:57] [INFO ] After 92ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-17 06:36:57] [INFO ] After 126ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 27 ms.
[2023-03-17 06:36:57] [INFO ] After 227ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 8 ms.
Support contains 6 out of 243 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 243/243 places, 160/160 transitions.
Applied a total of 0 rules in 4 ms. Remains 243 /243 variables (removed 0) and now considering 160/160 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 243/243 places, 160/160 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 243/243 places, 160/160 transitions.
Applied a total of 0 rules in 4 ms. Remains 243 /243 variables (removed 0) and now considering 160/160 (removed 0) transitions.
[2023-03-17 06:36:57] [INFO ] Invariant cache hit.
[2023-03-17 06:36:57] [INFO ] Implicit Places using invariants in 115 ms returned []
[2023-03-17 06:36:57] [INFO ] Invariant cache hit.
[2023-03-17 06:36:57] [INFO ] Implicit Places using invariants and state equation in 199 ms returned []
Implicit Place search using SMT with State Equation took 316 ms to find 0 implicit places.
[2023-03-17 06:36:57] [INFO ] Redundant transitions in 4 ms returned []
[2023-03-17 06:36:57] [INFO ] Invariant cache hit.
[2023-03-17 06:36:57] [INFO ] Dead Transitions using invariants and state equation in 85 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 415 ms. Remains : 243/243 places, 160/160 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 241 transition count 160
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 1 with 2 rules applied. Total rules applied 4 place count 240 transition count 159
Free-agglomeration rule applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 5 place count 240 transition count 158
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 6 place count 239 transition count 158
Applied a total of 6 rules in 12 ms. Remains 239 /243 variables (removed 4) and now considering 158/160 (removed 2) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 158 rows 239 cols
[2023-03-17 06:36:57] [INFO ] Computed 83 place invariants in 2 ms
[2023-03-17 06:36:57] [INFO ] After 40ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-17 06:36:57] [INFO ] [Nat]Absence check using 83 positive place invariants in 9 ms returned sat
[2023-03-17 06:36:57] [INFO ] After 82ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-17 06:36:57] [INFO ] After 126ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 26 ms.
[2023-03-17 06:36:57] [INFO ] After 205ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Successfully simplified 8 atomic propositions for a total of 11 simplifications.
FORMULA ResAllocation-PT-R100C002-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ResAllocation-PT-R100C002-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ResAllocation-PT-R100C002-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
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.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(p0))'
Support contains 4 out of 321 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 321/321 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 319 transition count 200
Applied a total of 4 rules in 11 ms. Remains 319 /321 variables (removed 2) and now considering 200/202 (removed 2) transitions.
// Phase 1: matrix 200 rows 319 cols
[2023-03-17 06:36:58] [INFO ] Computed 121 place invariants in 3 ms
[2023-03-17 06:36:58] [INFO ] Implicit Places using invariants in 144 ms returned [203, 209, 212, 214, 218, 221, 224, 246, 251, 266, 272, 274, 279, 282, 290, 300, 308, 315]
Discarding 18 places :
Implicit Place search using SMT only with invariants took 145 ms to find 18 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 301/321 places, 200/202 transitions.
Applied a total of 0 rules in 6 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 162 ms. Remains : 301/321 places, 200/202 transitions.
Stuttering acceptance computed with spot in 139 ms :[true, (NOT p0)]
Running random walk in product with property : ResAllocation-PT-R100C002-LTLCardinality-01 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}]], initial=1, aps=[p0:(OR (LEQ s58 s255) (LEQ s248 s270))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Entered a terminal (fully accepting) state of product in 8986 steps with 3 reset in 89 ms.
FORMULA ResAllocation-PT-R100C002-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ResAllocation-PT-R100C002-LTLCardinality-01 finished in 440 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((X(p0)&&(X(X(p1)) U ((X(X(p1))&&G(p2))||X(X(G(p1)))))))))'
Support contains 4 out of 321 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 321/321 places, 202/202 transitions.
Applied a total of 0 rules in 3 ms. Remains 321 /321 variables (removed 0) and now considering 202/202 (removed 0) transitions.
// Phase 1: matrix 202 rows 321 cols
[2023-03-17 06:36:58] [INFO ] Computed 121 place invariants in 7 ms
[2023-03-17 06:36:58] [INFO ] Implicit Places using invariants in 151 ms returned [211, 214, 216, 220, 223, 226, 253, 259, 266, 268, 274, 276, 281, 284, 286, 292, 302, 310, 317]
Discarding 19 places :
Implicit Place search using SMT only with invariants took 152 ms to find 19 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 302/321 places, 202/202 transitions.
Applied a total of 0 rules in 3 ms. Remains 302 /302 variables (removed 0) and now considering 202/202 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 158 ms. Remains : 302/321 places, 202/202 transitions.
Stuttering acceptance computed with spot in 638 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p1) (NOT p2)), (NOT p1), (NOT p1), (AND (NOT p1) (NOT p2)), (NOT p1), (NOT p1), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) p1)]
Running random walk in product with property : ResAllocation-PT-R100C002-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p2), acceptance={} source=0 dest: 2}, { cond=p2, acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0, 1} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p0)), acceptance={0, 1} source=1 dest: 2}, { cond=(AND p2 (NOT p0)), acceptance={1} source=1 dest: 3}, { cond=p0, acceptance={0, 1} source=1 dest: 4}, { cond=(AND (NOT p2) p0), acceptance={0, 1} source=1 dest: 5}, { cond=(AND p2 p0), acceptance={1} source=1 dest: 6}], [{ cond=true, acceptance={0, 1} source=2 dest: 7}, { cond=(NOT p2), acceptance={0, 1} source=2 dest: 8}, { cond=p2, acceptance={1} source=2 dest: 9}], [{ cond=(NOT p2), acceptance={0, 1} source=3 dest: 7}, { cond=(NOT p2), acceptance={0, 1} source=3 dest: 8}, { cond=p2, acceptance={1} source=3 dest: 9}, { cond=p2, acceptance={1} source=3 dest: 10}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=4 dest: 1}, { cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={0, 1} source=4 dest: 2}, { cond=(AND p2 (NOT p0) (NOT p1)), acceptance={1} source=4 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={0, 1} source=4 dest: 4}, { cond=(AND (NOT p2) p0 (NOT p1)), acceptance={0, 1} source=4 dest: 5}, { cond=(AND p2 p0 (NOT p1)), acceptance={1} source=4 dest: 6}], [{ cond=(NOT p1), acceptance={0, 1} source=5 dest: 7}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0, 1} source=5 dest: 8}, { cond=(AND p2 (NOT p1)), acceptance={1} source=5 dest: 9}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0, 1} source=6 dest: 7}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0, 1} source=6 dest: 8}, { cond=(AND p2 (NOT p1)), acceptance={1} source=6 dest: 9}, { cond=(AND p2 (NOT p1)), acceptance={1} source=6 dest: 10}], [{ cond=p1, acceptance={0} source=7 dest: 4}, { cond=(NOT p1), acceptance={0, 1} source=7 dest: 4}, { cond=(AND (NOT p2) p1), acceptance={0} source=7 dest: 5}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0, 1} source=7 dest: 5}, { cond=(AND p2 p1), acceptance={} source=7 dest: 6}, { cond=(AND p2 (NOT p1)), acceptance={1} source=7 dest: 6}], [{ cond=p1, acceptance={0} source=8 dest: 7}, { cond=(NOT p1), acceptance={0, 1} source=8 dest: 7}, { cond=(AND (NOT p2) p1), acceptance={0} source=8 dest: 8}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0, 1} source=8 dest: 8}, { cond=(AND p2 p1), acceptance={} source=8 dest: 9}, { cond=(AND p2 (NOT p1)), acceptance={1} source=8 dest: 9}], [{ cond=(AND (NOT p2) p1), acceptance={0} source=9 dest: 7}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0, 1} source=9 dest: 7}, { cond=(AND (NOT p2) p1), acceptance={0} source=9 dest: 8}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0, 1} source=9 dest: 8}, { cond=(AND p2 p1), acceptance={} source=9 dest: 9}, { cond=(AND p2 (NOT p1)), acceptance={1} source=9 dest: 9}, { cond=(AND p2 p1), acceptance={} source=9 dest: 10}, { cond=(AND p2 (NOT p1)), acceptance={1} source=9 dest: 10}], [{ cond=(AND (NOT p2) p1), acceptance={0} source=10 dest: 4}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0, 1} source=10 dest: 4}, { cond=(AND (NOT p2) p1), acceptance={0} source=10 dest: 5}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0, 1} source=10 dest: 5}, { cond=(AND p2 p1), acceptance={} source=10 dest: 6}, { cond=(AND p2 (NOT p1)), acceptance={1} source=10 dest: 6}, { cond=(AND p2 p1), acceptance={} source=10 dest: 11}, { cond=(AND p2 (NOT p1)), acceptance={1} source=10 dest: 11}], [{ cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={0, 1} source=11 dest: 1}, { cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={0, 1} source=11 dest: 2}, { cond=(AND p2 (NOT p0) (NOT p1)), acceptance={1} source=11 dest: 3}, { cond=(AND p2 (NOT p0) (NOT p1)), acceptance={1} source=11 dest: 12}], [{ cond=(AND (NOT p2) (NOT p0) p1), acceptance={0, 1} source=12 dest: 1}, { cond=(AND (NOT p2) (NOT p0) p1), acceptance={0, 1} source=12 dest: 2}, { cond=(AND p2 (NOT p0) p1), acceptance={1} source=12 dest: 3}, { cond=(AND (NOT p2) p0 p1), acceptance={0, 1} source=12 dest: 4}, { cond=(AND (NOT p2) p0 p1), acceptance={0, 1} source=12 dest: 5}, { cond=(AND p2 p0 p1), acceptance={1} source=12 dest: 6}, { cond=(AND p2 p1), acceptance={1} source=12 dest: 11}, { cond=(AND p2 (NOT p0) p1), acceptance={1} source=12 dest: 12}]], initial=0, aps=[p2:(GT 1 s266), p0:(OR (GT s1 s205) (LEQ 1 s266)), p1:(GT 1 s242)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 5734 reset in 418 ms.
Product exploration explored 100000 steps with 5673 reset in 413 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 p2 (NOT p0) (NOT p1)), (X (NOT (AND (NOT p2) (NOT p0)))), (X p2), (X (NOT (AND (NOT p2) p0))), (X (NOT p0)), (X (AND p2 (NOT p0))), (X (NOT (AND p2 p0))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p2) p0 (NOT p1))))), (X (X (NOT (AND p2 p0 (NOT p1))))), (X (X (NOT (AND p2 p0)))), (X (X (NOT (AND p2 p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (AND p2 (NOT p0) (NOT p1)))), true, (X (X p2)), (X (X (NOT p1))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (NOT p0))), (X (X (AND p2 (NOT p0)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND p2 (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p2) p1))))]
False Knowledge obtained : []
Knowledge based reduction with 25 factoid took 3349 ms. Reduced automaton from 13 states, 70 edges and 3 AP (stutter sensitive) to 13 states, 70 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 592 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p1) (NOT p2)), (NOT p1), (NOT p1), (AND (NOT p1) (NOT p2)), (NOT p1), (NOT p1), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) p1)]
Incomplete random walk after 10000 steps, including 3 resets, run finished after 202 ms. (steps per millisecond=49 ) properties (out of 21) seen :10
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 11) 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 11) 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 11) 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 11) 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 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 11) 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 11) 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 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 11) 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 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 11) seen :0
Running SMT prover for 11 properties.
// Phase 1: matrix 202 rows 302 cols
[2023-03-17 06:37:04] [INFO ] Computed 102 place invariants in 1 ms
[2023-03-17 06:37:04] [INFO ] After 80ms SMT Verify possible using all constraints in real domain returned unsat :3 sat :0 real:8
[2023-03-17 06:37:04] [INFO ] [Nat]Absence check using 102 positive place invariants in 14 ms returned sat
[2023-03-17 06:37:05] [INFO ] After 171ms SMT Verify possible using state equation in natural domain returned unsat :3 sat :8
[2023-03-17 06:37:05] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 1 ms to minimize.
[2023-03-17 06:37:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 71 ms
[2023-03-17 06:37:05] [INFO ] After 409ms SMT Verify possible using trap constraints in natural domain returned unsat :3 sat :8
Attempting to minimize the solution found.
Minimization took 109 ms.
[2023-03-17 06:37:05] [INFO ] After 650ms SMT Verify possible using all constraints in natural domain returned unsat :3 sat :8
Fused 11 Parikh solutions to 8 different solutions.
Finished Parikh walk after 1211 steps, including 2 resets, run visited all 1 properties in 6 ms. (steps per millisecond=201 )
Parikh walk visited 8 properties in 31 ms.
Found 3 invariant AP formulas.
Knowledge obtained : [(AND p2 (NOT p0) (NOT p1)), (X (NOT (AND (NOT p2) (NOT p0)))), (X p2), (X (NOT (AND (NOT p2) p0))), (X (NOT p0)), (X (AND p2 (NOT p0))), (X (NOT (AND p2 p0))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p2) p0 (NOT p1))))), (X (X (NOT (AND p2 p0 (NOT p1))))), (X (X (NOT (AND p2 p0)))), (X (X (NOT (AND p2 p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (AND p2 (NOT p0) (NOT p1)))), true, (X (X p2)), (X (X (NOT p1))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (NOT p0))), (X (X (AND p2 (NOT p0)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND p2 (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p2) p1)))), (G (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (G (NOT (AND (NOT p0) p1 (NOT p2)))), (G (NOT (AND (NOT p0) (NOT p2))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1) p2))), (F (AND p0 (NOT p1))), (F (AND p0 (NOT p2))), (F (AND p1 (NOT p2))), (F (NOT (AND (NOT p1) p2))), (F (NOT (AND (NOT p0) p2))), (F (AND (NOT p1) (NOT p2))), (F (NOT (AND (NOT p0) (NOT p1)))), (F p1), (F (AND p0 p2)), (F (NOT p2)), (F (AND p0 p1 (NOT p2))), (F (AND (NOT p0) p1 p2)), (F p0), (F (AND p1 p2)), (F (AND p0 (NOT p1) p2)), (F (AND p0 (NOT p1) (NOT p2))), (F (AND p0 p1 p2))]
Knowledge based reduction with 28 factoid took 4475 ms. Reduced automaton from 13 states, 70 edges and 3 AP (stutter sensitive) to 12 states, 61 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 667 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p2)), (NOT p1), (NOT p1), (AND (NOT p1) (NOT p2)), (NOT p1), (NOT p1), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p1)), false]
Stuttering acceptance computed with spot in 716 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p2)), (NOT p1), (NOT p1), (AND (NOT p1) (NOT p2)), (NOT p1), (NOT p1), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p1)), false]
[2023-03-17 06:37:11] [INFO ] Invariant cache hit.
[2023-03-17 06:37:11] [INFO ] [Real]Absence check using 102 positive place invariants in 24 ms returned sat
[2023-03-17 06:37:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-17 06:37:12] [INFO ] [Real]Absence check using state equation in 584 ms returned sat
[2023-03-17 06:37:12] [INFO ] Solution in real domain found non-integer solution.
[2023-03-17 06:37:12] [INFO ] [Nat]Absence check using 102 positive place invariants in 22 ms returned sat
[2023-03-17 06:37:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-17 06:37:12] [INFO ] [Nat]Absence check using state equation in 544 ms returned sat
[2023-03-17 06:37:12] [INFO ] Deduced a trap composed of 4 places in 48 ms of which 0 ms to minimize.
[2023-03-17 06:37:12] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 0 ms to minimize.
[2023-03-17 06:37:13] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 134 ms
[2023-03-17 06:37:13] [INFO ] Computed and/alt/rep : 200/200/200 causal constraints (skipped 0 transitions) in 11 ms.
[2023-03-17 06:37:13] [INFO ] Added : 101 causal constraints over 21 iterations in 478 ms. Result :sat
Could not prove EG (NOT p0)
[2023-03-17 06:37:13] [INFO ] Invariant cache hit.
[2023-03-17 06:37:13] [INFO ] [Real]Absence check using 102 positive place invariants in 22 ms returned sat
[2023-03-17 06:37:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-17 06:37:14] [INFO ] [Real]Absence check using state equation in 431 ms returned sat
[2023-03-17 06:37:14] [INFO ] Solution in real domain found non-integer solution.
[2023-03-17 06:37:14] [INFO ] [Nat]Absence check using 102 positive place invariants in 21 ms returned sat
[2023-03-17 06:37:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-17 06:37:14] [INFO ] [Nat]Absence check using state equation in 397 ms returned sat
[2023-03-17 06:37:14] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 0 ms to minimize.
[2023-03-17 06:37:14] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 1 ms to minimize.
[2023-03-17 06:37:14] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 116 ms
[2023-03-17 06:37:14] [INFO ] Computed and/alt/rep : 200/200/200 causal constraints (skipped 0 transitions) in 10 ms.
[2023-03-17 06:37:15] [INFO ] Added : 102 causal constraints over 21 iterations in 552 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 4 out of 302 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 302/302 places, 202/202 transitions.
Applied a total of 0 rules in 4 ms. Remains 302 /302 variables (removed 0) and now considering 202/202 (removed 0) transitions.
[2023-03-17 06:37:15] [INFO ] Invariant cache hit.
[2023-03-17 06:37:15] [INFO ] Implicit Places using invariants in 133 ms returned []
[2023-03-17 06:37:15] [INFO ] Invariant cache hit.
[2023-03-17 06:37:15] [INFO ] Implicit Places using invariants and state equation in 246 ms returned []
Implicit Place search using SMT with State Equation took 384 ms to find 0 implicit places.
[2023-03-17 06:37:15] [INFO ] Invariant cache hit.
[2023-03-17 06:37:15] [INFO ] Dead Transitions using invariants and state equation in 118 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 516 ms. Remains : 302/302 places, 202/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 p2 (NOT p0) (NOT p1)), (X p2), (X (NOT p0)), (X (NOT (AND p0 p2))), (X (NOT (AND p1 p2))), (X (AND (NOT p1) p2)), (X (NOT p1)), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (X p2)), (X (X (NOT p1))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT p0))), (X (X (NOT (AND p0 p2)))), (X (X (AND (NOT p1) p2))), (X (X (NOT (AND p1 p2)))), (X (X (NOT (AND (NOT p1) p0 p2)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND p1 (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 20 factoid took 6102 ms. Reduced automaton from 12 states, 61 edges and 3 AP (stutter sensitive) to 12 states, 61 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 520 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p2)), (NOT p1), (NOT p1), (AND (NOT p1) (NOT p2)), (NOT p1), (NOT p1), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p1)), false]
Incomplete random walk after 10000 steps, including 3 resets, run finished after 233 ms. (steps per millisecond=42 ) properties (out of 13) seen :6
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
[2023-03-17 06:37:22] [INFO ] Invariant cache hit.
[2023-03-17 06:37:22] [INFO ] After 74ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-17 06:37:23] [INFO ] [Nat]Absence check using 102 positive place invariants in 12 ms returned sat
[2023-03-17 06:37:23] [INFO ] After 152ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2023-03-17 06:37:23] [INFO ] After 298ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 88 ms.
[2023-03-17 06:37:23] [INFO ] After 501ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
Finished Parikh walk after 1002 steps, including 1 resets, run visited all 1 properties in 5 ms. (steps per millisecond=200 )
Parikh walk visited 7 properties in 39 ms.
Knowledge obtained : [(AND p2 (NOT p0) (NOT p1)), (X p2), (X (NOT p0)), (X (NOT (AND p0 p2))), (X (NOT (AND p1 p2))), (X (AND (NOT p1) p2)), (X (NOT p1)), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (X p2)), (X (X (NOT p1))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT p0))), (X (X (NOT (AND p0 p2)))), (X (X (AND (NOT p1) p2))), (X (X (NOT (AND p1 p2)))), (X (X (NOT (AND (NOT p1) p0 p2)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND p1 (NOT p2)))))]
False Knowledge obtained : [(F (NOT (AND (NOT p1) p2))), (F p1), (F (AND p1 (NOT p2))), (F (AND p0 (NOT p1))), (F (NOT (AND (NOT p0) (NOT p1)))), (F (AND p0 (NOT p1) p2)), (F (AND (NOT p1) (NOT p2))), (F (AND p0 p1 p2)), (F (NOT p2)), (F (AND p0 p2)), (F p0), (F (AND (NOT p0) p1)), (F (AND p1 p2))]
Knowledge based reduction with 20 factoid took 6373 ms. Reduced automaton from 12 states, 61 edges and 3 AP (stutter sensitive) to 12 states, 61 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 552 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p2)), (NOT p1), (NOT p1), (AND (NOT p1) (NOT p2)), (NOT p1), (NOT p1), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p1)), false]
Stuttering acceptance computed with spot in 570 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p2)), (NOT p1), (NOT p1), (AND (NOT p1) (NOT p2)), (NOT p1), (NOT p1), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p1)), false]
[2023-03-17 06:37:31] [INFO ] Invariant cache hit.
[2023-03-17 06:37:31] [INFO ] [Real]Absence check using 102 positive place invariants in 23 ms returned sat
[2023-03-17 06:37:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-17 06:37:31] [INFO ] [Real]Absence check using state equation in 583 ms returned sat
[2023-03-17 06:37:31] [INFO ] Solution in real domain found non-integer solution.
[2023-03-17 06:37:31] [INFO ] [Nat]Absence check using 102 positive place invariants in 23 ms returned sat
[2023-03-17 06:37:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-17 06:37:32] [INFO ] [Nat]Absence check using state equation in 540 ms returned sat
[2023-03-17 06:37:32] [INFO ] Deduced a trap composed of 4 places in 44 ms of which 1 ms to minimize.
[2023-03-17 06:37:32] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 0 ms to minimize.
[2023-03-17 06:37:32] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 140 ms
[2023-03-17 06:37:32] [INFO ] Computed and/alt/rep : 200/200/200 causal constraints (skipped 0 transitions) in 10 ms.
[2023-03-17 06:37:33] [INFO ] Added : 101 causal constraints over 21 iterations in 496 ms. Result :sat
Could not prove EG (NOT p0)
[2023-03-17 06:37:33] [INFO ] Invariant cache hit.
[2023-03-17 06:37:33] [INFO ] [Real]Absence check using 102 positive place invariants in 23 ms returned sat
[2023-03-17 06:37:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-17 06:37:33] [INFO ] [Real]Absence check using state equation in 443 ms returned sat
[2023-03-17 06:37:33] [INFO ] Solution in real domain found non-integer solution.
[2023-03-17 06:37:33] [INFO ] [Nat]Absence check using 102 positive place invariants in 21 ms returned sat
[2023-03-17 06:37:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-17 06:37:34] [INFO ] [Nat]Absence check using state equation in 415 ms returned sat
[2023-03-17 06:37:34] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 0 ms to minimize.
[2023-03-17 06:37:34] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 1 ms to minimize.
[2023-03-17 06:37:34] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 114 ms
[2023-03-17 06:37:34] [INFO ] Computed and/alt/rep : 200/200/200 causal constraints (skipped 0 transitions) in 10 ms.
[2023-03-17 06:37:34] [INFO ] Added : 102 causal constraints over 21 iterations in 515 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 549 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p2)), (NOT p1), (NOT p1), (AND (NOT p1) (NOT p2)), (NOT p1), (NOT p1), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p1)), false]
Product exploration explored 100000 steps with 5824 reset in 316 ms.
Product exploration explored 100000 steps with 5746 reset in 349 ms.
Built C files in :
/tmp/ltsmin17596916516274800975
[2023-03-17 06:37:36] [INFO ] Built C files in 19ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17596916516274800975
Running compilation step : cd /tmp/ltsmin17596916516274800975;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 452 ms.
Running link step : cd /tmp/ltsmin17596916516274800975;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 43 ms.
Running LTSmin : cd /tmp/ltsmin17596916516274800975;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased5777281453005096809.hoa' '--buchi-type=spotba'
LTSmin run took 1056 ms.
FORMULA ResAllocation-PT-R100C002-LTLCardinality-03 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property ResAllocation-PT-R100C002-LTLCardinality-03 finished in 39312 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 321 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 321/321 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 319 transition count 200
Applied a total of 4 rules in 14 ms. Remains 319 /321 variables (removed 2) and now considering 200/202 (removed 2) transitions.
// Phase 1: matrix 200 rows 319 cols
[2023-03-17 06:37:37] [INFO ] Computed 121 place invariants in 1 ms
[2023-03-17 06:37:38] [INFO ] Implicit Places using invariants in 168 ms returned [203, 209, 212, 214, 218, 221, 224, 246, 251, 257, 264, 266, 272, 274, 279, 282, 284, 290, 308, 315]
Discarding 20 places :
Implicit Place search using SMT only with invariants took 169 ms to find 20 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 299/321 places, 200/202 transitions.
Applied a total of 0 rules in 5 ms. Remains 299 /299 variables (removed 0) and now considering 200/200 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 188 ms. Remains : 299/321 places, 200/202 transitions.
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Running random walk in product with property : ResAllocation-PT-R100C002-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ s282 s114)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 38 reset in 395 ms.
Product exploration explored 100000 steps with 38 reset in 423 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 : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 199 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 24 ms :[(NOT p0)]
Finished random walk after 143 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=71 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 145 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
// Phase 1: matrix 200 rows 299 cols
[2023-03-17 06:37:39] [INFO ] Computed 101 place invariants in 3 ms
[2023-03-17 06:37:39] [INFO ] [Real]Absence check using 101 positive place invariants in 22 ms returned sat
[2023-03-17 06:37:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-17 06:37:40] [INFO ] [Real]Absence check using state equation in 1241 ms returned sat
[2023-03-17 06:37:40] [INFO ] Solution in real domain found non-integer solution.
[2023-03-17 06:37:40] [INFO ] [Nat]Absence check using 101 positive place invariants in 21 ms returned sat
[2023-03-17 06:37:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-17 06:37:41] [INFO ] [Nat]Absence check using state equation in 687 ms returned sat
[2023-03-17 06:37:41] [INFO ] Deduced a trap composed of 4 places in 49 ms of which 0 ms to minimize.
[2023-03-17 06:37:41] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 93 ms
[2023-03-17 06:37:41] [INFO ] Computed and/alt/rep : 198/198/198 causal constraints (skipped 0 transitions) in 9 ms.
[2023-03-17 06:37:42] [INFO ] Added : 157 causal constraints over 32 iterations in 843 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 2 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.
[2023-03-17 06:37:42] [INFO ] Invariant cache hit.
[2023-03-17 06:37:42] [INFO ] Implicit Places using invariants in 145 ms returned []
[2023-03-17 06:37:42] [INFO ] Invariant cache hit.
[2023-03-17 06:37:42] [INFO ] Implicit Places using invariants and state equation in 272 ms returned []
Implicit Place search using SMT with State Equation took 419 ms to find 0 implicit places.
[2023-03-17 06:37:42] [INFO ] Redundant transitions in 10 ms returned []
[2023-03-17 06:37:43] [INFO ] Invariant cache hit.
[2023-03-17 06:37:43] [INFO ] Dead Transitions using invariants and state equation in 108 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 553 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 : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 123 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
Finished random walk after 148 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=74 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 154 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
[2023-03-17 06:37:43] [INFO ] Invariant cache hit.
[2023-03-17 06:37:43] [INFO ] [Real]Absence check using 101 positive place invariants in 23 ms returned sat
[2023-03-17 06:37:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-17 06:37:44] [INFO ] [Real]Absence check using state equation in 1223 ms returned sat
[2023-03-17 06:37:44] [INFO ] Solution in real domain found non-integer solution.
[2023-03-17 06:37:44] [INFO ] [Nat]Absence check using 101 positive place invariants in 22 ms returned sat
[2023-03-17 06:37:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-17 06:37:45] [INFO ] [Nat]Absence check using state equation in 654 ms returned sat
[2023-03-17 06:37:45] [INFO ] Deduced a trap composed of 4 places in 47 ms of which 0 ms to minimize.
[2023-03-17 06:37:45] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 78 ms
[2023-03-17 06:37:45] [INFO ] Computed and/alt/rep : 198/198/198 causal constraints (skipped 0 transitions) in 13 ms.
[2023-03-17 06:37:46] [INFO ] Added : 157 causal constraints over 32 iterations in 753 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
Product exploration explored 100000 steps with 38 reset in 343 ms.
Product exploration explored 100000 steps with 38 reset in 394 ms.
Built C files in :
/tmp/ltsmin11765808698451258506
[2023-03-17 06:37:47] [INFO ] Computing symmetric may disable matrix : 200 transitions.
[2023-03-17 06:37:47] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-17 06:37:47] [INFO ] Computing symmetric may enable matrix : 200 transitions.
[2023-03-17 06:37:47] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-17 06:37:47] [INFO ] Computing Do-Not-Accords matrix : 200 transitions.
[2023-03-17 06:37:47] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-17 06:37:47] [INFO ] Built C files in 25ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11765808698451258506
Running compilation step : cd /tmp/ltsmin11765808698451258506;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 399 ms.
Running link step : cd /tmp/ltsmin11765808698451258506;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin11765808698451258506;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased3055963724493308719.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 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 12 ms. Remains 299 /299 variables (removed 0) and now considering 200/200 (removed 0) transitions.
[2023-03-17 06:38:02] [INFO ] Invariant cache hit.
[2023-03-17 06:38:02] [INFO ] Implicit Places using invariants in 149 ms returned []
[2023-03-17 06:38:02] [INFO ] Invariant cache hit.
[2023-03-17 06:38:02] [INFO ] Implicit Places using invariants and state equation in 285 ms returned []
Implicit Place search using SMT with State Equation took 435 ms to find 0 implicit places.
[2023-03-17 06:38:02] [INFO ] Redundant transitions in 5 ms returned []
[2023-03-17 06:38:02] [INFO ] Invariant cache hit.
[2023-03-17 06:38:02] [INFO ] Dead Transitions using invariants and state equation in 115 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 577 ms. Remains : 299/299 places, 200/200 transitions.
Built C files in :
/tmp/ltsmin866926859889758634
[2023-03-17 06:38:02] [INFO ] Computing symmetric may disable matrix : 200 transitions.
[2023-03-17 06:38:02] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-17 06:38:02] [INFO ] Computing symmetric may enable matrix : 200 transitions.
[2023-03-17 06:38:02] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-17 06:38:03] [INFO ] Computing Do-Not-Accords matrix : 200 transitions.
[2023-03-17 06:38:03] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-17 06:38:03] [INFO ] Built C files in 28ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin866926859889758634
Running compilation step : cd /tmp/ltsmin866926859889758634;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 391 ms.
Running link step : cd /tmp/ltsmin866926859889758634;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin866926859889758634;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased12043441976964846625.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-03-17 06:38:18] [INFO ] Flatten gal took : 14 ms
[2023-03-17 06:38:18] [INFO ] Flatten gal took : 14 ms
[2023-03-17 06:38:18] [INFO ] Time to serialize gal into /tmp/LTL6067763480165145740.gal : 6 ms
[2023-03-17 06:38:18] [INFO ] Time to serialize properties into /tmp/LTL16623029435584054487.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.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL6067763480165145740.gal' '-t' 'CGAL' '-hoa' '/tmp/aut14771100903307876667.hoa' '-atoms' '/tmp/LTL16623029435584054487.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL16623029435584054487.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut14771100903307876667.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.
[2023-03-17 06:38:33] [INFO ] Flatten gal took : 15 ms
[2023-03-17 06:38:33] [INFO ] Flatten gal took : 12 ms
[2023-03-17 06:38:33] [INFO ] Time to serialize gal into /tmp/LTL120786561533818593.gal : 9 ms
[2023-03-17 06:38:33] [INFO ] Time to serialize properties into /tmp/LTL4925920034575695108.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL120786561533818593.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4925920034575695108.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...274
Read 1 LTL properties
Checking formula 0 : !((F(G("(r_1_83<=p_0_57)"))))
Formula 0 simplified : GF!"(r_1_83<=p_0_57)"
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.
[2023-03-17 06:38:48] [INFO ] Flatten gal took : 16 ms
[2023-03-17 06:38:48] [INFO ] Applying decomposition
[2023-03-17 06:38:48] [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.202303021504/bin/convert-linux64' '-i' '/tmp/graph3135096840019566862.txt' '-o' '/tmp/graph3135096840019566862.bin' '-w' '/tmp/graph3135096840019566862.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph3135096840019566862.bin' '-l' '-1' '-v' '-w' '/tmp/graph3135096840019566862.weights' '-q' '0' '-e' '0.001'
[2023-03-17 06:38:48] [INFO ] Decomposing Gal with order
[2023-03-17 06:38:48] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-17 06:38:48] [INFO ] Flatten gal took : 45 ms
[2023-03-17 06:38:48] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 3 ms.
[2023-03-17 06:38:48] [INFO ] Time to serialize gal into /tmp/LTL6032553240727253238.gal : 6 ms
[2023-03-17 06:38:48] [INFO ] Time to serialize properties into /tmp/LTL16541105865844991623.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL6032553240727253238.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16541105865844991623.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((F(G("(gu99.r_1_83<=gu99.p_0_57)"))))
Formula 0 simplified : GF!"(gu99.r_1_83<=gu99.p_0_57)"
Reverse transition relation is NOT exact ! Due to transitions gi0.t102_t101, gi2.gi2.gi2.gi2.t99_t100, Intersection with reachable at each step enabled. (...202
Computing Next relation with stutter on 99 deadlock states
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin9524936516369674744
[2023-03-17 06:39:03] [INFO ] Built C files in 9ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9524936516369674744
Running compilation step : cd /tmp/ltsmin9524936516369674744;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 329 ms.
Running link step : cd /tmp/ltsmin9524936516369674744;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin9524936516369674744;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>([]((LTLAPp0==true)))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property ResAllocation-PT-R100C002-LTLCardinality-06 finished in 100898 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 321 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 321/321 places, 202/202 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 5 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 319 transition count 200
Applied a total of 4 rules in 20 ms. Remains 319 /321 variables (removed 2) and now considering 200/202 (removed 2) transitions.
// Phase 1: matrix 200 rows 319 cols
[2023-03-17 06:39:18] [INFO ] Computed 121 place invariants in 2 ms
[2023-03-17 06:39:18] [INFO ] Implicit Places using invariants in 174 ms returned [203, 209, 212, 214, 218, 221, 224, 246, 251, 257, 264, 266, 272, 274, 279, 282, 284, 290, 300, 308, 315]
Discarding 21 places :
Implicit Place search using SMT only with invariants took 175 ms to find 21 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 298/321 places, 200/202 transitions.
Applied a total of 0 rules in 5 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 201 ms. Remains : 298/321 places, 200/202 transitions.
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Running random walk in product with property : ResAllocation-PT-R100C002-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GT s292 s31)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Product exploration explored 100000 steps with 743 reset in 283 ms.
Product exploration explored 100000 steps with 732 reset in 318 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 : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 126 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
Finished random walk after 86 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=43 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 100 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
// Phase 1: matrix 200 rows 298 cols
[2023-03-17 06:39:19] [INFO ] Computed 100 place invariants in 1 ms
[2023-03-17 06:39:20] [INFO ] [Real]Absence check using 100 positive place invariants in 22 ms returned sat
[2023-03-17 06:39:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-17 06:39:20] [INFO ] [Real]Absence check using state equation in 562 ms returned sat
[2023-03-17 06:39:20] [INFO ] Solution in real domain found non-integer solution.
[2023-03-17 06:39:20] [INFO ] [Nat]Absence check using 100 positive place invariants in 22 ms returned sat
[2023-03-17 06:39:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-17 06:39:21] [INFO ] [Nat]Absence check using state equation in 463 ms returned sat
[2023-03-17 06:39:21] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 1 ms to minimize.
[2023-03-17 06:39:21] [INFO ] Deduced a trap composed of 5 places in 30 ms of which 0 ms to minimize.
[2023-03-17 06:39:21] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 127 ms
[2023-03-17 06:39:21] [INFO ] Computed and/alt/rep : 198/198/198 causal constraints (skipped 0 transitions) in 14 ms.
[2023-03-17 06:39:21] [INFO ] Added : 112 causal constraints over 23 iterations in 542 ms. Result :sat
Could not prove EG (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 7 ms. Remains 298 /298 variables (removed 0) and now considering 200/200 (removed 0) transitions.
[2023-03-17 06:39:21] [INFO ] Invariant cache hit.
[2023-03-17 06:39:22] [INFO ] Implicit Places using invariants in 149 ms returned []
[2023-03-17 06:39:22] [INFO ] Invariant cache hit.
[2023-03-17 06:39:22] [INFO ] Implicit Places using invariants and state equation in 275 ms returned []
Implicit Place search using SMT with State Equation took 424 ms to find 0 implicit places.
[2023-03-17 06:39:22] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-17 06:39:22] [INFO ] Invariant cache hit.
[2023-03-17 06:39:22] [INFO ] Dead Transitions using invariants and state equation in 108 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 548 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 : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 96 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Finished random walk after 108 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=108 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 126 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
[2023-03-17 06:39:22] [INFO ] Invariant cache hit.
[2023-03-17 06:39:22] [INFO ] [Real]Absence check using 100 positive place invariants in 21 ms returned sat
[2023-03-17 06:39:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-17 06:39:23] [INFO ] [Real]Absence check using state equation in 534 ms returned sat
[2023-03-17 06:39:23] [INFO ] Solution in real domain found non-integer solution.
[2023-03-17 06:39:23] [INFO ] [Nat]Absence check using 100 positive place invariants in 24 ms returned sat
[2023-03-17 06:39:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-17 06:39:24] [INFO ] [Nat]Absence check using state equation in 467 ms returned sat
[2023-03-17 06:39:24] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 0 ms to minimize.
[2023-03-17 06:39:24] [INFO ] Deduced a trap composed of 5 places in 32 ms of which 0 ms to minimize.
[2023-03-17 06:39:24] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 132 ms
[2023-03-17 06:39:24] [INFO ] Computed and/alt/rep : 198/198/198 causal constraints (skipped 0 transitions) in 13 ms.
[2023-03-17 06:39:24] [INFO ] Added : 112 causal constraints over 23 iterations in 581 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Product exploration explored 100000 steps with 740 reset in 267 ms.
Product exploration explored 100000 steps with 758 reset in 312 ms.
Built C files in :
/tmp/ltsmin1076181428184885284
[2023-03-17 06:39:25] [INFO ] Computing symmetric may disable matrix : 200 transitions.
[2023-03-17 06:39:25] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-17 06:39:25] [INFO ] Computing symmetric may enable matrix : 200 transitions.
[2023-03-17 06:39:25] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-17 06:39:25] [INFO ] Computing Do-Not-Accords matrix : 200 transitions.
[2023-03-17 06:39:25] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-17 06:39:25] [INFO ] Built C files in 25ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1076181428184885284
Running compilation step : cd /tmp/ltsmin1076181428184885284;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 384 ms.
Running link step : cd /tmp/ltsmin1076181428184885284;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 40 ms.
Running LTSmin : cd /tmp/ltsmin1076181428184885284;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased5948588306553788395.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.
[2023-03-17 06:39:40] [INFO ] Invariant cache hit.
[2023-03-17 06:39:40] [INFO ] Implicit Places using invariants in 133 ms returned []
[2023-03-17 06:39:40] [INFO ] Invariant cache hit.
[2023-03-17 06:39:40] [INFO ] Implicit Places using invariants and state equation in 262 ms returned []
Implicit Place search using SMT with State Equation took 399 ms to find 0 implicit places.
[2023-03-17 06:39:40] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-17 06:39:40] [INFO ] Invariant cache hit.
[2023-03-17 06:39:41] [INFO ] Dead Transitions using invariants and state equation in 116 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 533 ms. Remains : 298/298 places, 200/200 transitions.
Built C files in :
/tmp/ltsmin13706200426164928301
[2023-03-17 06:39:41] [INFO ] Computing symmetric may disable matrix : 200 transitions.
[2023-03-17 06:39:41] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-17 06:39:41] [INFO ] Computing symmetric may enable matrix : 200 transitions.
[2023-03-17 06:39:41] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-17 06:39:41] [INFO ] Computing Do-Not-Accords matrix : 200 transitions.
[2023-03-17 06:39:41] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-17 06:39:41] [INFO ] Built C files in 13ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13706200426164928301
Running compilation step : cd /tmp/ltsmin13706200426164928301;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 401 ms.
Running link step : cd /tmp/ltsmin13706200426164928301;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin13706200426164928301;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased343371843406942351.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-03-17 06:39:56] [INFO ] Flatten gal took : 22 ms
[2023-03-17 06:39:56] [INFO ] Flatten gal took : 9 ms
[2023-03-17 06:39:56] [INFO ] Time to serialize gal into /tmp/LTL11288204329914036307.gal : 2 ms
[2023-03-17 06:39:56] [INFO ] Time to serialize properties into /tmp/LTL4412167213862047055.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.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL11288204329914036307.gal' '-t' 'CGAL' '-hoa' '/tmp/aut1789770215646368095.hoa' '-atoms' '/tmp/LTL4412167213862047055.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL4412167213862047055.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut1789770215646368095.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.
[2023-03-17 06:40:11] [INFO ] Flatten gal took : 11 ms
[2023-03-17 06:40:11] [INFO ] Flatten gal took : 9 ms
[2023-03-17 06:40:11] [INFO ] Time to serialize gal into /tmp/LTL12531846291890436105.gal : 2 ms
[2023-03-17 06:40:11] [INFO ] Time to serialize properties into /tmp/LTL8579123631148456961.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL12531846291890436105.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8579123631148456961.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((F("(p_1_94>r_0_15)")))
Formula 0 simplified : G!"(p_1_94>r_0_15)"
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.
[2023-03-17 06:40:26] [INFO ] Flatten gal took : 10 ms
[2023-03-17 06:40:26] [INFO ] Applying decomposition
[2023-03-17 06:40:26] [INFO ] Flatten gal took : 9 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph18089265897215210393.txt' '-o' '/tmp/graph18089265897215210393.bin' '-w' '/tmp/graph18089265897215210393.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph18089265897215210393.bin' '-l' '-1' '-v' '-w' '/tmp/graph18089265897215210393.weights' '-q' '0' '-e' '0.001'
[2023-03-17 06:40:26] [INFO ] Decomposing Gal with order
[2023-03-17 06:40:26] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-17 06:40:26] [INFO ] Removed a total of 2 redundant transitions.
[2023-03-17 06:40:26] [INFO ] Flatten gal took : 17 ms
[2023-03-17 06:40:26] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 4 ms.
[2023-03-17 06:40:26] [INFO ] Time to serialize gal into /tmp/LTL6922796145700437583.gal : 4 ms
[2023-03-17 06:40:26] [INFO ] Time to serialize properties into /tmp/LTL6633919697322047129.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL6922796145700437583.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6633919697322047129.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((F("(gu99.p_1_94>gu99.r_0_15)")))
Formula 0 simplified : G!"(gu99.p_1_94>gu99.r_0_15)"
Reverse transition relation is NOT exact ! Due to transitions gi0.gi0.gi0.gi0.t102_t101, gi2.gi2.gi2.gi1.t99_t100, Intersection with reachable at each ste...214
Computing Next relation with stutter on 99 deadlock states
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin3289051258177238949
[2023-03-17 06:40:41] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3289051258177238949
Running compilation step : cd /tmp/ltsmin3289051258177238949;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 325 ms.
Running link step : cd /tmp/ltsmin3289051258177238949;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin3289051258177238949;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>((LTLAPp0==true))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property ResAllocation-PT-R100C002-LTLCardinality-09 finished in 97916 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((p0&&X(G(p1))))))'
Support contains 3 out of 321 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 321/321 places, 202/202 transitions.
Applied a total of 0 rules in 10 ms. Remains 321 /321 variables (removed 0) and now considering 202/202 (removed 0) transitions.
// Phase 1: matrix 202 rows 321 cols
[2023-03-17 06:40:56] [INFO ] Computed 121 place invariants in 3 ms
[2023-03-17 06:40:56] [INFO ] Implicit Places using invariants in 153 ms returned [205, 211, 216, 220, 223, 226, 248, 253, 259, 266, 268, 281, 284, 286, 292, 302, 310, 317]
Discarding 18 places :
Implicit Place search using SMT only with invariants took 154 ms to find 18 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 303/321 places, 202/202 transitions.
Applied a total of 0 rules in 2 ms. Remains 303 /303 variables (removed 0) and now considering 202/202 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 166 ms. Remains : 303/321 places, 202/202 transitions.
Stuttering acceptance computed with spot in 129 ms :[true, (OR (NOT p0) (NOT p1)), (NOT p1), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : ResAllocation-PT-R100C002-LTLCardinality-10 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: 2}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 1}]], initial=3, aps=[p0:(GT 1 s265), p1:(GT s263 s212)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA ResAllocation-PT-R100C002-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ResAllocation-PT-R100C002-LTLCardinality-10 finished in 311 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0||((p1||F(p2)) U p3)))))'
Support contains 5 out of 321 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 : 321/321 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 319 transition count 200
Applied a total of 4 rules in 11 ms. Remains 319 /321 variables (removed 2) and now considering 200/202 (removed 2) transitions.
// Phase 1: matrix 200 rows 319 cols
[2023-03-17 06:40:57] [INFO ] Computed 121 place invariants in 1 ms
[2023-03-17 06:40:57] [INFO ] Implicit Places using invariants in 143 ms returned [203, 212, 214, 221, 224, 246, 251, 257, 264, 272, 274, 279, 282, 284, 290, 300, 308, 315]
Discarding 18 places :
Implicit Place search using SMT only with invariants took 144 ms to find 18 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 301/321 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 161 ms. Remains : 301/321 places, 200/202 transitions.
Stuttering acceptance computed with spot in 57 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 (LEQ 1 s208) (LEQ s215 s293)), p0:(LEQ s243 s257)], 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 353 ms.
Product exploration explored 100000 steps with 38 reset in 380 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 98 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 69 ms :[(AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3))]
Incomplete random walk after 10000 steps, including 3 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Finished probabilistic random walk after 38867 steps, run visited all 1 properties in 142 ms. (steps per millisecond=273 )
Probabilistic random walk after 38867 steps, saw 27941 distinct states, run finished after 142 ms. (steps per millisecond=273 ) properties seen :1
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 134 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 90 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 10 ms. Remains 301 /301 variables (removed 0) and now considering 200/200 (removed 0) transitions.
// Phase 1: matrix 200 rows 301 cols
[2023-03-17 06:40:58] [INFO ] Computed 103 place invariants in 2 ms
[2023-03-17 06:40:58] [INFO ] Implicit Places using invariants in 133 ms returned []
[2023-03-17 06:40:58] [INFO ] Invariant cache hit.
[2023-03-17 06:40:59] [INFO ] Implicit Places using invariants and state equation in 249 ms returned []
Implicit Place search using SMT with State Equation took 385 ms to find 0 implicit places.
[2023-03-17 06:40:59] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-17 06:40:59] [INFO ] Invariant cache hit.
[2023-03-17 06:40:59] [INFO ] Dead Transitions using invariants and state equation in 104 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 511 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 95 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))]
Incomplete random walk after 10000 steps, including 3 resets, run finished after 36 ms. (steps per millisecond=277 ) 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 138 ms. (steps per millisecond=281 )
Probabilistic random walk after 38867 steps, saw 27941 distinct states, run finished after 138 ms. (steps per millisecond=281 ) properties seen :1
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 136 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 74 ms :[(AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3))]
Stuttering acceptance computed with spot in 65 ms :[(AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3))]
Stuttering acceptance computed with spot in 65 ms :[(AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3))]
Product exploration explored 100000 steps with 38 reset in 329 ms.
Product exploration explored 100000 steps with 38 reset in 375 ms.
Built C files in :
/tmp/ltsmin8924139810523056280
[2023-03-17 06:41:00] [INFO ] Computing symmetric may disable matrix : 200 transitions.
[2023-03-17 06:41:00] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-17 06:41:00] [INFO ] Computing symmetric may enable matrix : 200 transitions.
[2023-03-17 06:41:00] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-17 06:41:00] [INFO ] Computing Do-Not-Accords matrix : 200 transitions.
[2023-03-17 06:41:00] [INFO ] Computation of Completed DNA matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-17 06:41:00] [INFO ] Built C files in 27ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8924139810523056280
Running compilation step : cd /tmp/ltsmin8924139810523056280;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 397 ms.
Running link step : cd /tmp/ltsmin8924139810523056280;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin8924139810523056280;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased8898563380663136445.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 9 ms. Remains 301 /301 variables (removed 0) and now considering 200/200 (removed 0) transitions.
[2023-03-17 06:41:15] [INFO ] Invariant cache hit.
[2023-03-17 06:41:15] [INFO ] Implicit Places using invariants in 142 ms returned []
[2023-03-17 06:41:15] [INFO ] Invariant cache hit.
[2023-03-17 06:41:16] [INFO ] Implicit Places using invariants and state equation in 260 ms returned []
Implicit Place search using SMT with State Equation took 404 ms to find 0 implicit places.
[2023-03-17 06:41:16] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-17 06:41:16] [INFO ] Invariant cache hit.
[2023-03-17 06:41:16] [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 544 ms. Remains : 301/301 places, 200/200 transitions.
Built C files in :
/tmp/ltsmin15990394750817249870
[2023-03-17 06:41:16] [INFO ] Computing symmetric may disable matrix : 200 transitions.
[2023-03-17 06:41:16] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-17 06:41:16] [INFO ] Computing symmetric may enable matrix : 200 transitions.
[2023-03-17 06:41:16] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-17 06:41:16] [INFO ] Computing Do-Not-Accords matrix : 200 transitions.
[2023-03-17 06:41:16] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-17 06:41:16] [INFO ] Built C files in 11ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15990394750817249870
Running compilation step : cd /tmp/ltsmin15990394750817249870;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 399 ms.
Running link step : cd /tmp/ltsmin15990394750817249870;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin15990394750817249870;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased4719590465904962272.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-03-17 06:41:31] [INFO ] Flatten gal took : 13 ms
[2023-03-17 06:41:31] [INFO ] Flatten gal took : 9 ms
[2023-03-17 06:41:31] [INFO ] Time to serialize gal into /tmp/LTL2896405892544410727.gal : 2 ms
[2023-03-17 06:41:31] [INFO ] Time to serialize properties into /tmp/LTL5423463901857202397.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.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL2896405892544410727.gal' '-t' 'CGAL' '-hoa' '/tmp/aut12863638186814552863.hoa' '-atoms' '/tmp/LTL5423463901857202397.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL5423463901857202397.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut12863638186814552863.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.
[2023-03-17 06:41:46] [INFO ] Flatten gal took : 11 ms
[2023-03-17 06:41:46] [INFO ] Flatten gal took : 8 ms
[2023-03-17 06:41:46] [INFO ] Time to serialize gal into /tmp/LTL7578390308377620436.gal : 19 ms
[2023-03-17 06:41:46] [INFO ] Time to serialize properties into /tmp/LTL9079211865334884106.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL7578390308377620436.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9079211865334884106.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((G(F(("(p_1_43<=r_1_56)")||((("(p_1_28<=r_0_78)")||(F("(p_1_52<=p_0_61)")))U("((r_1_9>=1)||(r_1_15<=p_1_92))"))))))
Formula 0 simplified : FG(!"(p_1_43<=r_1_56)" & ((!"(p_1_28<=r_0_78)" & G!"(p_1_52<=p_0_61)") R !"((r_1_9>=1)||(r_1_15<=p_1_92))"))
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.
[2023-03-17 06:42:01] [INFO ] Flatten gal took : 8 ms
[2023-03-17 06:42:01] [INFO ] Applying decomposition
[2023-03-17 06:42:01] [INFO ] Flatten gal took : 8 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph8398601297209982067.txt' '-o' '/tmp/graph8398601297209982067.bin' '-w' '/tmp/graph8398601297209982067.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph8398601297209982067.bin' '-l' '-1' '-v' '-w' '/tmp/graph8398601297209982067.weights' '-q' '0' '-e' '0.001'
[2023-03-17 06:42:01] [INFO ] Decomposing Gal with order
[2023-03-17 06:42:01] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-17 06:42:01] [INFO ] Flatten gal took : 23 ms
[2023-03-17 06:42:01] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2023-03-17 06:42:01] [INFO ] Time to serialize gal into /tmp/LTL680980821416652557.gal : 3 ms
[2023-03-17 06:42:01] [INFO ] Time to serialize properties into /tmp/LTL9320691689240843090.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL680980821416652557.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9320691689240843090.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...274
Read 1 LTL properties
Checking formula 0 : !((G(F(("(gu100.p_1_43<=gu100.r_1_56)")||((("(gu99.p_1_28<=gu99.r_0_78)")||(F("(gu101.p_1_52<=gu101.p_0_61)")))U("((gi0.gi0.gi0.gi0.gi...207
Formula 0 simplified : FG(!"(gu100.p_1_43<=gu100.r_1_56)" & ((!"(gu99.p_1_28<=gu99.r_0_78)" & G!"(gu101.p_1_52<=gu101.p_0_61)") R !"((gi0.gi0.gi0.gi0.gi0.g...200
Reverse transition relation is NOT exact ! Due to transitions gi0.gi0.gi0.gi2.gi2.t102_t101, gi2.t99_t100, Intersection with reachable at each step enable...206
Computing Next relation with stutter on 99 deadlock states
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin869090599869410160
[2023-03-17 06:42:16] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin869090599869410160
Running compilation step : cd /tmp/ltsmin869090599869410160;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 359 ms.
Running link step : cd /tmp/ltsmin869090599869410160;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 28 ms.
Running LTSmin : cd /tmp/ltsmin869090599869410160;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](<>(((LTLAPp0==true)||(((LTLAPp1==true)||<>((LTLAPp2==true))) U (LTLAPp3==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 94839 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 2 out of 321 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 321/321 places, 202/202 transitions.
Applied a total of 0 rules in 2 ms. Remains 321 /321 variables (removed 0) and now considering 202/202 (removed 0) transitions.
// Phase 1: matrix 202 rows 321 cols
[2023-03-17 06:42:31] [INFO ] Computed 121 place invariants in 3 ms
[2023-03-17 06:42:31] [INFO ] Implicit Places using invariants in 149 ms returned [205, 214, 216, 220, 223, 226, 248, 253, 259, 266, 268, 274, 276, 284, 286, 292, 302, 310, 317]
Discarding 19 places :
Implicit Place search using SMT only with invariants took 150 ms to find 19 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 302/321 places, 202/202 transitions.
Applied a total of 0 rules in 3 ms. Remains 302 /302 variables (removed 0) and now considering 202/202 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 155 ms. Remains : 302/321 places, 202/202 transitions.
Stuttering acceptance computed with spot in 102 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ResAllocation-PT-R100C002-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(LEQ s210 s268)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 269 ms.
Product exploration explored 100000 steps with 33333 reset in 291 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 (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X p0))
Knowledge based reduction with 2 factoid took 47 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-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ResAllocation-PT-R100C002-LTLCardinality-14 finished in 885 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0) U (p1&&G(p2))))'
Support contains 5 out of 321 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 321/321 places, 202/202 transitions.
Applied a total of 0 rules in 2 ms. Remains 321 /321 variables (removed 0) and now considering 202/202 (removed 0) transitions.
[2023-03-17 06:42:32] [INFO ] Invariant cache hit.
[2023-03-17 06:42:32] [INFO ] Implicit Places using invariants in 138 ms returned [205, 211, 216, 220, 223, 248, 253, 259, 266, 268, 274, 276, 281, 284, 286, 292, 302, 310, 317]
Discarding 19 places :
Implicit Place search using SMT only with invariants took 139 ms to find 19 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 302/321 places, 202/202 transitions.
Applied a total of 0 rules in 2 ms. Remains 302 /302 variables (removed 0) and now considering 202/202 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 144 ms. Remains : 302/321 places, 202/202 transitions.
Stuttering acceptance computed with spot in 120 ms :[(OR (NOT p2) (NOT p1)), (NOT p0), (NOT p2), true, (AND (NOT p2) p0)]
Running random walk in product with property : ResAllocation-PT-R100C002-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=(OR (NOT p1) (NOT p2)), acceptance={0} source=0 dest: 0}, { cond=(OR (NOT p1) (NOT p2)), acceptance={} source=0 dest: 1}, { cond=(AND p1 p2), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p2) p0), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p2) p0), acceptance={} source=2 dest: 1}, { cond=p2, acceptance={} source=2 dest: 2}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=2 dest: 3}, { cond=(AND p2 (NOT p0)), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p2) p0), acceptance={} source=4 dest: 3}, { cond=(AND p2 p0), acceptance={} source=4 dest: 4}]], initial=0, aps=[p1:(LEQ s56 s212), p2:(LEQ 1 s221), p0:(GT s18 s290)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 25007 reset in 273 ms.
Product exploration explored 100000 steps with 24970 reset in 307 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 p1 p2 (NOT p0)), (X p2), (X (NOT (AND (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p2) p0))), (X (NOT p0)), (X (AND p1 p2)), (X (AND p2 (NOT p0))), (X (NOT (OR (NOT p1) (NOT p2)))), (X (X p2)), true, (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (NOT p0))), (X (X (AND p1 p2))), (X (X (AND p2 (NOT p0)))), (X (X (NOT (OR (NOT p1) (NOT p2))))), (X (X (NOT (AND p2 p0))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 17 factoid took 700 ms. Reduced automaton from 5 states, 12 edges and 3 AP (stutter sensitive) to 5 states, 14 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 145 ms :[(OR (NOT p1) (NOT p2)), (AND p1 (NOT p0) p2), (NOT p2), true, (AND p0 (NOT p2))]
Incomplete random walk after 10000 steps, including 3 resets, run finished after 118 ms. (steps per millisecond=84 ) properties (out of 9) seen :3
Finished Best-First random walk after 2021 steps, including 0 resets, run visited all 6 properties in 6 ms. (steps per millisecond=336 )
Knowledge obtained : [(AND p1 p2 (NOT p0)), (X p2), (X (NOT (AND (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p2) p0))), (X (NOT p0)), (X (AND p1 p2)), (X (AND p2 (NOT p0))), (X (NOT (OR (NOT p1) (NOT p2)))), (X (X p2)), true, (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (NOT p0))), (X (X (AND p1 p2))), (X (X (AND p2 (NOT p0)))), (X (X (NOT (OR (NOT p1) (NOT p2))))), (X (X (NOT (AND p2 p0))))]
False Knowledge obtained : [(F (AND p0 (NOT p2))), (F (NOT (AND p1 (NOT p0) p2))), (F (AND (NOT p0) (NOT p2))), (F (NOT p2)), (F (OR (AND (NOT p1) p0) (AND p0 (NOT p2)))), (F (OR (AND (NOT p1) (NOT p0)) (AND (NOT p0) (NOT p2)))), (F (NOT (AND p1 p2))), (F (AND p0 p2)), (F (NOT (AND (NOT p0) p2)))]
Property proved to be false thanks to negative knowledge :(F (AND (NOT p0) (NOT p2)))
Knowledge based reduction with 17 factoid took 273 ms. Reduced automaton from 5 states, 14 edges and 3 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA ResAllocation-PT-R100C002-LTLCardinality-15 FALSE TECHNIQUES KNOWLEDGE
Treatment of property ResAllocation-PT-R100C002-LTLCardinality-15 finished in 2122 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0||((p1||F(p2)) U p3)))))'
[2023-03-17 06:42:35] [INFO ] Flatten gal took : 11 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin9625113906292071020
[2023-03-17 06:42:35] [INFO ] Computing symmetric may disable matrix : 202 transitions.
[2023-03-17 06:42:35] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-17 06:42:35] [INFO ] Computing symmetric may enable matrix : 202 transitions.
[2023-03-17 06:42:35] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-17 06:42:35] [INFO ] Applying decomposition
[2023-03-17 06:42:35] [INFO ] Computing Do-Not-Accords matrix : 202 transitions.
[2023-03-17 06:42:35] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-17 06:42:35] [INFO ] Built C files in 14ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9625113906292071020
Running compilation step : cd /tmp/ltsmin9625113906292071020;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '240' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2023-03-17 06:42:35] [INFO ] Flatten gal took : 13 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph17822163044790848268.txt' '-o' '/tmp/graph17822163044790848268.bin' '-w' '/tmp/graph17822163044790848268.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph17822163044790848268.bin' '-l' '-1' '-v' '-w' '/tmp/graph17822163044790848268.weights' '-q' '0' '-e' '0.001'
[2023-03-17 06:42:35] [INFO ] Decomposing Gal with order
[2023-03-17 06:42:35] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-17 06:42:35] [INFO ] Flatten gal took : 11 ms
[2023-03-17 06:42:35] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2023-03-17 06:42:35] [INFO ] Time to serialize gal into /tmp/LTLCardinality2321291139575845294.gal : 4 ms
[2023-03-17 06:42:35] [INFO ] Time to serialize properties into /tmp/LTLCardinality11691180214237426372.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality2321291139575845294.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality11691180214237426372.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...298
Read 3 LTL properties
Checking formula 0 : !((F(G("(gu56.r_1_83<=gu56.p_0_57)"))))
Formula 0 simplified : GF!"(gu56.r_1_83<=gu56.p_0_57)"
Compilation finished in 419 ms.
Running link step : cd /tmp/ltsmin9625113906292071020;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin9625113906292071020;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>([]((LTLAPp0==true)))' '--buchi-type=spotba'
Reverse transition relation is NOT exact ! Due to transitions gi0.gu0.t101, gi6.gu96.t100, Intersection with reachable at each step enabled. (destroyed/re...190
Computing Next relation with stutter on 99 deadlock states
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.002: Loading model from ./gal.so
pins2lts-mc-linux64( 1/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.000: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.005: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.006: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.006: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.006: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.007: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.009: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.010: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.010: Initializing POR dependencies: labels 208, guards 202
pins2lts-mc-linux64( 4/ 8), 0.013: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.024: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.024: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.027: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.028: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.028: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.030: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.265: LTL layer: formula: <>([]((LTLAPp0==true)))
pins2lts-mc-linux64( 5/ 8), 0.265: "<>([]((LTLAPp0==true)))" is not a file, parsing as formula...
pins2lts-mc-linux64( 5/ 8), 0.265: Using Spin LTL semantics
pins2lts-mc-linux64( 0/ 8), 0.460: Forcing use of the an ignoring proviso (cndfs)
pins2lts-mc-linux64( 0/ 8), 0.480: There are 209 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.481: State length is 322, there are 206 groups
pins2lts-mc-linux64( 0/ 8), 0.481: Running cndfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.481: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.481: Successor permutation: dynamic
pins2lts-mc-linux64( 0/ 8), 0.481: Visible groups: 0 / 206, labels: 1 / 209
pins2lts-mc-linux64( 0/ 8), 0.481: POR cycle proviso: cndfs (ltl)
pins2lts-mc-linux64( 0/ 8), 0.481: Global bits: 2, count bits: 2, local bits: 0
pins2lts-mc-linux64( 3/ 8), 0.540: [Blue] ~120 levels ~960 states ~5520 transitions
pins2lts-mc-linux64( 0/ 8), 0.585: [Blue] ~240 levels ~1920 states ~9344 transitions
pins2lts-mc-linux64( 0/ 8), 0.678: [Blue] ~480 levels ~3840 states ~16984 transitions
pins2lts-mc-linux64( 0/ 8), 0.786: [Blue] ~960 levels ~7680 states ~26736 transitions
pins2lts-mc-linux64( 0/ 8), 0.959: [Blue] ~1920 levels ~15360 states ~46648 transitions
pins2lts-mc-linux64( 3/ 8), 1.232: [Blue] ~3707 levels ~30720 states ~99976 transitions
pins2lts-mc-linux64( 3/ 8), 1.582: [Blue] ~3707 levels ~61440 states ~180592 transitions
pins2lts-mc-linux64( 3/ 8), 2.240: [Blue] ~3707 levels ~122880 states ~359472 transitions
pins2lts-mc-linux64( 3/ 8), 3.452: [Blue] ~3707 levels ~245760 states ~712536 transitions
pins2lts-mc-linux64( 3/ 8), 6.020: [Blue] ~3707 levels ~491520 states ~1655640 transitions
pins2lts-mc-linux64( 3/ 8), 11.337: [Blue] ~3707 levels ~983040 states ~3535104 transitions
pins2lts-mc-linux64( 3/ 8), 22.046: [Blue] ~3707 levels ~1966080 states ~7269704 transitions
pins2lts-mc-linux64( 3/ 8), 40.662: [Blue] ~3707 levels ~3932160 states ~15456568 transitions
pins2lts-mc-linux64( 3/ 8), 81.839: [Blue] ~3707 levels ~7864320 states ~33991600 transitions
pins2lts-mc-linux64( 3/ 8), 164.687: [Blue] ~3707 levels ~15728640 states ~70741984 transitions
pins2lts-mc-linux64( 4/ 8), 297.011: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 297.050:
pins2lts-mc-linux64( 0/ 8), 297.050: Explored 23896857 states 129838653 transitions, fanout: 5.433
pins2lts-mc-linux64( 0/ 8), 297.050: Total exploration time 296.560 sec (296.520 sec minimum, 296.535 sec on average)
pins2lts-mc-linux64( 0/ 8), 297.050: States per second: 80580, Transitions per second: 437816
pins2lts-mc-linux64( 0/ 8), 297.050:
pins2lts-mc-linux64( 0/ 8), 297.050: State space has 23955766 states, 2259267 are accepting
pins2lts-mc-linux64( 0/ 8), 297.050: cndfs_1 (permutation: dynamic) stats:
pins2lts-mc-linux64( 0/ 8), 297.050: blue states: 23896857 (99.75%), transitions: 0 (per worker)
pins2lts-mc-linux64( 0/ 8), 297.050: red states: 0 (0.00%), bogus: 0 (0.00%), transitions: 0, waits: 0 (0.00 sec)
pins2lts-mc-linux64( 0/ 8), 297.050: all-red states: 2789288 (11.64%), bogus 0 (0.00%)
pins2lts-mc-linux64( 0/ 8), 297.050:
pins2lts-mc-linux64( 0/ 8), 297.050: Total memory used for local state coloring: 0.4MB
pins2lts-mc-linux64( 0/ 8), 297.050:
pins2lts-mc-linux64( 0/ 8), 297.050: Queue width: 8B, total height: 24895, memory: 0.19MB
pins2lts-mc-linux64( 0/ 8), 297.050: Tree memory: 438.8MB, 19.2 B/state, compr.: 1.5%
pins2lts-mc-linux64( 0/ 8), 297.050: Tree fill ratio (roots/leafs): 17.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 297.050: Stored 202 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 297.050: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 297.050: Est. total memory use: 439.0MB (~1024.2MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin9625113906292071020;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>([]((LTLAPp0==true)))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin9625113906292071020;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>([]((LTLAPp0==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)
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
42145 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,421.509,2953504,1,0,7646,1.58337e+07,20,6525,4579,2.78772e+07,12956
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 : !((F("(gu117.p_1_94>gu117.r_0_15)")))
Formula 1 simplified : G!"(gu117.p_1_94>gu117.r_0_15)"
Computing Next relation with stutter on 99 deadlock states
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
22600 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,647.517,3569728,1,0,9412,2.10083e+07,17,8212,4581,3.01423e+07,9460
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA ResAllocation-PT-R100C002-LTLCardinality-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 2 : !((G(F(("(gu109.p_1_43<=gu109.r_1_56)")||((("(gu103.p_1_28<=gu103.r_0_78)")||(F("(gu107.p_1_52<=gu107.p_0_61)")))U("((gi0.gu98.r_1_9>=...195
Formula 2 simplified : FG(!"(gu109.p_1_43<=gu109.r_1_56)" & ((!"(gu103.p_1_28<=gu103.r_0_78)" & G!"(gu107.p_1_52<=gu107.p_0_61)") R !"((gi0.gu98.r_1_9>=1)|...188
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
8376 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,731.279,3924720,1,0,9412,2.45157e+07,18,8212,4391,3.01423e+07,1098
no accepting run found
Formula 2 is TRUE no accepting run found.
FORMULA ResAllocation-PT-R100C002-LTLCardinality-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Total runtime 1254093 ms.

BK_STOP 1679036258290

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /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="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool itstools"
echo " Input is 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 r325-tall-167889197600771"
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 ;