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-167987247800254.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-07, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r523-tall-167987247800254
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.6M
-rw-r--r-- 1 mcc users 6.5K Mar 23 15:23 CTLCardinality.txt
-rw-r--r-- 1 mcc users 64K Mar 23 15:23 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.3K Mar 23 15:21 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K Mar 23 15:21 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K Mar 23 07:07 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Mar 23 07:07 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.0K Mar 23 07:07 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 23 07:07 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Mar 26 22:42 NewModel
-rw-r--r-- 1 mcc users 17K Mar 23 15:24 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 176K Mar 23 15:24 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.9K Mar 23 15:23 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 55K Mar 23 15:23 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K 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 1.2M 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-07-ReachabilityCardinality-00
FORMULA_NAME EisenbergMcGuire-PT-07-ReachabilityCardinality-01
FORMULA_NAME EisenbergMcGuire-PT-07-ReachabilityCardinality-02
FORMULA_NAME EisenbergMcGuire-PT-07-ReachabilityCardinality-03
FORMULA_NAME EisenbergMcGuire-PT-07-ReachabilityCardinality-04
FORMULA_NAME EisenbergMcGuire-PT-07-ReachabilityCardinality-05
FORMULA_NAME EisenbergMcGuire-PT-07-ReachabilityCardinality-06
FORMULA_NAME EisenbergMcGuire-PT-07-ReachabilityCardinality-07
FORMULA_NAME EisenbergMcGuire-PT-07-ReachabilityCardinality-08
FORMULA_NAME EisenbergMcGuire-PT-07-ReachabilityCardinality-09
FORMULA_NAME EisenbergMcGuire-PT-07-ReachabilityCardinality-10
FORMULA_NAME EisenbergMcGuire-PT-07-ReachabilityCardinality-11
FORMULA_NAME EisenbergMcGuire-PT-07-ReachabilityCardinality-12
FORMULA_NAME EisenbergMcGuire-PT-07-ReachabilityCardinality-13
FORMULA_NAME EisenbergMcGuire-PT-07-ReachabilityCardinality-14
FORMULA_NAME EisenbergMcGuire-PT-07-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1680811722446

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=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=EisenbergMcGuire-PT-07
Applying reductions before tool smart
Invoking reducer
Running Version 202304061127
[2023-04-06 20:08:44] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-04-06 20:08:44] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-04-06 20:08:44] [INFO ] Load time of PNML (sax parser for PT used): 125 ms
[2023-04-06 20:08:44] [INFO ] Transformed 553 places.
[2023-04-06 20:08:44] [INFO ] Transformed 1960 transitions.
[2023-04-06 20:08:44] [INFO ] Found NUPN structural information;
[2023-04-06 20:08:44] [INFO ] Parsed PT model containing 553 places and 1960 transitions and 9212 arcs in 209 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 16 ms.
Working with output stream class java.io.PrintStream
FORMULA EisenbergMcGuire-PT-07-ReachabilityCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA EisenbergMcGuire-PT-07-ReachabilityCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA EisenbergMcGuire-PT-07-ReachabilityCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 2 resets, run finished after 503 ms. (steps per millisecond=19 ) properties (out of 13) seen :7
FORMULA EisenbergMcGuire-PT-07-ReachabilityCardinality-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA EisenbergMcGuire-PT-07-ReachabilityCardinality-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA EisenbergMcGuire-PT-07-ReachabilityCardinality-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA EisenbergMcGuire-PT-07-ReachabilityCardinality-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA EisenbergMcGuire-PT-07-ReachabilityCardinality-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA EisenbergMcGuire-PT-07-ReachabilityCardinality-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA EisenbergMcGuire-PT-07-ReachabilityCardinality-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 6) 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 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
[2023-04-06 20:08:45] [INFO ] Flow matrix only has 1001 transitions (discarded 959 similar events)
// Phase 1: matrix 1001 rows 553 cols
[2023-04-06 20:08:45] [INFO ] Computed 22 invariants in 24 ms
[2023-04-06 20:08:45] [INFO ] After 382ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-04-06 20:08:46] [INFO ] [Nat]Absence check using 15 positive place invariants in 38 ms returned sat
[2023-04-06 20:08:46] [INFO ] [Nat]Absence check using 15 positive and 7 generalized place invariants in 5 ms returned sat
[2023-04-06 20:08:46] [INFO ] After 501ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :5
[2023-04-06 20:08:46] [INFO ] State equation strengthened by 472 read => feed constraints.
[2023-04-06 20:08:46] [INFO ] After 348ms SMT Verify possible using 472 Read/Feed constraints in natural domain returned unsat :1 sat :5
[2023-04-06 20:08:47] [INFO ] Deduced a trap composed of 6 places in 210 ms of which 8 ms to minimize.
[2023-04-06 20:08:47] [INFO ] Deduced a trap composed of 29 places in 171 ms of which 1 ms to minimize.
[2023-04-06 20:08:47] [INFO ] Deduced a trap composed of 3 places in 113 ms of which 1 ms to minimize.
[2023-04-06 20:08:47] [INFO ] Deduced a trap composed of 14 places in 68 ms of which 1 ms to minimize.
[2023-04-06 20:08:47] [INFO ] Deduced a trap composed of 3 places in 58 ms of which 1 ms to minimize.
[2023-04-06 20:08:47] [INFO ] Deduced a trap composed of 3 places in 54 ms of which 0 ms to minimize.
[2023-04-06 20:08:47] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 6 trap constraints in 880 ms
[2023-04-06 20:08:48] [INFO ] Deduced a trap composed of 3 places in 156 ms of which 1 ms to minimize.
[2023-04-06 20:08:48] [INFO ] Deduced a trap composed of 3 places in 113 ms of which 0 ms to minimize.
[2023-04-06 20:08:48] [INFO ] Deduced a trap composed of 32 places in 94 ms of which 0 ms to minimize.
[2023-04-06 20:08:48] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 511 ms
[2023-04-06 20:08:48] [INFO ] Deduced a trap composed of 78 places in 81 ms of which 1 ms to minimize.
[2023-04-06 20:08:48] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 150 ms
[2023-04-06 20:08:48] [INFO ] After 2195ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :4
Attempting to minimize the solution found.
Minimization took 240 ms.
[2023-04-06 20:08:49] [INFO ] After 3241ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :4
FORMULA EisenbergMcGuire-PT-07-ReachabilityCardinality-02 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA EisenbergMcGuire-PT-07-ReachabilityCardinality-01 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 6 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 91 ms.
Support contains 58 out of 553 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 553/553 places, 1960/1960 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 553 transition count 1955
Reduce places removed 5 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 6 rules applied. Total rules applied 11 place count 548 transition count 1954
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 12 place count 547 transition count 1954
Performed 121 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 121 Pre rules applied. Total rules applied 12 place count 547 transition count 1833
Deduced a syphon composed of 121 places in 2 ms
Reduce places removed 121 places and 0 transitions.
Iterating global reduction 3 with 242 rules applied. Total rules applied 254 place count 426 transition count 1833
Discarding 39 places :
Symmetric choice reduction at 3 with 39 rule applications. Total rules 293 place count 387 transition count 1560
Iterating global reduction 3 with 39 rules applied. Total rules applied 332 place count 387 transition count 1560
Performed 37 Post agglomeration using F-continuation condition.Transition count delta: 37
Deduced a syphon composed of 37 places in 2 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 3 with 74 rules applied. Total rules applied 406 place count 350 transition count 1523
Applied a total of 406 rules in 185 ms. Remains 350 /553 variables (removed 203) and now considering 1523/1960 (removed 437) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 185 ms. Remains : 350/553 places, 1523/1960 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 168 ms. (steps per millisecond=59 ) properties (out of 4) 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 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 4) 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 4) 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 4) seen :0
Interrupted probabilistic random walk after 386816 steps, run timeout after 3001 ms. (steps per millisecond=128 ) properties seen :{1=1, 3=1}
Probabilistic random walk after 386816 steps, saw 195829 distinct states, run finished after 3002 ms. (steps per millisecond=128 ) properties seen :2
FORMULA EisenbergMcGuire-PT-07-ReachabilityCardinality-15 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA EisenbergMcGuire-PT-07-ReachabilityCardinality-10 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Running SMT prover for 2 properties.
[2023-04-06 20:08:52] [INFO ] Flow matrix only has 564 transitions (discarded 959 similar events)
// Phase 1: matrix 564 rows 350 cols
[2023-04-06 20:08:52] [INFO ] Computed 22 invariants in 6 ms
[2023-04-06 20:08:52] [INFO ] After 60ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-04-06 20:08:52] [INFO ] [Nat]Absence check using 15 positive place invariants in 7 ms returned sat
[2023-04-06 20:08:52] [INFO ] [Nat]Absence check using 15 positive and 7 generalized place invariants in 3 ms returned sat
[2023-04-06 20:08:52] [INFO ] After 182ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-04-06 20:08:52] [INFO ] State equation strengthened by 238 read => feed constraints.
[2023-04-06 20:08:53] [INFO ] After 96ms SMT Verify possible using 238 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-04-06 20:08:53] [INFO ] Deduced a trap composed of 3 places in 85 ms of which 0 ms to minimize.
[2023-04-06 20:08:53] [INFO ] Deduced a trap composed of 3 places in 77 ms of which 1 ms to minimize.
[2023-04-06 20:08:53] [INFO ] Deduced a trap composed of 3 places in 46 ms of which 1 ms to minimize.
[2023-04-06 20:08:53] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 304 ms
[2023-04-06 20:08:53] [INFO ] Deduced a trap composed of 23 places in 164 ms of which 0 ms to minimize.
[2023-04-06 20:08:53] [INFO ] Deduced a trap composed of 19 places in 64 ms of which 0 ms to minimize.
[2023-04-06 20:08:53] [INFO ] Deduced a trap composed of 51 places in 182 ms of which 0 ms to minimize.
[2023-04-06 20:08:53] [INFO ] Deduced a trap composed of 30 places in 57 ms of which 1 ms to minimize.
[2023-04-06 20:08:54] [INFO ] Deduced a trap composed of 3 places in 189 ms of which 1 ms to minimize.
[2023-04-06 20:08:54] [INFO ] Deduced a trap composed of 4 places in 123 ms of which 1 ms to minimize.
[2023-04-06 20:08:54] [INFO ] Deduced a trap composed of 15 places in 62 ms of which 1 ms to minimize.
[2023-04-06 20:08:54] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1032 ms
[2023-04-06 20:08:54] [INFO ] After 1503ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 80 ms.
[2023-04-06 20:08:54] [INFO ] After 1874ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 7 ms.
Support contains 42 out of 350 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 350/350 places, 1523/1523 transitions.
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 8 Pre rules applied. Total rules applied 0 place count 350 transition count 1515
Deduced a syphon composed of 8 places in 2 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 0 with 16 rules applied. Total rules applied 16 place count 342 transition count 1515
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 341 transition count 1508
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 341 transition count 1508
Applied a total of 18 rules in 68 ms. Remains 341 /350 variables (removed 9) and now considering 1508/1523 (removed 15) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 68 ms. Remains : 341/350 places, 1508/1523 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 146 ms. (steps per millisecond=68 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 2) 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 2) seen :0
Interrupted probabilistic random walk after 398128 steps, run timeout after 3001 ms. (steps per millisecond=132 ) properties seen :{}
Probabilistic random walk after 398128 steps, saw 200384 distinct states, run finished after 3002 ms. (steps per millisecond=132 ) properties seen :0
Running SMT prover for 2 properties.
[2023-04-06 20:08:57] [INFO ] Flow matrix only has 549 transitions (discarded 959 similar events)
// Phase 1: matrix 549 rows 341 cols
[2023-04-06 20:08:57] [INFO ] Computed 22 invariants in 19 ms
[2023-04-06 20:08:57] [INFO ] After 66ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-04-06 20:08:57] [INFO ] [Nat]Absence check using 15 positive place invariants in 6 ms returned sat
[2023-04-06 20:08:57] [INFO ] [Nat]Absence check using 15 positive and 7 generalized place invariants in 3 ms returned sat
[2023-04-06 20:08:58] [INFO ] After 178ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-04-06 20:08:58] [INFO ] State equation strengthened by 232 read => feed constraints.
[2023-04-06 20:08:58] [INFO ] After 112ms SMT Verify possible using 232 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-04-06 20:08:58] [INFO ] Deduced a trap composed of 3 places in 94 ms of which 1 ms to minimize.
[2023-04-06 20:08:58] [INFO ] Deduced a trap composed of 3 places in 64 ms of which 1 ms to minimize.
[2023-04-06 20:08:58] [INFO ] Deduced a trap composed of 3 places in 142 ms of which 1 ms to minimize.
[2023-04-06 20:08:58] [INFO ] Deduced a trap composed of 44 places in 62 ms of which 1 ms to minimize.
[2023-04-06 20:08:58] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 465 ms
[2023-04-06 20:08:58] [INFO ] Deduced a trap composed of 17 places in 81 ms of which 0 ms to minimize.
[2023-04-06 20:08:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 129 ms
[2023-04-06 20:08:58] [INFO ] After 773ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 78 ms.
[2023-04-06 20:08:59] [INFO ] After 1119ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 6 ms.
Support contains 42 out of 341 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 341/341 places, 1508/1508 transitions.
Applied a total of 0 rules in 45 ms. Remains 341 /341 variables (removed 0) and now considering 1508/1508 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 45 ms. Remains : 341/341 places, 1508/1508 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 341/341 places, 1508/1508 transitions.
Applied a total of 0 rules in 44 ms. Remains 341 /341 variables (removed 0) and now considering 1508/1508 (removed 0) transitions.
[2023-04-06 20:08:59] [INFO ] Flow matrix only has 549 transitions (discarded 959 similar events)
[2023-04-06 20:08:59] [INFO ] Invariant cache hit.
[2023-04-06 20:08:59] [INFO ] Implicit Places using invariants in 283 ms returned []
[2023-04-06 20:08:59] [INFO ] Flow matrix only has 549 transitions (discarded 959 similar events)
[2023-04-06 20:08:59] [INFO ] Invariant cache hit.
[2023-04-06 20:08:59] [INFO ] State equation strengthened by 232 read => feed constraints.
[2023-04-06 20:09:00] [INFO ] Implicit Places using invariants and state equation in 1126 ms returned []
Implicit Place search using SMT with State Equation took 1412 ms to find 0 implicit places.
[2023-04-06 20:09:00] [INFO ] Redundant transitions in 94 ms returned []
[2023-04-06 20:09:00] [INFO ] Flow matrix only has 549 transitions (discarded 959 similar events)
[2023-04-06 20:09:00] [INFO ] Invariant cache hit.
[2023-04-06 20:09:01] [INFO ] Dead Transitions using invariants and state equation in 534 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2099 ms. Remains : 341/341 places, 1508/1508 transitions.
Graph (trivial) has 1230 edges and 341 vertex of which 42 / 341 are part of one of the 7 SCC in 3 ms
Free SCC test removed 35 places
Drop transitions removed 125 transitions
Ensure Unique test removed 946 transitions
Reduce isomorphic transitions removed 1071 transitions.
Drop transitions removed 52 transitions
Trivial Post-agglo rules discarded 52 transitions
Performed 52 trivial Post agglomeration. Transition count delta: 52
Iterating post reduction 0 with 52 rules applied. Total rules applied 53 place count 306 transition count 385
Reduce places removed 52 places and 0 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Iterating post reduction 1 with 59 rules applied. Total rules applied 112 place count 254 transition count 378
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 119 place count 247 transition count 378
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 119 place count 247 transition count 370
Deduced a syphon composed of 8 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 17 rules applied. Total rules applied 136 place count 238 transition count 370
Performed 67 Post agglomeration using F-continuation condition.Transition count delta: 67
Deduced a syphon composed of 67 places in 1 ms
Reduce places removed 67 places and 0 transitions.
Iterating global reduction 3 with 134 rules applied. Total rules applied 270 place count 171 transition count 303
Ensure Unique test removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Iterating post reduction 3 with 25 rules applied. Total rules applied 295 place count 171 transition count 278
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -11
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 301 place count 168 transition count 289
Drop transitions removed 16 transitions
Redundant transition composition rules discarded 16 transitions
Iterating global reduction 4 with 16 rules applied. Total rules applied 317 place count 168 transition count 273
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 319 place count 167 transition count 275
Free-agglomeration rule applied 37 times.
Iterating global reduction 4 with 37 rules applied. Total rules applied 356 place count 167 transition count 238
Reduce places removed 37 places and 0 transitions.
Iterating post reduction 4 with 37 rules applied. Total rules applied 393 place count 130 transition count 238
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 5 with 5 rules applied. Total rules applied 398 place count 130 transition count 238
Applied a total of 398 rules in 56 ms. Remains 130 /341 variables (removed 211) and now considering 238/1508 (removed 1270) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 238 rows 130 cols
[2023-04-06 20:09:01] [INFO ] Computed 21 invariants in 1 ms
[2023-04-06 20:09:01] [INFO ] After 31ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-04-06 20:09:01] [INFO ] [Nat]Absence check using 15 positive place invariants in 3 ms returned sat
[2023-04-06 20:09:01] [INFO ] [Nat]Absence check using 15 positive and 6 generalized place invariants in 2 ms returned sat
[2023-04-06 20:09:01] [INFO ] After 74ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-04-06 20:09:01] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-04-06 20:09:01] [INFO ] After 35ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-04-06 20:09:01] [INFO ] Deduced a trap composed of 5 places in 42 ms of which 1 ms to minimize.
[2023-04-06 20:09:01] [INFO ] Deduced a trap composed of 5 places in 22 ms of which 0 ms to minimize.
[2023-04-06 20:09:01] [INFO ] Deduced a trap composed of 5 places in 26 ms of which 0 ms to minimize.
[2023-04-06 20:09:01] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 122 ms
[2023-04-06 20:09:01] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-04-06 20:09:01] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 40 ms
[2023-04-06 20:09:01] [INFO ] After 227ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 27 ms.
[2023-04-06 20:09:01] [INFO ] After 370ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
[2023-04-06 20:09:01] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 19 ms.
[2023-04-06 20:09:01] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 341 places, 1508 transitions and 7748 arcs took 10 ms.
[2023-04-06 20:09:02] [INFO ] Flatten gal took : 253 ms
Total runtime 18140 ms.
There are residual formulas that ITS could not solve within timeout
======================================================
========== this is Smart for the MCC'2018 ============
======================================================
Running EisenbergMcGuire (PT), instance 07
Examination ReachabilityCardinality
Parser /home/mcc/BenchKit/bin//../reducer/bin//../../smart/bin//parser/Cardinality.jar
Model checker /home/mcc/BenchKit/bin//../reducer/bin//../../smart/bin//rem_exec//smart

