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

--------------------
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 1679170132903

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=ltsminxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ResAllocation-PT-R100C002
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-18 20:08:54] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-18 20:08:54] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-18 20:08:54] [INFO ] Load time of PNML (sax parser for PT used): 84 ms
[2023-03-18 20:08:54] [INFO ] Transformed 400 places.
[2023-03-18 20:08:54] [INFO ] Transformed 202 transitions.
[2023-03-18 20:08:54] [INFO ] Parsed PT model containing 400 places and 202 transitions and 1000 arcs in 146 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 8 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 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 40 ms. Remains 400 /400 variables (removed 0) and now considering 202/202 (removed 0) transitions.
// Phase 1: matrix 202 rows 400 cols
[2023-03-18 20:08:54] [INFO ] Computed 200 place invariants in 13 ms
[2023-03-18 20:08:55] [INFO ] Implicit Places using invariants in 495 ms returned []
[2023-03-18 20:08:55] [INFO ] Invariant cache hit.
[2023-03-18 20:08:55] [INFO ] Implicit Places using invariants and state equation in 468 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 with State Equation took 993 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 23 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 1057 ms. Remains : 321/400 places, 202/202 transitions.
Support contains 48 out of 321 places after structural reductions.
[2023-03-18 20:08:55] [INFO ] Flatten gal took : 46 ms
[2023-03-18 20:08:55] [INFO ] Flatten gal took : 19 ms
[2023-03-18 20:08:55] [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 460 ms. (steps per millisecond=21 ) properties (out of 26) seen :9
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 17) 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 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 17) 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 17) 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 17) 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 17) 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 17) 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 17) 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 17) 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 17) 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 17) 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 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 17) 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 17) 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 17) 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 17) 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 17) seen :0
Running SMT prover for 17 properties.
// Phase 1: matrix 202 rows 321 cols
[2023-03-18 20:08:56] [INFO ] Computed 121 place invariants in 3 ms
[2023-03-18 20:08:56] [INFO ] [Real]Absence check using 121 positive place invariants in 17 ms returned sat
[2023-03-18 20:08:56] [INFO ] After 292ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0 real:15
[2023-03-18 20:08:56] [INFO ] [Nat]Absence check using 121 positive place invariants in 17 ms returned sat
[2023-03-18 20:08:57] [INFO ] After 211ms SMT Verify possible using state equation in natural domain returned unsat :8 sat :9
[2023-03-18 20:08:57] [INFO ] Deduced a trap composed of 4 places in 52 ms of which 6 ms to minimize.
[2023-03-18 20:08:57] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 78 ms
[2023-03-18 20:08:57] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 1 ms to minimize.
[2023-03-18 20:08:57] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 68 ms
[2023-03-18 20:08:57] [INFO ] After 552ms SMT Verify possible using trap constraints in natural domain returned unsat :8 sat :9
Attempting to minimize the solution found.
Minimization took 121 ms.
[2023-03-18 20:08:57] [INFO ] After 890ms SMT Verify possible using all constraints in natural domain returned unsat :8 sat :9
Fused 17 Parikh solutions to 9 different solutions.
Parikh walk visited 6 properties in 137 ms.
Support contains 8 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 2 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 1 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 1 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 0 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 1 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 1 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 1 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 0 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 1 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 252 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 252 ms. Remains : 256/321 places, 160/202 transitions.
Incomplete random walk after 10000 steps, including 6 resets, run finished after 201 ms. (steps per millisecond=49 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 709429 steps, run timeout after 3001 ms. (steps per millisecond=236 ) properties seen :{1=1}
Probabilistic random walk after 709429 steps, saw 178729 distinct states, run finished after 3001 ms. (steps per millisecond=236 ) properties seen :1
Running SMT prover for 2 properties.
// Phase 1: matrix 160 rows 256 cols
[2023-03-18 20:09:01] [INFO ] Computed 98 place invariants in 4 ms
[2023-03-18 20:09:01] [INFO ] After 49ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-18 20:09:01] [INFO ] [Nat]Absence check using 98 positive place invariants in 15 ms returned sat
[2023-03-18 20:09:01] [INFO ] After 90ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-18 20:09:01] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 2 ms to minimize.
[2023-03-18 20:09:01] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 54 ms
[2023-03-18 20:09:01] [INFO ] After 168ms 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-18 20:09:01] [INFO ] After 265ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 11 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 5 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 5 ms. Remains : 256/256 places, 160/160 transitions.
Incomplete random walk after 10000 steps, including 6 resets, run finished after 120 ms. (steps per millisecond=83 ) properties (out of 2) 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 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 785612 steps, run timeout after 3001 ms. (steps per millisecond=261 ) properties seen :{}
Probabilistic random walk after 785612 steps, saw 194056 distinct states, run finished after 3001 ms. (steps per millisecond=261 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-18 20:09:04] [INFO ] Invariant cache hit.
[2023-03-18 20:09:04] [INFO ] After 48ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-18 20:09:05] [INFO ] [Nat]Absence check using 98 positive place invariants in 11 ms returned sat
[2023-03-18 20:09:05] [INFO ] After 96ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-18 20:09:05] [INFO ] After 131ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 23 ms.
[2023-03-18 20:09:05] [INFO ] After 222ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 11 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 5 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.
Starting structural reductions in REACHABILITY mode, iteration 0 : 256/256 places, 160/160 transitions.
Applied a total of 0 rules in 4 ms. Remains 256 /256 variables (removed 0) and now considering 160/160 (removed 0) transitions.
[2023-03-18 20:09:05] [INFO ] Invariant cache hit.
[2023-03-18 20:09:05] [INFO ] Implicit Places using invariants in 126 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 129 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 5 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 138 ms. Remains : 243/256 places, 160/160 transitions.
Incomplete random walk after 10000 steps, including 6 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 810101 steps, run timeout after 3001 ms. (steps per millisecond=269 ) properties seen :{}
Probabilistic random walk after 810101 steps, saw 199293 distinct states, run finished after 3002 ms. (steps per millisecond=269 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 160 rows 243 cols
[2023-03-18 20:09:08] [INFO ] Computed 85 place invariants in 5 ms
[2023-03-18 20:09:08] [INFO ] After 44ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-18 20:09:08] [INFO ] [Nat]Absence check using 85 positive place invariants in 9 ms returned sat
[2023-03-18 20:09:08] [INFO ] After 92ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-18 20:09:08] [INFO ] After 131ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 28 ms.
[2023-03-18 20:09:08] [INFO ] After 219ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 10 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-18 20:09:08] [INFO ] Invariant cache hit.
[2023-03-18 20:09:08] [INFO ] Implicit Places using invariants in 117 ms returned []
[2023-03-18 20:09:08] [INFO ] Invariant cache hit.
[2023-03-18 20:09:09] [INFO ] Implicit Places using invariants and state equation in 196 ms returned []
Implicit Place search using SMT with State Equation took 315 ms to find 0 implicit places.
[2023-03-18 20:09:09] [INFO ] Redundant transitions in 4 ms returned []
[2023-03-18 20:09:09] [INFO ] Invariant cache hit.
[2023-03-18 20:09:09] [INFO ] Dead Transitions using invariants and state equation in 85 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 413 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-18 20:09:09] [INFO ] Computed 83 place invariants in 1 ms
[2023-03-18 20:09:09] [INFO ] After 40ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-18 20:09:09] [INFO ] [Nat]Absence check using 83 positive place invariants in 9 ms returned sat
[2023-03-18 20:09:09] [INFO ] After 85ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-18 20:09:09] [INFO ] After 115ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 24 ms.
[2023-03-18 20:09:09] [INFO ] After 201ms 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 12 ms. Remains 319 /321 variables (removed 2) and now considering 200/202 (removed 2) transitions.
// Phase 1: matrix 200 rows 319 cols
[2023-03-18 20:09:09] [INFO ] Computed 121 place invariants in 4 ms
[2023-03-18 20:09:09] [INFO ] Implicit Places using invariants in 154 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 155 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 174 ms. Remains : 301/321 places, 200/202 transitions.
Stuttering acceptance computed with spot in 149 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 814 steps with 0 reset in 14 ms.
FORMULA ResAllocation-PT-R100C002-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ResAllocation-PT-R100C002-LTLCardinality-01 finished in 381 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-18 20:09:10] [INFO ] Computed 121 place invariants in 2 ms
[2023-03-18 20:09:10] [INFO ] Implicit Places using invariants in 152 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 154 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 160 ms. Remains : 302/321 places, 202/202 transitions.
Stuttering acceptance computed with spot in 628 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 5694 reset in 430 ms.
Product exploration explored 100000 steps with 5773 reset in 417 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 3335 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 606 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 254 ms. (steps per millisecond=39 ) properties (out of 21) seen :10
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) 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 39 ms. (steps per millisecond=256 ) 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 41 ms. (steps per millisecond=243 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) 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
Running SMT prover for 11 properties.
// Phase 1: matrix 202 rows 302 cols
[2023-03-18 20:09:16] [INFO ] Computed 102 place invariants in 1 ms
[2023-03-18 20:09:16] [INFO ] After 78ms SMT Verify possible using all constraints in real domain returned unsat :3 sat :0 real:8
[2023-03-18 20:09:16] [INFO ] [Nat]Absence check using 102 positive place invariants in 13 ms returned sat
[2023-03-18 20:09:16] [INFO ] After 170ms SMT Verify possible using state equation in natural domain returned unsat :3 sat :8
[2023-03-18 20:09:16] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 0 ms to minimize.
[2023-03-18 20:09:16] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 59 ms
[2023-03-18 20:09:16] [INFO ] After 386ms SMT Verify possible using trap constraints in natural domain returned unsat :3 sat :8
Attempting to minimize the solution found.
Minimization took 105 ms.
[2023-03-18 20:09:16] [INFO ] After 615ms 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 335 steps, including 0 resets, run visited all 2 properties in 5 ms. (steps per millisecond=67 )
Parikh walk visited 8 properties in 43 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 4470 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 766 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 568 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-18 20:09:22] [INFO ] Invariant cache hit.
[2023-03-18 20:09:23] [INFO ] [Real]Absence check using 102 positive place invariants in 24 ms returned sat
[2023-03-18 20:09:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 20:09:23] [INFO ] [Real]Absence check using state equation in 625 ms returned sat
[2023-03-18 20:09:23] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 20:09:23] [INFO ] [Nat]Absence check using 102 positive place invariants in 24 ms returned sat
[2023-03-18 20:09:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-18 20:09:24] [INFO ] [Nat]Absence check using state equation in 572 ms returned sat
[2023-03-18 20:09:24] [INFO ] Deduced a trap composed of 4 places in 49 ms of which 1 ms to minimize.
[2023-03-18 20:09:24] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 0 ms to minimize.
[2023-03-18 20:09:24] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 134 ms
[2023-03-18 20:09:24] [INFO ] Computed and/alt/rep : 200/200/200 causal constraints (skipped 0 transitions) in 12 ms.
[2023-03-18 20:09:24] [INFO ] Added : 101 causal constraints over 21 iterations in 512 ms. Result :sat
Could not prove EG (NOT p0)
[2023-03-18 20:09:24] [INFO ] Invariant cache hit.
[2023-03-18 20:09:25] [INFO ] [Real]Absence check using 102 positive place invariants in 24 ms returned sat
[2023-03-18 20:09:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 20:09:25] [INFO ] [Real]Absence check using state equation in 450 ms returned sat
[2023-03-18 20:09:25] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 20:09:25] [INFO ] [Nat]Absence check using 102 positive place invariants in 23 ms returned sat
[2023-03-18 20:09:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-18 20:09:26] [INFO ] [Nat]Absence check using state equation in 450 ms returned sat
[2023-03-18 20:09:26] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 0 ms to minimize.
[2023-03-18 20:09:26] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 0 ms to minimize.
[2023-03-18 20:09:26] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 108 ms
[2023-03-18 20:09:26] [INFO ] Computed and/alt/rep : 200/200/200 causal constraints (skipped 0 transitions) in 11 ms.
[2023-03-18 20:09:26] [INFO ] Added : 102 causal constraints over 21 iterations in 561 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 3 ms. Remains 302 /302 variables (removed 0) and now considering 202/202 (removed 0) transitions.
[2023-03-18 20:09:26] [INFO ] Invariant cache hit.
[2023-03-18 20:09:26] [INFO ] Implicit Places using invariants in 138 ms returned []
[2023-03-18 20:09:26] [INFO ] Invariant cache hit.
[2023-03-18 20:09:27] [INFO ] Implicit Places using invariants and state equation in 268 ms returned []
Implicit Place search using SMT with State Equation took 408 ms to find 0 implicit places.
[2023-03-18 20:09:27] [INFO ] Invariant cache hit.
[2023-03-18 20:09:27] [INFO ] Dead Transitions using invariants and state equation in 110 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 524 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 6232 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 517 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 217 ms. (steps per millisecond=46 ) properties (out of 13) seen :6
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 32 ms. (steps per millisecond=312 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
[2023-03-18 20:09:34] [INFO ] Invariant cache hit.
[2023-03-18 20:09:34] [INFO ] After 70ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-18 20:09:34] [INFO ] [Nat]Absence check using 102 positive place invariants in 13 ms returned sat
[2023-03-18 20:09:34] [INFO ] After 145ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2023-03-18 20:09:35] [INFO ] After 288ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 79 ms.
[2023-03-18 20:09:35] [INFO ] After 481ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
Parikh walk visited 6 properties in 50 ms.
Support contains 2 out of 302 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 302/302 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 300 transition count 200
Free-agglomeration rule applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 6 place count 300 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 296 transition count 198
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 14 place count 294 transition count 196
Free-agglomeration rule applied 2 times.
Iterating global reduction 1 with 2 rules applied. Total rules applied 16 place count 294 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 290 transition count 194
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 2 with 4 rules applied. Total rules applied 24 place count 288 transition count 192
Free-agglomeration rule applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 26 place count 288 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 284 transition count 190
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 3 with 4 rules applied. Total rules applied 34 place count 282 transition count 188
Free-agglomeration rule applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 36 place count 282 transition count 186
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 40 place count 278 transition count 186
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 5 rules applied. Total rules applied 45 place count 275 transition count 184
Free-agglomeration rule applied 2 times.
Iterating global reduction 4 with 2 rules applied. Total rules applied 47 place count 275 transition count 182
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 51 place count 271 transition count 182
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 5 with 4 rules applied. Total rules applied 55 place count 269 transition count 180
Free-agglomeration rule applied 2 times.
Iterating global reduction 5 with 2 rules applied. Total rules applied 57 place count 269 transition count 178
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 61 place count 265 transition count 178
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 6 with 4 rules applied. Total rules applied 65 place count 263 transition count 176
Free-agglomeration rule applied 2 times.
Iterating global reduction 6 with 2 rules applied. Total rules applied 67 place count 263 transition count 174
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 71 place count 259 transition count 174
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 7 with 4 rules applied. Total rules applied 75 place count 257 transition count 172
Free-agglomeration rule applied 2 times.
Iterating global reduction 7 with 2 rules applied. Total rules applied 77 place count 257 transition count 170
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 7 with 4 rules applied. Total rules applied 81 place count 253 transition count 170
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 8 with 4 rules applied. Total rules applied 85 place count 251 transition count 168
Free-agglomeration rule applied 2 times.
Iterating global reduction 8 with 2 rules applied. Total rules applied 87 place count 251 transition count 166
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 8 with 4 rules applied. Total rules applied 91 place count 247 transition count 166
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 9 with 4 rules applied. Total rules applied 95 place count 245 transition count 164
Free-agglomeration rule applied 2 times.
Iterating global reduction 9 with 2 rules applied. Total rules applied 97 place count 245 transition count 162
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 9 with 4 rules applied. Total rules applied 101 place count 241 transition count 162
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 10 with 4 rules applied. Total rules applied 105 place count 239 transition count 160
Free-agglomeration rule applied 2 times.
Iterating global reduction 10 with 2 rules applied. Total rules applied 107 place count 239 transition count 158
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 10 with 4 rules applied. Total rules applied 111 place count 235 transition count 158
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 11 with 4 rules applied. Total rules applied 115 place count 233 transition count 156
Free-agglomeration rule applied 2 times.
Iterating global reduction 11 with 2 rules applied. Total rules applied 117 place count 233 transition count 154
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 11 with 4 rules applied. Total rules applied 121 place count 229 transition count 154
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 12 with 4 rules applied. Total rules applied 125 place count 227 transition count 152
Free-agglomeration rule applied 2 times.
Iterating global reduction 12 with 2 rules applied. Total rules applied 127 place count 227 transition count 150
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 12 with 4 rules applied. Total rules applied 131 place count 223 transition count 150
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 13 with 4 rules applied. Total rules applied 135 place count 221 transition count 148
Free-agglomeration rule applied 2 times.
Iterating global reduction 13 with 2 rules applied. Total rules applied 137 place count 221 transition count 146
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 13 with 4 rules applied. Total rules applied 141 place count 217 transition count 146
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 14 with 4 rules applied. Total rules applied 145 place count 215 transition count 144
Free-agglomeration rule applied 2 times.
Iterating global reduction 14 with 2 rules applied. Total rules applied 147 place count 215 transition count 142
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 14 with 4 rules applied. Total rules applied 151 place count 211 transition count 142
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 15 with 4 rules applied. Total rules applied 155 place count 209 transition count 140
Free-agglomeration rule applied 2 times.
Iterating global reduction 15 with 2 rules applied. Total rules applied 157 place count 209 transition count 138
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 15 with 4 rules applied. Total rules applied 161 place count 205 transition count 138
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 16 with 4 rules applied. Total rules applied 165 place count 203 transition count 136
Free-agglomeration rule applied 2 times.
Iterating global reduction 16 with 2 rules applied. Total rules applied 167 place count 203 transition count 134
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 16 with 4 rules applied. Total rules applied 171 place count 199 transition count 134
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 17 with 4 rules applied. Total rules applied 175 place count 197 transition count 132
Free-agglomeration rule applied 2 times.
Iterating global reduction 17 with 2 rules applied. Total rules applied 177 place count 197 transition count 130
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 17 with 4 rules applied. Total rules applied 181 place count 193 transition count 130
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 18 with 4 rules applied. Total rules applied 185 place count 191 transition count 128
Free-agglomeration rule applied 2 times.
Iterating global reduction 18 with 2 rules applied. Total rules applied 187 place count 191 transition count 126
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 18 with 4 rules applied. Total rules applied 191 place count 187 transition count 126
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 19 with 4 rules applied. Total rules applied 195 place count 185 transition count 124
Free-agglomeration rule applied 2 times.
Iterating global reduction 19 with 2 rules applied. Total rules applied 197 place count 185 transition count 122
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 19 with 4 rules applied. Total rules applied 201 place count 181 transition count 122
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 20 with 4 rules applied. Total rules applied 205 place count 179 transition count 120
Free-agglomeration rule applied 2 times.
Iterating global reduction 20 with 2 rules applied. Total rules applied 207 place count 179 transition count 118
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 20 with 4 rules applied. Total rules applied 211 place count 175 transition count 118
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 21 with 4 rules applied. Total rules applied 215 place count 173 transition count 116
Free-agglomeration rule applied 2 times.
Iterating global reduction 21 with 2 rules applied. Total rules applied 217 place count 173 transition count 114
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 21 with 4 rules applied. Total rules applied 221 place count 169 transition count 114
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 22 with 4 rules applied. Total rules applied 225 place count 167 transition count 112
Free-agglomeration rule applied 2 times.
Iterating global reduction 22 with 2 rules applied. Total rules applied 227 place count 167 transition count 110
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 22 with 4 rules applied. Total rules applied 231 place count 163 transition count 110
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 23 with 4 rules applied. Total rules applied 235 place count 161 transition count 108
Free-agglomeration rule applied 2 times.
Iterating global reduction 23 with 2 rules applied. Total rules applied 237 place count 161 transition count 106
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 23 with 4 rules applied. Total rules applied 241 place count 157 transition count 106
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 24 with 4 rules applied. Total rules applied 245 place count 155 transition count 104
Free-agglomeration rule applied 2 times.
Iterating global reduction 24 with 2 rules applied. Total rules applied 247 place count 155 transition count 102
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 24 with 4 rules applied. Total rules applied 251 place count 151 transition count 102
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 25 with 4 rules applied. Total rules applied 255 place count 149 transition count 100
Free-agglomeration rule applied 2 times.
Iterating global reduction 25 with 2 rules applied. Total rules applied 257 place count 149 transition count 98
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 25 with 4 rules applied. Total rules applied 261 place count 145 transition count 98
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 26 with 4 rules applied. Total rules applied 265 place count 143 transition count 96
Free-agglomeration rule applied 2 times.
Iterating global reduction 26 with 2 rules applied. Total rules applied 267 place count 143 transition count 94
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 26 with 4 rules applied. Total rules applied 271 place count 139 transition count 94
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 27 with 4 rules applied. Total rules applied 275 place count 137 transition count 92
Free-agglomeration rule applied 2 times.
Iterating global reduction 27 with 2 rules applied. Total rules applied 277 place count 137 transition count 90
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 27 with 4 rules applied. Total rules applied 281 place count 133 transition count 90
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 28 with 4 rules applied. Total rules applied 285 place count 131 transition count 88
Free-agglomeration rule applied 2 times.
Iterating global reduction 28 with 2 rules applied. Total rules applied 287 place count 131 transition count 86
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 28 with 4 rules applied. Total rules applied 291 place count 127 transition count 86
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 29 with 4 rules applied. Total rules applied 295 place count 125 transition count 84
Free-agglomeration rule applied 2 times.
Iterating global reduction 29 with 2 rules applied. Total rules applied 297 place count 125 transition count 82
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 29 with 4 rules applied. Total rules applied 301 place count 121 transition count 82
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 30 with 4 rules applied. Total rules applied 305 place count 119 transition count 80
Free-agglomeration rule applied 2 times.
Iterating global reduction 30 with 2 rules applied. Total rules applied 307 place count 119 transition count 78
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 30 with 4 rules applied. Total rules applied 311 place count 115 transition count 78
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 31 with 4 rules applied. Total rules applied 315 place count 113 transition count 76
Free-agglomeration rule applied 2 times.
Iterating global reduction 31 with 2 rules applied. Total rules applied 317 place count 113 transition count 74
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 31 with 4 rules applied. Total rules applied 321 place count 109 transition count 74
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 32 with 4 rules applied. Total rules applied 325 place count 107 transition count 72
Free-agglomeration rule applied 2 times.
Iterating global reduction 32 with 2 rules applied. Total rules applied 327 place count 107 transition count 70
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 32 with 4 rules applied. Total rules applied 331 place count 103 transition count 70
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 33 with 4 rules applied. Total rules applied 335 place count 101 transition count 68
Free-agglomeration rule applied 2 times.
Iterating global reduction 33 with 2 rules applied. Total rules applied 337 place count 101 transition count 66
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 33 with 4 rules applied. Total rules applied 341 place count 97 transition count 66
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 34 with 4 rules applied. Total rules applied 345 place count 95 transition count 64
Free-agglomeration rule applied 2 times.
Iterating global reduction 34 with 2 rules applied. Total rules applied 347 place count 95 transition count 62
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 34 with 4 rules applied. Total rules applied 351 place count 91 transition count 62
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 35 with 4 rules applied. Total rules applied 355 place count 89 transition count 60
Free-agglomeration rule applied 1 times.
Iterating global reduction 35 with 1 rules applied. Total rules applied 356 place count 89 transition count 59
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 35 with 2 rules applied. Total rules applied 358 place count 87 transition count 59
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 36 with 2 rules applied. Total rules applied 360 place count 86 transition count 58
Free-agglomeration rule applied 1 times.
Iterating global reduction 36 with 1 rules applied. Total rules applied 361 place count 86 transition count 57
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 36 with 2 rules applied. Total rules applied 363 place count 84 transition count 57
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 37 with 2 rules applied. Total rules applied 365 place count 83 transition count 56
Free-agglomeration rule applied 1 times.
Iterating global reduction 37 with 1 rules applied. Total rules applied 366 place count 83 transition count 55
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 37 with 2 rules applied. Total rules applied 368 place count 81 transition count 55
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 38 with 2 rules applied. Total rules applied 370 place count 80 transition count 54
Free-agglomeration rule applied 1 times.
Iterating global reduction 38 with 1 rules applied. Total rules applied 371 place count 80 transition count 53
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 38 with 2 rules applied. Total rules applied 373 place count 78 transition count 53
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 39 with 2 rules applied. Total rules applied 375 place count 77 transition count 52
Free-agglomeration rule applied 1 times.
Iterating global reduction 39 with 1 rules applied. Total rules applied 376 place count 77 transition count 51
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 39 with 2 rules applied. Total rules applied 378 place count 75 transition count 51
Free-agglomeration rule applied 1 times.
Iterating global reduction 40 with 1 rules applied. Total rules applied 379 place count 75 transition count 50
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 40 with 1 rules applied. Total rules applied 380 place count 74 transition count 50
Applied a total of 380 rules in 184 ms. Remains 74 /302 variables (removed 228) and now considering 50/202 (removed 152) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 184 ms. Remains : 74/302 places, 50/202 transitions.
Incomplete random walk after 10000 steps, including 61 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Finished probabilistic random walk after 11083 steps, run visited all 1 properties in 21 ms. (steps per millisecond=527 )
Probabilistic random walk after 11083 steps, saw 3671 distinct states, run finished after 21 ms. (steps per millisecond=527 ) properties seen :1
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 6592 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 677 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 557 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-18 20:09:43] [INFO ] Invariant cache hit.
[2023-03-18 20:09:43] [INFO ] [Real]Absence check using 102 positive place invariants in 24 ms returned sat
[2023-03-18 20:09:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 20:09:43] [INFO ] [Real]Absence check using state equation in 619 ms returned sat
[2023-03-18 20:09:44] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 20:09:44] [INFO ] [Nat]Absence check using 102 positive place invariants in 24 ms returned sat
[2023-03-18 20:09:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-18 20:09:44] [INFO ] [Nat]Absence check using state equation in 587 ms returned sat
[2023-03-18 20:09:44] [INFO ] Deduced a trap composed of 4 places in 47 ms of which 1 ms to minimize.
[2023-03-18 20:09:44] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 0 ms to minimize.
[2023-03-18 20:09:44] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 154 ms
[2023-03-18 20:09:44] [INFO ] Computed and/alt/rep : 200/200/200 causal constraints (skipped 0 transitions) in 12 ms.
[2023-03-18 20:09:45] [INFO ] Added : 101 causal constraints over 21 iterations in 502 ms. Result :sat
Could not prove EG (NOT p0)
[2023-03-18 20:09:45] [INFO ] Invariant cache hit.
[2023-03-18 20:09:45] [INFO ] [Real]Absence check using 102 positive place invariants in 24 ms returned sat
[2023-03-18 20:09:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 20:09:45] [INFO ] [Real]Absence check using state equation in 459 ms returned sat
[2023-03-18 20:09:45] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 20:09:46] [INFO ] [Nat]Absence check using 102 positive place invariants in 23 ms returned sat
[2023-03-18 20:09:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-18 20:09:46] [INFO ] [Nat]Absence check using state equation in 436 ms returned sat
[2023-03-18 20:09:46] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 0 ms to minimize.
[2023-03-18 20:09:46] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 0 ms to minimize.
[2023-03-18 20:09:46] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 112 ms
[2023-03-18 20:09:46] [INFO ] Computed and/alt/rep : 200/200/200 causal constraints (skipped 0 transitions) in 10 ms.
[2023-03-18 20:09:47] [INFO ] Added : 102 causal constraints over 21 iterations in 555 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 665 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 5642 reset in 342 ms.
Product exploration explored 100000 steps with 5673 reset in 374 ms.
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 3 ms. Remains 302 /302 variables (removed 0) and now considering 202/202 (removed 0) transitions.
[2023-03-18 20:09:48] [INFO ] Invariant cache hit.
[2023-03-18 20:09:48] [INFO ] Implicit Places using invariants in 151 ms returned []
[2023-03-18 20:09:49] [INFO ] Invariant cache hit.
[2023-03-18 20:09:49] [INFO ] Implicit Places using invariants and state equation in 281 ms returned []
Implicit Place search using SMT with State Equation took 432 ms to find 0 implicit places.
[2023-03-18 20:09:49] [INFO ] Invariant cache hit.
[2023-03-18 20:09:49] [INFO ] Dead Transitions using invariants and state equation in 112 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 550 ms. Remains : 302/302 places, 202/202 transitions.
Treatment of property ResAllocation-PT-R100C002-LTLCardinality-03 finished in 39424 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 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 12 ms. Remains 319 /321 variables (removed 2) and now considering 200/202 (removed 2) transitions.
// Phase 1: matrix 200 rows 319 cols
[2023-03-18 20:09:49] [INFO ] Computed 121 place invariants in 1 ms
[2023-03-18 20:09:49] [INFO ] Implicit Places using invariants in 152 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 154 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 4 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 171 ms. Remains : 299/321 places, 200/202 transitions.
Stuttering acceptance computed with spot in 30 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 398 ms.
Product exploration explored 100000 steps with 38 reset in 440 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 104 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 89 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=89 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 110 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 37 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
// Phase 1: matrix 200 rows 299 cols
[2023-03-18 20:09:50] [INFO ] Computed 101 place invariants in 2 ms
[2023-03-18 20:09:50] [INFO ] [Real]Absence check using 101 positive place invariants in 22 ms returned sat
[2023-03-18 20:09:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 20:09:52] [INFO ] [Real]Absence check using state equation in 1293 ms returned sat
[2023-03-18 20:09:52] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 20:09:52] [INFO ] [Nat]Absence check using 101 positive place invariants in 23 ms returned sat
[2023-03-18 20:09:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-18 20:09:53] [INFO ] [Nat]Absence check using state equation in 741 ms returned sat
[2023-03-18 20:09:53] [INFO ] Deduced a trap composed of 4 places in 44 ms of which 0 ms to minimize.
[2023-03-18 20:09:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 83 ms
[2023-03-18 20:09:53] [INFO ] Computed and/alt/rep : 198/198/198 causal constraints (skipped 0 transitions) in 12 ms.
[2023-03-18 20:09:54] [INFO ] Added : 157 causal constraints over 32 iterations in 895 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-18 20:09:54] [INFO ] Invariant cache hit.
[2023-03-18 20:09:54] [INFO ] Implicit Places using invariants in 132 ms returned []
[2023-03-18 20:09:54] [INFO ] Invariant cache hit.
[2023-03-18 20:09:54] [INFO ] Implicit Places using invariants and state equation in 264 ms returned []
Implicit Place search using SMT with State Equation took 401 ms to find 0 implicit places.
[2023-03-18 20:09:54] [INFO ] Redundant transitions in 10 ms returned []
[2023-03-18 20:09:54] [INFO ] Invariant cache hit.
[2023-03-18 20:09:54] [INFO ] Dead Transitions using invariants and state equation in 110 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 540 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 102 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 45 ms :[(NOT p0)]
Finished random walk after 73 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=36 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 114 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
[2023-03-18 20:09:55] [INFO ] Invariant cache hit.
[2023-03-18 20:09:55] [INFO ] [Real]Absence check using 101 positive place invariants in 24 ms returned sat
[2023-03-18 20:09:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 20:09:56] [INFO ] [Real]Absence check using state equation in 1321 ms returned sat
[2023-03-18 20:09:56] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 20:09:56] [INFO ] [Nat]Absence check using 101 positive place invariants in 23 ms returned sat
[2023-03-18 20:09:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-18 20:09:57] [INFO ] [Nat]Absence check using state equation in 699 ms returned sat
[2023-03-18 20:09:57] [INFO ] Deduced a trap composed of 4 places in 48 ms of which 0 ms to minimize.
[2023-03-18 20:09:57] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 72 ms
[2023-03-18 20:09:57] [INFO ] Computed and/alt/rep : 198/198/198 causal constraints (skipped 0 transitions) in 12 ms.
[2023-03-18 20:09:58] [INFO ] Added : 157 causal constraints over 32 iterations in 708 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Product exploration explored 100000 steps with 38 reset in 371 ms.
Product exploration explored 100000 steps with 38 reset in 419 ms.
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 5 ms. Remains 299 /299 variables (removed 0) and now considering 200/200 (removed 0) transitions.
[2023-03-18 20:09:58] [INFO ] Invariant cache hit.
[2023-03-18 20:09:59] [INFO ] Implicit Places using invariants in 139 ms returned []
[2023-03-18 20:09:59] [INFO ] Invariant cache hit.
[2023-03-18 20:09:59] [INFO ] Implicit Places using invariants and state equation in 269 ms returned []
Implicit Place search using SMT with State Equation took 410 ms to find 0 implicit places.
[2023-03-18 20:09:59] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-18 20:09:59] [INFO ] Invariant cache hit.
[2023-03-18 20:09:59] [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 535 ms. Remains : 299/299 places, 200/200 transitions.
Treatment of property ResAllocation-PT-R100C002-LTLCardinality-06 finished in 10032 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 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 10 ms. Remains 319 /321 variables (removed 2) and now considering 200/202 (removed 2) transitions.
// Phase 1: matrix 200 rows 319 cols
[2023-03-18 20:09:59] [INFO ] Computed 121 place invariants in 2 ms
[2023-03-18 20:09:59] [INFO ] Implicit Places using invariants in 152 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 154 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 4 ms. Remains 298 /298 variables (removed 0) and now considering 200/200 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 168 ms. Remains : 298/321 places, 200/202 transitions.
Stuttering acceptance computed with spot in 58 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 768 reset in 298 ms.
Product exploration explored 100000 steps with 761 reset in 350 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 127 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 124 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=62 )
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 29 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
// Phase 1: matrix 200 rows 298 cols
[2023-03-18 20:10:00] [INFO ] Computed 100 place invariants in 2 ms
[2023-03-18 20:10:00] [INFO ] [Real]Absence check using 100 positive place invariants in 22 ms returned sat
[2023-03-18 20:10:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 20:10:01] [INFO ] [Real]Absence check using state equation in 585 ms returned sat
[2023-03-18 20:10:01] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 20:10:01] [INFO ] [Nat]Absence check using 100 positive place invariants in 21 ms returned sat
[2023-03-18 20:10:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-18 20:10:02] [INFO ] [Nat]Absence check using state equation in 487 ms returned sat
[2023-03-18 20:10:02] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 0 ms to minimize.
[2023-03-18 20:10:02] [INFO ] Deduced a trap composed of 5 places in 29 ms of which 0 ms to minimize.
[2023-03-18 20:10:02] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 115 ms
[2023-03-18 20:10:02] [INFO ] Computed and/alt/rep : 198/198/198 causal constraints (skipped 0 transitions) in 10 ms.
[2023-03-18 20:10:02] [INFO ] Added : 112 causal constraints over 23 iterations in 489 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-18 20:10:02] [INFO ] Invariant cache hit.
[2023-03-18 20:10:02] [INFO ] Implicit Places using invariants in 137 ms returned []
[2023-03-18 20:10:02] [INFO ] Invariant cache hit.
[2023-03-18 20:10:03] [INFO ] Implicit Places using invariants and state equation in 261 ms returned []
Implicit Place search using SMT with State Equation took 398 ms to find 0 implicit places.
[2023-03-18 20:10:03] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-18 20:10:03] [INFO ] Invariant cache hit.
[2023-03-18 20:10:03] [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 526 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 98 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 29 ms :[(NOT p0)]
Finished random walk after 139 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=69 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 128 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 31 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
[2023-03-18 20:10:03] [INFO ] Invariant cache hit.
[2023-03-18 20:10:03] [INFO ] [Real]Absence check using 100 positive place invariants in 23 ms returned sat
[2023-03-18 20:10:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 20:10:04] [INFO ] [Real]Absence check using state equation in 559 ms returned sat
[2023-03-18 20:10:04] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 20:10:04] [INFO ] [Nat]Absence check using 100 positive place invariants in 22 ms returned sat
[2023-03-18 20:10:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-18 20:10:04] [INFO ] [Nat]Absence check using state equation in 487 ms returned sat
[2023-03-18 20:10:04] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 0 ms to minimize.
[2023-03-18 20:10:04] [INFO ] Deduced a trap composed of 5 places in 30 ms of which 0 ms to minimize.
[2023-03-18 20:10:04] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 117 ms
[2023-03-18 20:10:04] [INFO ] Computed and/alt/rep : 198/198/198 causal constraints (skipped 0 transitions) in 13 ms.
[2023-03-18 20:10:05] [INFO ] Added : 112 causal constraints over 23 iterations in 545 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 748 reset in 303 ms.
Product exploration explored 100000 steps with 722 reset in 354 ms.
Support contains 2 out of 298 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 298/298 places, 200/200 transitions.
Applied a total of 0 rules in 4 ms. Remains 298 /298 variables (removed 0) and now considering 200/200 (removed 0) transitions.
[2023-03-18 20:10:06] [INFO ] Invariant cache hit.
[2023-03-18 20:10:06] [INFO ] Implicit Places using invariants in 144 ms returned []
[2023-03-18 20:10:06] [INFO ] Invariant cache hit.
[2023-03-18 20:10:06] [INFO ] Implicit Places using invariants and state equation in 277 ms returned []
Implicit Place search using SMT with State Equation took 422 ms to find 0 implicit places.
[2023-03-18 20:10:06] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-18 20:10:06] [INFO ] Invariant cache hit.
[2023-03-18 20:10:06] [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 537 ms. Remains : 298/298 places, 200/200 transitions.
Treatment of property ResAllocation-PT-R100C002-LTLCardinality-09 finished in 7301 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 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-18 20:10:06] [INFO ] Computed 121 place invariants in 1 ms
[2023-03-18 20:10:06] [INFO ] Implicit Places using invariants in 155 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 155 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 3 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 161 ms. Remains : 303/321 places, 202/202 transitions.
Stuttering acceptance computed with spot in 165 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 338 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 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 10 ms. Remains 319 /321 variables (removed 2) and now considering 200/202 (removed 2) transitions.
// Phase 1: matrix 200 rows 319 cols
[2023-03-18 20:10:07] [INFO ] Computed 121 place invariants in 3 ms
[2023-03-18 20:10:07] [INFO ] Implicit Places using invariants in 154 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 156 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 4 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 171 ms. Remains : 301/321 places, 200/202 transitions.
Stuttering acceptance computed with spot in 61 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 397 ms.
Product exploration explored 100000 steps with 38 reset in 429 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 101 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 73 ms :[(AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3))]
Incomplete random walk after 10000 steps, including 3 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :0
Finished probabilistic random walk after 38867 steps, run visited all 1 properties in 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 149 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 76 ms :[(AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3))]
Stuttering acceptance computed with spot in 76 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 5 ms. Remains 301 /301 variables (removed 0) and now considering 200/200 (removed 0) transitions.
// Phase 1: matrix 200 rows 301 cols
[2023-03-18 20:10:08] [INFO ] Computed 103 place invariants in 2 ms
[2023-03-18 20:10:09] [INFO ] Implicit Places using invariants in 135 ms returned []
[2023-03-18 20:10:09] [INFO ] Invariant cache hit.
[2023-03-18 20:10:09] [INFO ] Implicit Places using invariants and state equation in 263 ms returned []
Implicit Place search using SMT with State Equation took 399 ms to find 0 implicit places.
[2023-03-18 20:10:09] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-18 20:10:09] [INFO ] Invariant cache hit.
[2023-03-18 20:10:09] [INFO ] Dead Transitions using invariants and state equation in 101 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 512 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 92 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 82 ms :[(AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3))]
Incomplete random walk after 10000 steps, including 3 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :0
Finished probabilistic random walk after 38867 steps, run visited all 1 properties in 145 ms. (steps per millisecond=268 )
Probabilistic random walk after 38867 steps, saw 27941 distinct states, run finished after 145 ms. (steps per millisecond=268 ) 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 140 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))]
Stuttering acceptance computed with spot in 64 ms :[(AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3))]
Stuttering acceptance computed with spot in 70 ms :[(AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3))]
Product exploration explored 100000 steps with 38 reset in 349 ms.
Product exploration explored 100000 steps with 38 reset in 410 ms.
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 3 ms. Remains 301 /301 variables (removed 0) and now considering 200/200 (removed 0) transitions.
[2023-03-18 20:10:10] [INFO ] Invariant cache hit.
[2023-03-18 20:10:11] [INFO ] Implicit Places using invariants in 136 ms returned []
[2023-03-18 20:10:11] [INFO ] Invariant cache hit.
[2023-03-18 20:10:11] [INFO ] Implicit Places using invariants and state equation in 263 ms returned []
Implicit Place search using SMT with State Equation took 400 ms to find 0 implicit places.
[2023-03-18 20:10:11] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-18 20:10:11] [INFO ] Invariant cache hit.
[2023-03-18 20:10:11] [INFO ] Dead Transitions using invariants and state equation in 106 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 520 ms. Remains : 301/301 places, 200/200 transitions.
Treatment of property ResAllocation-PT-R100C002-LTLCardinality-11 finished in 4353 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-18 20:10:11] [INFO ] Computed 121 place invariants in 1 ms
[2023-03-18 20:10:11] [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 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 154 ms. Remains : 302/321 places, 202/202 transitions.
Stuttering acceptance computed with spot in 96 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 290 ms.
Product exploration explored 100000 steps with 33333 reset in 338 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 46 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 942 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 5 ms. Remains 321 /321 variables (removed 0) and now considering 202/202 (removed 0) transitions.
[2023-03-18 20:10:12] [INFO ] Invariant cache hit.
[2023-03-18 20:10:12] [INFO ] Implicit Places using invariants in 154 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 155 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 162 ms. Remains : 302/321 places, 202/202 transitions.
Stuttering acceptance computed with spot in 153 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 25034 reset in 303 ms.
Product exploration explored 100000 steps with 25007 reset in 343 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 704 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 180 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 231 ms. (steps per millisecond=43 ) properties (out of 9) seen :3
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 6) seen :0
Finished Best-First random walk after 4513 steps, including 1 resets, run visited all 6 properties in 24 ms. (steps per millisecond=188 )
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 312 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 2561 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)))))))))'
Found a Shortening insensitive property : ResAllocation-PT-R100C002-LTLCardinality-03
Stuttering acceptance computed with spot in 608 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)]
Support contains 4 out of 321 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 321/321 places, 202/202 transitions.
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 0 with 2 rules applied. Total rules applied 2 place count 320 transition count 201
Applied a total of 2 rules in 14 ms. Remains 320 /321 variables (removed 1) and now considering 201/202 (removed 1) transitions.
// Phase 1: matrix 201 rows 320 cols
[2023-03-18 20:10:15] [INFO ] Computed 121 place invariants in 2 ms
[2023-03-18 20:10:15] [INFO ] Implicit Places using invariants in 153 ms returned [210, 213, 215, 219, 222, 225, 252, 258, 265, 267, 273, 275, 280, 283, 285, 291, 301, 309, 316]
Discarding 19 places :
Implicit Place search using SMT only with invariants took 155 ms to find 19 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 301/321 places, 201/202 transitions.
Applied a total of 0 rules in 3 ms. Remains 301 /301 variables (removed 0) and now considering 201/201 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 173 ms. Remains : 301/321 places, 201/202 transitions.
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 s265), p0:(OR (GT s1 s204) (LEQ 1 s265)), p1:(GT 1 s241)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, cl-invariant], 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 5801 reset in 331 ms.
Product exploration explored 100000 steps with 5804 reset in 367 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 3400 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 552 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 253 ms. (steps per millisecond=39 ) properties (out of 21) seen :10
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) 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 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 39 ms. (steps per millisecond=256 ) 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 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 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 38 ms. (steps per millisecond=263 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 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 39 ms. (steps per millisecond=256 ) properties (out of 11) seen :0
Running SMT prover for 11 properties.
// Phase 1: matrix 201 rows 301 cols
[2023-03-18 20:10:21] [INFO ] Computed 102 place invariants in 0 ms
[2023-03-18 20:10:21] [INFO ] After 71ms SMT Verify possible using all constraints in real domain returned unsat :3 sat :0 real:8
[2023-03-18 20:10:21] [INFO ] [Nat]Absence check using 102 positive place invariants in 13 ms returned sat
[2023-03-18 20:10:21] [INFO ] After 169ms SMT Verify possible using state equation in natural domain returned unsat :3 sat :8
[2023-03-18 20:10:21] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 0 ms to minimize.
[2023-03-18 20:10:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 66 ms
[2023-03-18 20:10:21] [INFO ] After 383ms SMT Verify possible using trap constraints in natural domain returned unsat :3 sat :8
Attempting to minimize the solution found.
Minimization took 95 ms.
[2023-03-18 20:10:21] [INFO ] After 604ms 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 438 steps, including 0 resets, run visited all 2 properties in 5 ms. (steps per millisecond=87 )
Parikh walk visited 8 properties in 44 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 4297 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 499 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 519 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-18 20:10:27] [INFO ] Invariant cache hit.
[2023-03-18 20:10:27] [INFO ] [Real]Absence check using 102 positive place invariants in 25 ms returned sat
[2023-03-18 20:10:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 20:10:27] [INFO ] [Real]Absence check using state equation in 478 ms returned sat
[2023-03-18 20:10:27] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 20:10:28] [INFO ] [Nat]Absence check using 102 positive place invariants in 24 ms returned sat
[2023-03-18 20:10:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-18 20:10:28] [INFO ] [Nat]Absence check using state equation in 384 ms returned sat
[2023-03-18 20:10:28] [INFO ] Computed and/alt/rep : 199/199/199 causal constraints (skipped 0 transitions) in 13 ms.
[2023-03-18 20:10:28] [INFO ] Added : 102 causal constraints over 21 iterations in 436 ms. Result :sat
Could not prove EG (NOT p0)
[2023-03-18 20:10:28] [INFO ] Invariant cache hit.
[2023-03-18 20:10:29] [INFO ] [Real]Absence check using 102 positive place invariants in 24 ms returned sat
[2023-03-18 20:10:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 20:10:29] [INFO ] [Real]Absence check using state equation in 447 ms returned sat
[2023-03-18 20:10:29] [INFO ] Computed and/alt/rep : 199/199/199 causal constraints (skipped 0 transitions) in 11 ms.
[2023-03-18 20:10:30] [INFO ] Added : 98 causal constraints over 20 iterations in 525 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 4 out of 301 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 301/301 places, 201/201 transitions.
Applied a total of 0 rules in 3 ms. Remains 301 /301 variables (removed 0) and now considering 201/201 (removed 0) transitions.
[2023-03-18 20:10:30] [INFO ] Invariant cache hit.
[2023-03-18 20:10:30] [INFO ] Implicit Places using invariants in 138 ms returned []
[2023-03-18 20:10:30] [INFO ] Invariant cache hit.
[2023-03-18 20:10:30] [INFO ] Implicit Places using invariants and state equation in 269 ms returned []
Implicit Place search using SMT with State Equation took 408 ms to find 0 implicit places.
[2023-03-18 20:10:30] [INFO ] Invariant cache hit.
[2023-03-18 20:10:30] [INFO ] Dead Transitions using invariants and state equation in 105 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 516 ms. Remains : 301/301 places, 201/201 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 6188 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 546 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 176 ms. (steps per millisecond=56 ) properties (out of 13) seen :6
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 7) seen :0
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 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 29 ms. (steps per millisecond=344 ) properties (out of 7) seen :0
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
Running SMT prover for 7 properties.
[2023-03-18 20:10:37] [INFO ] Invariant cache hit.
[2023-03-18 20:10:37] [INFO ] After 65ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-18 20:10:37] [INFO ] [Nat]Absence check using 102 positive place invariants in 14 ms returned sat
[2023-03-18 20:10:38] [INFO ] After 164ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2023-03-18 20:10:38] [INFO ] After 302ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 94 ms.
[2023-03-18 20:10:38] [INFO ] After 503ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
Finished Parikh walk after 842 steps, including 1 resets, run visited all 2 properties in 7 ms. (steps per millisecond=120 )
Parikh walk visited 7 properties in 26 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 6545 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 551 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 538 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-18 20:10:45] [INFO ] Invariant cache hit.
[2023-03-18 20:10:46] [INFO ] [Real]Absence check using 102 positive place invariants in 25 ms returned sat
[2023-03-18 20:10:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 20:10:46] [INFO ] [Real]Absence check using state equation in 490 ms returned sat
[2023-03-18 20:10:46] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 20:10:46] [INFO ] [Nat]Absence check using 102 positive place invariants in 23 ms returned sat
[2023-03-18 20:10:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-18 20:10:47] [INFO ] [Nat]Absence check using state equation in 391 ms returned sat
[2023-03-18 20:10:47] [INFO ] Computed and/alt/rep : 199/199/199 causal constraints (skipped 0 transitions) in 10 ms.
[2023-03-18 20:10:47] [INFO ] Added : 102 causal constraints over 21 iterations in 457 ms. Result :sat
Could not prove EG (NOT p0)
[2023-03-18 20:10:47] [INFO ] Invariant cache hit.
[2023-03-18 20:10:47] [INFO ] [Real]Absence check using 102 positive place invariants in 24 ms returned sat
[2023-03-18 20:10:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 20:10:48] [INFO ] [Real]Absence check using state equation in 457 ms returned sat
[2023-03-18 20:10:48] [INFO ] Computed and/alt/rep : 199/199/199 causal constraints (skipped 0 transitions) in 10 ms.
[2023-03-18 20:10:48] [INFO ] Added : 98 causal constraints over 20 iterations in 515 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 593 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 5745 reset in 332 ms.
Product exploration explored 100000 steps with 5718 reset in 383 ms.
Support contains 4 out of 301 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 301/301 places, 201/201 transitions.
Applied a total of 0 rules in 5 ms. Remains 301 /301 variables (removed 0) and now considering 201/201 (removed 0) transitions.
[2023-03-18 20:10:50] [INFO ] Invariant cache hit.
[2023-03-18 20:10:50] [INFO ] Implicit Places using invariants in 133 ms returned []
[2023-03-18 20:10:50] [INFO ] Invariant cache hit.
[2023-03-18 20:10:50] [INFO ] Implicit Places using invariants and state equation in 267 ms returned []
Implicit Place search using SMT with State Equation took 400 ms to find 0 implicit places.
[2023-03-18 20:10:50] [INFO ] Invariant cache hit.
[2023-03-18 20:10:50] [INFO ] Dead Transitions using invariants and state equation in 102 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 507 ms. Remains : 301/301 places, 201/201 transitions.
Treatment of property ResAllocation-PT-R100C002-LTLCardinality-03 finished in 35724 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-18 20:10:50] [INFO ] Flatten gal took : 19 ms
[2023-03-18 20:10:50] [INFO ] Export to MCC of 4 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 1 ms.
[2023-03-18 20:10:50] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 321 places, 202 transitions and 842 arcs took 4 ms.
Total runtime 116691 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2786/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2786/ltl_1_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2786/ltl_2_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2786/ltl_3_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : ResAllocation-PT-R100C002-LTLCardinality-03
Could not compute solution for formula : ResAllocation-PT-R100C002-LTLCardinality-06
Could not compute solution for formula : ResAllocation-PT-R100C002-LTLCardinality-09
Could not compute solution for formula : ResAllocation-PT-R100C002-LTLCardinality-11

