Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 6.4M
-rw-r--r-- 1 mcc users 7.5K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 77K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.3K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 62K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K May 19 07:08 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 19 15:45 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Apr 22 14:39 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 22 14:39 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Apr 11 20:11 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 149K Apr 11 20:11 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.7K Apr 11 20:07 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 58K Apr 11 20:07 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 22 14:39 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 22 14:39 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 5.9M May 18 16:42 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1716414382896

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=gold2023
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Dekker-PT-100
Applying reductions before tool lola
Invoking reducer
Running Version 202304061127
[2024-05-22 21:46:24] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2024-05-22 21:46:24] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 21:46:24] [INFO ] Load time of PNML (sax parser for PT used): 380 ms
[2024-05-22 21:46:24] [INFO ] Transformed 500 places.
[2024-05-22 21:46:24] [INFO ] Transformed 10200 transitions.
[2024-05-22 21:46:24] [INFO ] Found NUPN structural information;
[2024-05-22 21:46:24] [INFO ] Parsed PT model containing 500 places and 10200 transitions and 80200 arcs in 655 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 15 ms.
Working with output stream class java.io.PrintStream
FORMULA Dekker-PT-100-ReachabilityCardinality-2024-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-100-ReachabilityCardinality-2024-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-100-ReachabilityCardinality-2024-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-100-ReachabilityCardinality-2024-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-100-ReachabilityCardinality-2024-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 2 resets, run finished after 506 ms. (steps per millisecond=19 ) properties (out of 11) seen :5
FORMULA Dekker-PT-100-ReachabilityCardinality-2024-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Dekker-PT-100-ReachabilityCardinality-2024-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Dekker-PT-100-ReachabilityCardinality-2024-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Dekker-PT-100-ReachabilityCardinality-2024-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Dekker-PT-100-ReachabilityCardinality-2024-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 6) 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 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
[2024-05-22 21:46:25] [INFO ] Flow matrix only has 400 transitions (discarded 9800 similar events)
// Phase 1: matrix 400 rows 500 cols
[2024-05-22 21:46:25] [INFO ] Computed 300 invariants in 22 ms
[2024-05-22 21:46:26] [INFO ] After 298ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2024-05-22 21:46:26] [INFO ] [Nat]Absence check using 200 positive place invariants in 39 ms returned sat
[2024-05-22 21:46:26] [INFO ] [Nat]Absence check using 200 positive and 100 generalized place invariants in 30 ms returned sat
[2024-05-22 21:46:27] [INFO ] After 416ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2024-05-22 21:46:27] [INFO ] State equation strengthened by 100 read => feed constraints.
[2024-05-22 21:46:27] [INFO ] After 334ms SMT Verify possible using 100 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2024-05-22 21:46:27] [INFO ] Deduced a trap composed of 4 places in 393 ms of which 6 ms to minimize.
[2024-05-22 21:46:28] [INFO ] Deduced a trap composed of 4 places in 411 ms of which 1 ms to minimize.
[2024-05-22 21:46:28] [INFO ] Deduced a trap composed of 4 places in 383 ms of which 2 ms to minimize.
[2024-05-22 21:46:29] [INFO ] Deduced a trap composed of 4 places in 337 ms of which 1 ms to minimize.
[2024-05-22 21:46:29] [INFO ] Deduced a trap composed of 4 places in 334 ms of which 1 ms to minimize.
[2024-05-22 21:46:29] [INFO ] Deduced a trap composed of 4 places in 315 ms of which 0 ms to minimize.
[2024-05-22 21:46:30] [INFO ] Deduced a trap composed of 4 places in 322 ms of which 1 ms to minimize.
[2024-05-22 21:46:30] [INFO ] Deduced a trap composed of 4 places in 312 ms of which 1 ms to minimize.
[2024-05-22 21:46:30] [INFO ] Deduced a trap composed of 4 places in 312 ms of which 1 ms to minimize.
[2024-05-22 21:46:31] [INFO ] Deduced a trap composed of 4 places in 308 ms of which 1 ms to minimize.
[2024-05-22 21:46:31] [INFO ] Deduced a trap composed of 4 places in 338 ms of which 4 ms to minimize.
[2024-05-22 21:46:31] [INFO ] Trap strengthening procedure interrupted after too many repetitions 3989 ms
[2024-05-22 21:46:31] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 3989 ms
[2024-05-22 21:46:31] [INFO ] Deduced a trap composed of 4 places in 286 ms of which 1 ms to minimize.
[2024-05-22 21:46:32] [INFO ] Deduced a trap composed of 4 places in 280 ms of which 0 ms to minimize.
[2024-05-22 21:46:32] [INFO ] Deduced a trap composed of 4 places in 279 ms of which 0 ms to minimize.
[2024-05-22 21:46:32] [INFO ] Deduced a trap composed of 4 places in 274 ms of which 1 ms to minimize.
[2024-05-22 21:46:33] [INFO ] Deduced a trap composed of 4 places in 257 ms of which 0 ms to minimize.
[2024-05-22 21:46:33] [INFO ] Deduced a trap composed of 4 places in 268 ms of which 0 ms to minimize.
[2024-05-22 21:46:33] [INFO ] Deduced a trap composed of 4 places in 228 ms of which 1 ms to minimize.
[2024-05-22 21:46:33] [INFO ] Deduced a trap composed of 4 places in 236 ms of which 1 ms to minimize.
[2024-05-22 21:46:34] [INFO ] Deduced a trap composed of 4 places in 224 ms of which 0 ms to minimize.
[2024-05-22 21:46:34] [INFO ] Deduced a trap composed of 4 places in 245 ms of which 0 ms to minimize.
[2024-05-22 21:46:34] [INFO ] Deduced a trap composed of 4 places in 232 ms of which 0 ms to minimize.
[2024-05-22 21:46:34] [INFO ] Trap strengthening procedure interrupted after too many repetitions 3083 ms
[2024-05-22 21:46:34] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 3083 ms
[2024-05-22 21:46:35] [INFO ] Deduced a trap composed of 4 places in 264 ms of which 0 ms to minimize.
[2024-05-22 21:46:35] [INFO ] Deduced a trap composed of 4 places in 262 ms of which 1 ms to minimize.
[2024-05-22 21:46:35] [INFO ] Deduced a trap composed of 4 places in 250 ms of which 1 ms to minimize.
[2024-05-22 21:46:35] [INFO ] Deduced a trap composed of 6 places in 241 ms of which 0 ms to minimize.
[2024-05-22 21:46:36] [INFO ] Deduced a trap composed of 4 places in 245 ms of which 1 ms to minimize.
[2024-05-22 21:46:36] [INFO ] Deduced a trap composed of 6 places in 236 ms of which 0 ms to minimize.
[2024-05-22 21:46:36] [INFO ] Deduced a trap composed of 4 places in 233 ms of which 1 ms to minimize.
[2024-05-22 21:46:36] [INFO ] Deduced a trap composed of 4 places in 216 ms of which 1 ms to minimize.
[2024-05-22 21:46:37] [INFO ] Deduced a trap composed of 4 places in 228 ms of which 2 ms to minimize.
[2024-05-22 21:46:37] [INFO ] Deduced a trap composed of 4 places in 212 ms of which 1 ms to minimize.
[2024-05-22 21:46:37] [INFO ] Deduced a trap composed of 4 places in 189 ms of which 0 ms to minimize.
[2024-05-22 21:46:37] [INFO ] Deduced a trap composed of 4 places in 200 ms of which 1 ms to minimize.
[2024-05-22 21:46:38] [INFO ] Deduced a trap composed of 4 places in 194 ms of which 0 ms to minimize.
[2024-05-22 21:46:38] [INFO ] Deduced a trap composed of 4 places in 190 ms of which 1 ms to minimize.
[2024-05-22 21:46:38] [INFO ] Deduced a trap composed of 4 places in 190 ms of which 1 ms to minimize.
[2024-05-22 21:46:38] [INFO ] Deduced a trap composed of 4 places in 167 ms of which 1 ms to minimize.
[2024-05-22 21:46:38] [INFO ] Deduced a trap composed of 4 places in 168 ms of which 0 ms to minimize.
[2024-05-22 21:46:38] [INFO ] Trap strengthening procedure interrupted after too many repetitions 4109 ms
[2024-05-22 21:46:38] [INFO ] Trap strengthening (SAT) tested/added 17/16 trap constraints in 4110 ms
[2024-05-22 21:46:39] [INFO ] Deduced a trap composed of 4 places in 190 ms of which 0 ms to minimize.
[2024-05-22 21:46:39] [INFO ] Deduced a trap composed of 6 places in 190 ms of which 1 ms to minimize.
[2024-05-22 21:46:39] [INFO ] Deduced a trap composed of 6 places in 174 ms of which 0 ms to minimize.
[2024-05-22 21:46:39] [INFO ] Deduced a trap composed of 4 places in 157 ms of which 0 ms to minimize.
[2024-05-22 21:46:39] [INFO ] Deduced a trap composed of 4 places in 146 ms of which 1 ms to minimize.
[2024-05-22 21:46:40] [INFO ] Deduced a trap composed of 4 places in 148 ms of which 0 ms to minimize.
[2024-05-22 21:46:40] [INFO ] Deduced a trap composed of 4 places in 142 ms of which 1 ms to minimize.
[2024-05-22 21:46:40] [INFO ] Deduced a trap composed of 4 places in 135 ms of which 0 ms to minimize.
[2024-05-22 21:46:40] [INFO ] Deduced a trap composed of 4 places in 151 ms of which 0 ms to minimize.
[2024-05-22 21:46:40] [INFO ] Deduced a trap composed of 4 places in 153 ms of which 0 ms to minimize.
[2024-05-22 21:46:40] [INFO ] Deduced a trap composed of 4 places in 150 ms of which 0 ms to minimize.
[2024-05-22 21:46:41] [INFO ] Deduced a trap composed of 4 places in 145 ms of which 0 ms to minimize.
[2024-05-22 21:46:41] [INFO ] Deduced a trap composed of 4 places in 130 ms of which 0 ms to minimize.
[2024-05-22 21:46:41] [INFO ] Deduced a trap composed of 4 places in 127 ms of which 1 ms to minimize.
[2024-05-22 21:46:41] [INFO ] Trap strengthening procedure interrupted after too many repetitions 2482 ms
[2024-05-22 21:46:41] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 2482 ms
[2024-05-22 21:46:41] [INFO ] After 14302ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 260 ms.
[2024-05-22 21:46:41] [INFO ] After 15366ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Fused 6 Parikh solutions to 5 different solutions.
Parikh walk visited 0 properties in 24 ms.
Support contains 72 out of 500 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 500/500 places, 10200/10200 transitions.
Applied a total of 0 rules in 748 ms. Remains 500 /500 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 751 ms. Remains : 500/500 places, 10200/10200 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 337 ms. (steps per millisecond=29 ) properties (out of 6) 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 6) 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 6) 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 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 6) 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 6) 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 6) seen :0
Interrupted probabilistic random walk after 128270 steps, run timeout after 3001 ms. (steps per millisecond=42 ) properties seen :{4=1}
Probabilistic random walk after 128270 steps, saw 118734 distinct states, run finished after 3002 ms. (steps per millisecond=42 ) properties seen :1
FORMULA Dekker-PT-100-ReachabilityCardinality-2024-12 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Running SMT prover for 5 properties.
[2024-05-22 21:46:46] [INFO ] Flow matrix only has 400 transitions (discarded 9800 similar events)
[2024-05-22 21:46:46] [INFO ] Invariant cache hit.
[2024-05-22 21:46:46] [INFO ] After 126ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2024-05-22 21:46:46] [INFO ] [Nat]Absence check using 200 positive place invariants in 28 ms returned sat
[2024-05-22 21:46:46] [INFO ] [Nat]Absence check using 200 positive and 100 generalized place invariants in 14 ms returned sat
[2024-05-22 21:46:46] [INFO ] After 334ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2024-05-22 21:46:46] [INFO ] State equation strengthened by 100 read => feed constraints.
[2024-05-22 21:46:47] [INFO ] After 276ms SMT Verify possible using 100 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2024-05-22 21:46:47] [INFO ] Deduced a trap composed of 4 places in 343 ms of which 0 ms to minimize.
[2024-05-22 21:46:47] [INFO ] Deduced a trap composed of 4 places in 339 ms of which 3 ms to minimize.
[2024-05-22 21:46:48] [INFO ] Deduced a trap composed of 4 places in 360 ms of which 1 ms to minimize.
[2024-05-22 21:46:48] [INFO ] Deduced a trap composed of 4 places in 371 ms of which 1 ms to minimize.
[2024-05-22 21:46:49] [INFO ] Deduced a trap composed of 4 places in 334 ms of which 0 ms to minimize.
[2024-05-22 21:46:49] [INFO ] Deduced a trap composed of 4 places in 321 ms of which 0 ms to minimize.
[2024-05-22 21:46:49] [INFO ] Deduced a trap composed of 4 places in 306 ms of which 1 ms to minimize.
[2024-05-22 21:46:50] [INFO ] Deduced a trap composed of 5 places in 335 ms of which 0 ms to minimize.
[2024-05-22 21:46:50] [INFO ] Deduced a trap composed of 4 places in 326 ms of which 0 ms to minimize.
[2024-05-22 21:46:50] [INFO ] Deduced a trap composed of 4 places in 305 ms of which 1 ms to minimize.
[2024-05-22 21:46:51] [INFO ] Deduced a trap composed of 4 places in 355 ms of which 4 ms to minimize.
[2024-05-22 21:46:51] [INFO ] Deduced a trap composed of 4 places in 308 ms of which 0 ms to minimize.
[2024-05-22 21:46:51] [INFO ] Deduced a trap composed of 4 places in 278 ms of which 2 ms to minimize.
[2024-05-22 21:46:52] [INFO ] Deduced a trap composed of 4 places in 302 ms of which 1 ms to minimize.
[2024-05-22 21:46:52] [INFO ] Deduced a trap composed of 4 places in 293 ms of which 1 ms to minimize.
[2024-05-22 21:46:52] [INFO ] Deduced a trap composed of 4 places in 293 ms of which 0 ms to minimize.
[2024-05-22 21:46:53] [INFO ] Deduced a trap composed of 4 places in 288 ms of which 1 ms to minimize.
[2024-05-22 21:46:53] [INFO ] Deduced a trap composed of 4 places in 280 ms of which 0 ms to minimize.
[2024-05-22 21:46:53] [INFO ] Deduced a trap composed of 6 places in 282 ms of which 1 ms to minimize.
[2024-05-22 21:46:53] [INFO ] Deduced a trap composed of 4 places in 267 ms of which 1 ms to minimize.
[2024-05-22 21:46:54] [INFO ] Deduced a trap composed of 4 places in 233 ms of which 0 ms to minimize.
[2024-05-22 21:46:54] [INFO ] Deduced a trap composed of 4 places in 227 ms of which 0 ms to minimize.
[2024-05-22 21:46:54] [INFO ] Deduced a trap composed of 4 places in 236 ms of which 0 ms to minimize.
[2024-05-22 21:46:54] [INFO ] Deduced a trap composed of 4 places in 252 ms of which 0 ms to minimize.
[2024-05-22 21:46:55] [INFO ] Deduced a trap composed of 4 places in 244 ms of which 1 ms to minimize.
[2024-05-22 21:46:55] [INFO ] Deduced a trap composed of 4 places in 237 ms of which 1 ms to minimize.
[2024-05-22 21:46:55] [INFO ] Deduced a trap composed of 4 places in 228 ms of which 0 ms to minimize.
[2024-05-22 21:46:56] [INFO ] Deduced a trap composed of 4 places in 230 ms of which 1 ms to minimize.
[2024-05-22 21:46:56] [INFO ] Deduced a trap composed of 4 places in 206 ms of which 0 ms to minimize.
[2024-05-22 21:46:56] [INFO ] Deduced a trap composed of 4 places in 223 ms of which 0 ms to minimize.
[2024-05-22 21:46:56] [INFO ] Trap strengthening procedure interrupted after too many repetitions 9293 ms
[2024-05-22 21:46:56] [INFO ] Trap strengthening (SAT) tested/added 30/29 trap constraints in 9293 ms
[2024-05-22 21:46:56] [INFO ] Deduced a trap composed of 4 places in 235 ms of which 1 ms to minimize.
[2024-05-22 21:46:57] [INFO ] Deduced a trap composed of 4 places in 232 ms of which 0 ms to minimize.
[2024-05-22 21:46:57] [INFO ] Deduced a trap composed of 4 places in 222 ms of which 1 ms to minimize.
[2024-05-22 21:46:57] [INFO ] Deduced a trap composed of 4 places in 224 ms of which 1 ms to minimize.
[2024-05-22 21:46:57] [INFO ] Deduced a trap composed of 6 places in 214 ms of which 0 ms to minimize.
[2024-05-22 21:46:58] [INFO ] Deduced a trap composed of 4 places in 212 ms of which 0 ms to minimize.
[2024-05-22 21:46:58] [INFO ] Deduced a trap composed of 4 places in 209 ms of which 0 ms to minimize.
[2024-05-22 21:46:58] [INFO ] Deduced a trap composed of 4 places in 220 ms of which 0 ms to minimize.
[2024-05-22 21:46:58] [INFO ] Deduced a trap composed of 6 places in 215 ms of which 0 ms to minimize.
[2024-05-22 21:46:59] [INFO ] Deduced a trap composed of 4 places in 199 ms of which 0 ms to minimize.
[2024-05-22 21:46:59] [INFO ] Deduced a trap composed of 4 places in 193 ms of which 1 ms to minimize.
[2024-05-22 21:46:59] [INFO ] Deduced a trap composed of 4 places in 190 ms of which 0 ms to minimize.
[2024-05-22 21:46:59] [INFO ] Deduced a trap composed of 4 places in 187 ms of which 0 ms to minimize.
[2024-05-22 21:46:59] [INFO ] Deduced a trap composed of 4 places in 193 ms of which 1 ms to minimize.
[2024-05-22 21:47:00] [INFO ] Deduced a trap composed of 4 places in 189 ms of which 0 ms to minimize.
[2024-05-22 21:47:00] [INFO ] Deduced a trap composed of 4 places in 170 ms of which 0 ms to minimize.
[2024-05-22 21:47:00] [INFO ] Deduced a trap composed of 4 places in 171 ms of which 0 ms to minimize.
[2024-05-22 21:47:00] [INFO ] Deduced a trap composed of 4 places in 167 ms of which 0 ms to minimize.
[2024-05-22 21:47:00] [INFO ] Deduced a trap composed of 4 places in 191 ms of which 0 ms to minimize.
[2024-05-22 21:47:01] [INFO ] Deduced a trap composed of 4 places in 177 ms of which 1 ms to minimize.
[2024-05-22 21:47:01] [INFO ] Trap strengthening procedure interrupted after too many repetitions 4506 ms
[2024-05-22 21:47:01] [INFO ] Trap strengthening (SAT) tested/added 20/19 trap constraints in 4506 ms
[2024-05-22 21:47:01] [INFO ] Deduced a trap composed of 4 places in 167 ms of which 0 ms to minimize.
[2024-05-22 21:47:01] [INFO ] Deduced a trap composed of 4 places in 183 ms of which 1 ms to minimize.
[2024-05-22 21:47:01] [INFO ] Deduced a trap composed of 6 places in 169 ms of which 0 ms to minimize.
[2024-05-22 21:47:02] [INFO ] Deduced a trap composed of 4 places in 164 ms of which 0 ms to minimize.
[2024-05-22 21:47:02] [INFO ] Deduced a trap composed of 4 places in 160 ms of which 0 ms to minimize.
[2024-05-22 21:47:02] [INFO ] Deduced a trap composed of 4 places in 158 ms of which 1 ms to minimize.
[2024-05-22 21:47:02] [INFO ] Deduced a trap composed of 4 places in 159 ms of which 0 ms to minimize.
[2024-05-22 21:47:02] [INFO ] Deduced a trap composed of 4 places in 148 ms of which 0 ms to minimize.
[2024-05-22 21:47:02] [INFO ] Deduced a trap composed of 4 places in 146 ms of which 1 ms to minimize.
[2024-05-22 21:47:03] [INFO ] Deduced a trap composed of 4 places in 138 ms of which 0 ms to minimize.
[2024-05-22 21:47:03] [INFO ] Deduced a trap composed of 4 places in 142 ms of which 0 ms to minimize.
[2024-05-22 21:47:03] [INFO ] Deduced a trap composed of 4 places in 140 ms of which 0 ms to minimize.
[2024-05-22 21:47:03] [INFO ] Deduced a trap composed of 4 places in 136 ms of which 0 ms to minimize.
[2024-05-22 21:47:03] [INFO ] Deduced a trap composed of 4 places in 138 ms of which 0 ms to minimize.
[2024-05-22 21:47:03] [INFO ] Trap strengthening procedure interrupted after too many repetitions 2493 ms
[2024-05-22 21:47:03] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 2494 ms
[2024-05-22 21:47:03] [INFO ] After 16825ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 215 ms.
[2024-05-22 21:47:03] [INFO ] After 17666ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Fused 5 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 17 ms.
Support contains 62 out of 500 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 500/500 places, 10200/10200 transitions.
Applied a total of 0 rules in 399 ms. Remains 500 /500 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 399 ms. Remains : 500/500 places, 10200/10200 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 322 ms. (steps per millisecond=31 ) properties (out of 5) 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 5) 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 5) 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 5) seen :1
FORMULA Dekker-PT-100-ReachabilityCardinality-2024-10 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 4) 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 4) seen :0
Running SMT prover for 4 properties.
[2024-05-22 21:47:04] [INFO ] Flow matrix only has 400 transitions (discarded 9800 similar events)
[2024-05-22 21:47:04] [INFO ] Invariant cache hit.
[2024-05-22 21:47:05] [INFO ] After 112ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-22 21:47:05] [INFO ] [Nat]Absence check using 200 positive place invariants in 27 ms returned sat
[2024-05-22 21:47:05] [INFO ] [Nat]Absence check using 200 positive and 100 generalized place invariants in 14 ms returned sat
[2024-05-22 21:47:05] [INFO ] After 315ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-05-22 21:47:05] [INFO ] State equation strengthened by 100 read => feed constraints.
[2024-05-22 21:47:05] [INFO ] After 261ms SMT Verify possible using 100 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2024-05-22 21:47:06] [INFO ] Deduced a trap composed of 6 places in 396 ms of which 1 ms to minimize.
[2024-05-22 21:47:06] [INFO ] Deduced a trap composed of 4 places in 388 ms of which 1 ms to minimize.
[2024-05-22 21:47:07] [INFO ] Deduced a trap composed of 4 places in 359 ms of which 0 ms to minimize.
[2024-05-22 21:47:07] [INFO ] Deduced a trap composed of 4 places in 367 ms of which 1 ms to minimize.
[2024-05-22 21:47:07] [INFO ] Deduced a trap composed of 4 places in 365 ms of which 1 ms to minimize.
[2024-05-22 21:47:08] [INFO ] Deduced a trap composed of 4 places in 353 ms of which 1 ms to minimize.
[2024-05-22 21:47:08] [INFO ] Deduced a trap composed of 4 places in 359 ms of which 0 ms to minimize.
[2024-05-22 21:47:08] [INFO ] Deduced a trap composed of 4 places in 361 ms of which 0 ms to minimize.
[2024-05-22 21:47:09] [INFO ] Deduced a trap composed of 4 places in 339 ms of which 0 ms to minimize.
[2024-05-22 21:47:09] [INFO ] Deduced a trap composed of 4 places in 342 ms of which 1 ms to minimize.
[2024-05-22 21:47:10] [INFO ] Deduced a trap composed of 4 places in 336 ms of which 0 ms to minimize.
[2024-05-22 21:47:10] [INFO ] Deduced a trap composed of 4 places in 331 ms of which 0 ms to minimize.
[2024-05-22 21:47:10] [INFO ] Trap strengthening procedure interrupted after too many repetitions 4547 ms
[2024-05-22 21:47:10] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 4548 ms
[2024-05-22 21:47:10] [INFO ] Deduced a trap composed of 4 places in 284 ms of which 1 ms to minimize.
[2024-05-22 21:47:11] [INFO ] Deduced a trap composed of 4 places in 283 ms of which 0 ms to minimize.
[2024-05-22 21:47:11] [INFO ] Deduced a trap composed of 4 places in 287 ms of which 1 ms to minimize.
[2024-05-22 21:47:11] [INFO ] Deduced a trap composed of 4 places in 263 ms of which 1 ms to minimize.
[2024-05-22 21:47:12] [INFO ] Deduced a trap composed of 4 places in 272 ms of which 1 ms to minimize.
[2024-05-22 21:47:12] [INFO ] Deduced a trap composed of 4 places in 256 ms of which 0 ms to minimize.
[2024-05-22 21:47:12] [INFO ] Deduced a trap composed of 4 places in 264 ms of which 0 ms to minimize.
[2024-05-22 21:47:12] [INFO ] Deduced a trap composed of 4 places in 258 ms of which 1 ms to minimize.
[2024-05-22 21:47:13] [INFO ] Deduced a trap composed of 4 places in 229 ms of which 0 ms to minimize.
[2024-05-22 21:47:13] [INFO ] Deduced a trap composed of 4 places in 227 ms of which 0 ms to minimize.
[2024-05-22 21:47:13] [INFO ] Deduced a trap composed of 4 places in 247 ms of which 0 ms to minimize.
[2024-05-22 21:47:13] [INFO ] Trap strengthening procedure interrupted after too many repetitions 3160 ms
[2024-05-22 21:47:13] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 3163 ms
[2024-05-22 21:47:14] [INFO ] Deduced a trap composed of 4 places in 265 ms of which 1 ms to minimize.
[2024-05-22 21:47:14] [INFO ] Deduced a trap composed of 4 places in 249 ms of which 0 ms to minimize.
[2024-05-22 21:47:14] [INFO ] Deduced a trap composed of 4 places in 240 ms of which 0 ms to minimize.
[2024-05-22 21:47:14] [INFO ] Deduced a trap composed of 6 places in 234 ms of which 1 ms to minimize.
[2024-05-22 21:47:15] [INFO ] Deduced a trap composed of 4 places in 228 ms of which 0 ms to minimize.
[2024-05-22 21:47:15] [INFO ] Deduced a trap composed of 4 places in 221 ms of which 1 ms to minimize.
[2024-05-22 21:47:15] [INFO ] Deduced a trap composed of 4 places in 209 ms of which 0 ms to minimize.
[2024-05-22 21:47:15] [INFO ] Deduced a trap composed of 4 places in 228 ms of which 1 ms to minimize.
[2024-05-22 21:47:16] [INFO ] Deduced a trap composed of 4 places in 224 ms of which 0 ms to minimize.
[2024-05-22 21:47:16] [INFO ] Deduced a trap composed of 4 places in 221 ms of which 0 ms to minimize.
[2024-05-22 21:47:16] [INFO ] Deduced a trap composed of 4 places in 210 ms of which 1 ms to minimize.
[2024-05-22 21:47:16] [INFO ] Deduced a trap composed of 4 places in 199 ms of which 1 ms to minimize.
[2024-05-22 21:47:16] [INFO ] Deduced a trap composed of 4 places in 208 ms of which 0 ms to minimize.
[2024-05-22 21:47:17] [INFO ] Deduced a trap composed of 4 places in 196 ms of which 1 ms to minimize.
[2024-05-22 21:47:17] [INFO ] Deduced a trap composed of 4 places in 188 ms of which 0 ms to minimize.
[2024-05-22 21:47:17] [INFO ] Trap strengthening procedure interrupted after too many repetitions 3645 ms
[2024-05-22 21:47:17] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 3646 ms
[2024-05-22 21:47:17] [INFO ] After 11831ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 204 ms.
[2024-05-22 21:47:17] [INFO ] After 12593ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 10 ms.
Support contains 61 out of 500 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 500/500 places, 10200/10200 transitions.
Applied a total of 0 rules in 393 ms. Remains 500 /500 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 394 ms. Remains : 500/500 places, 10200/10200 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 339 ms. (steps per millisecond=29 ) properties (out of 4) 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 4) 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 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 152813 steps, run timeout after 3001 ms. (steps per millisecond=50 ) properties seen :{}
Probabilistic random walk after 152813 steps, saw 141142 distinct states, run finished after 3003 ms. (steps per millisecond=50 ) properties seen :0
Running SMT prover for 4 properties.
[2024-05-22 21:47:21] [INFO ] Flow matrix only has 400 transitions (discarded 9800 similar events)
[2024-05-22 21:47:21] [INFO ] Invariant cache hit.
[2024-05-22 21:47:21] [INFO ] After 110ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-22 21:47:21] [INFO ] [Nat]Absence check using 200 positive place invariants in 28 ms returned sat
[2024-05-22 21:47:21] [INFO ] [Nat]Absence check using 200 positive and 100 generalized place invariants in 23 ms returned sat
[2024-05-22 21:47:22] [INFO ] After 302ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-05-22 21:47:22] [INFO ] State equation strengthened by 100 read => feed constraints.
[2024-05-22 21:47:22] [INFO ] After 271ms SMT Verify possible using 100 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2024-05-22 21:47:22] [INFO ] Deduced a trap composed of 6 places in 387 ms of which 0 ms to minimize.
[2024-05-22 21:47:23] [INFO ] Deduced a trap composed of 4 places in 383 ms of which 0 ms to minimize.
[2024-05-22 21:47:23] [INFO ] Deduced a trap composed of 4 places in 401 ms of which 0 ms to minimize.
[2024-05-22 21:47:24] [INFO ] Deduced a trap composed of 4 places in 371 ms of which 1 ms to minimize.
[2024-05-22 21:47:24] [INFO ] Deduced a trap composed of 4 places in 365 ms of which 1 ms to minimize.
[2024-05-22 21:47:24] [INFO ] Deduced a trap composed of 4 places in 367 ms of which 0 ms to minimize.
[2024-05-22 21:47:25] [INFO ] Deduced a trap composed of 4 places in 366 ms of which 1 ms to minimize.
[2024-05-22 21:47:25] [INFO ] Deduced a trap composed of 4 places in 316 ms of which 0 ms to minimize.
[2024-05-22 21:47:25] [INFO ] Deduced a trap composed of 4 places in 318 ms of which 1 ms to minimize.
[2024-05-22 21:47:26] [INFO ] Deduced a trap composed of 4 places in 342 ms of which 1 ms to minimize.
[2024-05-22 21:47:26] [INFO ] Deduced a trap composed of 4 places in 334 ms of which 0 ms to minimize.
[2024-05-22 21:47:27] [INFO ] Deduced a trap composed of 4 places in 304 ms of which 1 ms to minimize.
[2024-05-22 21:47:27] [INFO ] Trap strengthening procedure interrupted after too many repetitions 4508 ms
[2024-05-22 21:47:27] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 4508 ms
[2024-05-22 21:47:27] [INFO ] Deduced a trap composed of 4 places in 262 ms of which 0 ms to minimize.
[2024-05-22 21:47:27] [INFO ] Deduced a trap composed of 4 places in 256 ms of which 0 ms to minimize.
[2024-05-22 21:47:27] [INFO ] Deduced a trap composed of 4 places in 246 ms of which 0 ms to minimize.
[2024-05-22 21:47:28] [INFO ] Deduced a trap composed of 4 places in 243 ms of which 0 ms to minimize.
[2024-05-22 21:47:28] [INFO ] Deduced a trap composed of 4 places in 236 ms of which 0 ms to minimize.
[2024-05-22 21:47:28] [INFO ] Deduced a trap composed of 4 places in 231 ms of which 0 ms to minimize.
[2024-05-22 21:47:29] [INFO ] Deduced a trap composed of 4 places in 238 ms of which 0 ms to minimize.
[2024-05-22 21:47:29] [INFO ] Deduced a trap composed of 4 places in 254 ms of which 0 ms to minimize.
[2024-05-22 21:47:29] [INFO ] Deduced a trap composed of 4 places in 230 ms of which 0 ms to minimize.
[2024-05-22 21:47:29] [INFO ] Deduced a trap composed of 4 places in 229 ms of which 0 ms to minimize.
[2024-05-22 21:47:30] [INFO ] Deduced a trap composed of 4 places in 227 ms of which 0 ms to minimize.
[2024-05-22 21:47:30] [INFO ] Trap strengthening procedure interrupted after too many repetitions 2924 ms
[2024-05-22 21:47:30] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 2924 ms
[2024-05-22 21:47:30] [INFO ] Deduced a trap composed of 4 places in 259 ms of which 1 ms to minimize.
[2024-05-22 21:47:30] [INFO ] Deduced a trap composed of 4 places in 259 ms of which 1 ms to minimize.
[2024-05-22 21:47:30] [INFO ] Deduced a trap composed of 4 places in 255 ms of which 1 ms to minimize.
[2024-05-22 21:47:31] [INFO ] Deduced a trap composed of 6 places in 256 ms of which 0 ms to minimize.
[2024-05-22 21:47:31] [INFO ] Deduced a trap composed of 4 places in 240 ms of which 0 ms to minimize.
[2024-05-22 21:47:31] [INFO ] Deduced a trap composed of 4 places in 238 ms of which 1 ms to minimize.
[2024-05-22 21:47:32] [INFO ] Deduced a trap composed of 4 places in 234 ms of which 1 ms to minimize.
[2024-05-22 21:47:32] [INFO ] Deduced a trap composed of 4 places in 225 ms of which 0 ms to minimize.
[2024-05-22 21:47:32] [INFO ] Deduced a trap composed of 4 places in 218 ms of which 0 ms to minimize.
[2024-05-22 21:47:32] [INFO ] Deduced a trap composed of 4 places in 211 ms of which 0 ms to minimize.
[2024-05-22 21:47:33] [INFO ] Deduced a trap composed of 4 places in 219 ms of which 0 ms to minimize.
[2024-05-22 21:47:33] [INFO ] Deduced a trap composed of 4 places in 207 ms of which 0 ms to minimize.
[2024-05-22 21:47:33] [INFO ] Deduced a trap composed of 4 places in 202 ms of which 1 ms to minimize.
[2024-05-22 21:47:33] [INFO ] Deduced a trap composed of 4 places in 193 ms of which 0 ms to minimize.
[2024-05-22 21:47:33] [INFO ] Deduced a trap composed of 4 places in 195 ms of which 0 ms to minimize.
[2024-05-22 21:47:33] [INFO ] Trap strengthening procedure interrupted after too many repetitions 3802 ms
[2024-05-22 21:47:33] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 3803 ms
[2024-05-22 21:47:33] [INFO ] After 11717ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 192 ms.
[2024-05-22 21:47:34] [INFO ] After 12462ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 8 ms.
Support contains 61 out of 500 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 500/500 places, 10200/10200 transitions.
Applied a total of 0 rules in 378 ms. Remains 500 /500 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 378 ms. Remains : 500/500 places, 10200/10200 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 500/500 places, 10200/10200 transitions.
Applied a total of 0 rules in 372 ms. Remains 500 /500 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
[2024-05-22 21:47:34] [INFO ] Flow matrix only has 400 transitions (discarded 9800 similar events)
[2024-05-22 21:47:34] [INFO ] Invariant cache hit.
[2024-05-22 21:47:41] [INFO ] Implicit Places using invariants in 6745 ms returned [200, 203, 206, 209, 212, 215, 218, 221, 224, 227, 230, 233, 236, 239, 242, 245, 248, 251, 254, 257, 260, 263, 266, 269, 272, 275, 278, 281, 287, 290, 293, 296, 299, 302, 305, 311, 314, 320, 323, 326, 329, 332, 335, 338, 341, 344, 347, 350, 356, 359, 362, 365, 368, 371, 374, 377, 380, 383, 386, 389, 392, 395, 398, 404, 410, 413, 416, 419, 422, 425, 428, 431, 434, 437, 440, 446, 449, 452, 455, 458, 464, 467, 470, 473, 476, 479, 482, 485, 488, 491, 494, 497]
Discarding 92 places :
Implicit Place search using SMT only with invariants took 6765 ms to find 92 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 408/500 places, 10200/10200 transitions.
Applied a total of 0 rules in 347 ms. Remains 408 /408 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 7488 ms. Remains : 408/500 places, 10200/10200 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 320 ms. (steps per millisecond=31 ) properties (out of 4) 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 4) 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 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 4) 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 4) seen :0
Interrupted probabilistic random walk after 158469 steps, run timeout after 3003 ms. (steps per millisecond=52 ) properties seen :{}
Probabilistic random walk after 158469 steps, saw 146371 distinct states, run finished after 3003 ms. (steps per millisecond=52 ) properties seen :0
Running SMT prover for 4 properties.
[2024-05-22 21:47:45] [INFO ] Flow matrix only has 400 transitions (discarded 9800 similar events)
// Phase 1: matrix 400 rows 408 cols
[2024-05-22 21:47:45] [INFO ] Computed 208 invariants in 5 ms
[2024-05-22 21:47:45] [INFO ] After 100ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-22 21:47:45] [INFO ] [Nat]Absence check using 200 positive place invariants in 27 ms returned sat
[2024-05-22 21:47:45] [INFO ] [Nat]Absence check using 200 positive and 8 generalized place invariants in 1 ms returned sat
[2024-05-22 21:47:46] [INFO ] After 284ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-05-22 21:47:46] [INFO ] State equation strengthened by 100 read => feed constraints.
[2024-05-22 21:47:46] [INFO ] After 238ms SMT Verify possible using 100 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2024-05-22 21:47:46] [INFO ] Deduced a trap composed of 4 places in 306 ms of which 0 ms to minimize.
[2024-05-22 21:47:47] [INFO ] Deduced a trap composed of 4 places in 329 ms of which 1 ms to minimize.
[2024-05-22 21:47:47] [INFO ] Deduced a trap composed of 4 places in 326 ms of which 1 ms to minimize.
[2024-05-22 21:47:47] [INFO ] Deduced a trap composed of 4 places in 323 ms of which 1 ms to minimize.
[2024-05-22 21:47:48] [INFO ] Deduced a trap composed of 4 places in 305 ms of which 0 ms to minimize.
[2024-05-22 21:47:48] [INFO ] Deduced a trap composed of 4 places in 317 ms of which 1 ms to minimize.
[2024-05-22 21:47:48] [INFO ] Deduced a trap composed of 4 places in 311 ms of which 0 ms to minimize.
[2024-05-22 21:47:49] [INFO ] Deduced a trap composed of 4 places in 309 ms of which 0 ms to minimize.
[2024-05-22 21:47:49] [INFO ] Deduced a trap composed of 4 places in 292 ms of which 0 ms to minimize.
[2024-05-22 21:47:49] [INFO ] Deduced a trap composed of 5 places in 280 ms of which 0 ms to minimize.
[2024-05-22 21:47:49] [INFO ] Deduced a trap composed of 6 places in 283 ms of which 1 ms to minimize.
[2024-05-22 21:47:50] [INFO ] Deduced a trap composed of 4 places in 270 ms of which 0 ms to minimize.
[2024-05-22 21:47:50] [INFO ] Deduced a trap composed of 4 places in 262 ms of which 1 ms to minimize.
[2024-05-22 21:47:50] [INFO ] Deduced a trap composed of 4 places in 258 ms of which 1 ms to minimize.
[2024-05-22 21:47:51] [INFO ] Deduced a trap composed of 4 places in 257 ms of which 1 ms to minimize.
[2024-05-22 21:47:51] [INFO ] Deduced a trap composed of 4 places in 254 ms of which 1 ms to minimize.
[2024-05-22 21:47:51] [INFO ] Deduced a trap composed of 4 places in 249 ms of which 1 ms to minimize.
[2024-05-22 21:47:51] [INFO ] Deduced a trap composed of 4 places in 240 ms of which 0 ms to minimize.
[2024-05-22 21:47:52] [INFO ] Deduced a trap composed of 4 places in 236 ms of which 1 ms to minimize.
[2024-05-22 21:47:52] [INFO ] Deduced a trap composed of 4 places in 232 ms of which 0 ms to minimize.
[2024-05-22 21:47:52] [INFO ] Deduced a trap composed of 4 places in 226 ms of which 0 ms to minimize.
[2024-05-22 21:47:52] [INFO ] Deduced a trap composed of 4 places in 220 ms of which 0 ms to minimize.
[2024-05-22 21:47:52] [INFO ] Trap strengthening procedure interrupted after too many repetitions 6533 ms
[2024-05-22 21:47:52] [INFO ] Trap strengthening (SAT) tested/added 22/21 trap constraints in 6534 ms
[2024-05-22 21:47:53] [INFO ] Deduced a trap composed of 4 places in 230 ms of which 0 ms to minimize.
[2024-05-22 21:47:53] [INFO ] Deduced a trap composed of 4 places in 220 ms of which 1 ms to minimize.
[2024-05-22 21:47:53] [INFO ] Deduced a trap composed of 4 places in 206 ms of which 0 ms to minimize.
[2024-05-22 21:47:53] [INFO ] Deduced a trap composed of 4 places in 201 ms of which 0 ms to minimize.
[2024-05-22 21:47:54] [INFO ] Deduced a trap composed of 4 places in 213 ms of which 1 ms to minimize.
[2024-05-22 21:47:54] [INFO ] Deduced a trap composed of 4 places in 212 ms of which 1 ms to minimize.
[2024-05-22 21:47:54] [INFO ] Deduced a trap composed of 4 places in 192 ms of which 1 ms to minimize.
[2024-05-22 21:47:54] [INFO ] Deduced a trap composed of 4 places in 183 ms of which 0 ms to minimize.
[2024-05-22 21:47:55] [INFO ] Deduced a trap composed of 4 places in 200 ms of which 0 ms to minimize.
[2024-05-22 21:47:55] [INFO ] Deduced a trap composed of 6 places in 186 ms of which 1 ms to minimize.
[2024-05-22 21:47:55] [INFO ] Deduced a trap composed of 4 places in 185 ms of which 0 ms to minimize.
[2024-05-22 21:47:55] [INFO ] Deduced a trap composed of 6 places in 180 ms of which 0 ms to minimize.
[2024-05-22 21:47:55] [INFO ] Deduced a trap composed of 4 places in 175 ms of which 1 ms to minimize.
[2024-05-22 21:47:56] [INFO ] Deduced a trap composed of 4 places in 168 ms of which 1 ms to minimize.
[2024-05-22 21:47:56] [INFO ] Deduced a trap composed of 4 places in 172 ms of which 0 ms to minimize.
[2024-05-22 21:47:56] [INFO ] Deduced a trap composed of 4 places in 167 ms of which 0 ms to minimize.
[2024-05-22 21:47:56] [INFO ] Deduced a trap composed of 4 places in 173 ms of which 1 ms to minimize.
[2024-05-22 21:47:56] [INFO ] Deduced a trap composed of 4 places in 178 ms of which 0 ms to minimize.
[2024-05-22 21:47:57] [INFO ] Deduced a trap composed of 4 places in 182 ms of which 0 ms to minimize.
[2024-05-22 21:47:57] [INFO ] Deduced a trap composed of 4 places in 171 ms of which 1 ms to minimize.
[2024-05-22 21:47:57] [INFO ] Deduced a trap composed of 4 places in 69 ms of which 0 ms to minimize.
[2024-05-22 21:47:57] [INFO ] Deduced a trap composed of 4 places in 65 ms of which 1 ms to minimize.
[2024-05-22 21:47:57] [INFO ] Deduced a trap composed of 4 places in 60 ms of which 0 ms to minimize.
[2024-05-22 21:47:57] [INFO ] Trap strengthening procedure interrupted after too many repetitions 4476 ms
[2024-05-22 21:47:57] [INFO ] Trap strengthening (SAT) tested/added 23/22 trap constraints in 4476 ms
[2024-05-22 21:47:57] [INFO ] Deduced a trap composed of 4 places in 190 ms of which 0 ms to minimize.
[2024-05-22 21:47:57] [INFO ] Deduced a trap composed of 4 places in 174 ms of which 0 ms to minimize.
[2024-05-22 21:47:58] [INFO ] Deduced a trap composed of 4 places in 179 ms of which 0 ms to minimize.
[2024-05-22 21:47:58] [INFO ] Deduced a trap composed of 4 places in 176 ms of which 0 ms to minimize.
[2024-05-22 21:47:58] [INFO ] Deduced a trap composed of 4 places in 150 ms of which 0 ms to minimize.
[2024-05-22 21:47:58] [INFO ] Deduced a trap composed of 4 places in 159 ms of which 0 ms to minimize.
[2024-05-22 21:47:58] [INFO ] Deduced a trap composed of 4 places in 158 ms of which 2 ms to minimize.
[2024-05-22 21:47:59] [INFO ] Deduced a trap composed of 4 places in 153 ms of which 0 ms to minimize.
[2024-05-22 21:47:59] [INFO ] Deduced a trap composed of 4 places in 147 ms of which 0 ms to minimize.
[2024-05-22 21:47:59] [INFO ] Deduced a trap composed of 4 places in 145 ms of which 0 ms to minimize.
[2024-05-22 21:47:59] [INFO ] Deduced a trap composed of 4 places in 151 ms of which 0 ms to minimize.
[2024-05-22 21:47:59] [INFO ] Trap strengthening procedure interrupted after too many repetitions 1995 ms
[2024-05-22 21:47:59] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1996 ms
[2024-05-22 21:47:59] [INFO ] After 13427ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 164 ms.
[2024-05-22 21:47:59] [INFO ] After 14092ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 5 ms.
Support contains 61 out of 408 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 408/408 places, 10200/10200 transitions.
Applied a total of 0 rules in 336 ms. Remains 408 /408 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 336 ms. Remains : 408/408 places, 10200/10200 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 408/408 places, 10200/10200 transitions.
Applied a total of 0 rules in 335 ms. Remains 408 /408 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
[2024-05-22 21:48:00] [INFO ] Flow matrix only has 400 transitions (discarded 9800 similar events)
[2024-05-22 21:48:00] [INFO ] Invariant cache hit.
[2024-05-22 21:48:02] [INFO ] Implicit Places using invariants in 1678 ms returned []
Implicit Place search using SMT only with invariants took 1681 ms to find 0 implicit places.
[2024-05-22 21:48:02] [INFO ] Flow matrix only has 400 transitions (discarded 9800 similar events)
[2024-05-22 21:48:02] [INFO ] Invariant cache hit.
[2024-05-22 21:48:05] [INFO ] Dead Transitions using invariants and state equation in 3292 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5312 ms. Remains : 408/408 places, 10200/10200 transitions.
Graph (complete) has 640 edges and 408 vertex of which 184 are kept as prefixes of interest. Removing 224 places using SCC suffix rule.2 ms
Discarding 224 places :
Also discarding 5712 output transitions
Drop transitions removed 5712 transitions
Ensure Unique test removed 5 places
Ensure Unique test removed 4312 transitions
Reduce isomorphic transitions removed 4312 transitions.
Iterating post reduction 0 with 4317 rules applied. Total rules applied 4318 place count 179 transition count 176
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 1 with 18 rules applied. Total rules applied 4336 place count 167 transition count 170
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 4342 place count 167 transition count 164
Free-agglomeration rule applied 23 times.
Iterating global reduction 2 with 23 rules applied. Total rules applied 4365 place count 167 transition count 141
Ensure Unique test removed 23 places
Reduce places removed 46 places and 0 transitions.
Ensure Unique test removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Iterating post reduction 2 with 69 rules applied. Total rules applied 4434 place count 121 transition count 118
Applied a total of 4434 rules in 159 ms. Remains 121 /408 variables (removed 287) and now considering 118/10200 (removed 10082) transitions.
Running SMT prover for 4 properties.
// Phase 1: matrix 118 rows 121 cols
[2024-05-22 21:48:05] [INFO ] Computed 62 invariants in 0 ms
[2024-05-22 21:48:05] [INFO ] After 42ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-22 21:48:05] [INFO ] [Nat]Absence check using 62 positive place invariants in 7 ms returned sat
[2024-05-22 21:48:05] [INFO ] After 62ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-05-22 21:48:05] [INFO ] After 116ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 36 ms.
[2024-05-22 21:48:05] [INFO ] After 213ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
[2024-05-22 21:48:05] [INFO ] Export to MCC of 4 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 4 ms.
[2024-05-22 21:48:05] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 408 places, 10200 transitions and 70908 arcs took 65 ms.
[2024-05-22 21:48:06] [INFO ] Flatten gal took : 644 ms
Total runtime 102496 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT Dekker-PT-100
BK_EXAMINATION: ReachabilityCardinality
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/371
ReachabilityCardinality

