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.r523-tall-167987247800239.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 EisenbergMcGuire-PT-05, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r523-tall-167987247800239
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 968K
-rw-r--r-- 1 mcc users 9.1K Mar 23 15:20 CTLCardinality.txt
-rw-r--r-- 1 mcc users 97K Mar 23 15:20 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.0K Mar 23 15:19 CTLFireability.txt
-rw-r--r-- 1 mcc users 64K Mar 23 15:19 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 23 07:07 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Mar 23 07:07 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Mar 23 07:07 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 23 07:07 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Mar 26 22:42 NewModel
-rw-r--r-- 1 mcc users 14K Mar 23 15:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 136K Mar 23 15:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Mar 23 15:21 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 77K Mar 23 15:21 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Mar 23 07:07 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 23 07:07 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 26 22:42 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 26 22:42 instance
-rw-r--r-- 1 mcc users 6 Mar 26 22:42 iscolored
-rw-r--r-- 1 mcc users 460K Mar 31 16:48 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 EisenbergMcGuire-PT-05-ReachabilityFireability-00
FORMULA_NAME EisenbergMcGuire-PT-05-ReachabilityFireability-01
FORMULA_NAME EisenbergMcGuire-PT-05-ReachabilityFireability-02
FORMULA_NAME EisenbergMcGuire-PT-05-ReachabilityFireability-03
FORMULA_NAME EisenbergMcGuire-PT-05-ReachabilityFireability-04
FORMULA_NAME EisenbergMcGuire-PT-05-ReachabilityFireability-05
FORMULA_NAME EisenbergMcGuire-PT-05-ReachabilityFireability-06
FORMULA_NAME EisenbergMcGuire-PT-05-ReachabilityFireability-07
FORMULA_NAME EisenbergMcGuire-PT-05-ReachabilityFireability-08
FORMULA_NAME EisenbergMcGuire-PT-05-ReachabilityFireability-09
FORMULA_NAME EisenbergMcGuire-PT-05-ReachabilityFireability-10
FORMULA_NAME EisenbergMcGuire-PT-05-ReachabilityFireability-11
FORMULA_NAME EisenbergMcGuire-PT-05-ReachabilityFireability-12
FORMULA_NAME EisenbergMcGuire-PT-05-ReachabilityFireability-13
FORMULA_NAME EisenbergMcGuire-PT-05-ReachabilityFireability-14
FORMULA_NAME EisenbergMcGuire-PT-05-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1680811428983

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=EisenbergMcGuire-PT-05
Applying reductions before tool smart
Invoking reducer
Running Version 202304061127
[2023-04-06 20:03:50] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-04-06 20:03:50] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-04-06 20:03:50] [INFO ] Load time of PNML (sax parser for PT used): 92 ms
[2023-04-06 20:03:50] [INFO ] Transformed 295 places.
[2023-04-06 20:03:50] [INFO ] Transformed 800 transitions.
[2023-04-06 20:03:50] [INFO ] Found NUPN structural information;
[2023-04-06 20:03:50] [INFO ] Parsed PT model containing 295 places and 800 transitions and 3600 arcs in 222 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 12 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 2 resets, run finished after 357 ms. (steps per millisecond=28 ) properties (out of 16) seen :4
FORMULA EisenbergMcGuire-PT-05-ReachabilityFireability-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA EisenbergMcGuire-PT-05-ReachabilityFireability-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA EisenbergMcGuire-PT-05-ReachabilityFireability-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA EisenbergMcGuire-PT-05-ReachabilityFireability-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 89 ms. (steps per millisecond=112 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 12) seen :0
Running SMT prover for 12 properties.
[2023-04-06 20:03:52] [INFO ] Flow matrix only has 465 transitions (discarded 335 similar events)
// Phase 1: matrix 465 rows 295 cols
[2023-04-06 20:03:52] [INFO ] Computed 16 invariants in 16 ms
[2023-04-06 20:03:52] [INFO ] After 324ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:12
[2023-04-06 20:03:52] [INFO ] [Nat]Absence check using 11 positive place invariants in 80 ms returned sat
[2023-04-06 20:03:52] [INFO ] [Nat]Absence check using 11 positive and 5 generalized place invariants in 2 ms returned sat
[2023-04-06 20:03:53] [INFO ] After 451ms SMT Verify possible using state equation in natural domain returned unsat :3 sat :9
[2023-04-06 20:03:53] [INFO ] State equation strengthened by 196 read => feed constraints.
[2023-04-06 20:03:53] [INFO ] After 406ms SMT Verify possible using 196 Read/Feed constraints in natural domain returned unsat :3 sat :9
[2023-04-06 20:03:53] [INFO ] Deduced a trap composed of 66 places in 87 ms of which 4 ms to minimize.
[2023-04-06 20:03:53] [INFO ] Deduced a trap composed of 21 places in 96 ms of which 0 ms to minimize.
[2023-04-06 20:03:54] [INFO ] Deduced a trap composed of 3 places in 40 ms of which 1 ms to minimize.
[2023-04-06 20:03:54] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 2 ms to minimize.
[2023-04-06 20:03:54] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 347 ms
[2023-04-06 20:03:54] [INFO ] Deduced a trap composed of 77 places in 104 ms of which 1 ms to minimize.
[2023-04-06 20:03:54] [INFO ] Deduced a trap composed of 60 places in 101 ms of which 1 ms to minimize.
[2023-04-06 20:03:54] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 285 ms
[2023-04-06 20:03:54] [INFO ] Deduced a trap composed of 19 places in 102 ms of which 0 ms to minimize.
[2023-04-06 20:03:54] [INFO ] Deduced a trap composed of 27 places in 113 ms of which 0 ms to minimize.
[2023-04-06 20:03:54] [INFO ] Deduced a trap composed of 56 places in 114 ms of which 1 ms to minimize.
[2023-04-06 20:03:54] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 0 ms to minimize.
[2023-04-06 20:03:54] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 502 ms
[2023-04-06 20:03:55] [INFO ] Deduced a trap composed of 3 places in 38 ms of which 0 ms to minimize.
[2023-04-06 20:03:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 73 ms
[2023-04-06 20:03:55] [INFO ] Deduced a trap composed of 23 places in 122 ms of which 0 ms to minimize.
[2023-04-06 20:03:55] [INFO ] Deduced a trap composed of 37 places in 112 ms of which 1 ms to minimize.
[2023-04-06 20:03:55] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 326 ms
[2023-04-06 20:03:55] [INFO ] Deduced a trap composed of 22 places in 64 ms of which 1 ms to minimize.
[2023-04-06 20:03:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 104 ms
[2023-04-06 20:03:55] [INFO ] After 2488ms SMT Verify possible using trap constraints in natural domain returned unsat :3 sat :9
Attempting to minimize the solution found.
Minimization took 426 ms.
[2023-04-06 20:03:56] [INFO ] After 3649ms SMT Verify possible using all constraints in natural domain returned unsat :3 sat :9
FORMULA EisenbergMcGuire-PT-05-ReachabilityFireability-14 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA EisenbergMcGuire-PT-05-ReachabilityFireability-13 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA EisenbergMcGuire-PT-05-ReachabilityFireability-00 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 12 Parikh solutions to 9 different solutions.
Parikh walk visited 0 properties in 75 ms.
Support contains 108 out of 295 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 295/295 places, 800/800 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 295 transition count 799
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 294 transition count 799
Performed 43 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 43 Pre rules applied. Total rules applied 2 place count 294 transition count 756
Deduced a syphon composed of 43 places in 1 ms
Reduce places removed 43 places and 0 transitions.
Iterating global reduction 2 with 86 rules applied. Total rules applied 88 place count 251 transition count 756
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 95 place count 244 transition count 721
Iterating global reduction 2 with 7 rules applied. Total rules applied 102 place count 244 transition count 721
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 1 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 28 rules applied. Total rules applied 130 place count 230 transition count 707
Applied a total of 130 rules in 87 ms. Remains 230 /295 variables (removed 65) and now considering 707/800 (removed 93) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 88 ms. Remains : 230/295 places, 707/800 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 151 ms. (steps per millisecond=66 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 9) 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 9) 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 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 9) 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 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 9) seen :0
Interrupted probabilistic random walk after 502608 steps, run timeout after 3001 ms. (steps per millisecond=167 ) properties seen :{0=1, 1=1, 3=1, 6=1, 8=1}
Probabilistic random walk after 502608 steps, saw 188087 distinct states, run finished after 3002 ms. (steps per millisecond=167 ) properties seen :5
FORMULA EisenbergMcGuire-PT-05-ReachabilityFireability-15 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA EisenbergMcGuire-PT-05-ReachabilityFireability-11 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA EisenbergMcGuire-PT-05-ReachabilityFireability-06 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA EisenbergMcGuire-PT-05-ReachabilityFireability-04 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA EisenbergMcGuire-PT-05-ReachabilityFireability-01 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Running SMT prover for 4 properties.
[2023-04-06 20:03:59] [INFO ] Flow matrix only has 372 transitions (discarded 335 similar events)
// Phase 1: matrix 372 rows 230 cols
[2023-04-06 20:03:59] [INFO ] Computed 16 invariants in 8 ms
[2023-04-06 20:03:59] [INFO ] After 58ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-04-06 20:03:59] [INFO ] [Nat]Absence check using 11 positive place invariants in 7 ms returned sat
[2023-04-06 20:03:59] [INFO ] [Nat]Absence check using 11 positive and 5 generalized place invariants in 2 ms returned sat
[2023-04-06 20:04:00] [INFO ] After 210ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-04-06 20:04:00] [INFO ] State equation strengthened by 168 read => feed constraints.
[2023-04-06 20:04:00] [INFO ] After 174ms SMT Verify possible using 168 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-04-06 20:04:00] [INFO ] Deduced a trap composed of 3 places in 105 ms of which 1 ms to minimize.
[2023-04-06 20:04:00] [INFO ] Deduced a trap composed of 3 places in 82 ms of which 0 ms to minimize.
[2023-04-06 20:04:00] [INFO ] Deduced a trap composed of 20 places in 83 ms of which 0 ms to minimize.
[2023-04-06 20:04:00] [INFO ] Deduced a trap composed of 3 places in 88 ms of which 0 ms to minimize.
[2023-04-06 20:04:00] [INFO ] Deduced a trap composed of 57 places in 77 ms of which 0 ms to minimize.
[2023-04-06 20:04:00] [INFO ] Deduced a trap composed of 40 places in 63 ms of which 1 ms to minimize.
[2023-04-06 20:04:01] [INFO ] Deduced a trap composed of 11 places in 52 ms of which 0 ms to minimize.
[2023-04-06 20:04:01] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 684 ms
[2023-04-06 20:04:01] [INFO ] Deduced a trap composed of 3 places in 38 ms of which 0 ms to minimize.
[2023-04-06 20:04:01] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 70 ms
[2023-04-06 20:04:01] [INFO ] After 1124ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 172 ms.
[2023-04-06 20:04:01] [INFO ] After 1592ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 40 ms.
Support contains 78 out of 230 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 230/230 places, 707/707 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 230 transition count 706
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 229 transition count 706
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 2 place count 229 transition count 695
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 24 place count 218 transition count 695
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 30 place count 212 transition count 665
Iterating global reduction 2 with 6 rules applied. Total rules applied 36 place count 212 transition count 665
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 40 place count 210 transition count 663
Applied a total of 40 rules in 49 ms. Remains 210 /230 variables (removed 20) and now considering 663/707 (removed 44) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 49 ms. Remains : 210/230 places, 663/707 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 240 ms. (steps per millisecond=41 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 623316 steps, run timeout after 3001 ms. (steps per millisecond=207 ) properties seen :{3=1}
Probabilistic random walk after 623316 steps, saw 175209 distinct states, run finished after 3001 ms. (steps per millisecond=207 ) properties seen :1
FORMULA EisenbergMcGuire-PT-05-ReachabilityFireability-12 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Running SMT prover for 3 properties.
[2023-04-06 20:04:04] [INFO ] Flow matrix only has 328 transitions (discarded 335 similar events)
// Phase 1: matrix 328 rows 210 cols
[2023-04-06 20:04:04] [INFO ] Computed 16 invariants in 3 ms
[2023-04-06 20:04:05] [INFO ] After 46ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-04-06 20:04:05] [INFO ] [Nat]Absence check using 11 positive place invariants in 4 ms returned sat
[2023-04-06 20:04:05] [INFO ] [Nat]Absence check using 11 positive and 5 generalized place invariants in 2 ms returned sat
[2023-04-06 20:04:05] [INFO ] After 175ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-04-06 20:04:05] [INFO ] State equation strengthened by 144 read => feed constraints.
[2023-04-06 20:04:05] [INFO ] After 127ms SMT Verify possible using 144 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-04-06 20:04:05] [INFO ] Deduced a trap composed of 3 places in 92 ms of which 1 ms to minimize.
[2023-04-06 20:04:05] [INFO ] Deduced a trap composed of 42 places in 81 ms of which 0 ms to minimize.
[2023-04-06 20:04:05] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 222 ms
[2023-04-06 20:04:05] [INFO ] Deduced a trap composed of 3 places in 73 ms of which 1 ms to minimize.
[2023-04-06 20:04:05] [INFO ] Deduced a trap composed of 7 places in 51 ms of which 1 ms to minimize.
[2023-04-06 20:04:05] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 162 ms
[2023-04-06 20:04:05] [INFO ] After 639ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 131 ms.
[2023-04-06 20:04:06] [INFO ] After 1013ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 7 ms.
Support contains 62 out of 210 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 210/210 places, 663/663 transitions.
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 6 Pre rules applied. Total rules applied 0 place count 210 transition count 657
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 12 place count 204 transition count 657
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 14 place count 203 transition count 656
Applied a total of 14 rules in 31 ms. Remains 203 /210 variables (removed 7) and now considering 656/663 (removed 7) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 31 ms. Remains : 203/210 places, 656/663 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 98 ms. (steps per millisecond=102 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 722652 steps, run timeout after 3002 ms. (steps per millisecond=240 ) properties seen :{}
Probabilistic random walk after 722652 steps, saw 180756 distinct states, run finished after 3002 ms. (steps per millisecond=240 ) properties seen :0
Running SMT prover for 3 properties.
[2023-04-06 20:04:09] [INFO ] Flow matrix only has 321 transitions (discarded 335 similar events)
// Phase 1: matrix 321 rows 203 cols
[2023-04-06 20:04:09] [INFO ] Computed 16 invariants in 3 ms
[2023-04-06 20:04:09] [INFO ] After 48ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-04-06 20:04:09] [INFO ] [Nat]Absence check using 11 positive place invariants in 4 ms returned sat
[2023-04-06 20:04:09] [INFO ] [Nat]Absence check using 11 positive and 5 generalized place invariants in 2 ms returned sat
[2023-04-06 20:04:09] [INFO ] After 175ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-04-06 20:04:09] [INFO ] State equation strengthened by 144 read => feed constraints.
[2023-04-06 20:04:09] [INFO ] After 129ms SMT Verify possible using 144 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-04-06 20:04:09] [INFO ] Deduced a trap composed of 3 places in 78 ms of which 0 ms to minimize.
[2023-04-06 20:04:09] [INFO ] Deduced a trap composed of 57 places in 80 ms of which 0 ms to minimize.
[2023-04-06 20:04:09] [INFO ] Deduced a trap composed of 53 places in 70 ms of which 1 ms to minimize.
[2023-04-06 20:04:10] [INFO ] Deduced a trap composed of 35 places in 56 ms of which 1 ms to minimize.
[2023-04-06 20:04:10] [INFO ] Deduced a trap composed of 11 places in 61 ms of which 1 ms to minimize.
[2023-04-06 20:04:10] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 435 ms
[2023-04-06 20:04:10] [INFO ] Deduced a trap composed of 8 places in 103 ms of which 4 ms to minimize.
[2023-04-06 20:04:10] [INFO ] Deduced a trap composed of 4 places in 86 ms of which 0 ms to minimize.
[2023-04-06 20:04:10] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 228 ms
[2023-04-06 20:04:10] [INFO ] After 917ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 126 ms.
[2023-04-06 20:04:10] [INFO ] After 1288ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 8 ms.
Support contains 62 out of 203 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 203/203 places, 656/656 transitions.
Applied a total of 0 rules in 16 ms. Remains 203 /203 variables (removed 0) and now considering 656/656 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 203/203 places, 656/656 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 203/203 places, 656/656 transitions.
Applied a total of 0 rules in 11 ms. Remains 203 /203 variables (removed 0) and now considering 656/656 (removed 0) transitions.
[2023-04-06 20:04:10] [INFO ] Flow matrix only has 321 transitions (discarded 335 similar events)
[2023-04-06 20:04:10] [INFO ] Invariant cache hit.
[2023-04-06 20:04:10] [INFO ] Implicit Places using invariants in 98 ms returned []
[2023-04-06 20:04:10] [INFO ] Flow matrix only has 321 transitions (discarded 335 similar events)
[2023-04-06 20:04:10] [INFO ] Invariant cache hit.
[2023-04-06 20:04:10] [INFO ] State equation strengthened by 144 read => feed constraints.
[2023-04-06 20:04:11] [INFO ] Implicit Places using invariants and state equation in 322 ms returned []
Implicit Place search using SMT with State Equation took 423 ms to find 0 implicit places.
[2023-04-06 20:04:11] [INFO ] Redundant transitions in 39 ms returned []
[2023-04-06 20:04:11] [INFO ] Flow matrix only has 321 transitions (discarded 335 similar events)
[2023-04-06 20:04:11] [INFO ] Invariant cache hit.
[2023-04-06 20:04:11] [INFO ] Dead Transitions using invariants and state equation in 242 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 726 ms. Remains : 203/203 places, 656/656 transitions.
Graph (trivial) has 299 edges and 203 vertex of which 18 / 203 are part of one of the 5 SCC in 3 ms
Free SCC test removed 13 places
Drop transitions removed 44 transitions
Ensure Unique test removed 339 transitions
Reduce isomorphic transitions removed 383 transitions.
Drop transitions removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 0 with 15 rules applied. Total rules applied 16 place count 190 transition count 258
Reduce places removed 15 places and 0 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Iterating post reduction 1 with 22 rules applied. Total rules applied 38 place count 175 transition count 251
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 45 place count 168 transition count 251
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 45 place count 168 transition count 244
Deduced a syphon composed of 7 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 15 rules applied. Total rules applied 60 place count 160 transition count 244
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 61 place count 159 transition count 243
Iterating global reduction 3 with 1 rules applied. Total rules applied 62 place count 159 transition count 243
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
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 96 place count 142 transition count 226
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 98 place count 142 transition count 224
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -38
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 110 place count 136 transition count 262
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 4 with 9 rules applied. Total rules applied 119 place count 136 transition count 253
Drop transitions removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 5 with 19 rules applied. Total rules applied 138 place count 136 transition count 234
Free-agglomeration rule applied 11 times.
Iterating global reduction 5 with 11 rules applied. Total rules applied 149 place count 136 transition count 223
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 5 with 11 rules applied. Total rules applied 160 place count 125 transition count 223
Drop transitions removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 6 with 5 rules applied. Total rules applied 165 place count 125 transition count 218
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -1
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 167 place count 124 transition count 219
Partial Free-agglomeration rule applied 10 times.
Drop transitions removed 10 transitions
Iterating global reduction 6 with 10 rules applied. Total rules applied 177 place count 124 transition count 219
Applied a total of 177 rules in 48 ms. Remains 124 /203 variables (removed 79) and now considering 219/656 (removed 437) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 219 rows 124 cols
[2023-04-06 20:04:11] [INFO ] Computed 15 invariants in 1 ms
[2023-04-06 20:04:11] [INFO ] After 35ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-04-06 20:04:11] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2023-04-06 20:04:11] [INFO ] [Nat]Absence check using 11 positive and 4 generalized place invariants in 1 ms returned sat
[2023-04-06 20:04:11] [INFO ] After 148ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-04-06 20:04:11] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2023-04-06 20:04:11] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 49 ms
[2023-04-06 20:04:11] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2023-04-06 20:04:11] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 0 ms to minimize.
[2023-04-06 20:04:11] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 85 ms
[2023-04-06 20:04:11] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-04-06 20:04:11] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 53 ms
[2023-04-06 20:04:11] [INFO ] After 442ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 110 ms.
[2023-04-06 20:04:12] [INFO ] After 601ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
[2023-04-06 20:04:12] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 4 ms.
[2023-04-06 20:04:12] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 203 places, 656 transitions and 3182 arcs took 4 ms.
[2023-04-06 20:04:12] [INFO ] Flatten gal took : 71 ms
Total runtime 21654 ms.
There are residual formulas that ITS could not solve within timeout
======================================================
========== this is Smart for the MCC'2018 ============
======================================================
Running EisenbergMcGuire (PT), instance 05
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: 203 places, 656 transitions, 3182 arcs.
Final Score: 10993.962
Took : 31 seconds
Reachability Fireability file is: ReachabilityFireability.xml
READY TO PARSE. BS

BK_STOP 1680811484958

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

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

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