BK_STOP 1679170252356

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

+ 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//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML
mcc2023
ltl formula name ResAllocation-PT-R100C002-LTLCardinality-03
ltl formula formula --ltl=/tmp/2786/ltl_0_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 321 places, 202 transitions and 842 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.030 real 0.000 user 0.010 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2786/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2786/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2786/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2786/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 12 states
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
ltl formula name ResAllocation-PT-R100C002-LTLCardinality-06
ltl formula formula --ltl=/tmp/2786/ltl_1_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 321 places, 202 transitions and 842 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.020 real 0.010 user 0.000 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2786/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2786/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2786/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2786/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
double free or corruption (fasttop)
ltl formula name ResAllocation-PT-R100C002-LTLCardinality-09
ltl formula formula --ltl=/tmp/2786/ltl_2_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 321 places, 202 transitions and 842 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.020 real 0.010 user 0.000 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2786/ltl_2_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2786/ltl_2_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2786/ltl_2_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2786/ltl_2_
pnml2lts-mc( 0/ 4): buchi has 1 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
double free or corruption (fasttop)
ltl formula name ResAllocation-PT-R100C002-LTLCardinality-11
ltl formula formula --ltl=/tmp/2786/ltl_3_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 321 places, 202 transitions and 842 arcs
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.020 real 0.010 user 0.000 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2786/ltl_3_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2786/ltl_3_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2786/ltl_3_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2786/ltl_3_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:

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="ltsminxred"
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 ltsminxred"
echo " Input is ResAllocation-PT-R100C002, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r329-tall-167889202500771"
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 ;