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.r235-tall-167856421900527.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 smartxred
Input is LeafsetExtension-PT-S64C2, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r235-tall-167856421900527
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 14M
-rw-r--r-- 1 mcc users 15K Feb 25 16:57 CTLCardinality.txt
-rw-r--r-- 1 mcc users 98K Feb 25 16:57 CTLCardinality.xml
-rw-r--r-- 1 mcc users 11K Feb 25 16:56 CTLFireability.txt
-rw-r--r-- 1 mcc users 60K Feb 25 16:56 CTLFireability.xml
-rw-r--r-- 1 mcc users 5.8K 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.7K Feb 25 16:21 LTLFireability.txt
-rw-r--r-- 1 mcc users 21K Feb 25 16:21 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.5K Feb 25 16:58 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 51K Feb 25 16:58 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 18K Feb 25 16:58 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 84K Feb 25 16:58 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-S64C2-ReachabilityFireability-00
FORMULA_NAME LeafsetExtension-PT-S64C2-ReachabilityFireability-01
FORMULA_NAME LeafsetExtension-PT-S64C2-ReachabilityFireability-02
FORMULA_NAME LeafsetExtension-PT-S64C2-ReachabilityFireability-03
FORMULA_NAME LeafsetExtension-PT-S64C2-ReachabilityFireability-04
FORMULA_NAME LeafsetExtension-PT-S64C2-ReachabilityFireability-05
FORMULA_NAME LeafsetExtension-PT-S64C2-ReachabilityFireability-06
FORMULA_NAME LeafsetExtension-PT-S64C2-ReachabilityFireability-07
FORMULA_NAME LeafsetExtension-PT-S64C2-ReachabilityFireability-08
FORMULA_NAME LeafsetExtension-PT-S64C2-ReachabilityFireability-09
FORMULA_NAME LeafsetExtension-PT-S64C2-ReachabilityFireability-10
FORMULA_NAME LeafsetExtension-PT-S64C2-ReachabilityFireability-11
FORMULA_NAME LeafsetExtension-PT-S64C2-ReachabilityFireability-12
FORMULA_NAME LeafsetExtension-PT-S64C2-ReachabilityFireability-13
FORMULA_NAME LeafsetExtension-PT-S64C2-ReachabilityFireability-14
FORMULA_NAME LeafsetExtension-PT-S64C2-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1678666916013

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=smartxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=LeafsetExtension-PT-S64C2
Applying reductions before tool smart
Invoking reducer
Running Version 202303021504
[2023-03-13 00:21:57] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-03-13 00:21:57] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-13 00:21:58] [INFO ] Load time of PNML (sax parser for PT used): 473 ms
[2023-03-13 00:21:58] [INFO ] Transformed 21462 places.
[2023-03-13 00:21:58] [INFO ] Transformed 21129 transitions.
[2023-03-13 00:21:58] [INFO ] Parsed PT model containing 21462 places and 21129 transitions and 67740 arcs in 669 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 17 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 551 resets, run finished after 746 ms. (steps per millisecond=13 ) properties (out of 16) seen :4
FORMULA LeafsetExtension-PT-S64C2-ReachabilityFireability-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LeafsetExtension-PT-S64C2-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LeafsetExtension-PT-S64C2-ReachabilityFireability-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LeafsetExtension-PT-S64C2-ReachabilityFireability-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 28 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 24 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 24 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 21 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 26 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 12) seen :1
FORMULA LeafsetExtension-PT-S64C2-ReachabilityFireability-07 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 26 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 28 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 11) seen :0
Running SMT prover for 11 properties.
// Phase 1: matrix 21129 rows 21462 cols
[2023-03-13 00:22:02] [INFO ] Computed 333 place invariants in 2563 ms
[2023-03-13 00:22:07] [INFO ] [Real]Absence check using 67 positive place invariants in 69 ms returned sat
[2023-03-13 00:22:08] [INFO ] [Real]Absence check using 67 positive and 266 generalized place invariants in 940 ms returned sat
[2023-03-13 00:22:27] [INFO ] After 17576ms SMT Verify possible using state equation in real domain returned unsat :3 sat :1 real:6
[2023-03-13 00:22:27] [INFO ] After 17657ms SMT Verify possible using trap constraints in real domain returned unsat :3 sat :1 real:6
Attempting to minimize the solution found.
Minimization took 7 ms.
[2023-03-13 00:22:27] [INFO ] After 25168ms SMT Verify possible using all constraints in real domain returned unsat :3 sat :1 real:6
[2023-03-13 00:22:31] [INFO ] [Nat]Absence check using 67 positive place invariants in 52 ms returned sat
[2023-03-13 00:22:32] [INFO ] [Nat]Absence check using 67 positive and 266 generalized place invariants in 960 ms returned sat
[2023-03-13 00:22:52] [INFO ] After 17648ms SMT Verify possible using state equation in natural domain returned unsat :5 sat :5
[2023-03-13 00:22:52] [INFO ] After 17649ms SMT Verify possible using trap constraints in natural domain returned unsat :5 sat :5
Attempting to minimize the solution found.
Minimization took 6 ms.
[2023-03-13 00:22:52] [INFO ] After 25050ms SMT Verify possible using all constraints in natural domain returned unsat :5 sat :5
FORMULA LeafsetExtension-PT-S64C2-ReachabilityFireability-14 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA LeafsetExtension-PT-S64C2-ReachabilityFireability-13 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA LeafsetExtension-PT-S64C2-ReachabilityFireability-08 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA LeafsetExtension-PT-S64C2-ReachabilityFireability-05 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA LeafsetExtension-PT-S64C2-ReachabilityFireability-04 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 11 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 156 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 10778 are kept as prefixes of interest. Removing 10684 places using SCC suffix rule.48 ms
Discarding 10684 places :
Also discarding 4980 output transitions
Drop transitions removed 4980 transitions
Drop transitions removed 1430 transitions
Reduce isomorphic transitions removed 1430 transitions.
Drop transitions removed 3631 transitions
Trivial Post-agglo rules discarded 3631 transitions
Performed 3631 trivial Post agglomeration. Transition count delta: 3631
Iterating post reduction 0 with 5061 rules applied. Total rules applied 5062 place count 10778 transition count 11088
Reduce places removed 3632 places and 0 transitions.
Drop transitions removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 1 with 3642 rules applied. Total rules applied 8704 place count 7146 transition count 11078
Reduce places removed 10 places and 0 transitions.
Performed 1094 Post agglomeration using F-continuation condition.Transition count delta: 1094
Iterating post reduction 2 with 1104 rules applied. Total rules applied 9808 place count 7136 transition count 9984
Reduce places removed 1094 places and 0 transitions.
Iterating post reduction 3 with 1094 rules applied. Total rules applied 10902 place count 6042 transition count 9984
Performed 77 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 77 Pre rules applied. Total rules applied 10902 place count 6042 transition count 9907
Deduced a syphon composed of 77 places in 4 ms
Reduce places removed 77 places and 0 transitions.
Iterating global reduction 4 with 154 rules applied. Total rules applied 11056 place count 5965 transition count 9907
Discarding 2628 places :
Symmetric choice reduction at 4 with 2628 rule applications. Total rules 13684 place count 3337 transition count 7279
Iterating global reduction 4 with 2628 rules applied. Total rules applied 16312 place count 3337 transition count 7279
Discarding 31 places :
Symmetric choice reduction at 4 with 31 rule applications. Total rules 16343 place count 3306 transition count 7248
Iterating global reduction 4 with 31 rules applied. Total rules applied 16374 place count 3306 transition count 7248
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 4 with 1 rules applied. Total rules applied 16375 place count 3305 transition count 7248
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 16377 place count 3304 transition count 7247
Free-agglomeration rule (complex) applied 13 times.
Iterating global reduction 5 with 13 rules applied. Total rules applied 16390 place count 3304 transition count 7234
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 5 with 13 rules applied. Total rules applied 16403 place count 3291 transition count 7234
Partial Free-agglomeration rule applied 239 times.
Drop transitions removed 239 transitions
Iterating global reduction 6 with 239 rules applied. Total rules applied 16642 place count 3291 transition count 7234
Applied a total of 16642 rules in 3745 ms. Remains 3291 /21462 variables (removed 18171) and now considering 7234/21129 (removed 13895) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3747 ms. Remains : 3291/21462 places, 7234/21129 transitions.
Incomplete random walk after 10000 steps, including 1045 resets, run finished after 262 ms. (steps per millisecond=38 ) properties (out of 6) seen :4
FORMULA LeafsetExtension-PT-S64C2-ReachabilityFireability-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LeafsetExtension-PT-S64C2-ReachabilityFireability-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LeafsetExtension-PT-S64C2-ReachabilityFireability-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LeafsetExtension-PT-S64C2-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 21 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 33 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-13 00:22:56] [INFO ] Flow matrix only has 5852 transitions (discarded 1382 similar events)
// Phase 1: matrix 5852 rows 3291 cols
[2023-03-13 00:22:56] [INFO ] Computed 116 place invariants in 93 ms
[2023-03-13 00:22:57] [INFO ] [Real]Absence check using 0 positive and 116 generalized place invariants in 42 ms returned sat
[2023-03-13 00:22:57] [INFO ] After 459ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-13 00:22:57] [INFO ] [Nat]Absence check using 0 positive and 116 generalized place invariants in 39 ms returned sat
[2023-03-13 00:23:00] [INFO ] After 2990ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-13 00:23:02] [INFO ] After 4360ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 1225 ms.
[2023-03-13 00:23:03] [INFO ] After 6051ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 8 ms.
Support contains 79 out of 3291 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3291/3291 places, 7234/7234 transitions.
Graph (complete) has 16546 edges and 3291 vertex of which 2961 are kept as prefixes of interest. Removing 330 places using SCC suffix rule.2 ms
Discarding 330 places :
Also discarding 37 output transitions
Drop transitions removed 37 transitions
Drop transitions removed 283 transitions
Reduce isomorphic transitions removed 283 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 291 rules applied. Total rules applied 292 place count 2961 transition count 6906
Reduce places removed 8 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 10 rules applied. Total rules applied 302 place count 2953 transition count 6904
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 304 place count 2951 transition count 6904
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 304 place count 2951 transition count 6898
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 316 place count 2945 transition count 6898
Discarding 57 places :
Symmetric choice reduction at 3 with 57 rule applications. Total rules 373 place count 2888 transition count 6841
Iterating global reduction 3 with 57 rules applied. Total rules applied 430 place count 2888 transition count 6841
Partial Free-agglomeration rule applied 71 times.
Drop transitions removed 71 transitions
Iterating global reduction 3 with 71 rules applied. Total rules applied 501 place count 2888 transition count 6841
Applied a total of 501 rules in 944 ms. Remains 2888 /3291 variables (removed 403) and now considering 6841/7234 (removed 393) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 945 ms. Remains : 2888/3291 places, 6841/7234 transitions.
Incomplete random walk after 10000 steps, including 1052 resets, run finished after 189 ms. (steps per millisecond=52 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 37 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 23388 steps, run timeout after 3001 ms. (steps per millisecond=7 ) properties seen :{}
Probabilistic random walk after 23388 steps, saw 10968 distinct states, run finished after 3002 ms. (steps per millisecond=7 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-13 00:23:07] [INFO ] Flow matrix only has 5132 transitions (discarded 1709 similar events)
// Phase 1: matrix 5132 rows 2888 cols
[2023-03-13 00:23:07] [INFO ] Computed 109 place invariants in 46 ms
[2023-03-13 00:23:08] [INFO ] [Real]Absence check using 0 positive and 109 generalized place invariants in 37 ms returned sat
[2023-03-13 00:23:08] [INFO ] After 475ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-13 00:23:08] [INFO ] [Nat]Absence check using 0 positive and 109 generalized place invariants in 36 ms returned sat
[2023-03-13 00:23:11] [INFO ] After 2441ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-13 00:23:12] [INFO ] After 3590ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 1052 ms.
[2023-03-13 00:23:13] [INFO ] After 5054ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 4 ms.
Support contains 79 out of 2888 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2888/2888 places, 6841/6841 transitions.
Applied a total of 0 rules in 291 ms. Remains 2888 /2888 variables (removed 0) and now considering 6841/6841 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 291 ms. Remains : 2888/2888 places, 6841/6841 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2888/2888 places, 6841/6841 transitions.
Applied a total of 0 rules in 301 ms. Remains 2888 /2888 variables (removed 0) and now considering 6841/6841 (removed 0) transitions.
[2023-03-13 00:23:13] [INFO ] Flow matrix only has 5132 transitions (discarded 1709 similar events)
[2023-03-13 00:23:13] [INFO ] Invariant cache hit.
[2023-03-13 00:23:16] [INFO ] Implicit Places using invariants in 2566 ms returned [8, 45, 85, 124, 199, 238, 275, 312, 388, 425, 462, 499, 649, 688, 725, 797, 837, 908, 950, 1022, 1060, 1098, 1135, 1172, 1209, 1247, 1286, 1324, 1362, 1400, 1437, 1439, 1476, 1510, 1513, 1547, 1550, 1584, 1587, 1621, 1624, 1658, 1697, 1700, 1734, 1739, 1773, 1850, 1854, 1888, 1891, 1925, 1928, 1963, 2004, 2007, 2041, 2044, 2078, 2081, 2115, 2118, 2152, 2155, 2192, 2226, 2231, 2265, 2268, 2302, 2307, 2341, 2413, 2416, 2453, 2487, 2492, 2526, 2563, 2602, 2639, 2673, 2712, 2715, 2749, 2786, 2821]
Discarding 87 places :
Implicit Place search using SMT only with invariants took 2580 ms to find 87 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 2801/2888 places, 6841/6841 transitions.
Discarding 1776 places :
Symmetric choice reduction at 0 with 1776 rule applications. Total rules 1776 place count 1025 transition count 5065
Iterating global reduction 0 with 1776 rules applied. Total rules applied 3552 place count 1025 transition count 5065
Discarding 57 places :
Symmetric choice reduction at 0 with 57 rule applications. Total rules 3609 place count 968 transition count 5008
Iterating global reduction 0 with 57 rules applied. Total rules applied 3666 place count 968 transition count 5008
Discarding 300 places :
Symmetric choice reduction at 0 with 300 rule applications. Total rules 3966 place count 668 transition count 4708
Iterating global reduction 0 with 300 rules applied. Total rules applied 4266 place count 668 transition count 4708
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 0 with 18 rules applied. Total rules applied 4284 place count 659 transition count 4699
Free-agglomeration rule (complex) applied 19 times.
Iterating global reduction 0 with 19 rules applied. Total rules applied 4303 place count 659 transition count 4680
Reduce places removed 19 places and 0 transitions.
Iterating post reduction 0 with 19 rules applied. Total rules applied 4322 place count 640 transition count 4680
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 4323 place count 640 transition count 4680
Applied a total of 4323 rules in 401 ms. Remains 640 /2801 variables (removed 2161) and now considering 4680/6841 (removed 2161) transitions.
[2023-03-13 00:23:16] [INFO ] Flow matrix only has 1161 transitions (discarded 3519 similar events)
// Phase 1: matrix 1161 rows 640 cols
[2023-03-13 00:23:16] [INFO ] Computed 22 place invariants in 3 ms
[2023-03-13 00:23:17] [INFO ] Implicit Places using invariants in 507 ms returned []
[2023-03-13 00:23:17] [INFO ] Flow matrix only has 1161 transitions (discarded 3519 similar events)
[2023-03-13 00:23:17] [INFO ] Invariant cache hit.
[2023-03-13 00:23:20] [INFO ] Implicit Places using invariants and state equation in 3013 ms returned [13, 18, 25, 31, 73, 76, 79, 82, 94, 97, 100, 103, 106, 158, 194, 196, 200, 203, 286, 292, 329, 331, 338, 341, 344, 352, 362, 368, 373, 376, 529, 631]
Discarding 32 places :
Implicit Place search using SMT with State Equation took 3536 ms to find 32 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 608/2888 places, 4680/6841 transitions.
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 3 Pre rules applied. Total rules applied 0 place count 608 transition count 4677
Deduced a syphon composed of 3 places in 2 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 605 transition count 4677
Discarding 267 places :
Symmetric choice reduction at 0 with 267 rule applications. Total rules 273 place count 338 transition count 4410
Iterating global reduction 0 with 267 rules applied. Total rules applied 540 place count 338 transition count 4410
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 0 with 26 rules applied. Total rules applied 566 place count 325 transition count 4397
Free-agglomeration rule (complex) applied 23 times.
Iterating global reduction 0 with 23 rules applied. Total rules applied 589 place count 325 transition count 4374
Reduce places removed 23 places and 0 transitions.
Iterating post reduction 0 with 23 rules applied. Total rules applied 612 place count 302 transition count 4374
Applied a total of 612 rules in 189 ms. Remains 302 /608 variables (removed 306) and now considering 4374/4680 (removed 306) transitions.
[2023-03-13 00:23:20] [INFO ] Flow matrix only has 837 transitions (discarded 3537 similar events)
// Phase 1: matrix 837 rows 302 cols
[2023-03-13 00:23:20] [INFO ] Computed 22 place invariants in 10 ms
[2023-03-13 00:23:20] [INFO ] Implicit Places using invariants in 399 ms returned []
[2023-03-13 00:23:20] [INFO ] Flow matrix only has 837 transitions (discarded 3537 similar events)
[2023-03-13 00:23:20] [INFO ] Invariant cache hit.
[2023-03-13 00:23:21] [INFO ] Implicit Places using invariants and state equation in 1022 ms returned []
Implicit Place search using SMT with State Equation took 1423 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 302/2888 places, 4374/6841 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 8432 ms. Remains : 302/2888 places, 4374/6841 transitions.
Incomplete random walk after 10000 steps, including 1548 resets, run finished after 320 ms. (steps per millisecond=31 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 73454 steps, run timeout after 3001 ms. (steps per millisecond=24 ) properties seen :{}
Probabilistic random walk after 73454 steps, saw 22350 distinct states, run finished after 3002 ms. (steps per millisecond=24 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-13 00:23:25] [INFO ] Flow matrix only has 837 transitions (discarded 3537 similar events)
[2023-03-13 00:23:25] [INFO ] Invariant cache hit.
[2023-03-13 00:23:25] [INFO ] [Real]Absence check using 0 positive and 22 generalized place invariants in 4 ms returned sat
[2023-03-13 00:23:25] [INFO ] After 59ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-13 00:23:25] [INFO ] [Nat]Absence check using 0 positive and 22 generalized place invariants in 4 ms returned sat
[2023-03-13 00:23:25] [INFO ] After 343ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-13 00:23:26] [INFO ] After 609ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 233 ms.
[2023-03-13 00:23:26] [INFO ] After 917ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 6 ms.
Support contains 79 out of 302 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 302/302 places, 4374/4374 transitions.
Applied a total of 0 rules in 64 ms. Remains 302 /302 variables (removed 0) and now considering 4374/4374 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 64 ms. Remains : 302/302 places, 4374/4374 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 302/302 places, 4374/4374 transitions.
Applied a total of 0 rules in 61 ms. Remains 302 /302 variables (removed 0) and now considering 4374/4374 (removed 0) transitions.
[2023-03-13 00:23:26] [INFO ] Flow matrix only has 837 transitions (discarded 3537 similar events)
[2023-03-13 00:23:26] [INFO ] Invariant cache hit.
[2023-03-13 00:23:26] [INFO ] Implicit Places using invariants in 335 ms returned []
[2023-03-13 00:23:26] [INFO ] Flow matrix only has 837 transitions (discarded 3537 similar events)
[2023-03-13 00:23:26] [INFO ] Invariant cache hit.
[2023-03-13 00:23:27] [INFO ] Implicit Places using invariants and state equation in 928 ms returned []
Implicit Place search using SMT with State Equation took 1265 ms to find 0 implicit places.
[2023-03-13 00:23:28] [INFO ] Redundant transitions in 327 ms returned []
[2023-03-13 00:23:28] [INFO ] Flow matrix only has 837 transitions (discarded 3537 similar events)
[2023-03-13 00:23:28] [INFO ] Invariant cache hit.
[2023-03-13 00:23:29] [INFO ] Dead Transitions using invariants and state equation in 1097 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2759 ms. Remains : 302/302 places, 4374/4374 transitions.
Drop transitions removed 1296 transitions
Ensure Unique test removed 2265 transitions
Reduce isomorphic transitions removed 3561 transitions.
Iterating post reduction 0 with 3561 rules applied. Total rules applied 3561 place count 302 transition count 813
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 6 Pre rules applied. Total rules applied 3561 place count 302 transition count 807
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 1 with 12 rules applied. Total rules applied 3573 place count 296 transition count 807
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 3595 place count 274 transition count 613
Iterating global reduction 1 with 22 rules applied. Total rules applied 3617 place count 274 transition count 613
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 1 with 8 rules applied. Total rules applied 3625 place count 270 transition count 609
Free-agglomeration rule applied 62 times.
Iterating global reduction 1 with 62 rules applied. Total rules applied 3687 place count 270 transition count 547
Reduce places removed 62 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 69 rules applied. Total rules applied 3756 place count 208 transition count 540
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 3758 place count 208 transition count 538
Free-agglomeration rule (complex) applied 15 times.
Iterating global reduction 2 with 15 rules applied. Total rules applied 3773 place count 208 transition count 523
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 2 with 15 rules applied. Total rules applied 3788 place count 193 transition count 523
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 3790 place count 191 transition count 521
Iterating global reduction 3 with 2 rules applied. Total rules applied 3792 place count 191 transition count 521
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 3794 place count 189 transition count 501
Iterating global reduction 3 with 2 rules applied. Total rules applied 3796 place count 189 transition count 501
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 3798 place count 189 transition count 499
Partial Free-agglomeration rule applied 62 times.
Drop transitions removed 62 transitions
Iterating global reduction 3 with 62 rules applied. Total rules applied 3860 place count 189 transition count 499
Applied a total of 3860 rules in 40 ms. Remains 189 /302 variables (removed 113) and now considering 499/4374 (removed 3875) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 499 rows 189 cols
[2023-03-13 00:23:29] [INFO ] Computed 22 place invariants in 10 ms
[2023-03-13 00:23:29] [INFO ] [Real]Absence check using 0 positive and 22 generalized place invariants in 19 ms returned sat
[2023-03-13 00:23:29] [INFO ] After 172ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-13 00:23:29] [INFO ] [Nat]Absence check using 0 positive and 22 generalized place invariants in 3 ms returned sat
[2023-03-13 00:23:29] [INFO ] After 190ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-13 00:23:29] [INFO ] After 326ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 98 ms.
[2023-03-13 00:23:29] [INFO ] After 494ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
[2023-03-13 00:23:29] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 4 ms.
[2023-03-13 00:23:29] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 302 places, 4374 transitions and 18784 arcs took 19 ms.
[2023-03-13 00:23:30] [INFO ] Flatten gal took : 297 ms
Total runtime 93080 ms.
There are residual formulas that ITS could not solve within timeout
======================================================
========== this is Smart for the MCC'2018 ============
======================================================
Running LeafsetExtension (PT), instance S64C2
Examination ReachabilityFireability
Parser /home/mcc/BenchKit/bin//../reducer/bin//../../smart/bin//parser/Fireability.jar
Model checker /home/mcc/BenchKit/bin//../reducer/bin//../../smart/bin//rem_exec//smart

GOT IT HERE. BS
Petri model created: 302 places, 4374 transitions, 18784 arcs.
Final Score: 34450.487
Took : 76 seconds
Reachability Fireability file is: ReachabilityFireability.xml
READY TO PARSE. BS

BK_STOP 1678667088302

--------------------
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 ReachabilityFireability -timeout 360 -rebuildPNML
ERROR in file model.sm near line 23533:
syntax error

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-S64C2"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="smartxred"
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 smartxred"
echo " Input is LeafsetExtension-PT-S64C2, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r235-tall-167856421900527"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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