FORMULA Dekker-PT-100-ReachabilityCardinality-2024-08 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Dekker-PT-100-ReachabilityCardinality-2024-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Dekker-PT-100-ReachabilityCardinality-2024-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Dekker-PT-100-ReachabilityCardinality-2024-02 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

BK_STOP 1716414509842

--------------------
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.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityCardinality -timeout 360 -rebuildPNML
lola: MEM LIMIT 32
lola: MEM LIMIT 5
lola: NET
lola: input: PNML file (--pnmlnet)
lola: reading net from /home/mcc/execution/371/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/371/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/371/ReachabilityCardinality.xml
lola: Created skeleton in 0.000000 secs.
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: LAUNCH task # 14 (type SKEL/FNDP) for 0 Dekker-PT-100-ReachabilityCardinality-2024-02
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 15 (type SKEL/EQUN) for 0 Dekker-PT-100-ReachabilityCardinality-2024-02
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: LAUNCH task # 17 (type SKEL/SRCH) for 0 Dekker-PT-100-ReachabilityCardinality-2024-02
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 18 (type SKEL/SRCH) for 0 Dekker-PT-100-ReachabilityCardinality-2024-02
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: FINISHED task # 17 (type SKEL/SRCH) for Dekker-PT-100-ReachabilityCardinality-2024-02
lola: result : true
lola: markings : 4
lola: fired transitions : 3
lola: time used : 1.000000
lola: memory pages used : 1
lola: FINISHED task # 14 (type SKEL/FNDP) for Dekker-PT-100-ReachabilityCardinality-2024-02
lola: result : true
lola: fired transitions : 2
lola: tried executions : 1
lola: time used : 1.000000
lola: memory pages used : 0
lola: CANCELED task # 15 (type EQUN) for Dekker-PT-100-ReachabilityCardinality-2024-02 (obsolete)
lola: CANCELED task # 18 (type SRCH) for Dekker-PT-100-ReachabilityCardinality-2024-02 (obsolete)
lola: FINISHED task # 18 (type SKEL/SRCH) for Dekker-PT-100-ReachabilityCardinality-2024-02
lola: result : true
lola: markings : 86
lola: fired transitions : 597
lola: time used : 1.000000
lola: memory pages used : 1
lola: FINISHED task # 15 (type SKEL/EQUN) for Dekker-PT-100-ReachabilityCardinality-2024-02
lola: result : unknown
lola: Created skeleton in 1.000000 secs.
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: LAUNCH task # 21 (type SKEL/FNDP) for 3 Dekker-PT-100-ReachabilityCardinality-2024-08
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 22 (type SKEL/EQUN) for 3 Dekker-PT-100-ReachabilityCardinality-2024-08
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: LAUNCH task # 24 (type SKEL/SRCH) for 3 Dekker-PT-100-ReachabilityCardinality-2024-08
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 25 (type SKEL/SRCH) for 3 Dekker-PT-100-ReachabilityCardinality-2024-08
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: FINISHED task # 24 (type SKEL/SRCH) for Dekker-PT-100-ReachabilityCardinality-2024-08
lola: result : true
lola: markings : 3
lola: fired transitions : 2
lola: time used : 0.000000
lola: memory pages used : 1
lola: CANCELED task # 21 (type FNDP) for Dekker-PT-100-ReachabilityCardinality-2024-08 (obsolete)
lola: CANCELED task # 22 (type EQUN) for Dekker-PT-100-ReachabilityCardinality-2024-08 (obsolete)
lola: CANCELED task # 25 (type SRCH) for Dekker-PT-100-ReachabilityCardinality-2024-08 (obsolete)
lola: FINISHED task # 21 (type SKEL/FNDP) for Dekker-PT-100-ReachabilityCardinality-2024-08
lola: result : true
lola: fired transitions : 1
lola: tried executions : 1
lola: time used : 0.000000
lola: memory pages used : 0
sara: try reading problem file /home/mcc/execution/371/ReachabilityCardinality-22.sara.

