Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 14M
-rw-r--r-- 1 mcc users 11K Feb 25 16:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 73K Feb 25 16:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.3K Feb 25 16:53 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K Feb 25 16:53 CTLFireability.xml
-rw-r--r-- 1 mcc users 5.7K Feb 25 16:21 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 16:21 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.2K Feb 25 16:21 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:21 LTLFireability.xml
-rw-r--r-- 1 mcc users 31K Feb 25 16:55 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 194K Feb 25 16:55 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.7K Feb 25 16:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 36K Feb 25 16:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 16:21 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.3K Feb 25 16:21 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 14M Mar 5 18:22 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 LeafsetExtension-PT-S64C3-ReachabilityCardinality-00
FORMULA_NAME LeafsetExtension-PT-S64C3-ReachabilityCardinality-01
FORMULA_NAME LeafsetExtension-PT-S64C3-ReachabilityCardinality-02
FORMULA_NAME LeafsetExtension-PT-S64C3-ReachabilityCardinality-03
FORMULA_NAME LeafsetExtension-PT-S64C3-ReachabilityCardinality-04
FORMULA_NAME LeafsetExtension-PT-S64C3-ReachabilityCardinality-05
FORMULA_NAME LeafsetExtension-PT-S64C3-ReachabilityCardinality-06
FORMULA_NAME LeafsetExtension-PT-S64C3-ReachabilityCardinality-07
FORMULA_NAME LeafsetExtension-PT-S64C3-ReachabilityCardinality-08
FORMULA_NAME LeafsetExtension-PT-S64C3-ReachabilityCardinality-09
FORMULA_NAME LeafsetExtension-PT-S64C3-ReachabilityCardinality-10
FORMULA_NAME LeafsetExtension-PT-S64C3-ReachabilityCardinality-11
FORMULA_NAME LeafsetExtension-PT-S64C3-ReachabilityCardinality-12
FORMULA_NAME LeafsetExtension-PT-S64C3-ReachabilityCardinality-13
FORMULA_NAME LeafsetExtension-PT-S64C3-ReachabilityCardinality-14
FORMULA_NAME LeafsetExtension-PT-S64C3-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1679461981661

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=lolaxred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=LeafsetExtension-PT-S64C3
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-22 05:13:03] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-22 05:13:03] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-22 05:13:04] [INFO ] Load time of PNML (sax parser for PT used): 654 ms
[2023-03-22 05:13:04] [INFO ] Transformed 21462 places.
[2023-03-22 05:13:04] [INFO ] Transformed 21129 transitions.
[2023-03-22 05:13:04] [INFO ] Parsed PT model containing 21462 places and 21129 transitions and 67740 arcs in 828 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 47 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 388 resets, run finished after 695 ms. (steps per millisecond=14 ) properties (out of 16) seen :1
FORMULA LeafsetExtension-PT-S64C3-ReachabilityCardinality-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 15) seen :1
FORMULA LeafsetExtension-PT-S64C3-ReachabilityCardinality-14 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 14) seen :0
Running SMT prover for 14 properties.
// Phase 1: matrix 21129 rows 21462 cols
[2023-03-22 05:13:08] [INFO ] Computed 333 place invariants in 2803 ms
[2023-03-22 05:13:14] [INFO ] After 6284ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:14
[2023-03-22 05:13:20] [INFO ] [Nat]Absence check using 67 positive place invariants in 60 ms returned sat
[2023-03-22 05:13:21] [INFO ] [Nat]Absence check using 67 positive and 266 generalized place invariants in 1014 ms returned sat
[2023-03-22 05:13:39] [INFO ] After 12056ms SMT Verify possible using state equation in natural domain returned unsat :5 sat :8
[2023-03-22 05:13:39] [INFO ] After 12086ms SMT Verify possible using trap constraints in natural domain returned unsat :5 sat :8
Attempting to minimize the solution found.
Minimization took 6 ms.
[2023-03-22 05:13:39] [INFO ] After 25069ms SMT Verify possible using all constraints in natural domain returned unsat :5 sat :8
FORMULA LeafsetExtension-PT-S64C3-ReachabilityCardinality-12 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA LeafsetExtension-PT-S64C3-ReachabilityCardinality-11 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA LeafsetExtension-PT-S64C3-ReachabilityCardinality-07 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA LeafsetExtension-PT-S64C3-ReachabilityCardinality-06 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA LeafsetExtension-PT-S64C3-ReachabilityCardinality-00 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 14 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 327 out of 21462 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 21462/21462 places, 21129/21129 transitions.
Graph (complete) has 42457 edges and 21462 vertex of which 12524 are kept as prefixes of interest. Removing 8938 places using SCC suffix rule.43 ms
Discarding 8938 places :
Also discarding 2856 output transitions
Drop transitions removed 2856 transitions
Drop transitions removed 1897 transitions
Reduce isomorphic transitions removed 1897 transitions.
Drop transitions removed 3501 transitions
Trivial Post-agglo rules discarded 3501 transitions
Performed 3501 trivial Post agglomeration. Transition count delta: 3501
Iterating post reduction 0 with 5398 rules applied. Total rules applied 5399 place count 12524 transition count 12875
Reduce places removed 3502 places and 0 transitions.
Drop transitions removed 48 transitions
Trivial Post-agglo rules discarded 48 transitions
Performed 48 trivial Post agglomeration. Transition count delta: 48
Iterating post reduction 1 with 3550 rules applied. Total rules applied 8949 place count 9022 transition count 12827
Reduce places removed 48 places and 0 transitions.
Performed 127 Post agglomeration using F-continuation condition.Transition count delta: 127
Iterating post reduction 2 with 175 rules applied. Total rules applied 9124 place count 8974 transition count 12700
Reduce places removed 127 places and 0 transitions.
Iterating post reduction 3 with 127 rules applied. Total rules applied 9251 place count 8847 transition count 12700
Performed 120 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 120 Pre rules applied. Total rules applied 9251 place count 8847 transition count 12580
Deduced a syphon composed of 120 places in 5 ms
Reduce places removed 120 places and 0 transitions.
Iterating global reduction 4 with 240 rules applied. Total rules applied 9491 place count 8727 transition count 12580
Discarding 2116 places :
Symmetric choice reduction at 4 with 2116 rule applications. Total rules 11607 place count 6611 transition count 10464
Iterating global reduction 4 with 2116 rules applied. Total rules applied 13723 place count 6611 transition count 10464
Discarding 1935 places :
Symmetric choice reduction at 4 with 1935 rule applications. Total rules 15658 place count 4676 transition count 8529
Iterating global reduction 4 with 1935 rules applied. Total rules applied 17593 place count 4676 transition count 8529
Free-agglomeration rule (complex) applied 100 times.
Iterating global reduction 4 with 100 rules applied. Total rules applied 17693 place count 4676 transition count 8429
Reduce places removed 100 places and 0 transitions.
Iterating post reduction 4 with 100 rules applied. Total rules applied 17793 place count 4576 transition count 8429
Partial Free-agglomeration rule applied 718 times.
Drop transitions removed 718 transitions
Iterating global reduction 5 with 718 rules applied. Total rules applied 18511 place count 4576 transition count 8429
Discarding 5 places :
Implicit places reduction removed 5 places
Iterating post reduction 5 with 5 rules applied. Total rules applied 18516 place count 4571 transition count 8429
Free-agglomeration rule (complex) applied 5 times.
Iterating global reduction 6 with 5 rules applied. Total rules applied 18521 place count 4571 transition count 8424
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 6 with 5 rules applied. Total rules applied 18526 place count 4566 transition count 8424
Applied a total of 18526 rules in 5930 ms. Remains 4566 /21462 variables (removed 16896) and now considering 8424/21129 (removed 12705) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5932 ms. Remains : 4566/21462 places, 8424/21129 transitions.
Incomplete random walk after 10000 steps, including 747 resets, run finished after 565 ms. (steps per millisecond=17 ) properties (out of 9) seen :2
FORMULA LeafsetExtension-PT-S64C3-ReachabilityCardinality-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LeafsetExtension-PT-S64C3-ReachabilityCardinality-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 7) seen :1
FORMULA LeafsetExtension-PT-S64C3-ReachabilityCardinality-05 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
[2023-03-22 05:13:46] [INFO ] Flow matrix only has 8050 transitions (discarded 374 similar events)
// Phase 1: matrix 8050 rows 4566 cols
[2023-03-22 05:13:46] [INFO ] Computed 102 place invariants in 140 ms
[2023-03-22 05:13:47] [INFO ] After 757ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-22 05:13:48] [INFO ] [Nat]Absence check using 0 positive and 102 generalized place invariants in 44 ms returned sat
[2023-03-22 05:13:53] [INFO ] After 5202ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-22 05:13:57] [INFO ] After 8846ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 2723 ms.
[2023-03-22 05:13:59] [INFO ] After 12666ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Parikh walk visited 0 properties in 33 ms.
Support contains 309 out of 4566 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4566/4566 places, 8424/8424 transitions.
Graph (complete) has 20179 edges and 4566 vertex of which 4495 are kept as prefixes of interest. Removing 71 places using SCC suffix rule.3 ms
Discarding 71 places :
Also discarding 4 output transitions
Drop transitions removed 4 transitions
Drop transitions removed 65 transitions
Reduce isomorphic transitions removed 65 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 67 rules applied. Total rules applied 68 place count 4495 transition count 8353
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 70 place count 4493 transition count 8353
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 75 place count 4488 transition count 8348
Iterating global reduction 2 with 5 rules applied. Total rules applied 80 place count 4488 transition count 8348
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 81 place count 4488 transition count 8347
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 82 place count 4487 transition count 8347
Partial Free-agglomeration rule applied 39 times.
Drop transitions removed 39 transitions
Iterating global reduction 3 with 39 rules applied. Total rules applied 121 place count 4487 transition count 8347
Discarding 3 places :
Implicit places reduction removed 3 places
Iterating post reduction 3 with 3 rules applied. Total rules applied 124 place count 4484 transition count 8347
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 129 place count 4479 transition count 8342
Iterating global reduction 4 with 5 rules applied. Total rules applied 134 place count 4479 transition count 8342
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 4 with 2 rules applied. Total rules applied 136 place count 4479 transition count 8340
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 138 place count 4477 transition count 8340
Applied a total of 138 rules in 2447 ms. Remains 4477 /4566 variables (removed 89) and now considering 8340/8424 (removed 84) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2448 ms. Remains : 4477/4566 places, 8340/8424 transitions.
Incomplete random walk after 10000 steps, including 757 resets, run finished after 383 ms. (steps per millisecond=26 ) properties (out of 6) seen :1
FORMULA LeafsetExtension-PT-S64C3-ReachabilityCardinality-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
[2023-03-22 05:14:02] [INFO ] Flow matrix only has 7903 transitions (discarded 437 similar events)
// Phase 1: matrix 7903 rows 4477 cols
[2023-03-22 05:14:03] [INFO ] Computed 102 place invariants in 74 ms
[2023-03-22 05:14:03] [INFO ] After 795ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-22 05:14:04] [INFO ] [Nat]Absence check using 0 positive and 102 generalized place invariants in 35 ms returned sat
[2023-03-22 05:14:09] [INFO ] After 4846ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-22 05:14:12] [INFO ] After 7558ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 2365 ms.
[2023-03-22 05:14:14] [INFO ] After 10878ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Parikh walk visited 0 properties in 12 ms.
Support contains 283 out of 4477 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4477/4477 places, 8340/8340 transitions.
Graph (complete) has 19943 edges and 4477 vertex of which 4398 are kept as prefixes of interest. Removing 79 places using SCC suffix rule.3 ms
Discarding 79 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Drop transitions removed 70 transitions
Reduce isomorphic transitions removed 70 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 72 rules applied. Total rules applied 73 place count 4398 transition count 8265
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 75 place count 4396 transition count 8265
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 75 place count 4396 transition count 8264
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 77 place count 4395 transition count 8264
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 83 place count 4389 transition count 8258
Iterating global reduction 2 with 6 rules applied. Total rules applied 89 place count 4389 transition count 8258
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 90 place count 4389 transition count 8257
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 91 place count 4388 transition count 8257
Partial Free-agglomeration rule applied 67 times.
Drop transitions removed 67 transitions
Iterating global reduction 3 with 67 rules applied. Total rules applied 158 place count 4388 transition count 8257
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 3 with 2 rules applied. Total rules applied 160 place count 4386 transition count 8257
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 164 place count 4382 transition count 8253
Iterating global reduction 4 with 4 rules applied. Total rules applied 168 place count 4382 transition count 8253
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 4 with 2 rules applied. Total rules applied 170 place count 4382 transition count 8251
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 172 place count 4380 transition count 8251
Applied a total of 172 rules in 2402 ms. Remains 4380 /4477 variables (removed 97) and now considering 8251/8340 (removed 89) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2402 ms. Remains : 4380/4477 places, 8251/8340 transitions.
Incomplete random walk after 10000 steps, including 756 resets, run finished after 358 ms. (steps per millisecond=27 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 17 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 17 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 17726 steps, run timeout after 3001 ms. (steps per millisecond=5 ) properties seen :{0=1}
Probabilistic random walk after 17726 steps, saw 9563 distinct states, run finished after 3002 ms. (steps per millisecond=5 ) properties seen :1
FORMULA LeafsetExtension-PT-S64C3-ReachabilityCardinality-01 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Running SMT prover for 4 properties.
[2023-03-22 05:14:20] [INFO ] Flow matrix only has 7748 transitions (discarded 503 similar events)
// Phase 1: matrix 7748 rows 4380 cols
[2023-03-22 05:14:20] [INFO ] Computed 101 place invariants in 75 ms
[2023-03-22 05:14:21] [INFO ] After 585ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-22 05:14:22] [INFO ] [Nat]Absence check using 0 positive and 101 generalized place invariants in 36 ms returned sat
[2023-03-22 05:14:26] [INFO ] After 4344ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-22 05:14:28] [INFO ] After 6451ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 1844 ms.
[2023-03-22 05:14:30] [INFO ] After 9111ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 8 ms.
Support contains 222 out of 4380 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4380/4380 places, 8251/8251 transitions.
Graph (complete) has 19582 edges and 4380 vertex of which 4213 are kept as prefixes of interest. Removing 167 places using SCC suffix rule.3 ms
Discarding 167 places :
Also discarding 11 output transitions
Drop transitions removed 11 transitions
Drop transitions removed 145 transitions
Reduce isomorphic transitions removed 145 transitions.
Drop transitions removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 0 with 159 rules applied. Total rules applied 160 place count 4213 transition count 8081
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 1 with 14 rules applied. Total rules applied 174 place count 4199 transition count 8081
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 180 place count 4193 transition count 8075
Iterating global reduction 2 with 6 rules applied. Total rules applied 186 place count 4193 transition count 8075
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 188 place count 4191 transition count 8073
Iterating global reduction 2 with 2 rules applied. Total rules applied 190 place count 4191 transition count 8073
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 191 place count 4191 transition count 8072
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 192 place count 4190 transition count 8072
Partial Free-agglomeration rule applied 256 times.
Drop transitions removed 256 transitions
Iterating global reduction 3 with 256 rules applied. Total rules applied 448 place count 4190 transition count 8072
Discarding 3 places :
Implicit places reduction removed 3 places
Iterating post reduction 3 with 3 rules applied. Total rules applied 451 place count 4187 transition count 8072
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 459 place count 4179 transition count 8064
Iterating global reduction 4 with 8 rules applied. Total rules applied 467 place count 4179 transition count 8064
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 4 with 2 rules applied. Total rules applied 469 place count 4179 transition count 8062
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 471 place count 4177 transition count 8062
Applied a total of 471 rules in 2500 ms. Remains 4177 /4380 variables (removed 203) and now considering 8062/8251 (removed 189) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2501 ms. Remains : 4177/4380 places, 8062/8251 transitions.
Incomplete random walk after 10000 steps, including 771 resets, run finished after 321 ms. (steps per millisecond=31 ) properties (out of 4) seen :1
FORMULA LeafsetExtension-PT-S64C3-ReachabilityCardinality-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-03-22 05:14:33] [INFO ] Flow matrix only has 7430 transitions (discarded 632 similar events)
// Phase 1: matrix 7430 rows 4177 cols
[2023-03-22 05:14:33] [INFO ] Computed 101 place invariants in 81 ms
[2023-03-22 05:14:34] [INFO ] After 492ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-22 05:14:34] [INFO ] [Nat]Absence check using 0 positive and 101 generalized place invariants in 36 ms returned sat
[2023-03-22 05:14:38] [INFO ] After 3637ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-22 05:14:39] [INFO ] After 5052ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 1075 ms.
[2023-03-22 05:14:40] [INFO ] After 6799ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 10 ms.
Support contains 153 out of 4177 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4177/4177 places, 8062/8062 transitions.
Graph (complete) has 18963 edges and 4177 vertex of which 3816 are kept as prefixes of interest. Removing 361 places using SCC suffix rule.3 ms
Discarding 361 places :
Also discarding 17 output transitions
Drop transitions removed 17 transitions
Drop transitions removed 325 transitions
Reduce isomorphic transitions removed 325 transitions.
Drop transitions removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 0 with 338 rules applied. Total rules applied 339 place count 3816 transition count 7707
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 1 with 13 rules applied. Total rules applied 352 place count 3803 transition count 7707
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 365 place count 3790 transition count 7694
Iterating global reduction 2 with 13 rules applied. Total rules applied 378 place count 3790 transition count 7694
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 379 place count 3790 transition count 7693
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 380 place count 3789 transition count 7693
Partial Free-agglomeration rule applied 169 times.
Drop transitions removed 169 transitions
Iterating global reduction 3 with 169 rules applied. Total rules applied 549 place count 3789 transition count 7693
Discarding 5 places :
Implicit places reduction removed 5 places
Iterating post reduction 3 with 5 rules applied. Total rules applied 554 place count 3784 transition count 7693
Discarding 13 places :
Symmetric choice reduction at 4 with 13 rule applications. Total rules 567 place count 3771 transition count 7680
Iterating global reduction 4 with 13 rules applied. Total rules applied 580 place count 3771 transition count 7680
Free-agglomeration rule (complex) applied 4 times.
Iterating global reduction 4 with 4 rules applied. Total rules applied 584 place count 3771 transition count 7676
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 588 place count 3767 transition count 7676
Applied a total of 588 rules in 1838 ms. Remains 3767 /4177 variables (removed 410) and now considering 7676/8062 (removed 386) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1838 ms. Remains : 3767/4177 places, 7676/8062 transitions.
Incomplete random walk after 10000 steps, including 789 resets, run finished after 308 ms. (steps per millisecond=32 ) properties (out of 3) seen :1
FORMULA LeafsetExtension-PT-S64C3-ReachabilityCardinality-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-22 05:14:43] [INFO ] Flow matrix only has 6727 transitions (discarded 949 similar events)
// Phase 1: matrix 6727 rows 3767 cols
[2023-03-22 05:14:43] [INFO ] Computed 100 place invariants in 61 ms
[2023-03-22 05:14:43] [INFO ] After 444ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-22 05:14:44] [INFO ] [Nat]Absence check using 0 positive and 100 generalized place invariants in 35 ms returned sat
[2023-03-22 05:14:47] [INFO ] After 3048ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-22 05:14:48] [INFO ] After 4123ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 790 ms.
[2023-03-22 05:14:49] [INFO ] After 5424ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 3 ms.
Support contains 124 out of 3767 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3767/3767 places, 7676/7676 transitions.
Graph (complete) has 17500 edges and 3767 vertex of which 3615 are kept as prefixes of interest. Removing 152 places using SCC suffix rule.2 ms
Discarding 152 places :
Also discarding 9 output transitions
Drop transitions removed 9 transitions
Drop transitions removed 134 transitions
Reduce isomorphic transitions removed 134 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 136 rules applied. Total rules applied 137 place count 3615 transition count 7531
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 139 place count 3613 transition count 7531
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 142 place count 3610 transition count 7528
Iterating global reduction 2 with 3 rules applied. Total rules applied 145 place count 3610 transition count 7528
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 146 place count 3610 transition count 7527
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 147 place count 3609 transition count 7527
Partial Free-agglomeration rule applied 159 times.
Drop transitions removed 159 transitions
Iterating global reduction 3 with 159 rules applied. Total rules applied 306 place count 3609 transition count 7527
Discarding 5 places :
Implicit places reduction removed 5 places
Iterating post reduction 3 with 5 rules applied. Total rules applied 311 place count 3604 transition count 7527
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 314 place count 3601 transition count 7524
Iterating global reduction 4 with 3 rules applied. Total rules applied 317 place count 3601 transition count 7524
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 4 with 3 rules applied. Total rules applied 320 place count 3601 transition count 7521
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 323 place count 3598 transition count 7521
Applied a total of 323 rules in 1688 ms. Remains 3598 /3767 variables (removed 169) and now considering 7521/7676 (removed 155) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1688 ms. Remains : 3598/3767 places, 7521/7676 transitions.
Incomplete random walk after 10000 steps, including 789 resets, run finished after 220 ms. (steps per millisecond=45 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 19400 steps, run timeout after 3001 ms. (steps per millisecond=6 ) properties seen :{}
Probabilistic random walk after 19400 steps, saw 10369 distinct states, run finished after 3002 ms. (steps per millisecond=6 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-22 05:14:54] [INFO ] Flow matrix only has 6443 transitions (discarded 1078 similar events)
// Phase 1: matrix 6443 rows 3598 cols
[2023-03-22 05:14:54] [INFO ] Computed 100 place invariants in 64 ms
[2023-03-22 05:14:54] [INFO ] After 386ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-22 05:14:55] [INFO ] [Nat]Absence check using 0 positive and 100 generalized place invariants in 36 ms returned sat
[2023-03-22 05:14:58] [INFO ] After 3063ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-22 05:14:59] [INFO ] After 4122ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 760 ms.
[2023-03-22 05:14:59] [INFO ] After 5382ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 2 ms.
Support contains 124 out of 3598 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3598/3598 places, 7521/7521 transitions.
Applied a total of 0 rules in 272 ms. Remains 3598 /3598 variables (removed 0) and now considering 7521/7521 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 272 ms. Remains : 3598/3598 places, 7521/7521 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3598/3598 places, 7521/7521 transitions.
Applied a total of 0 rules in 279 ms. Remains 3598 /3598 variables (removed 0) and now considering 7521/7521 (removed 0) transitions.
[2023-03-22 05:15:00] [INFO ] Flow matrix only has 6443 transitions (discarded 1078 similar events)
[2023-03-22 05:15:00] [INFO ] Invariant cache hit.
[2023-03-22 05:15:03] [INFO ] Implicit Places using invariants in 2886 ms returned [38, 78, 115, 225, 338, 375, 483, 522, 560, 637, 707, 747, 857, 894, 964, 1001, 1077, 1186, 1297, 1336, 1410, 1599, 1711, 1746, 1782, 1816, 1889, 1965, 2039, 2111, 2114, 2148, 2187, 2225, 2260, 2263, 2298, 2301, 2335, 2342, 2376, 2455, 2458, 2493, 2532, 2568, 2602, 2674, 2717, 2789, 2792, 2826, 2866, 2871, 2905, 2941, 2975, 3011, 3045, 3120, 3160, 3195, 3234, 3308, 3312, 3346, 3382, 3416, 3419, 3455, 3493, 3529]
Discarding 72 places :
Implicit Place search using SMT only with invariants took 2892 ms to find 72 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 3526/3598 places, 7521/7521 transitions.
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 13 Pre rules applied. Total rules applied 0 place count 3526 transition count 7508
Deduced a syphon composed of 13 places in 1 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 0 with 26 rules applied. Total rules applied 26 place count 3513 transition count 7508
Discarding 1961 places :
Symmetric choice reduction at 0 with 1961 rule applications. Total rules 1987 place count 1552 transition count 5547
Iterating global reduction 0 with 1961 rules applied. Total rules applied 3948 place count 1552 transition count 5547
Discarding 38 places :
Symmetric choice reduction at 0 with 38 rule applications. Total rules 3986 place count 1514 transition count 5509
Iterating global reduction 0 with 38 rules applied. Total rules applied 4024 place count 1514 transition count 5509
Discarding 42 places :
Symmetric choice reduction at 0 with 42 rule applications. Total rules 4066 place count 1472 transition count 5467
Iterating global reduction 0 with 42 rules applied. Total rules applied 4108 place count 1472 transition count 5467
Performed 46 Post agglomeration using F-continuation condition.Transition count delta: 46
Deduced a syphon composed of 46 places in 1 ms
Reduce places removed 46 places and 0 transitions.
Iterating global reduction 0 with 92 rules applied. Total rules applied 4200 place count 1426 transition count 5421
Free-agglomeration rule (complex) applied 32 times.
Iterating global reduction 0 with 32 rules applied. Total rules applied 4232 place count 1426 transition count 5389
Reduce places removed 32 places and 0 transitions.
Iterating post reduction 0 with 32 rules applied. Total rules applied 4264 place count 1394 transition count 5389
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 4265 place count 1394 transition count 5389
Applied a total of 4265 rules in 878 ms. Remains 1394 /3526 variables (removed 2132) and now considering 5389/7521 (removed 2132) transitions.
[2023-03-22 05:15:04] [INFO ] Flow matrix only has 3115 transitions (discarded 2274 similar events)
// Phase 1: matrix 3115 rows 1394 cols
[2023-03-22 05:15:04] [INFO ] Computed 28 place invariants in 15 ms
[2023-03-22 05:15:05] [INFO ] Implicit Places using invariants in 900 ms returned []
[2023-03-22 05:15:05] [INFO ] Flow matrix only has 3115 transitions (discarded 2274 similar events)
[2023-03-22 05:15:05] [INFO ] Invariant cache hit.
[2023-03-22 05:15:15] [INFO ] Implicit Places using invariants and state equation in 10041 ms returned [41, 44, 47, 50, 90, 96, 107, 143, 146, 153, 189, 196, 201, 208, 211, 247, 249, 254, 297, 300, 303, 339, 342, 351, 354, 361, 398, 438, 441, 445, 450, 494, 501, 509, 548, 551, 592, 595, 634, 708, 793, 879, 937, 1195, 1236, 1282, 1364]
Discarding 47 places :
Drop transitions removed 148 transitions
Reduce isomorphic transitions removed 148 transitions.
Implicit Place search using SMT with State Equation took 10952 ms to find 47 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 1347/3598 places, 5241/7521 transitions.
Graph (complete) has 5009 edges and 1347 vertex of which 1199 are kept as prefixes of interest. Removing 148 places using SCC suffix rule.2 ms
Discarding 148 places :
Also discarding 0 output transitions
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 14 Pre rules applied. Total rules applied 1 place count 1199 transition count 5227
Deduced a syphon composed of 14 places in 1 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 0 with 28 rules applied. Total rules applied 29 place count 1185 transition count 5227
Discarding 719 places :
Symmetric choice reduction at 0 with 719 rule applications. Total rules 748 place count 466 transition count 4508
Iterating global reduction 0 with 719 rules applied. Total rules applied 1467 place count 466 transition count 4508
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 0 with 36 rules applied. Total rules applied 1503 place count 448 transition count 4490
Free-agglomeration rule (complex) applied 32 times.
Iterating global reduction 0 with 32 rules applied. Total rules applied 1535 place count 448 transition count 4458
Reduce places removed 32 places and 0 transitions.
Iterating post reduction 0 with 32 rules applied. Total rules applied 1567 place count 416 transition count 4458
Applied a total of 1567 rules in 224 ms. Remains 416 /1347 variables (removed 931) and now considering 4458/5241 (removed 783) transitions.
[2023-03-22 05:15:15] [INFO ] Flow matrix only has 2036 transitions (discarded 2422 similar events)
// Phase 1: matrix 2036 rows 416 cols
[2023-03-22 05:15:15] [INFO ] Computed 28 place invariants in 13 ms
[2023-03-22 05:15:15] [INFO ] Implicit Places using invariants in 344 ms returned []
[2023-03-22 05:15:15] [INFO ] Flow matrix only has 2036 transitions (discarded 2422 similar events)
[2023-03-22 05:15:15] [INFO ] Invariant cache hit.
[2023-03-22 05:15:16] [INFO ] Implicit Places using invariants and state equation in 871 ms returned []
Implicit Place search using SMT with State Equation took 1219 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 416/3598 places, 4458/7521 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 16446 ms. Remains : 416/3598 places, 4458/7521 transitions.
Incomplete random walk after 10000 steps, including 1210 resets, run finished after 1338 ms. (steps per millisecond=7 ) properties (out of 2) 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 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 136953 steps, run timeout after 3001 ms. (steps per millisecond=45 ) properties seen :{}
Probabilistic random walk after 136953 steps, saw 51072 distinct states, run finished after 3001 ms. (steps per millisecond=45 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-22 05:15:21] [INFO ] Flow matrix only has 2036 transitions (discarded 2422 similar events)
[2023-03-22 05:15:21] [INFO ] Invariant cache hit.
[2023-03-22 05:15:21] [INFO ] After 64ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-22 05:15:21] [INFO ] [Nat]Absence check using 0 positive and 28 generalized place invariants in 4 ms returned sat
[2023-03-22 05:15:21] [INFO ] After 497ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-22 05:15:22] [INFO ] After 779ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 208 ms.
[2023-03-22 05:15:22] [INFO ] After 1061ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 2 ms.
Support contains 124 out of 416 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 416/416 places, 4458/4458 transitions.
Applied a total of 0 rules in 70 ms. Remains 416 /416 variables (removed 0) and now considering 4458/4458 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 71 ms. Remains : 416/416 places, 4458/4458 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 416/416 places, 4458/4458 transitions.
Applied a total of 0 rules in 69 ms. Remains 416 /416 variables (removed 0) and now considering 4458/4458 (removed 0) transitions.
[2023-03-22 05:15:22] [INFO ] Flow matrix only has 2036 transitions (discarded 2422 similar events)
[2023-03-22 05:15:22] [INFO ] Invariant cache hit.
[2023-03-22 05:15:22] [INFO ] Implicit Places using invariants in 349 ms returned []
[2023-03-22 05:15:22] [INFO ] Flow matrix only has 2036 transitions (discarded 2422 similar events)
[2023-03-22 05:15:22] [INFO ] Invariant cache hit.
[2023-03-22 05:15:23] [INFO ] Implicit Places using invariants and state equation in 884 ms returned []
Implicit Place search using SMT with State Equation took 1236 ms to find 0 implicit places.
[2023-03-22 05:15:24] [INFO ] Redundant transitions in 423 ms returned []
[2023-03-22 05:15:24] [INFO ] Flow matrix only has 2036 transitions (discarded 2422 similar events)
[2023-03-22 05:15:24] [INFO ] Invariant cache hit.
[2023-03-22 05:15:25] [INFO ] Dead Transitions using invariants and state equation in 1131 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2864 ms. Remains : 416/416 places, 4458/4458 transitions.
Drop transitions removed 1259 transitions
Ensure Unique test removed 1196 transitions
Reduce isomorphic transitions removed 2455 transitions.
Iterating post reduction 0 with 2455 rules applied. Total rules applied 2455 place count 416 transition count 2003
Performed 26 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 26 Pre rules applied. Total rules applied 2455 place count 416 transition count 1977
Deduced a syphon composed of 26 places in 0 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 1 with 52 rules applied. Total rules applied 2507 place count 390 transition count 1977
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 2509 place count 388 transition count 1925
Iterating global reduction 1 with 2 rules applied. Total rules applied 2511 place count 388 transition count 1925
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 2515 place count 386 transition count 1923
Drop transitions removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 1 with 9 rules applied. Total rules applied 2524 place count 386 transition count 1914
Free-agglomeration rule (complex) applied 96 times.
Iterating global reduction 1 with 96 rules applied. Total rules applied 2620 place count 386 transition count 1818
Reduce places removed 96 places and 0 transitions.
Iterating post reduction 1 with 96 rules applied. Total rules applied 2716 place count 290 transition count 1818
Drop transitions removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 2 with 10 rules applied. Total rules applied 2726 place count 290 transition count 1808
Partial Free-agglomeration rule applied 444 times.
Drop transitions removed 444 transitions
Iterating global reduction 2 with 444 rules applied. Total rules applied 3170 place count 290 transition count 1808
Drop transitions removed 13 transitions
Redundant transition composition rules discarded 13 transitions
Iterating global reduction 2 with 13 rules applied. Total rules applied 3183 place count 290 transition count 1795
Applied a total of 3183 rules in 75 ms. Remains 290 /416 variables (removed 126) and now considering 1795/4458 (removed 2663) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 1795 rows 290 cols
[2023-03-22 05:15:25] [INFO ] Computed 28 place invariants in 8 ms
[2023-03-22 05:15:25] [INFO ] After 85ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-22 05:15:25] [INFO ] [Nat]Absence check using 0 positive and 28 generalized place invariants in 4 ms returned sat
[2023-03-22 05:15:26] [INFO ] After 576ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-22 05:15:26] [INFO ] After 911ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 314 ms.
[2023-03-22 05:15:26] [INFO ] After 1281ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
[2023-03-22 05:15:26] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 2 ms.
[2023-03-22 05:15:26] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 416 places, 4458 transitions and 21059 arcs took 26 ms.
[2023-03-22 05:15:27] [INFO ] Flatten gal took : 326 ms
Total runtime 143941 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT LeafsetExtension-PT-S64C3
BK_EXAMINATION: ReachabilityCardinality
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/370
ReachabilityCardinality

