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.r107-tall-167814484700775.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 DLCround-PT-12b, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r107-tall-167814484700775
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.3M
-rw-r--r-- 1 mcc users 5.9K Feb 25 18:19 CTLCardinality.txt
-rw-r--r-- 1 mcc users 60K Feb 25 18:19 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.6K Feb 25 18:19 CTLFireability.txt
-rw-r--r-- 1 mcc users 77K Feb 25 18:19 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.0K Feb 25 15:53 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Feb 25 15:53 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 15:53 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 15:53 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.6K Feb 25 18:20 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 85K Feb 25 18:20 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Feb 25 18:20 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 42K Feb 25 18:20 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 15:53 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 15:53 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 1.9M 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 DLCround-PT-12b-ReachabilityFireability-00
FORMULA_NAME DLCround-PT-12b-ReachabilityFireability-01
FORMULA_NAME DLCround-PT-12b-ReachabilityFireability-02
FORMULA_NAME DLCround-PT-12b-ReachabilityFireability-03
FORMULA_NAME DLCround-PT-12b-ReachabilityFireability-04
FORMULA_NAME DLCround-PT-12b-ReachabilityFireability-05
FORMULA_NAME DLCround-PT-12b-ReachabilityFireability-06
FORMULA_NAME DLCround-PT-12b-ReachabilityFireability-07
FORMULA_NAME DLCround-PT-12b-ReachabilityFireability-08
FORMULA_NAME DLCround-PT-12b-ReachabilityFireability-09
FORMULA_NAME DLCround-PT-12b-ReachabilityFireability-10
FORMULA_NAME DLCround-PT-12b-ReachabilityFireability-11
FORMULA_NAME DLCround-PT-12b-ReachabilityFireability-12
FORMULA_NAME DLCround-PT-12b-ReachabilityFireability-13
FORMULA_NAME DLCround-PT-12b-ReachabilityFireability-14
FORMULA_NAME DLCround-PT-12b-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1678425963272

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=DLCround-PT-12b
Applying reductions before tool smart
Invoking reducer
Running Version 202303021504
[2023-03-10 05:26:04] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-03-10 05:26:04] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-10 05:26:05] [INFO ] Load time of PNML (sax parser for PT used): 327 ms
[2023-03-10 05:26:05] [INFO ] Transformed 4848 places.
[2023-03-10 05:26:05] [INFO ] Transformed 7836 transitions.
[2023-03-10 05:26:05] [INFO ] Found NUPN structural information;
[2023-03-10 05:26:05] [INFO ] Parsed PT model containing 4848 places and 7836 transitions and 22188 arcs in 621 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 11 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 2 resets, run finished after 499 ms. (steps per millisecond=20 ) properties (out of 16) seen :6
FORMULA DLCround-PT-12b-ReachabilityFireability-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-12b-ReachabilityFireability-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-12b-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-12b-ReachabilityFireability-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-12b-ReachabilityFireability-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-12b-ReachabilityFireability-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 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 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 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 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 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 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 10) seen :0
Running SMT prover for 10 properties.
// Phase 1: matrix 7836 rows 4848 cols
[2023-03-10 05:26:06] [INFO ] Computed 277 place invariants in 57 ms
[2023-03-10 05:26:08] [INFO ] [Real]Absence check using 277 positive place invariants in 333 ms returned sat
[2023-03-10 05:26:08] [INFO ] After 2200ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:10
[2023-03-10 05:26:10] [INFO ] [Nat]Absence check using 277 positive place invariants in 280 ms returned sat
[2023-03-10 05:26:16] [INFO ] After 5657ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :9
[2023-03-10 05:26:18] [INFO ] Deduced a trap composed of 188 places in 1185 ms of which 9 ms to minimize.
[2023-03-10 05:26:19] [INFO ] Deduced a trap composed of 302 places in 974 ms of which 7 ms to minimize.
[2023-03-10 05:26:19] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 2931 ms
[2023-03-10 05:26:24] [INFO ] After 13321ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :9
Attempting to minimize the solution found.
Minimization took 2254 ms.
[2023-03-10 05:26:26] [INFO ] After 17829ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :9
FORMULA DLCround-PT-12b-ReachabilityFireability-14 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 10 Parikh solutions to 9 different solutions.
FORMULA DLCround-PT-12b-ReachabilityFireability-15 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA DLCround-PT-12b-ReachabilityFireability-04 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA DLCround-PT-12b-ReachabilityFireability-02 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA DLCround-PT-12b-ReachabilityFireability-07 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 4 properties in 1005 ms.
Support contains 110 out of 4848 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4848/4848 places, 7836/7836 transitions.
Graph (trivial) has 4228 edges and 4848 vertex of which 660 / 4848 are part of one of the 55 SCC in 15 ms
Free SCC test removed 605 places
Drop transitions removed 681 transitions
Reduce isomorphic transitions removed 681 transitions.
Drop transitions removed 1698 transitions
Trivial Post-agglo rules discarded 1698 transitions
Performed 1698 trivial Post agglomeration. Transition count delta: 1698
Iterating post reduction 0 with 1698 rules applied. Total rules applied 1699 place count 4243 transition count 5457
Reduce places removed 1698 places and 0 transitions.
Ensure Unique test removed 37 transitions
Reduce isomorphic transitions removed 37 transitions.
Drop transitions removed 30 transitions
Trivial Post-agglo rules discarded 30 transitions
Performed 30 trivial Post agglomeration. Transition count delta: 30
Iterating post reduction 1 with 1765 rules applied. Total rules applied 3464 place count 2545 transition count 5390
Reduce places removed 30 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 2 with 34 rules applied. Total rules applied 3498 place count 2515 transition count 5386
Reduce places removed 2 places and 0 transitions.
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Iterating post reduction 3 with 27 rules applied. Total rules applied 3525 place count 2513 transition count 5361
Reduce places removed 25 places and 0 transitions.
Iterating post reduction 4 with 25 rules applied. Total rules applied 3550 place count 2488 transition count 5361
Performed 46 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 46 Pre rules applied. Total rules applied 3550 place count 2488 transition count 5315
Deduced a syphon composed of 46 places in 38 ms
Reduce places removed 46 places and 0 transitions.
Iterating global reduction 5 with 92 rules applied. Total rules applied 3642 place count 2442 transition count 5315
Discarding 650 places :
Symmetric choice reduction at 5 with 650 rule applications. Total rules 4292 place count 1792 transition count 4665
Iterating global reduction 5 with 650 rules applied. Total rules applied 4942 place count 1792 transition count 4665
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 5 with 12 rules applied. Total rules applied 4954 place count 1792 transition count 4653
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 4957 place count 1790 transition count 4652
Performed 274 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 274 Pre rules applied. Total rules applied 4957 place count 1790 transition count 4378
Deduced a syphon composed of 274 places in 28 ms
Reduce places removed 274 places and 0 transitions.
Iterating global reduction 7 with 548 rules applied. Total rules applied 5505 place count 1516 transition count 4378
Discarding 64 places :
Symmetric choice reduction at 7 with 64 rule applications. Total rules 5569 place count 1452 transition count 3423
Iterating global reduction 7 with 64 rules applied. Total rules applied 5633 place count 1452 transition count 3423
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 7 with 13 rules applied. Total rules applied 5646 place count 1452 transition count 3410
Performed 376 Post agglomeration using F-continuation condition with reduction of 8 identical transitions.
Deduced a syphon composed of 376 places in 2 ms
Reduce places removed 376 places and 0 transitions.
Iterating global reduction 8 with 752 rules applied. Total rules applied 6398 place count 1076 transition count 3026
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 8 with 9 rules applied. Total rules applied 6407 place count 1076 transition count 3017
Renaming transitions due to excessive name length > 1024 char.
Discarding 5 places :
Symmetric choice reduction at 9 with 5 rule applications. Total rules 6412 place count 1071 transition count 2937
Iterating global reduction 9 with 5 rules applied. Total rules applied 6417 place count 1071 transition count 2937
Performed 32 Post agglomeration using F-continuation condition.Transition count delta: -256
Deduced a syphon composed of 32 places in 1 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 9 with 64 rules applied. Total rules applied 6481 place count 1039 transition count 3193
Drop transitions removed 31 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 35 transitions.
Iterating post reduction 9 with 35 rules applied. Total rules applied 6516 place count 1039 transition count 3158
Discarding 4 places :
Symmetric choice reduction at 10 with 4 rule applications. Total rules 6520 place count 1035 transition count 3045
Iterating global reduction 10 with 4 rules applied. Total rules applied 6524 place count 1035 transition count 3045
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 10 with 3 rules applied. Total rules applied 6527 place count 1035 transition count 3042
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -37
Deduced a syphon composed of 3 places in 2 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 11 with 6 rules applied. Total rules applied 6533 place count 1032 transition count 3079
Drop transitions removed 62 transitions
Redundant transition composition rules discarded 62 transitions
Iterating global reduction 11 with 62 rules applied. Total rules applied 6595 place count 1032 transition count 3017
Discarding 8 places :
Symmetric choice reduction at 11 with 8 rule applications. Total rules 6603 place count 1024 transition count 3009
Iterating global reduction 11 with 8 rules applied. Total rules applied 6611 place count 1024 transition count 3009
Discarding 8 places :
Symmetric choice reduction at 11 with 8 rule applications. Total rules 6619 place count 1016 transition count 2880
Iterating global reduction 11 with 8 rules applied. Total rules applied 6627 place count 1016 transition count 2880
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 11 with 8 rules applied. Total rules applied 6635 place count 1016 transition count 2872
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 12 with 22 rules applied. Total rules applied 6657 place count 1005 transition count 2861
Discarding 9 places :
Symmetric choice reduction at 12 with 9 rule applications. Total rules 6666 place count 996 transition count 2713
Iterating global reduction 12 with 9 rules applied. Total rules applied 6675 place count 996 transition count 2713
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 12 with 8 rules applied. Total rules applied 6683 place count 996 transition count 2705
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -11
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 13 with 2 rules applied. Total rules applied 6685 place count 995 transition count 2716
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 13 with 1 rules applied. Total rules applied 6686 place count 995 transition count 2715
Free-agglomeration rule applied 490 times with reduction of 155 identical transitions.
Iterating global reduction 13 with 490 rules applied. Total rules applied 7176 place count 995 transition count 2070
Reduce places removed 490 places and 0 transitions.
Drop transitions removed 466 transitions
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 476 transitions.
Graph (complete) has 1865 edges and 505 vertex of which 502 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.2 ms
Discarding 3 places :
Also discarding 0 output transitions
Iterating post reduction 13 with 967 rules applied. Total rules applied 8143 place count 502 transition count 1594
Discarding 32 places :
Symmetric choice reduction at 14 with 32 rule applications. Total rules 8175 place count 470 transition count 1497
Iterating global reduction 14 with 32 rules applied. Total rules applied 8207 place count 470 transition count 1497
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: -101
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 14 with 16 rules applied. Total rules applied 8223 place count 462 transition count 1598
Drop transitions removed 99 transitions
Reduce isomorphic transitions removed 99 transitions.
Iterating post reduction 14 with 99 rules applied. Total rules applied 8322 place count 462 transition count 1499
Discarding 1 places :
Symmetric choice reduction at 15 with 1 rule applications. Total rules 8323 place count 461 transition count 1483
Iterating global reduction 15 with 1 rules applied. Total rules applied 8324 place count 461 transition count 1483
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 15 with 1 rules applied. Total rules applied 8325 place count 461 transition count 1482
Drop transitions removed 39 transitions
Redundant transition composition rules discarded 39 transitions
Iterating global reduction 16 with 39 rules applied. Total rules applied 8364 place count 461 transition count 1443
Free-agglomeration rule applied 1 times.
Iterating global reduction 16 with 1 rules applied. Total rules applied 8365 place count 461 transition count 1442
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 12 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 16 with 15 rules applied. Total rules applied 8380 place count 460 transition count 1428
Partial Free-agglomeration rule applied 7 times.
Drop transitions removed 7 transitions
Iterating global reduction 17 with 7 rules applied. Total rules applied 8387 place count 460 transition count 1428
Applied a total of 8387 rules in 1927 ms. Remains 460 /4848 variables (removed 4388) and now considering 1428/7836 (removed 6408) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1929 ms. Remains : 460/4848 places, 1428/7836 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 244 ms. (steps per millisecond=40 ) properties (out of 5) seen :3
FORMULA DLCround-PT-12b-ReachabilityFireability-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-12b-ReachabilityFireability-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-12b-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-10 05:26:30] [INFO ] Flow matrix only has 598 transitions (discarded 830 similar events)
// Phase 1: matrix 598 rows 460 cols
[2023-03-10 05:26:30] [INFO ] Computed 242 place invariants in 5 ms
[2023-03-10 05:26:30] [INFO ] After 122ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-10 05:26:30] [INFO ] [Nat]Absence check using 242 positive place invariants in 37 ms returned sat
[2023-03-10 05:26:30] [INFO ] After 264ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-10 05:26:30] [INFO ] State equation strengthened by 137 read => feed constraints.
[2023-03-10 05:26:30] [INFO ] After 106ms SMT Verify possible using 137 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-10 05:26:30] [INFO ] After 221ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 65 ms.
[2023-03-10 05:26:30] [INFO ] After 677ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 8 ms.
Support contains 28 out of 460 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 460/460 places, 1428/1428 transitions.
Graph (trivial) has 181 edges and 460 vertex of which 17 / 460 are part of one of the 7 SCC in 0 ms
Free SCC test removed 10 places
Drop transitions removed 17 transitions
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 20 transitions.
Graph (complete) has 1611 edges and 450 vertex of which 441 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.1 ms
Discarding 9 places :
Also discarding 11 output transitions
Drop transitions removed 11 transitions
Drop transitions removed 27 transitions
Reduce isomorphic transitions removed 27 transitions.
Drop transitions removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 0 with 40 rules applied. Total rules applied 42 place count 441 transition count 1357
Reduce places removed 13 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 14 rules applied. Total rules applied 56 place count 428 transition count 1356
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 57 place count 427 transition count 1356
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 17 Pre rules applied. Total rules applied 57 place count 427 transition count 1339
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 3 with 34 rules applied. Total rules applied 91 place count 410 transition count 1339
Discarding 19 places :
Symmetric choice reduction at 3 with 19 rule applications. Total rules 110 place count 391 transition count 1236
Iterating global reduction 3 with 19 rules applied. Total rules applied 129 place count 391 transition count 1236
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 131 place count 391 transition count 1234
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Deduced a syphon composed of 21 places in 1 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 4 with 42 rules applied. Total rules applied 173 place count 370 transition count 1213
Drop transitions removed 108 transitions
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 114 transitions.
Graph (complete) has 1284 edges and 370 vertex of which 360 are kept as prefixes of interest. Removing 10 places using SCC suffix rule.2 ms
Discarding 10 places :
Also discarding 9 output transitions
Drop transitions removed 9 transitions
Iterating post reduction 4 with 115 rules applied. Total rules applied 288 place count 360 transition count 1090
Drop transitions removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 5 with 12 rules applied. Total rules applied 300 place count 360 transition count 1078
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 300 place count 360 transition count 1077
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 302 place count 359 transition count 1077
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 306 place count 359 transition count 1073
Discarding 38 places :
Symmetric choice reduction at 7 with 38 rule applications. Total rules 344 place count 321 transition count 937
Iterating global reduction 7 with 38 rules applied. Total rules applied 382 place count 321 transition count 937
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 7 with 4 rules applied. Total rules applied 386 place count 321 transition count 933
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -47
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 8 with 12 rules applied. Total rules applied 398 place count 315 transition count 980
Drop transitions removed 42 transitions
Reduce isomorphic transitions removed 42 transitions.
Iterating post reduction 8 with 42 rules applied. Total rules applied 440 place count 315 transition count 938
Discarding 3 places :
Symmetric choice reduction at 9 with 3 rule applications. Total rules 443 place count 312 transition count 889
Iterating global reduction 9 with 3 rules applied. Total rules applied 446 place count 312 transition count 889
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 9 with 3 rules applied. Total rules applied 449 place count 312 transition count 886
Drop transitions removed 41 transitions
Redundant transition composition rules discarded 41 transitions
Iterating global reduction 10 with 41 rules applied. Total rules applied 490 place count 312 transition count 845
Discarding 3 places :
Symmetric choice reduction at 10 with 3 rule applications. Total rules 493 place count 309 transition count 809
Iterating global reduction 10 with 3 rules applied. Total rules applied 496 place count 309 transition count 809
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 10 with 3 rules applied. Total rules applied 499 place count 309 transition count 806
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -22
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 11 with 4 rules applied. Total rules applied 503 place count 307 transition count 828
Drop transitions removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 11 with 7 rules applied. Total rules applied 510 place count 307 transition count 821
Drop transitions removed 16 transitions
Redundant transition composition rules discarded 16 transitions
Iterating global reduction 12 with 16 rules applied. Total rules applied 526 place count 307 transition count 805
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 12 with 2 rules applied. Total rules applied 528 place count 306 transition count 807
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 12 with 4 rules applied. Total rules applied 532 place count 306 transition count 803
Free-agglomeration rule applied 37 times with reduction of 10 identical transitions.
Iterating global reduction 12 with 37 rules applied. Total rules applied 569 place count 306 transition count 756
Reduce places removed 37 places and 0 transitions.
Drop transitions removed 168 transitions
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 171 transitions.
Graph (complete) has 780 edges and 269 vertex of which 252 are kept as prefixes of interest. Removing 17 places using SCC suffix rule.0 ms
Discarding 17 places :
Also discarding 6 output transitions
Drop transitions removed 6 transitions
Iterating post reduction 12 with 209 rules applied. Total rules applied 778 place count 252 transition count 579
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 13 with 6 rules applied. Total rules applied 784 place count 252 transition count 573
Discarding 59 places :
Symmetric choice reduction at 14 with 59 rule applications. Total rules 843 place count 193 transition count 466
Iterating global reduction 14 with 59 rules applied. Total rules applied 902 place count 193 transition count 466
Drop transitions removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 14 with 12 rules applied. Total rules applied 914 place count 193 transition count 454
Free-agglomeration rule applied 1 times.
Iterating global reduction 14 with 1 rules applied. Total rules applied 915 place count 193 transition count 453
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 8 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 14 with 10 rules applied. Total rules applied 925 place count 192 transition count 444
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 15 with 3 rules applied. Total rules applied 928 place count 192 transition count 444
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 15 with 3 rules applied. Total rules applied 931 place count 192 transition count 441
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 15 with 6 rules applied. Total rules applied 937 place count 189 transition count 438
Applied a total of 937 rules in 224 ms. Remains 189 /460 variables (removed 271) and now considering 438/1428 (removed 990) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 225 ms. Remains : 189/460 places, 438/1428 transitions.
Finished random walk after 6738 steps, including 2 resets, run visited all 2 properties in 36 ms. (steps per millisecond=187 )
FORMULA DLCround-PT-12b-ReachabilityFireability-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-12b-ReachabilityFireability-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 26409 ms.
======================================================
========== this is Smart for the MCC'2018 ============
======================================================
Running DLCround (PT), instance 12b
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: 4848 places, 7836 transitions, 22188 arcs.
Final Score: 3099012.489
Took : 55 seconds
Reachability Fireability file is: ReachabilityFireability.xml
READY TO PARSE. BS
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393232 kB
MemFree: 15194756 kB
After kill :
MemTotal: 16393232 kB
MemFree: 16100788 kB

BK_TIME_CONFINEMENT_REACHED

--------------------
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
Caught signal 15, terminating.

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="DLCround-PT-12b"
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 DLCround-PT-12b, 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 r107-tall-167814484700775"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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