lola: FINISHED task # 22 (type SKEL/EQUN) for Dekker-PT-100-ReachabilityCardinality-2024-08
lola: result : true
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Rule S: 0 transitions removed,0 places removed
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: LAUNCH task # 29 (type SKEL/FNDP) for 9 Dekker-PT-100-ReachabilityCardinality-2024-13
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 30 (type SKEL/EQUN) for 9 Dekker-PT-100-ReachabilityCardinality-2024-13
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: LAUNCH task # 32 (type SKEL/SRCH) for 9 Dekker-PT-100-ReachabilityCardinality-2024-13
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 33 (type SKEL/SRCH) for 9 Dekker-PT-100-ReachabilityCardinality-2024-13
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: FINISHED task # 29 (type SKEL/FNDP) for Dekker-PT-100-ReachabilityCardinality-2024-13
lola: result : true
lola: fired transitions : 756
lola: tried executions : 1
lola: time used : 0.000000
lola: memory pages used : 0
lola: CANCELED task # 30 (type EQUN) for Dekker-PT-100-ReachabilityCardinality-2024-13 (obsolete)
lola: CANCELED task # 32 (type SRCH) for Dekker-PT-100-ReachabilityCardinality-2024-13 (obsolete)
lola: CANCELED task # 33 (type SRCH) for Dekker-PT-100-ReachabilityCardinality-2024-13 (obsolete)
sara: try reading problem file /home/mcc/execution/371/ReachabilityCardinality-30.sara.
sara: place or transition ordering is non-deterministic
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Dekker-PT-100-ReachabilityCardinality-2024-02: AG 0 0 0 0 4 0 0 1
Dekker-PT-100-ReachabilityCardinality-2024-08: EF 0 0 0 0 3 0 0 2
Dekker-PT-100-ReachabilityCardinality-2024-11: AG 0 0 0 0 1 0 0 0
Dekker-PT-100-ReachabilityCardinality-2024-13: AG 0 0 0 0 1 0 0 4

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS

