fond
Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r235-tall-167856421900543
Last Updated
May 14, 2023

About the Execution of Smart+red for LeafsetExtension-PT-S64C4

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
1310.224 183729.00 219262.00 634.50 T?TFTT??TF??FTT? normal

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-167856421900543.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-S64C4, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r235-tall-167856421900543
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 14M
-rw-r--r-- 1 mcc users 15K Feb 25 16:55 CTLCardinality.txt
-rw-r--r-- 1 mcc users 97K Feb 25 16:55 CTLCardinality.xml
-rw-r--r-- 1 mcc users 9.2K Feb 25 16:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K Feb 25 16:54 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.3K Feb 25 16:21 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Feb 25 16:21 LTLFireability.xml
-rw-r--r-- 1 mcc users 29K Feb 25 16:56 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 183K Feb 25 16:56 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 15K Feb 25 16:55 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 65K Feb 25 16:55 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.3K 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-S64C4-ReachabilityFireability-00
FORMULA_NAME LeafsetExtension-PT-S64C4-ReachabilityFireability-01
FORMULA_NAME LeafsetExtension-PT-S64C4-ReachabilityFireability-02
FORMULA_NAME LeafsetExtension-PT-S64C4-ReachabilityFireability-03
FORMULA_NAME LeafsetExtension-PT-S64C4-ReachabilityFireability-04
FORMULA_NAME LeafsetExtension-PT-S64C4-ReachabilityFireability-05
FORMULA_NAME LeafsetExtension-PT-S64C4-ReachabilityFireability-06
FORMULA_NAME LeafsetExtension-PT-S64C4-ReachabilityFireability-07
FORMULA_NAME LeafsetExtension-PT-S64C4-ReachabilityFireability-08
FORMULA_NAME LeafsetExtension-PT-S64C4-ReachabilityFireability-09
FORMULA_NAME LeafsetExtension-PT-S64C4-ReachabilityFireability-10
FORMULA_NAME LeafsetExtension-PT-S64C4-ReachabilityFireability-11
FORMULA_NAME LeafsetExtension-PT-S64C4-ReachabilityFireability-12
FORMULA_NAME LeafsetExtension-PT-S64C4-ReachabilityFireability-13
FORMULA_NAME LeafsetExtension-PT-S64C4-ReachabilityFireability-14
FORMULA_NAME LeafsetExtension-PT-S64C4-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1678668009931

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-S64C4
Applying reductions before tool smart
Invoking reducer
Running Version 202303021504
[2023-03-13 00:40:11] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-03-13 00:40:11] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-13 00:40:12] [INFO ] Load time of PNML (sax parser for PT used): 706 ms
[2023-03-13 00:40:12] [INFO ] Transformed 21462 places.
[2023-03-13 00:40:12] [INFO ] Transformed 21129 transitions.
[2023-03-13 00:40:12] [INFO ] Parsed PT model containing 21462 places and 21129 transitions and 67740 arcs in 885 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 16 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 301 resets, run finished after 600 ms. (steps per millisecond=16 ) properties (out of 16) seen :5
FORMULA LeafsetExtension-PT-S64C4-ReachabilityFireability-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LeafsetExtension-PT-S64C4-ReachabilityFireability-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LeafsetExtension-PT-S64C4-ReachabilityFireability-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LeafsetExtension-PT-S64C4-ReachabilityFireability-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LeafsetExtension-PT-S64C4-ReachabilityFireability-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 7 resets, run finished after 122 ms. (steps per millisecond=81 ) properties (out of 11) seen :1
FORMULA LeafsetExtension-PT-S64C4-ReachabilityFireability-04 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 10) seen :1
FORMULA LeafsetExtension-PT-S64C4-ReachabilityFireability-14 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 9) seen :0
Running SMT prover for 9 properties.
// Phase 1: matrix 21129 rows 21462 cols
[2023-03-13 00:40:16] [INFO ] Computed 333 place invariants in 2757 ms
[2023-03-13 00:40:21] [INFO ] [Real]Absence check using 67 positive place invariants in 67 ms returned sat
[2023-03-13 00:40:22] [INFO ] [Real]Absence check using 67 positive and 266 generalized place invariants in 967 ms returned sat
[2023-03-13 00:40:41] [INFO ] After 17908ms SMT Verify possible using state equation in real domain returned unsat :0 sat :0 real:8
[2023-03-13 00:40:41] [INFO ] After 17940ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:8
[2023-03-13 00:40:41] [INFO ] After 25110ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2023-03-13 00:40:46] [INFO ] [Nat]Absence check using 67 positive place invariants in 57 ms returned sat
[2023-03-13 00:40:47] [INFO ] [Nat]Absence check using 67 positive and 266 generalized place invariants in 1031 ms returned sat
[2023-03-13 00:41:06] [INFO ] After 16039ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-13 00:41:06] [INFO ] After 16091ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 7 ms.
[2023-03-13 00:41:06] [INFO ] After 25083ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Fused 9 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 213 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 11083 are kept as prefixes of interest. Removing 10379 places using SCC suffix rule.42 ms
Discarding 10379 places :
Also discarding 4924 output transitions
Drop transitions removed 4924 transitions
Drop transitions removed 1182 transitions
Reduce isomorphic transitions removed 1182 transitions.
Drop transitions removed 3311 transitions
Trivial Post-agglo rules discarded 3311 transitions
Performed 3311 trivial Post agglomeration. Transition count delta: 3311
Iterating post reduction 0 with 4493 rules applied. Total rules applied 4494 place count 11083 transition count 11712
Reduce places removed 3312 places and 0 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 3318 rules applied. Total rules applied 7812 place count 7771 transition count 11706
Reduce places removed 6 places and 0 transitions.
Performed 1391 Post agglomeration using F-continuation condition.Transition count delta: 1391
Iterating post reduction 2 with 1397 rules applied. Total rules applied 9209 place count 7765 transition count 10315
Reduce places removed 1391 places and 0 transitions.
Iterating post reduction 3 with 1391 rules applied. Total rules applied 10600 place count 6374 transition count 10315
Performed 73 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 73 Pre rules applied. Total rules applied 10600 place count 6374 transition count 10242
Deduced a syphon composed of 73 places in 4 ms
Reduce places removed 73 places and 0 transitions.
Iterating global reduction 4 with 146 rules applied. Total rules applied 10746 place count 6301 transition count 10242
Discarding 2851 places :
Symmetric choice reduction at 4 with 2851 rule applications. Total rules 13597 place count 3450 transition count 7391
Iterating global reduction 4 with 2851 rules applied. Total rules applied 16448 place count 3450 transition count 7391
Discarding 61 places :
Symmetric choice reduction at 4 with 61 rule applications. Total rules 16509 place count 3389 transition count 7330
Iterating global reduction 4 with 61 rules applied. Total rules applied 16570 place count 3389 transition count 7330
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 4 with 1 rules applied. Total rules applied 16571 place count 3388 transition count 7330
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 16573 place count 3387 transition count 7329
Free-agglomeration rule (complex) applied 17 times.
Iterating global reduction 5 with 17 rules applied. Total rules applied 16590 place count 3387 transition count 7312
Reduce places removed 17 places and 0 transitions.
Iterating post reduction 5 with 17 rules applied. Total rules applied 16607 place count 3370 transition count 7312
Partial Free-agglomeration rule applied 211 times.
Drop transitions removed 211 transitions
Iterating global reduction 6 with 211 rules applied. Total rules applied 16818 place count 3370 transition count 7312
Applied a total of 16818 rules in 3654 ms. Remains 3370 /21462 variables (removed 18092) and now considering 7312/21129 (removed 13817) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3658 ms. Remains : 3370/21462 places, 7312/21129 transitions.
Incomplete random walk after 10000 steps, including 550 resets, run finished after 560 ms. (steps per millisecond=17 ) properties (out of 9) seen :3
FORMULA LeafsetExtension-PT-S64C4-ReachabilityFireability-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LeafsetExtension-PT-S64C4-ReachabilityFireability-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LeafsetExtension-PT-S64C4-ReachabilityFireability-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 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 7 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 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 11 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
[2023-03-13 00:41:11] [INFO ] Flow matrix only has 5961 transitions (discarded 1351 similar events)
// Phase 1: matrix 5961 rows 3370 cols
[2023-03-13 00:41:11] [INFO ] Computed 124 place invariants in 90 ms
[2023-03-13 00:41:12] [INFO ] [Real]Absence check using 0 positive and 124 generalized place invariants in 48 ms returned sat
[2023-03-13 00:41:12] [INFO ] After 858ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-13 00:41:12] [INFO ] [Nat]Absence check using 0 positive and 124 generalized place invariants in 45 ms returned sat
[2023-03-13 00:41:17] [INFO ] After 4784ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-13 00:41:22] [INFO ] After 8876ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 3132 ms.
[2023-03-13 00:41:25] [INFO ] After 12914ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Parikh walk visited 0 properties in 29 ms.
Support contains 161 out of 3370 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3370/3370 places, 7312/7312 transitions.
Graph (complete) has 17093 edges and 3370 vertex of which 3236 are kept as prefixes of interest. Removing 134 places using SCC suffix rule.2 ms
Discarding 134 places :
Also discarding 17 output transitions
Drop transitions removed 17 transitions
Drop transitions removed 113 transitions
Reduce isomorphic transitions removed 113 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 119 rules applied. Total rules applied 120 place count 3236 transition count 7176
Reduce places removed 6 places and 0 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Iterating post reduction 1 with 13 rules applied. Total rules applied 133 place count 3230 transition count 7169
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 140 place count 3223 transition count 7169
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 140 place count 3223 transition count 7162
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 154 place count 3216 transition count 7162
Discarding 35 places :
Symmetric choice reduction at 3 with 35 rule applications. Total rules 189 place count 3181 transition count 7127
Iterating global reduction 3 with 35 rules applied. Total rules applied 224 place count 3181 transition count 7127
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 226 place count 3181 transition count 7125
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 228 place count 3179 transition count 7125
Partial Free-agglomeration rule applied 56 times.
Drop transitions removed 56 transitions
Iterating global reduction 4 with 56 rules applied. Total rules applied 284 place count 3179 transition count 7125
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 286 place count 3177 transition count 7123
Iterating global reduction 4 with 2 rules applied. Total rules applied 288 place count 3177 transition count 7123
Applied a total of 288 rules in 1606 ms. Remains 3177 /3370 variables (removed 193) and now considering 7123/7312 (removed 189) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1609 ms. Remains : 3177/3370 places, 7123/7312 transitions.
Incomplete random walk after 10000 steps, including 585 resets, run finished after 370 ms. (steps per millisecond=27 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 25911 steps, run timeout after 3001 ms. (steps per millisecond=8 ) properties seen :{}
Probabilistic random walk after 25911 steps, saw 11904 distinct states, run finished after 3002 ms. (steps per millisecond=8 ) properties seen :0
Running SMT prover for 6 properties.
[2023-03-13 00:41:30] [INFO ] Flow matrix only has 5636 transitions (discarded 1487 similar events)
// Phase 1: matrix 5636 rows 3177 cols
[2023-03-13 00:41:30] [INFO ] Computed 115 place invariants in 53 ms
[2023-03-13 00:41:31] [INFO ] [Real]Absence check using 0 positive and 115 generalized place invariants in 37 ms returned sat
[2023-03-13 00:41:31] [INFO ] After 770ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-13 00:41:31] [INFO ] [Nat]Absence check using 0 positive and 115 generalized place invariants in 39 ms returned sat
[2023-03-13 00:41:35] [INFO ] After 3853ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-13 00:41:38] [INFO ] After 6835ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 2869 ms.
[2023-03-13 00:41:41] [INFO ] After 10525ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Parikh walk visited 0 properties in 13 ms.
Support contains 161 out of 3177 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3177/3177 places, 7123/7123 transitions.
Applied a total of 0 rules in 322 ms. Remains 3177 /3177 variables (removed 0) and now considering 7123/7123 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 322 ms. Remains : 3177/3177 places, 7123/7123 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3177/3177 places, 7123/7123 transitions.
Applied a total of 0 rules in 294 ms. Remains 3177 /3177 variables (removed 0) and now considering 7123/7123 (removed 0) transitions.
[2023-03-13 00:41:42] [INFO ] Flow matrix only has 5636 transitions (discarded 1487 similar events)
[2023-03-13 00:41:42] [INFO ] Invariant cache hit.
[2023-03-13 00:41:44] [INFO ] Implicit Places using invariants in 2517 ms returned [3, 43, 46, 84, 198, 242, 276, 316, 353, 387, 390, 459, 462, 531, 534, 568, 610, 644, 688, 722, 764, 834, 837, 871, 874, 908, 984, 987, 1026, 1060, 1063, 1097, 1172, 1250, 1253, 1287, 1290, 1327, 1361, 1364, 1434, 1476, 1478, 1515, 1553, 1664, 1741, 1778, 1857, 1895, 2016, 2128, 2207, 2279, 2352, 2389, 2426, 2543, 2581, 2655, 2770, 2842, 2879, 2955, 3071]
Discarding 65 places :
Implicit Place search using SMT only with invariants took 2528 ms to find 65 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 3112/3177 places, 7123/7123 transitions.
Discarding 1240 places :
Symmetric choice reduction at 0 with 1240 rule applications. Total rules 1240 place count 1872 transition count 5883
Iterating global reduction 0 with 1240 rules applied. Total rules applied 2480 place count 1872 transition count 5883
Discarding 43 places :
Symmetric choice reduction at 0 with 43 rule applications. Total rules 2523 place count 1829 transition count 5840
Iterating global reduction 0 with 43 rules applied. Total rules applied 2566 place count 1829 transition count 5840
Discarding 549 places :
Symmetric choice reduction at 0 with 549 rule applications. Total rules 3115 place count 1280 transition count 5291
Iterating global reduction 0 with 549 rules applied. Total rules applied 3664 place count 1280 transition count 5291
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 1 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 0 with 60 rules applied. Total rules applied 3724 place count 1250 transition count 5261
Free-agglomeration rule (complex) applied 11 times.
Iterating global reduction 0 with 11 rules applied. Total rules applied 3735 place count 1250 transition count 5250
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 0 with 11 rules applied. Total rules applied 3746 place count 1239 transition count 5250
Applied a total of 3746 rules in 511 ms. Remains 1239 /3112 variables (removed 1873) and now considering 5250/7123 (removed 1873) transitions.
[2023-03-13 00:41:45] [INFO ] Flow matrix only has 2418 transitions (discarded 2832 similar events)
// Phase 1: matrix 2418 rows 1239 cols
[2023-03-13 00:41:45] [INFO ] Computed 50 place invariants in 20 ms
[2023-03-13 00:41:46] [INFO ] Implicit Places using invariants in 614 ms returned []
[2023-03-13 00:41:46] [INFO ] Flow matrix only has 2418 transitions (discarded 2832 similar events)
[2023-03-13 00:41:46] [INFO ] Invariant cache hit.
[2023-03-13 00:41:51] [INFO ] Implicit Places using invariants and state equation in 4939 ms returned [154, 190, 556, 592, 594, 613, 656, 660, 686, 697, 716, 739, 745, 797, 799, 825, 861, 863, 902, 905, 909, 912, 952, 997, 1003, 1060, 1096, 1098, 1101, 1143, 1148, 1203, 1216]
Discarding 33 places :
Implicit Place search using SMT with State Equation took 5561 ms to find 33 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 1206/3177 places, 5250/7123 transitions.
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 7 Pre rules applied. Total rules applied 0 place count 1206 transition count 5243
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 0 with 14 rules applied. Total rules applied 14 place count 1199 transition count 5243
Discarding 433 places :
Symmetric choice reduction at 0 with 433 rule applications. Total rules 447 place count 766 transition count 4810
Iterating global reduction 0 with 433 rules applied. Total rules applied 880 place count 766 transition count 4810
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 906 place count 753 transition count 4797
Free-agglomeration rule (complex) applied 14 times.
Iterating global reduction 0 with 14 rules applied. Total rules applied 920 place count 753 transition count 4783
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 0 with 14 rules applied. Total rules applied 934 place count 739 transition count 4783
Applied a total of 934 rules in 203 ms. Remains 739 /1206 variables (removed 467) and now considering 4783/5250 (removed 467) transitions.
[2023-03-13 00:41:51] [INFO ] Flow matrix only has 1906 transitions (discarded 2877 similar events)
// Phase 1: matrix 1906 rows 739 cols
[2023-03-13 00:41:51] [INFO ] Computed 50 place invariants in 14 ms
[2023-03-13 00:41:51] [INFO ] Implicit Places using invariants in 441 ms returned []
[2023-03-13 00:41:51] [INFO ] Flow matrix only has 1906 transitions (discarded 2877 similar events)
[2023-03-13 00:41:51] [INFO ] Invariant cache hit.
[2023-03-13 00:41:54] [INFO ] Implicit Places using invariants and state equation in 2779 ms returned []
Implicit Place search using SMT with State Equation took 3225 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 739/3177 places, 4783/7123 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 12332 ms. Remains : 739/3177 places, 4783/7123 transitions.
Incomplete random walk after 10000 steps, including 853 resets, run finished after 548 ms. (steps per millisecond=18 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 76296 steps, run timeout after 3001 ms. (steps per millisecond=25 ) properties seen :{}
Probabilistic random walk after 76296 steps, saw 20379 distinct states, run finished after 3002 ms. (steps per millisecond=25 ) properties seen :0
Running SMT prover for 6 properties.
[2023-03-13 00:41:58] [INFO ] Flow matrix only has 1906 transitions (discarded 2877 similar events)
[2023-03-13 00:41:58] [INFO ] Invariant cache hit.
[2023-03-13 00:41:58] [INFO ] [Real]Absence check using 0 positive and 50 generalized place invariants in 12 ms returned sat
[2023-03-13 00:41:58] [INFO ] After 217ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-13 00:41:58] [INFO ] [Nat]Absence check using 0 positive and 50 generalized place invariants in 12 ms returned sat
[2023-03-13 00:42:00] [INFO ] After 1330ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-13 00:42:01] [INFO ] After 2612ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 999 ms.
[2023-03-13 00:42:02] [INFO ] After 3850ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Parikh walk visited 0 properties in 8 ms.
Support contains 161 out of 739 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 739/739 places, 4783/4783 transitions.
Applied a total of 0 rules in 63 ms. Remains 739 /739 variables (removed 0) and now considering 4783/4783 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 63 ms. Remains : 739/739 places, 4783/4783 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 739/739 places, 4783/4783 transitions.
Applied a total of 0 rules in 59 ms. Remains 739 /739 variables (removed 0) and now considering 4783/4783 (removed 0) transitions.
[2023-03-13 00:42:02] [INFO ] Flow matrix only has 1906 transitions (discarded 2877 similar events)
[2023-03-13 00:42:02] [INFO ] Invariant cache hit.
[2023-03-13 00:42:02] [INFO ] Implicit Places using invariants in 451 ms returned []
[2023-03-13 00:42:02] [INFO ] Flow matrix only has 1906 transitions (discarded 2877 similar events)
[2023-03-13 00:42:02] [INFO ] Invariant cache hit.
[2023-03-13 00:42:05] [INFO ] Implicit Places using invariants and state equation in 2842 ms returned []
Implicit Place search using SMT with State Equation took 3298 ms to find 0 implicit places.
[2023-03-13 00:42:06] [INFO ] Redundant transitions in 380 ms returned []
[2023-03-13 00:42:06] [INFO ] Flow matrix only has 1906 transitions (discarded 2877 similar events)
[2023-03-13 00:42:06] [INFO ] Invariant cache hit.
[2023-03-13 00:42:07] [INFO ] Dead Transitions using invariants and state equation in 1454 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5201 ms. Remains : 739/739 places, 4783/4783 transitions.
Drop transitions removed 993 transitions
Ensure Unique test removed 1905 transitions
Reduce isomorphic transitions removed 2898 transitions.
Iterating post reduction 0 with 2898 rules applied. Total rules applied 2898 place count 739 transition count 1885
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 19 Pre rules applied. Total rules applied 2898 place count 739 transition count 1866
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 1 with 38 rules applied. Total rules applied 2936 place count 720 transition count 1866
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 2939 place count 717 transition count 1800
Iterating global reduction 1 with 3 rules applied. Total rules applied 2942 place count 717 transition count 1800
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 1 with 22 rules applied. Total rules applied 2964 place count 706 transition count 1789
Free-agglomeration rule applied 213 times.
Iterating global reduction 1 with 213 rules applied. Total rules applied 3177 place count 706 transition count 1576
Reduce places removed 213 places and 0 transitions.
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 1 with 224 rules applied. Total rules applied 3401 place count 493 transition count 1565
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 3403 place count 493 transition count 1563
Free-agglomeration rule (complex) applied 13 times.
Iterating global reduction 2 with 13 rules applied. Total rules applied 3416 place count 493 transition count 1550
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 2 with 13 rules applied. Total rules applied 3429 place count 480 transition count 1550
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 3431 place count 478 transition count 1548
Iterating global reduction 3 with 2 rules applied. Total rules applied 3433 place count 478 transition count 1548
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 3435 place count 478 transition count 1546
Partial Free-agglomeration rule applied 113 times.
Drop transitions removed 113 transitions
Iterating global reduction 3 with 113 rules applied. Total rules applied 3548 place count 478 transition count 1546
Applied a total of 3548 rules in 133 ms. Remains 478 /739 variables (removed 261) and now considering 1546/4783 (removed 3237) transitions.
Running SMT prover for 6 properties.
// Phase 1: matrix 1546 rows 478 cols
[2023-03-13 00:42:07] [INFO ] Computed 50 place invariants in 12 ms
[2023-03-13 00:42:07] [INFO ] [Real]Absence check using 0 positive and 50 generalized place invariants in 8 ms returned sat
[2023-03-13 00:42:07] [INFO ] After 187ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-13 00:42:08] [INFO ] [Nat]Absence check using 0 positive and 50 generalized place invariants in 9 ms returned sat
[2023-03-13 00:42:08] [INFO ] After 786ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-13 00:42:09] [INFO ] After 1464ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 545 ms.
[2023-03-13 00:42:10] [INFO ] After 2149ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
[2023-03-13 00:42:10] [INFO ] Export to MCC of 6 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 3 ms.
[2023-03-13 00:42:10] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 739 places, 4783 transitions and 19696 arcs took 22 ms.
[2023-03-13 00:42:10] [INFO ] Flatten gal took : 315 ms
Total runtime 119265 ms.
There are residual formulas that ITS could not solve within timeout
======================================================
========== this is Smart for the MCC'2018 ============
======================================================
Running LeafsetExtension (PT), instance S64C4
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: 739 places, 4783 transitions, 19696 arcs.
Final Score: 195154.966
Took : 61 seconds
Reachability Fireability file is: ReachabilityFireability.xml
READY TO PARSE. BS

BK_STOP 1678668193660

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityFireability -timeout 360 -rebuildPNML
ERROR in file model.sm near line 25291:
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-S64C4"
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-S64C4, 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-167856421900543"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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