GOT IT HERE. BS
Petri model created: 341 places, 1508 transitions, 7748 arcs.
Final Score: 30143.577
Took : 97 seconds
Reachability Cardinality file is: ReachabilityCardinality.xml
READY TO PARSE. BS
PROPERTY: EisenbergMcGuire-PT-07-ReachabilityCardinality-06 (reachable & potential(( ( ( (tk(P164)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P164)) ) ) & ( ( ( (tk(P313)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P313)) ) ) & ( ( ( ( ( (tk(P14)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P14)) ) ) & ( ( ( (tk(P245)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P245)) ) ) | ( ( (tk(P85)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P85)) ) ) ) ) & ( ( ( ( (tk(P266)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P266)) ) ) | ( ( (tk(P97)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P97)) ) ) ) & ( ( ( (tk(P179)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P179)) ) ) | ( ( ( (tk(P104)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P104)) ) ) & ( ( (tk(P172)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P172)) ) ) ) ) ) ) | ( ( ( (tk(P94)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P94)) ) ) & ( ( (tk(P70)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P70)) ) ) ) ) ) )))
PROPERTY: EisenbergMcGuire-PT-07-ReachabilityCardinality-13 (reachable & potential(( ( ( ( (tk(P99)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P99)) ) ) & ( ( (tk(P54)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P54)) ) ) ) & ( ( ( (tk(P231)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P231)) ) ) & ( ( ( ( ( (tk(P191)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P191)) ) ) | ( ( ( (tk(P86)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P86)) ) ) | ( ( (tk(P161)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P161)) ) ) ) ) | ( ( ( ( (tk(P25)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P25)) ) ) & ( ( (tk(P270)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P270)) ) ) ) | ( ( ( ( (tk(P324)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P324)) ) ) & ( ( (tk(P193)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P193)) ) ) ) | ( ( ( (tk(P272)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P272)) ) ) & ( ( ( (tk(P277)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P277)) ) ) & ( ( ( ( (tk(P22)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P22)) ) ) & ( ( (tk(P96)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P96)) ) ) ) | ( ( ( (tk(P317)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P317)) ) ) & ( ( (tk(P100)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P100)) ) ) ) ) ) ) ) ) ) & ( ( ( (tk(P268)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P268)) ) ) | ( ( ( ( (tk(P288)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P288)) ) ) & ( ( (tk(P143)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P143)) ) ) ) | ( ( ( ( (tk(P168)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P168)) ) ) & ( ( (tk(P26)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P26)) ) ) ) & ( ( ( ( (tk(P249)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P249)) ) ) | ( ( (tk(P50)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P50)) ) ) ) & ( ( ( ( (tk(P320)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P320)) ) ) | ( ( (tk(P187)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P187)) ) ) ) & ( ( ( (tk(P162)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P162)) ) ) | ( ( ( (tk(P137)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P137)) ) ) | ( ( ( (tk(P93)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P93)) ) ) & ( ( ( (tk(P147)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P147)) ) ) | ( ( (tk(P163)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P163)) ) ) ) ) ) ) ) ) ) ) ) ) ) )))

BK_STOP 1680815261418

--------------------
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 ReachabilityCardinality -timeout 360 -rebuildPNML
/home/mcc/BenchKit/bin//../reducer/bin//../../smart/bin//smart.sh: line 116: 627 Killed ${SMART}/smart ${INPUT_SM}

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-07"
export BK_EXAMINATION="ReachabilityCardinality"
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-07, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r523-tall-167987247800254"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/EisenbergMcGuire-PT-07.tgz
mv EisenbergMcGuire-PT-07 execution
cd execution
if [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "UpperBounds" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] || [ "ReachabilityCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' ReachabilityCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;