Time elapsed: 8 secs. Pages in use: 2
# running tasks: 0 of 4 Visible: 4
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: LAUNCH task # 39 (type EXCL) for 3 Dekker-PT-100-ReachabilityCardinality-2024-08
lola: time limit : 897 sec
lola: memory limit: 32 pages
lola: LAUNCH task # 35 (type FNDP) for 3 Dekker-PT-100-ReachabilityCardinality-2024-08
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 36 (type EQUN) for 3 Dekker-PT-100-ReachabilityCardinality-2024-08
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 38 (type SRCH) for 3 Dekker-PT-100-ReachabilityCardinality-2024-08
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: FINISHED task # 38 (type SRCH) for Dekker-PT-100-ReachabilityCardinality-2024-08
lola: result : true
lola: markings : 3
lola: fired transitions : 2
lola: time used : 0.000000
lola: memory pages used : 1
lola: CANCELED task # 35 (type FNDP) for Dekker-PT-100-ReachabilityCardinality-2024-08 (obsolete)
lola: CANCELED task # 36 (type EQUN) for Dekker-PT-100-ReachabilityCardinality-2024-08 (obsolete)
lola: CANCELED task # 39 (type EXCL) for Dekker-PT-100-ReachabilityCardinality-2024-08 (obsolete)
lola: FINISHED task # 35 (type FNDP) for Dekker-PT-100-ReachabilityCardinality-2024-08
lola: result : true
lola: fired transitions : 1
lola: tried executions : 1
lola: time used : 0.000000
lola: memory pages used : 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: LAUNCH task # 46 (type EXCL) for 6 Dekker-PT-100-ReachabilityCardinality-2024-11
lola: time limit : 1197 sec
lola: memory limit: 32 pages
lola: LAUNCH task # 42 (type FNDP) for 6 Dekker-PT-100-ReachabilityCardinality-2024-11
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 43 (type EQUN) for 6 Dekker-PT-100-ReachabilityCardinality-2024-11
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 45 (type SRCH) for 6 Dekker-PT-100-ReachabilityCardinality-2024-11
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
sara: try reading problem file /home/mcc/execution/371/ReachabilityCardinality-36.sara.
lola: FINISHED task # 45 (type SRCH) for Dekker-PT-100-ReachabilityCardinality-2024-11
lola: result : true
lola: markings : 3
lola: fired transitions : 2
lola: time used : 1.000000
lola: memory pages used : 1
lola: FINISHED task # 42 (type FNDP) for Dekker-PT-100-ReachabilityCardinality-2024-11
lola: result : true
lola: fired transitions : 1
lola: tried executions : 1
lola: time used : 1.000000
lola: memory pages used : 0
lola: CANCELED task # 43 (type EQUN) for Dekker-PT-100-ReachabilityCardinality-2024-11 (obsolete)
lola: CANCELED task # 46 (type EXCL) for Dekker-PT-100-ReachabilityCardinality-2024-11 (obsolete)
lola: LAUNCH task # 60 (type EXCL) for 0 Dekker-PT-100-ReachabilityCardinality-2024-02
lola: time limit : 1795 sec
lola: memory limit: 32 pages
lola: LAUNCH task # 49 (type FNDP) for 9 Dekker-PT-100-ReachabilityCardinality-2024-13
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 50 (type EQUN) for 9 Dekker-PT-100-ReachabilityCardinality-2024-13
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 52 (type SRCH) for 9 Dekker-PT-100-ReachabilityCardinality-2024-13
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Dekker-PT-100-ReachabilityCardinality-2024-08: EF true tandem / insertion
Dekker-PT-100-ReachabilityCardinality-2024-11: AG false findpath

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Dekker-PT-100-ReachabilityCardinality-2024-02: AG 0 4 1 0 4 0 0 1
Dekker-PT-100-ReachabilityCardinality-2024-13: AG 0 2 3 0 1 0 0 4

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
49 EF FNDP 3/1196 0/5 Dekker-PT-100-ReachabilityCardinality-2024-13 31250 t fired, 1 attempts, .
50 EF STEQ 3/1196 0/5 Dekker-PT-100-ReachabilityCardinality-2024-13 sara not yet started (preprocessing).
52 EF SRCH 3/1795 1/5 Dekker-PT-100-ReachabilityCardinality-2024-13 23451 m, 4690 m/sec, 98749 t fired, .
60 EF EXCL 3/1795 1/32 Dekker-PT-100-ReachabilityCardinality-2024-02 670 m, 134 m/sec, 1704 t fired, .

