Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2023-input.r041-tajo-167813695000662.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2023-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
..........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool ltsminxred
Input is CANConstruction-PT-060, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r041-tajo-167813695000662
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 5.9M
-rw-r--r-- 1 mcc users 9.0K Feb 25 22:23 CTLCardinality.txt
-rw-r--r-- 1 mcc users 76K Feb 25 22:23 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.6K Feb 25 22:03 CTLFireability.txt
-rw-r--r-- 1 mcc users 58K Feb 25 22:03 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.8K Feb 25 15:40 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 15:40 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Feb 25 15:40 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 15:40 LTLFireability.xml
-rw-r--r-- 1 mcc users 26K Feb 25 22:43 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 219K Feb 25 22:43 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.8K Feb 25 22:36 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 46K Feb 25 22:36 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Feb 25 15:40 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K Feb 25 15:40 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 5.4M Mar 5 18:22 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME CANConstruction-PT-060-ReachabilityCardinality-00
FORMULA_NAME CANConstruction-PT-060-ReachabilityCardinality-01
FORMULA_NAME CANConstruction-PT-060-ReachabilityCardinality-02
FORMULA_NAME CANConstruction-PT-060-ReachabilityCardinality-03
FORMULA_NAME CANConstruction-PT-060-ReachabilityCardinality-04
FORMULA_NAME CANConstruction-PT-060-ReachabilityCardinality-05
FORMULA_NAME CANConstruction-PT-060-ReachabilityCardinality-06
FORMULA_NAME CANConstruction-PT-060-ReachabilityCardinality-07
FORMULA_NAME CANConstruction-PT-060-ReachabilityCardinality-08
FORMULA_NAME CANConstruction-PT-060-ReachabilityCardinality-09
FORMULA_NAME CANConstruction-PT-060-ReachabilityCardinality-10
FORMULA_NAME CANConstruction-PT-060-ReachabilityCardinality-11
FORMULA_NAME CANConstruction-PT-060-ReachabilityCardinality-12
FORMULA_NAME CANConstruction-PT-060-ReachabilityCardinality-13
FORMULA_NAME CANConstruction-PT-060-ReachabilityCardinality-14
FORMULA_NAME CANConstruction-PT-060-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1678654858963

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=ltsminxred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CANConstruction-PT-060
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-12 21:01:00] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-12 21:01:00] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-12 21:01:01] [INFO ] Load time of PNML (sax parser for PT used): 341 ms
[2023-03-12 21:01:01] [INFO ] Transformed 7922 places.
[2023-03-12 21:01:01] [INFO ] Transformed 14880 transitions.
[2023-03-12 21:01:01] [INFO ] Parsed PT model containing 7922 places and 14880 transitions and 44400 arcs in 495 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 30 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 9 resets, run finished after 696 ms. (steps per millisecond=14 ) properties (out of 16) seen :4
FORMULA CANConstruction-PT-060-ReachabilityCardinality-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-060-ReachabilityCardinality-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-060-ReachabilityCardinality-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-060-ReachabilityCardinality-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 12) 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 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 12) 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 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 114 ms. (steps per millisecond=87 ) 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 25 ms. (steps per millisecond=400 ) properties (out of 12) 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 12) 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 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 12) seen :0
Running SMT prover for 12 properties.
// Phase 1: matrix 14880 rows 7922 cols
[2023-03-12 21:01:02] [INFO ] Computed 121 place invariants in 232 ms
[2023-03-12 21:01:06] [INFO ] [Real]Absence check using 61 positive place invariants in 193 ms returned sat
[2023-03-12 21:01:06] [INFO ] [Real]Absence check using 61 positive and 60 generalized place invariants in 151 ms returned sat
[2023-03-12 21:01:06] [INFO ] After 3552ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:12
[2023-03-12 21:01:09] [INFO ] [Nat]Absence check using 61 positive place invariants in 194 ms returned sat
[2023-03-12 21:01:09] [INFO ] [Nat]Absence check using 61 positive and 60 generalized place invariants in 162 ms returned sat
[2023-03-12 21:01:23] [INFO ] After 12429ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :10
[2023-03-12 21:01:23] [INFO ] State equation strengthened by 7140 read => feed constraints.
[2023-03-12 21:01:31] [INFO ] After 7689ms SMT Verify possible using 7140 Read/Feed constraints in natural domain returned unsat :2 sat :9
[2023-03-12 21:01:31] [INFO ] After 7691ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :9
Attempting to minimize the solution found.
Minimization took 6 ms.
[2023-03-12 21:01:31] [INFO ] After 25030ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :9
FORMULA CANConstruction-PT-060-ReachabilityCardinality-11 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA CANConstruction-PT-060-ReachabilityCardinality-09 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 12 Parikh solutions to 10 different solutions.
FORMULA CANConstruction-PT-060-ReachabilityCardinality-00 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA CANConstruction-PT-060-ReachabilityCardinality-03 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 2 properties in 200 ms.
Support contains 204 out of 7922 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 7922/7922 places, 14880/14880 transitions.
Drop transitions removed 379 transitions
Trivial Post-agglo rules discarded 379 transitions
Performed 379 trivial Post agglomeration. Transition count delta: 379
Iterating post reduction 0 with 379 rules applied. Total rules applied 379 place count 7922 transition count 14501
Reduce places removed 379 places and 0 transitions.
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Iterating post reduction 1 with 392 rules applied. Total rules applied 771 place count 7543 transition count 14488
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 2 with 13 rules applied. Total rules applied 784 place count 7530 transition count 14488
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 10 Pre rules applied. Total rules applied 784 place count 7530 transition count 14478
Deduced a syphon composed of 10 places in 16 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 804 place count 7520 transition count 14478
Discarding 3389 places :
Symmetric choice reduction at 3 with 3389 rule applications. Total rules 4193 place count 4131 transition count 7700
Iterating global reduction 3 with 3389 rules applied. Total rules applied 7582 place count 4131 transition count 7700
Performed 47 Post agglomeration using F-continuation condition.Transition count delta: 47
Deduced a syphon composed of 47 places in 5 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 3 with 94 rules applied. Total rules applied 7676 place count 4084 transition count 7653
Free-agglomeration rule applied 32 times.
Iterating global reduction 3 with 32 rules applied. Total rules applied 7708 place count 4084 transition count 7621
Reduce places removed 32 places and 0 transitions.
Iterating post reduction 3 with 32 rules applied. Total rules applied 7740 place count 4052 transition count 7621
Free-agglomeration rule (complex) applied 5 times.
Iterating global reduction 4 with 5 rules applied. Total rules applied 7745 place count 4052 transition count 7616
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 7750 place count 4047 transition count 7616
Partial Free-agglomeration rule applied 97 times.
Drop transitions removed 97 transitions
Iterating global reduction 5 with 97 rules applied. Total rules applied 7847 place count 4047 transition count 7616
Partial Free-agglomeration rule applied 9 times.
Drop transitions removed 9 transitions
Iterating global reduction 5 with 9 rules applied. Total rules applied 7856 place count 4047 transition count 7616
Applied a total of 7856 rules in 4920 ms. Remains 4047 /7922 variables (removed 3875) and now considering 7616/14880 (removed 7264) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4922 ms. Remains : 4047/7922 places, 7616/14880 transitions.
Incomplete random walk after 10000 steps, including 22 resets, run finished after 274 ms. (steps per millisecond=36 ) properties (out of 8) seen :2
FORMULA CANConstruction-PT-060-ReachabilityCardinality-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-060-ReachabilityCardinality-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 6) 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 6) 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 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 22 ms. (steps per millisecond=454 ) properties (out of 6) 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 6) seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 7616 rows 4047 cols
[2023-03-12 21:01:37] [INFO ] Computed 121 place invariants in 49 ms
[2023-03-12 21:01:37] [INFO ] After 559ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-12 21:01:38] [INFO ] [Nat]Absence check using 61 positive place invariants in 84 ms returned sat
[2023-03-12 21:01:38] [INFO ] [Nat]Absence check using 61 positive and 60 generalized place invariants in 44 ms returned sat
[2023-03-12 21:01:42] [INFO ] After 4043ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-12 21:01:43] [INFO ] State equation strengthened by 7224 read => feed constraints.
[2023-03-12 21:01:47] [INFO ] After 4682ms SMT Verify possible using 7224 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2023-03-12 21:01:51] [INFO ] After 8378ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 2782 ms.
[2023-03-12 21:01:54] [INFO ] After 16420ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
FORMULA CANConstruction-PT-060-ReachabilityCardinality-04 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA CANConstruction-PT-060-ReachabilityCardinality-14 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA CANConstruction-PT-060-ReachabilityCardinality-15 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 3 properties in 91 ms.
Support contains 158 out of 4047 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4047/4047 places, 7616/7616 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 4047 transition count 7615
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 4046 transition count 7615
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 6 place count 4042 transition count 7607
Iterating global reduction 2 with 4 rules applied. Total rules applied 10 place count 4042 transition count 7607
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 2 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 42 place count 4026 transition count 7591
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 4 places in 2 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 50 place count 4022 transition count 7591
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 52 place count 4022 transition count 7591
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 53 place count 4021 transition count 7589
Iterating global reduction 2 with 1 rules applied. Total rules applied 54 place count 4021 transition count 7589
Applied a total of 54 rules in 2654 ms. Remains 4021 /4047 variables (removed 26) and now considering 7589/7616 (removed 27) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2654 ms. Remains : 4021/4047 places, 7589/7616 transitions.
Incomplete random walk after 10000 steps, including 22 resets, run finished after 276 ms. (steps per millisecond=36 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 3) 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 3) 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 3) seen :0
Interrupted probabilistic random walk after 69940 steps, run timeout after 3001 ms. (steps per millisecond=23 ) properties seen :{}
Probabilistic random walk after 69940 steps, saw 47328 distinct states, run finished after 3002 ms. (steps per millisecond=23 ) properties seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 7589 rows 4021 cols
[2023-03-12 21:02:00] [INFO ] Computed 121 place invariants in 61 ms
[2023-03-12 21:02:00] [INFO ] After 466ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-12 21:02:01] [INFO ] [Nat]Absence check using 61 positive place invariants in 69 ms returned sat
[2023-03-12 21:02:01] [INFO ] [Nat]Absence check using 61 positive and 60 generalized place invariants in 42 ms returned sat
[2023-03-12 21:02:05] [INFO ] After 3574ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-12 21:02:05] [INFO ] State equation strengthened by 7248 read => feed constraints.
[2023-03-12 21:02:09] [INFO ] After 3909ms SMT Verify possible using 7248 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-12 21:02:12] [INFO ] After 6637ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 1878 ms.
[2023-03-12 21:02:13] [INFO ] After 13026ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 38 ms.
Support contains 158 out of 4021 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4021/4021 places, 7589/7589 transitions.
Applied a total of 0 rules in 592 ms. Remains 4021 /4021 variables (removed 0) and now considering 7589/7589 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 592 ms. Remains : 4021/4021 places, 7589/7589 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4021/4021 places, 7589/7589 transitions.
Applied a total of 0 rules in 556 ms. Remains 4021 /4021 variables (removed 0) and now considering 7589/7589 (removed 0) transitions.
[2023-03-12 21:02:15] [INFO ] Invariant cache hit.
[2023-03-12 21:02:17] [INFO ] Implicit Places using invariants in 2698 ms returned [5, 11, 19, 23, 27, 34, 42, 48, 56, 62, 68, 74, 78, 82, 86, 92, 98, 104, 115, 121, 125, 129, 135, 139, 147, 160, 166, 173, 179, 187, 193, 199, 205, 211, 215, 221, 227, 233, 239, 245, 251, 255, 261, 267, 274, 280, 284, 288, 292, 298, 304, 310, 318, 326, 332, 339, 346, 350]
Discarding 58 places :
Implicit Place search using SMT only with invariants took 2713 ms to find 58 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 3963/4021 places, 7589/7589 transitions.
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: 29
Iterating post reduction 0 with 29 rules applied. Total rules applied 29 place count 3963 transition count 7560
Reduce places removed 29 places and 0 transitions.
Iterating post reduction 1 with 29 rules applied. Total rules applied 58 place count 3934 transition count 7560
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 66 place count 3926 transition count 7552
Iterating global reduction 2 with 8 rules applied. Total rules applied 74 place count 3926 transition count 7552
Performed 45 Post agglomeration using F-continuation condition.Transition count delta: 45
Deduced a syphon composed of 45 places in 4 ms
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 2 with 90 rules applied. Total rules applied 164 place count 3881 transition count 7507
Applied a total of 164 rules in 1713 ms. Remains 3881 /3963 variables (removed 82) and now considering 7507/7589 (removed 82) transitions.
// Phase 1: matrix 7507 rows 3881 cols
[2023-03-12 21:02:19] [INFO ] Computed 63 place invariants in 154 ms
[2023-03-12 21:02:22] [INFO ] Implicit Places using invariants in 2561 ms returned []
[2023-03-12 21:02:22] [INFO ] Invariant cache hit.
[2023-03-12 21:02:24] [INFO ] Implicit Places using invariants and state equation in 2483 ms returned []
Implicit Place search using SMT with State Equation took 5046 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 3881/4021 places, 7507/7589 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 10029 ms. Remains : 3881/4021 places, 7507/7589 transitions.
Incomplete random walk after 10000 steps, including 22 resets, run finished after 225 ms. (steps per millisecond=44 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 3) 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 3) seen :0
Interrupted probabilistic random walk after 72666 steps, run timeout after 3001 ms. (steps per millisecond=24 ) properties seen :{}
Probabilistic random walk after 72666 steps, saw 46548 distinct states, run finished after 3001 ms. (steps per millisecond=24 ) properties seen :0
Running SMT prover for 3 properties.
[2023-03-12 21:02:27] [INFO ] Invariant cache hit.
[2023-03-12 21:02:28] [INFO ] After 518ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-12 21:02:29] [INFO ] [Nat]Absence check using 61 positive place invariants in 59 ms returned sat
[2023-03-12 21:02:29] [INFO ] [Nat]Absence check using 61 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-12 21:02:32] [INFO ] After 3578ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-12 21:02:32] [INFO ] State equation strengthened by 7162 read => feed constraints.
[2023-03-12 21:02:37] [INFO ] After 4120ms SMT Verify possible using 7162 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-12 21:02:39] [INFO ] After 6806ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 1687 ms.
[2023-03-12 21:02:41] [INFO ] After 12885ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 34 ms.
Support contains 158 out of 3881 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3881/3881 places, 7507/7507 transitions.
Applied a total of 0 rules in 733 ms. Remains 3881 /3881 variables (removed 0) and now considering 7507/7507 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 733 ms. Remains : 3881/3881 places, 7507/7507 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3881/3881 places, 7507/7507 transitions.
Applied a total of 0 rules in 769 ms. Remains 3881 /3881 variables (removed 0) and now considering 7507/7507 (removed 0) transitions.
[2023-03-12 21:02:42] [INFO ] Invariant cache hit.
[2023-03-12 21:02:45] [INFO ] Implicit Places using invariants in 2365 ms returned []
[2023-03-12 21:02:45] [INFO ] Invariant cache hit.
[2023-03-12 21:02:49] [INFO ] Implicit Places using invariants and state equation in 4215 ms returned []
Implicit Place search using SMT with State Equation took 6585 ms to find 0 implicit places.
[2023-03-12 21:02:50] [INFO ] Redundant transitions in 841 ms returned []
[2023-03-12 21:02:50] [INFO ] Invariant cache hit.
[2023-03-12 21:02:54] [INFO ] Dead Transitions using invariants and state equation in 4035 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12257 ms. Remains : 3881/3881 places, 7507/7507 transitions.
Graph (trivial) has 6859 edges and 3881 vertex of which 2821 / 3881 are part of one of the 48 SCC in 9 ms
Free SCC test removed 2773 places
Drop transitions removed 5498 transitions
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 5515 transitions.
Graph (complete) has 2247 edges and 1108 vertex of which 1030 are kept as prefixes of interest. Removing 78 places using SCC suffix rule.1 ms
Discarding 78 places :
Also discarding 18 output transitions
Drop transitions removed 18 transitions
Drop transitions removed 106 transitions
Reduce isomorphic transitions removed 106 transitions.
Drop transitions removed 562 transitions
Trivial Post-agglo rules discarded 562 transitions
Performed 562 trivial Post agglomeration. Transition count delta: 562
Iterating post reduction 0 with 668 rules applied. Total rules applied 670 place count 1030 transition count 1306
Reduce places removed 562 places and 0 transitions.
Ensure Unique test removed 549 transitions
Reduce isomorphic transitions removed 549 transitions.
Performed 114 Post agglomeration using F-continuation condition.Transition count delta: 114
Iterating post reduction 1 with 1225 rules applied. Total rules applied 1895 place count 468 transition count 643
Reduce places removed 114 places and 0 transitions.
Ensure Unique test removed 110 transitions
Reduce isomorphic transitions removed 110 transitions.
Iterating post reduction 2 with 224 rules applied. Total rules applied 2119 place count 354 transition count 533
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 2119 place count 354 transition count 528
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 2129 place count 349 transition count 528
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 2139 place count 339 transition count 518
Iterating global reduction 3 with 10 rules applied. Total rules applied 2149 place count 339 transition count 518
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 5 rules applied. Total rules applied 2154 place count 339 transition count 513
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 2155 place count 338 transition count 513
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 5 with 6 rules applied. Total rules applied 2161 place count 335 transition count 516
Drop transitions removed 11 transitions
Redundant transition composition rules discarded 11 transitions
Iterating global reduction 5 with 11 rules applied. Total rules applied 2172 place count 335 transition count 505
Free-agglomeration rule applied 56 times.
Iterating global reduction 5 with 56 rules applied. Total rules applied 2228 place count 335 transition count 449
Reduce places removed 56 places and 0 transitions.
Iterating post reduction 5 with 56 rules applied. Total rules applied 2284 place count 279 transition count 449
Partial Free-agglomeration rule applied 20 times.
Drop transitions removed 20 transitions
Iterating global reduction 6 with 20 rules applied. Total rules applied 2304 place count 279 transition count 449
Discarding 13 places :
Symmetric choice reduction at 6 with 13 rule applications. Total rules 2317 place count 266 transition count 436
Iterating global reduction 6 with 13 rules applied. Total rules applied 2330 place count 266 transition count 436
Reduce places removed 28 places and 28 transitions.
Iterating global reduction 6 with 28 rules applied. Total rules applied 2358 place count 238 transition count 408
Applied a total of 2358 rules in 113 ms. Remains 238 /3881 variables (removed 3643) and now considering 408/7507 (removed 7099) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 408 rows 238 cols
[2023-03-12 21:02:54] [INFO ] Computed 13 place invariants in 1 ms
[2023-03-12 21:02:54] [INFO ] After 51ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-12 21:02:54] [INFO ] [Nat]Absence check using 11 positive place invariants in 1 ms returned sat
[2023-03-12 21:02:54] [INFO ] [Nat]Absence check using 11 positive and 2 generalized place invariants in 0 ms returned sat
[2023-03-12 21:02:54] [INFO ] After 168ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-12 21:02:54] [INFO ] After 287ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 111 ms.
[2023-03-12 21:02:55] [INFO ] After 462ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
[2023-03-12 21:02:55] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 4 ms.
[2023-03-12 21:02:55] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 3881 places, 7507 transitions and 29611 arcs took 43 ms.
[2023-03-12 21:02:55] [INFO ] Flatten gal took : 457 ms
Total runtime 115139 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-sym model.pnml --lace-workers=4 --vset=lddmc --saturation=sat -rbs,w2W,ru,hf --sylvan-sizes=20,28,20,28 --invariant=/tmp/544/inv_0_ --invariant=/tmp/544/inv_1_ --invariant=/tmp/544/inv_2_ --inv-par
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393356 kB
MemFree: 12417012 kB
After kill :
MemTotal: 16393356 kB
MemFree: 16086652 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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityCardinality -timeout 360 -rebuildPNML
mcc2023

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="CANConstruction-PT-060"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="ltsminxred"
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 ltsminxred"
echo " Input is CANConstruction-PT-060, 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 r041-tajo-167813695000662"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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