FORMULA LeafsetExtension-PT-S64C3-ReachabilityCardinality-08 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA LeafsetExtension-PT-S64C3-ReachabilityCardinality-04 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

BK_STOP 1679462129947

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /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/370/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/370/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/370/ReachabilityCardinality.xml
lola: Rule S: 0 transitions removed,0 places removed
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.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 # 10 (type EXCL) for 3 LeafsetExtension-PT-S64C3-ReachabilityCardinality-08
lola: time limit : 1799 sec
lola: memory limit: 32 pages
lola: LAUNCH task # 6 (type FNDP) for 3 LeafsetExtension-PT-S64C3-ReachabilityCardinality-08
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 7 (type EQUN) for 3 LeafsetExtension-PT-S64C3-ReachabilityCardinality-08
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 9 (type SRCH) for 3 LeafsetExtension-PT-S64C3-ReachabilityCardinality-08
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: FINISHED task # 6 (type FNDP) for LeafsetExtension-PT-S64C3-ReachabilityCardinality-08
lola: result : true
lola: fired transitions : 4
lola: tried executions : 1
lola: time used : 0.000000
lola: memory pages used : 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: CANCELED task # 7 (type EQUN) for LeafsetExtension-PT-S64C3-ReachabilityCardinality-08 (obsolete)
lola: CANCELED task # 9 (type SRCH) for LeafsetExtension-PT-S64C3-ReachabilityCardinality-08 (obsolete)
lola: CANCELED task # 10 (type EXCL) for LeafsetExtension-PT-S64C3-ReachabilityCardinality-08 (obsolete)
lola: FINISHED task # 9 (type SRCH) for LeafsetExtension-PT-S64C3-ReachabilityCardinality-08
lola: result : true
lola: markings : 6
lola: fired transitions : 5
lola: time used : 0.000000
lola: memory pages used : 1
sara: try reading problem file /home/mcc/execution/370/ReachabilityCardinality-7.sara.
sara: place or transition ordering is non-deterministic
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 # 16 (type EXCL) for 0 LeafsetExtension-PT-S64C3-ReachabilityCardinality-04
lola: time limit : 3599 sec
lola: memory limit: 32 pages
lola: LAUNCH task # 12 (type FNDP) for 0 LeafsetExtension-PT-S64C3-ReachabilityCardinality-04
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 13 (type EQUN) for 0 LeafsetExtension-PT-S64C3-ReachabilityCardinality-04
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 15 (type SRCH) for 0 LeafsetExtension-PT-S64C3-ReachabilityCardinality-04
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: FINISHED task # 12 (type FNDP) for LeafsetExtension-PT-S64C3-ReachabilityCardinality-04
lola:
result : true
lola: fired transitions : 20
lola: tried executions : 3
lola: time used : 0.000000
lola: memory pages used : 0
lola: CANCELED task # 13 (type EQUN) for LeafsetExtension-PT-S64C3-ReachabilityCardinality-04 (obsolete)
lola: CANCELED task # 15 (type SRCH) for LeafsetExtension-PT-S64C3-ReachabilityCardinality-04 (obsolete)
lola: CANCELED task # 16 (type EXCL) for LeafsetExtension-PT-S64C3-ReachabilityCardinality-04 (obsolete)
lola: Portfolio finished: no open formulas

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
LeafsetExtension-PT-S64C3-ReachabilityCardinality-04: EF true findpath
LeafsetExtension-PT-S64C3-ReachabilityCardinality-08: EF true findpath


Time elapsed: 1 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="LeafsetExtension-PT-S64C3"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="lolaxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool lolaxred"
echo " Input is LeafsetExtension-PT-S64C3, 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 r231-tall-167856416200534"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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