Time elapsed: 13 secs. Pages in use: 2
# running tasks: 4 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Dekker-PT-100-ReachabilityCardinality-2024-08: EF true tandem / insertion
Dekker-PT-100-ReachabilityCardinality-2024-11: AG false findpath

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Dekker-PT-100-ReachabilityCardinality-2024-02: AG 0 4 1 0 4 0 0 1
Dekker-PT-100-ReachabilityCardinality-2024-13: AG 0 2 3 0 1 0 0 4

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
49 EF FNDP 8/1193 0/5 Dekker-PT-100-ReachabilityCardinality-2024-13 87210 t fired, 1 attempts, .
50 EF STEQ 8/1193 0/5 Dekker-PT-100-ReachabilityCardinality-2024-13 sara not yet started (preprocessing).
52 EF SRCH 8/1792 1/5 Dekker-PT-100-ReachabilityCardinality-2024-13 47014 m, 4712 m/sec, 211938 t fired, .
60 EF EXCL 8/1795 1/32 Dekker-PT-100-ReachabilityCardinality-2024-02 1540 m, 174 m/sec, 3862 t fired, .

Time elapsed: 18 secs. Pages in use: 2
# running tasks: 4 of 4 Visible: 4
lola: FINISHED task # 49 (type FNDP) for Dekker-PT-100-ReachabilityCardinality-2024-13
lola: result : true
lola: fired transitions : 121699
lola: tried executions : 1
lola: time used : 12.000000
lola: memory pages used : 0
lola: CANCELED task # 50 (type EQUN) for Dekker-PT-100-ReachabilityCardinality-2024-13 (obsolete)
lola: CANCELED task # 52 (type SRCH) for Dekker-PT-100-ReachabilityCardinality-2024-13 (obsolete)
lola: LAUNCH task # 55 (type FNDP) for 0 Dekker-PT-100-ReachabilityCardinality-2024-02
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 57 (type EQUN) for 0 Dekker-PT-100-ReachabilityCardinality-2024-02
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 59 (type SRCH) for 0 Dekker-PT-100-ReachabilityCardinality-2024-02
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: FINISHED task # 55 (type FNDP) for Dekker-PT-100-ReachabilityCardinality-2024-02
lola: result : true
lola: fired transitions : 2
lola: tried executions : 1
lola: time used : 0.000000
lola: memory pages used : 0
lola: FINISHED task # 59 (type SRCH) for Dekker-PT-100-ReachabilityCardinality-2024-02
lola: result : true
lola: markings : 4
lola: fired transitions : 3
lola: time used : 0.000000
lola: memory pages used : 1
lola: CANCELED task # 57 (type EQUN) for Dekker-PT-100-ReachabilityCardinality-2024-02 (obsolete)
lola: CANCELED task # 60 (type EXCL) for Dekker-PT-100-ReachabilityCardinality-2024-02 (obsolete)
lola: Portfolio finished: no open formulas

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Dekker-PT-100-ReachabilityCardinality-2024-02: AG false findpath
Dekker-PT-100-ReachabilityCardinality-2024-08: EF true tandem / insertion
Dekker-PT-100-ReachabilityCardinality-2024-11: AG false findpath
Dekker-PT-100-ReachabilityCardinality-2024-13: AG false findpath


Time elapsed: 22 secs. Pages in use: 2

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="Dekker-PT-100"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="gold2023"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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