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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.0M
-rw-r--r-- 1 mcc users 6.2K Mar 23 15:19 CTLCardinality.txt
-rw-r--r-- 1 mcc users 62K Mar 23 15:19 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.8K Mar 23 15:18 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K Mar 23 15:18 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K Mar 23 07:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Mar 23 07:06 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.1K Mar 23 07:06 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Mar 23 07:06 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Mar 26 22:42 NewModel
-rw-r--r-- 1 mcc users 11K Mar 23 15:19 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 98K Mar 23 15:19 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.4K Mar 23 15:19 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 59K Mar 23 15:19 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 23 07:06 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 23 07:06 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.6M 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 Anderson-PT-11-ReachabilityCardinality-00
FORMULA_NAME Anderson-PT-11-ReachabilityCardinality-01
FORMULA_NAME Anderson-PT-11-ReachabilityCardinality-02
FORMULA_NAME Anderson-PT-11-ReachabilityCardinality-03
FORMULA_NAME Anderson-PT-11-ReachabilityCardinality-04
FORMULA_NAME Anderson-PT-11-ReachabilityCardinality-05
FORMULA_NAME Anderson-PT-11-ReachabilityCardinality-06
FORMULA_NAME Anderson-PT-11-ReachabilityCardinality-07
FORMULA_NAME Anderson-PT-11-ReachabilityCardinality-08
FORMULA_NAME Anderson-PT-11-ReachabilityCardinality-09
FORMULA_NAME Anderson-PT-11-ReachabilityCardinality-10
FORMULA_NAME Anderson-PT-11-ReachabilityCardinality-11
FORMULA_NAME Anderson-PT-11-ReachabilityCardinality-12
FORMULA_NAME Anderson-PT-11-ReachabilityCardinality-13
FORMULA_NAME Anderson-PT-11-ReachabilityCardinality-14
FORMULA_NAME Anderson-PT-11-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1680825795324

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=Anderson-PT-11
Applying reductions before tool smart
Invoking reducer
Running Version 202304061127
[2023-04-07 00:03:17] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-04-07 00:03:17] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-04-07 00:03:17] [INFO ] Load time of PNML (sax parser for PT used): 150 ms
[2023-04-07 00:03:17] [INFO ] Transformed 749 places.
[2023-04-07 00:03:17] [INFO ] Transformed 3245 transitions.
[2023-04-07 00:03:17] [INFO ] Found NUPN structural information;
[2023-04-07 00:03:17] [INFO ] Parsed PT model containing 749 places and 3245 transitions and 12540 arcs in 233 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 16 ms.
Working with output stream class java.io.PrintStream
FORMULA Anderson-PT-11-ReachabilityCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Anderson-PT-11-ReachabilityCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Anderson-PT-11-ReachabilityCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 2 resets, run finished after 453 ms. (steps per millisecond=22 ) properties (out of 13) seen :5
FORMULA Anderson-PT-11-ReachabilityCardinality-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Anderson-PT-11-ReachabilityCardinality-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Anderson-PT-11-ReachabilityCardinality-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Anderson-PT-11-ReachabilityCardinality-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Anderson-PT-11-ReachabilityCardinality-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 96 ms. (steps per millisecond=104 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 112 ms. (steps per millisecond=89 ) properties (out of 8) seen :1
FORMULA Anderson-PT-11-ReachabilityCardinality-09 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 7) 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 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 96 ms. (steps per millisecond=104 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
// Phase 1: matrix 3245 rows 749 cols
[2023-04-07 00:03:18] [INFO ] Computed 25 invariants in 73 ms
[2023-04-07 00:03:19] [INFO ] After 550ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-04-07 00:03:19] [INFO ] [Nat]Absence check using 12 positive place invariants in 15 ms returned sat
[2023-04-07 00:03:19] [INFO ] [Nat]Absence check using 12 positive and 13 generalized place invariants in 15 ms returned sat
[2023-04-07 00:03:22] [INFO ] After 3251ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :6
[2023-04-07 00:03:22] [INFO ] State equation strengthened by 110 read => feed constraints.
[2023-04-07 00:03:24] [INFO ] After 1125ms SMT Verify possible using 110 Read/Feed constraints in natural domain returned unsat :1 sat :6
[2023-04-07 00:03:25] [INFO ] Deduced a trap composed of 336 places in 790 ms of which 11 ms to minimize.
[2023-04-07 00:03:26] [INFO ] Deduced a trap composed of 253 places in 523 ms of which 1 ms to minimize.
[2023-04-07 00:03:27] [INFO ] Deduced a trap composed of 239 places in 529 ms of which 1 ms to minimize.
[2023-04-07 00:03:27] [INFO ] Deduced a trap composed of 232 places in 534 ms of which 1 ms to minimize.
[2023-04-07 00:03:28] [INFO ] Deduced a trap composed of 285 places in 556 ms of which 1 ms to minimize.
[2023-04-07 00:03:28] [INFO ] Deduced a trap composed of 171 places in 536 ms of which 1 ms to minimize.
[2023-04-07 00:03:29] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 3972 ms
[2023-04-07 00:03:29] [INFO ] After 6726ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :6
Attempting to minimize the solution found.
Minimization took 842 ms.
[2023-04-07 00:03:30] [INFO ] After 11287ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :6
FORMULA Anderson-PT-11-ReachabilityCardinality-10 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 7 Parikh solutions to 6 different solutions.
Parikh walk visited 0 properties in 177 ms.
Support contains 25 out of 749 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 749/749 places, 3245/3245 transitions.
Performed 92 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 92 Pre rules applied. Total rules applied 0 place count 749 transition count 3153
Deduced a syphon composed of 92 places in 2 ms
Reduce places removed 92 places and 0 transitions.
Iterating global reduction 0 with 184 rules applied. Total rules applied 184 place count 657 transition count 3153
Discarding 203 places :
Symmetric choice reduction at 0 with 203 rule applications. Total rules 387 place count 454 transition count 830
Iterating global reduction 0 with 203 rules applied. Total rules applied 590 place count 454 transition count 830
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Deduced a syphon composed of 13 places in 1 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 0 with 26 rules applied. Total rules applied 616 place count 441 transition count 817
Applied a total of 616 rules in 190 ms. Remains 441 /749 variables (removed 308) and now considering 817/3245 (removed 2428) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 191 ms. Remains : 441/749 places, 817/3245 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 207 ms. (steps per millisecond=48 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 88 ms. (steps per millisecond=113 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 6) 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 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 98 ms. (steps per millisecond=102 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 371179 steps, run timeout after 3001 ms. (steps per millisecond=123 ) properties seen :{5=1}
Probabilistic random walk after 371179 steps, saw 284220 distinct states, run finished after 3001 ms. (steps per millisecond=123 ) properties seen :1
FORMULA Anderson-PT-11-ReachabilityCardinality-15 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Running SMT prover for 5 properties.
// Phase 1: matrix 817 rows 441 cols
[2023-04-07 00:03:34] [INFO ] Computed 25 invariants in 17 ms
[2023-04-07 00:03:34] [INFO ] After 181ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-04-07 00:03:34] [INFO ] [Nat]Absence check using 13 positive place invariants in 13 ms returned sat
[2023-04-07 00:03:34] [INFO ] [Nat]Absence check using 13 positive and 12 generalized place invariants in 23 ms returned sat
[2023-04-07 00:03:35] [INFO ] After 573ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-04-07 00:03:35] [INFO ] State equation strengthened by 110 read => feed constraints.
[2023-04-07 00:03:35] [INFO ] After 445ms SMT Verify possible using 110 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2023-04-07 00:03:36] [INFO ] After 887ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 303 ms.
[2023-04-07 00:03:36] [INFO ] After 1957ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Parikh walk visited 0 properties in 25 ms.
Support contains 24 out of 441 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 441/441 places, 817/817 transitions.
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 0 with 2 rules applied. Total rules applied 2 place count 440 transition count 816
Applied a total of 2 rules in 38 ms. Remains 440 /441 variables (removed 1) and now considering 816/817 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 38 ms. Remains : 440/441 places, 816/817 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 143 ms. (steps per millisecond=69 ) properties (out of 5) 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 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 5) 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 5) seen :0
Interrupted probabilistic random walk after 361942 steps, run timeout after 3001 ms. (steps per millisecond=120 ) properties seen :{}
Probabilistic random walk after 361942 steps, saw 277533 distinct states, run finished after 3002 ms. (steps per millisecond=120 ) properties seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 816 rows 440 cols
[2023-04-07 00:03:40] [INFO ] Computed 25 invariants in 8 ms
[2023-04-07 00:03:40] [INFO ] After 129ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-04-07 00:03:40] [INFO ] [Nat]Absence check using 13 positive place invariants in 11 ms returned sat
[2023-04-07 00:03:40] [INFO ] [Nat]Absence check using 13 positive and 12 generalized place invariants in 20 ms returned sat
[2023-04-07 00:03:41] [INFO ] After 687ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-04-07 00:03:41] [INFO ] State equation strengthened by 110 read => feed constraints.
[2023-04-07 00:03:41] [INFO ] After 522ms SMT Verify possible using 110 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2023-04-07 00:03:42] [INFO ] After 959ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 331 ms.
[2023-04-07 00:03:42] [INFO ] After 2146ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Parikh walk visited 0 properties in 16 ms.
Support contains 24 out of 440 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 440/440 places, 816/816 transitions.
Applied a total of 0 rules in 34 ms. Remains 440 /440 variables (removed 0) and now considering 816/816 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 34 ms. Remains : 440/440 places, 816/816 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 440/440 places, 816/816 transitions.
Applied a total of 0 rules in 35 ms. Remains 440 /440 variables (removed 0) and now considering 816/816 (removed 0) transitions.
[2023-04-07 00:03:42] [INFO ] Invariant cache hit.
[2023-04-07 00:03:43] [INFO ] Implicit Places using invariants in 501 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 506 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 439/440 places, 816/816 transitions.
Drop transitions removed 95 transitions
Trivial Post-agglo rules discarded 95 transitions
Performed 95 trivial Post agglomeration. Transition count delta: 95
Iterating post reduction 0 with 95 rules applied. Total rules applied 95 place count 439 transition count 721
Reduce places removed 95 places and 0 transitions.
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Iterating post reduction 1 with 105 rules applied. Total rules applied 200 place count 344 transition count 711
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 210 place count 334 transition count 711
Free-agglomeration rule (complex) applied 13 times.
Iterating global reduction 3 with 13 rules applied. Total rules applied 223 place count 334 transition count 698
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 3 with 13 rules applied. Total rules applied 236 place count 321 transition count 698
Applied a total of 236 rules in 40 ms. Remains 321 /439 variables (removed 118) and now considering 698/816 (removed 118) transitions.
// Phase 1: matrix 698 rows 321 cols
[2023-04-07 00:03:43] [INFO ] Computed 24 invariants in 11 ms
[2023-04-07 00:03:43] [INFO ] Implicit Places using invariants in 258 ms returned []
[2023-04-07 00:03:43] [INFO ] Invariant cache hit.
[2023-04-07 00:03:43] [INFO ] State equation strengthened by 110 read => feed constraints.
[2023-04-07 00:03:44] [INFO ] Implicit Places using invariants and state equation in 1215 ms returned []
Implicit Place search using SMT with State Equation took 1477 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 321/440 places, 698/816 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 2058 ms. Remains : 321/440 places, 698/816 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 195 ms. (steps per millisecond=51 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 73 ms. (steps per millisecond=136 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 266989 steps, run timeout after 3001 ms. (steps per millisecond=88 ) properties seen :{}
Probabilistic random walk after 266989 steps, saw 204533 distinct states, run finished after 3003 ms. (steps per millisecond=88 ) properties seen :0
Running SMT prover for 5 properties.
[2023-04-07 00:03:48] [INFO ] Invariant cache hit.
[2023-04-07 00:03:48] [INFO ] After 80ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-04-07 00:03:48] [INFO ] [Nat]Absence check using 13 positive place invariants in 7 ms returned sat
[2023-04-07 00:03:48] [INFO ] [Nat]Absence check using 13 positive and 11 generalized place invariants in 9 ms returned sat
[2023-04-07 00:03:48] [INFO ] After 474ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-04-07 00:03:48] [INFO ] State equation strengthened by 110 read => feed constraints.
[2023-04-07 00:03:49] [INFO ] After 455ms SMT Verify possible using 110 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2023-04-07 00:03:49] [INFO ] After 805ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 195 ms.
[2023-04-07 00:03:49] [INFO ] After 1615ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Parikh walk visited 0 properties in 18 ms.
Support contains 24 out of 321 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 321/321 places, 698/698 transitions.
Applied a total of 0 rules in 11 ms. Remains 321 /321 variables (removed 0) and now considering 698/698 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 321/321 places, 698/698 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 321/321 places, 698/698 transitions.
Applied a total of 0 rules in 10 ms. Remains 321 /321 variables (removed 0) and now considering 698/698 (removed 0) transitions.
[2023-04-07 00:03:49] [INFO ] Invariant cache hit.
[2023-04-07 00:03:50] [INFO ] Implicit Places using invariants in 275 ms returned []
[2023-04-07 00:03:50] [INFO ] Invariant cache hit.
[2023-04-07 00:03:50] [INFO ] State equation strengthened by 110 read => feed constraints.
[2023-04-07 00:03:51] [INFO ] Implicit Places using invariants and state equation in 1183 ms returned []
Implicit Place search using SMT with State Equation took 1463 ms to find 0 implicit places.
[2023-04-07 00:03:51] [INFO ] Redundant transitions in 43 ms returned []
[2023-04-07 00:03:51] [INFO ] Invariant cache hit.
[2023-04-07 00:03:51] [INFO ] Dead Transitions using invariants and state equation in 457 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1984 ms. Remains : 321/321 places, 698/698 transitions.
Performed 116 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 116 Pre rules applied. Total rules applied 0 place count 321 transition count 582
Deduced a syphon composed of 116 places in 1 ms
Reduce places removed 116 places and 0 transitions.
Iterating global reduction 0 with 232 rules applied. Total rules applied 232 place count 205 transition count 582
Applied a total of 232 rules in 13 ms. Remains 205 /321 variables (removed 116) and now considering 582/698 (removed 116) transitions.
Running SMT prover for 5 properties.
// Phase 1: matrix 582 rows 205 cols
[2023-04-07 00:03:51] [INFO ] Computed 24 invariants in 4 ms
[2023-04-07 00:03:51] [INFO ] After 51ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-04-07 00:03:51] [INFO ] [Nat]Absence check using 13 positive place invariants in 7 ms returned sat
[2023-04-07 00:03:51] [INFO ] [Nat]Absence check using 13 positive and 11 generalized place invariants in 8 ms returned sat
[2023-04-07 00:03:52] [INFO ] After 331ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-04-07 00:03:52] [INFO ] After 501ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 119 ms.
[2023-04-07 00:03:52] [INFO ] After 715ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
[2023-04-07 00:03:52] [INFO ] Export to MCC of 5 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 4 ms.
[2023-04-07 00:03:52] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 321 places, 698 transitions and 2752 arcs took 4 ms.
[2023-04-07 00:03:52] [INFO ] Flatten gal took : 86 ms
Total runtime 35896 ms.
There are residual formulas that ITS could not solve within timeout
======================================================
========== this is Smart for the MCC'2018 ============
======================================================
Running Anderson (PT), instance 11
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: 321 places, 698 transitions, 2752 arcs.
Final Score: 27670.429
Took : 30 seconds
Reachability Cardinality file is: ReachabilityCardinality.xml
READY TO PARSE. BS
PROPERTY: Anderson-PT-11-ReachabilityCardinality-02 (reachable &!potential( ( ( ( (tk(P91)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P91)) ) ) | ( ( (tk(P135)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P135)) ) ) )))
PROPERTY: Anderson-PT-11-ReachabilityCardinality-06 (reachable &!potential( ( ( ( ( (tk(P37)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P37)) ) ) | ( ( (tk(P92)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P92)) ) ) ) | ( ( ( (tk(P87)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P87)) ) ) | ( ( ( (tk(P167)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P167)) ) ) | ( ( (tk(P11)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P11)) ) ) ) ) )))
PROPERTY: Anderson-PT-11-ReachabilityCardinality-08 (reachable & potential(( ( ( ( (tk(P156)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P156)) ) ) & ( ( (tk(P168)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P168)) ) ) ) & ( ( ( ( (tk(P45)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P45)) ) ) | ( ( (tk(P195)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P195)) ) ) ) & ( ( ( ( (tk(P319)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P319)) ) ) & ( ( ( (tk(P180)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P180)) ) ) | ( ( (tk(P169)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P169)) ) ) ) ) | ( ( ( (tk(P65)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P65)) ) ) & ( ( ( (tk(P170)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P170)) ) ) & ( ( (tk(P36)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P36)) ) ) ) ) ) ) )))
PROPERTY: Anderson-PT-11-ReachabilityCardinality-12 (reachable &!potential( ( ( ( (tk(P92)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P92)) ) ) | ( ( (tk(P166)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P166)) ) ) )))
PROPERTY: Anderson-PT-11-ReachabilityCardinality-13 (reachable & potential(( ( ( (tk(P157)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P157)) ) ) & ( ( ( ( (tk(P320)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P320)) ) ) & ( ( (tk(P148)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P148)) ) ) ) | ( ( ( (tk(P113)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P113)) ) ) & ( ( ( (tk(P41)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P41)) ) ) | ( ( (tk(P185)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P185)) ) ) ) ) ) )))
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393228 kB
MemFree: 10434140 kB
After kill :
MemTotal: 16393228 kB
MemFree: 16106920 kB

BK_TIME_CONFINEMENT_REACHED

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.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
Caught signal 15, terminating.

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="Anderson-PT-11"
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 Anderson-PT-11, 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-167987247500062"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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