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.r042-tajo-167813696100662.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 marciexred
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 r042-tajo-167813696100662
=====================================================================

--------------------
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 1678739283769

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=marciexred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CANConstruction-PT-060
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-13 20:28:05] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-13 20:28:05] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-13 20:28:05] [INFO ] Load time of PNML (sax parser for PT used): 318 ms
[2023-03-13 20:28:05] [INFO ] Transformed 7922 places.
[2023-03-13 20:28:05] [INFO ] Transformed 14880 transitions.
[2023-03-13 20:28:05] [INFO ] Parsed PT model containing 7922 places and 14880 transitions and 44400 arcs in 457 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 27 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 9 resets, run finished after 644 ms. (steps per millisecond=15 ) properties (out of 16) seen :5
FORMULA CANConstruction-PT-060-ReachabilityCardinality-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-060-ReachabilityCardinality-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-060-ReachabilityCardinality-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-060-ReachabilityCardinality-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-060-ReachabilityCardinality-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 11) 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 11) 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 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 105 ms. (steps per millisecond=95 ) properties (out of 11) 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 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 11) 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 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 11) 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 11) seen :0
Running SMT prover for 11 properties.
// Phase 1: matrix 14880 rows 7922 cols
[2023-03-13 20:28:07] [INFO ] Computed 121 place invariants in 184 ms
[2023-03-13 20:28:10] [INFO ] [Real]Absence check using 61 positive place invariants in 233 ms returned sat
[2023-03-13 20:28:10] [INFO ] [Real]Absence check using 61 positive and 60 generalized place invariants in 167 ms returned sat
[2023-03-13 20:28:10] [INFO ] After 3163ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:11
[2023-03-13 20:28:13] [INFO ] [Nat]Absence check using 61 positive place invariants in 136 ms returned sat
[2023-03-13 20:28:13] [INFO ] [Nat]Absence check using 61 positive and 60 generalized place invariants in 91 ms returned sat
[2023-03-13 20:28:24] [INFO ] After 10472ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :9
[2023-03-13 20:28:25] [INFO ] State equation strengthened by 7140 read => feed constraints.
[2023-03-13 20:28:34] [INFO ] After 9548ms SMT Verify possible using 7140 Read/Feed constraints in natural domain returned unsat :2 sat :9
[2023-03-13 20:28:35] [INFO ] After 10791ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :8
Attempting to minimize the solution found.
Minimization took 11 ms.
[2023-03-13 20:28:35] [INFO ] After 25045ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :8
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 11 Parikh solutions to 9 different solutions.
FORMULA CANConstruction-PT-060-ReachabilityCardinality-14 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA CANConstruction-PT-060-ReachabilityCardinality-03 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA CANConstruction-PT-060-ReachabilityCardinality-07 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 3 properties in 283 ms.
Support contains 240 out of 7922 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 7922/7922 places, 14880/14880 transitions.
Drop transitions removed 322 transitions
Trivial Post-agglo rules discarded 322 transitions
Performed 322 trivial Post agglomeration. Transition count delta: 322
Iterating post reduction 0 with 322 rules applied. Total rules applied 322 place count 7922 transition count 14558
Reduce places removed 322 places and 0 transitions.
Performed 70 Post agglomeration using F-continuation condition.Transition count delta: 70
Iterating post reduction 1 with 392 rules applied. Total rules applied 714 place count 7600 transition count 14488
Reduce places removed 70 places and 0 transitions.
Iterating post reduction 2 with 70 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 5 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 3365 places :
Symmetric choice reduction at 3 with 3365 rule applications. Total rules 4169 place count 4155 transition count 7748
Iterating global reduction 3 with 3365 rules applied. Total rules applied 7534 place count 4155 transition count 7748
Performed 46 Post agglomeration using F-continuation condition.Transition count delta: 46
Deduced a syphon composed of 46 places in 4 ms
Reduce places removed 46 places and 0 transitions.
Iterating global reduction 3 with 92 rules applied. Total rules applied 7626 place count 4109 transition count 7702
Free-agglomeration rule applied 14 times.
Iterating global reduction 3 with 14 rules applied. Total rules applied 7640 place count 4109 transition count 7688
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 3 with 14 rules applied. Total rules applied 7654 place count 4095 transition count 7688
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 7655 place count 4095 transition count 7687
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 7656 place count 4094 transition count 7687
Partial Free-agglomeration rule applied 115 times.
Drop transitions removed 115 transitions
Iterating global reduction 5 with 115 rules applied. Total rules applied 7771 place count 4094 transition count 7687
Partial Free-agglomeration rule applied 9 times.
Drop transitions removed 9 transitions
Iterating global reduction 5 with 9 rules applied. Total rules applied 7780 place count 4094 transition count 7687
Applied a total of 7780 rules in 4990 ms. Remains 4094 /7922 variables (removed 3828) and now considering 7687/14880 (removed 7193) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4994 ms. Remains : 4094/7922 places, 7687/14880 transitions.
Incomplete random walk after 10000 steps, including 21 resets, run finished after 365 ms. (steps per millisecond=27 ) properties (out of 6) seen :3
FORMULA CANConstruction-PT-060-ReachabilityCardinality-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-060-ReachabilityCardinality-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-060-ReachabilityCardinality-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 3) 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 3) 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 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 7687 rows 4094 cols
[2023-03-13 20:28:41] [INFO ] Computed 121 place invariants in 60 ms
[2023-03-13 20:28:42] [INFO ] After 763ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-13 20:28:43] [INFO ] [Nat]Absence check using 61 positive place invariants in 112 ms returned sat
[2023-03-13 20:28:43] [INFO ] [Nat]Absence check using 61 positive and 60 generalized place invariants in 50 ms returned sat
[2023-03-13 20:28:47] [INFO ] After 3466ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-13 20:28:47] [INFO ] State equation strengthened by 7231 read => feed constraints.
[2023-03-13 20:28:50] [INFO ] After 3121ms SMT Verify possible using 7231 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-13 20:28:52] [INFO ] After 5565ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 1770 ms.
[2023-03-13 20:28:54] [INFO ] After 11959ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 25 ms.
Support contains 158 out of 4094 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4094/4094 places, 7687/7687 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 4094 transition count 7683
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 4090 transition count 7683
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 22 place count 4076 transition count 7655
Iterating global reduction 2 with 14 rules applied. Total rules applied 36 place count 4076 transition count 7655
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Deduced a syphon composed of 24 places in 2 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 2 with 48 rules applied. Total rules applied 84 place count 4052 transition count 7631
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 11 places in 2 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 106 place count 4041 transition count 7634
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 108 place count 4041 transition count 7632
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 110 place count 4039 transition count 7632
Applied a total of 110 rules in 2677 ms. Remains 4039 /4094 variables (removed 55) and now considering 7632/7687 (removed 55) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2677 ms. Remains : 4039/4094 places, 7632/7687 transitions.
Incomplete random walk after 10000 steps, including 22 resets, run finished after 203 ms. (steps per millisecond=49 ) properties (out of 3) 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 3) 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 3) 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 3) seen :0
Interrupted probabilistic random walk after 217246 steps, run timeout after 3004 ms. (steps per millisecond=72 ) properties seen :{}
Probabilistic random walk after 217246 steps, saw 216082 distinct states, run finished after 3005 ms. (steps per millisecond=72 ) properties seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 7632 rows 4039 cols
[2023-03-13 20:29:00] [INFO ] Computed 121 place invariants in 40 ms
[2023-03-13 20:29:01] [INFO ] After 506ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-13 20:29:01] [INFO ] [Nat]Absence check using 61 positive place invariants in 109 ms returned sat
[2023-03-13 20:29:01] [INFO ] [Nat]Absence check using 61 positive and 60 generalized place invariants in 44 ms returned sat
[2023-03-13 20:29:05] [INFO ] After 3381ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-13 20:29:05] [INFO ] State equation strengthened by 7281 read => feed constraints.
[2023-03-13 20:29:08] [INFO ] After 3189ms SMT Verify possible using 7281 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-13 20:29:11] [INFO ] After 5947ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 1713 ms.
[2023-03-13 20:29:13] [INFO ] After 12001ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 35 ms.
Support contains 158 out of 4039 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4039/4039 places, 7632/7632 transitions.
Applied a total of 0 rules in 606 ms. Remains 4039 /4039 variables (removed 0) and now considering 7632/7632 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 606 ms. Remains : 4039/4039 places, 7632/7632 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4039/4039 places, 7632/7632 transitions.
Applied a total of 0 rules in 457 ms. Remains 4039 /4039 variables (removed 0) and now considering 7632/7632 (removed 0) transitions.
[2023-03-13 20:29:14] [INFO ] Invariant cache hit.
[2023-03-13 20:29:16] [INFO ] Implicit Places using invariants in 2445 ms returned []
[2023-03-13 20:29:16] [INFO ] Invariant cache hit.
[2023-03-13 20:29:18] [INFO ] State equation strengthened by 7281 read => feed constraints.
[2023-03-13 20:29:18] [INFO ] Implicit Places using invariants and state equation in 1818 ms returned []
Implicit Place search using SMT with State Equation took 4267 ms to find 0 implicit places.
[2023-03-13 20:29:19] [INFO ] Redundant transitions in 1055 ms returned []
[2023-03-13 20:29:19] [INFO ] Invariant cache hit.
[2023-03-13 20:29:23] [INFO ] Dead Transitions using invariants and state equation in 4389 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10181 ms. Remains : 4039/4039 places, 7632/7632 transitions.
Graph (trivial) has 6900 edges and 4039 vertex of which 2847 / 4039 are part of one of the 48 SCC in 9 ms
Free SCC test removed 2799 places
Drop transitions removed 5524 transitions
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 5534 transitions.
Graph (complete) has 2521 edges and 1240 vertex of which 1065 are kept as prefixes of interest. Removing 175 places using SCC suffix rule.2 ms
Discarding 175 places :
Also discarding 68 output transitions
Drop transitions removed 68 transitions
Drop transitions removed 136 transitions
Reduce isomorphic transitions removed 136 transitions.
Drop transitions removed 561 transitions
Trivial Post-agglo rules discarded 561 transitions
Performed 561 trivial Post agglomeration. Transition count delta: 561
Iterating post reduction 0 with 697 rules applied. Total rules applied 699 place count 1065 transition count 1333
Reduce places removed 561 places and 0 transitions.
Ensure Unique test removed 548 transitions
Reduce isomorphic transitions removed 548 transitions.
Performed 122 Post agglomeration using F-continuation condition.Transition count delta: 122
Iterating post reduction 1 with 1231 rules applied. Total rules applied 1930 place count 504 transition count 663
Reduce places removed 122 places and 0 transitions.
Ensure Unique test removed 109 transitions
Reduce isomorphic transitions removed 109 transitions.
Iterating post reduction 2 with 231 rules applied. Total rules applied 2161 place count 382 transition count 554
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 13 Pre rules applied. Total rules applied 2161 place count 382 transition count 541
Deduced a syphon composed of 13 places in 1 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 3 with 26 rules applied. Total rules applied 2187 place count 369 transition count 541
Discarding 17 places :
Symmetric choice reduction at 3 with 17 rule applications. Total rules 2204 place count 352 transition count 524
Iterating global reduction 3 with 17 rules applied. Total rules applied 2221 place count 352 transition count 524
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 3 with 9 rules applied. Total rules applied 2230 place count 350 transition count 517
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 2232 place count 348 transition count 517
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 2232 place count 348 transition count 516
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 2234 place count 347 transition count 516
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 2236 place count 345 transition count 514
Iterating global reduction 5 with 2 rules applied. Total rules applied 2238 place count 345 transition count 514
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 2242 place count 343 transition count 512
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 5 with 16 rules applied. Total rules applied 2258 place count 335 transition count 510
Drop transitions removed 11 transitions
Redundant transition composition rules discarded 11 transitions
Iterating global reduction 5 with 11 rules applied. Total rules applied 2269 place count 335 transition count 499
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 5 with 1 rules applied. Total rules applied 2270 place count 334 transition count 499
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 2271 place count 333 transition count 498
Iterating global reduction 6 with 1 rules applied. Total rules applied 2272 place count 333 transition count 498
Free-agglomeration rule applied 56 times.
Iterating global reduction 6 with 56 rules applied. Total rules applied 2328 place count 333 transition count 442
Reduce places removed 56 places and 0 transitions.
Iterating post reduction 6 with 56 rules applied. Total rules applied 2384 place count 277 transition count 442
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 7 with 2 rules applied. Total rules applied 2386 place count 277 transition count 440
Partial Free-agglomeration rule applied 12 times.
Drop transitions removed 12 transitions
Iterating global reduction 7 with 12 rules applied. Total rules applied 2398 place count 277 transition count 440
Discarding 5 places :
Symmetric choice reduction at 7 with 5 rule applications. Total rules 2403 place count 272 transition count 435
Iterating global reduction 7 with 5 rules applied. Total rules applied 2408 place count 272 transition count 435
Reduce places removed 22 places and 22 transitions.
Iterating global reduction 7 with 22 rules applied. Total rules applied 2430 place count 250 transition count 413
Applied a total of 2430 rules in 168 ms. Remains 250 /4039 variables (removed 3789) and now considering 413/7632 (removed 7219) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 413 rows 250 cols
[2023-03-13 20:29:24] [INFO ] Computed 20 place invariants in 1 ms
[2023-03-13 20:29:24] [INFO ] After 55ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-13 20:29:24] [INFO ] [Nat]Absence check using 17 positive place invariants in 1 ms returned sat
[2023-03-13 20:29:24] [INFO ] [Nat]Absence check using 17 positive and 3 generalized place invariants in 1 ms returned sat
[2023-03-13 20:29:24] [INFO ] After 155ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-13 20:29:24] [INFO ] After 260ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 89 ms.
[2023-03-13 20:29:24] [INFO ] After 412ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
[2023-03-13 20:29:24] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 4 ms.
[2023-03-13 20:29:24] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 4039 places, 7632 transitions and 30249 arcs took 38 ms.
[2023-03-13 20:29:25] [INFO ] Flatten gal took : 428 ms
Total runtime 79847 ms.
There are residual formulas that ITS could not solve within timeout
timeout --kill-after=10s --signal=SIGINT 1m for testing only

Marcie built on Linux at 2019-11-18.
A model checker for Generalized Stochastic Petri nets

authors: Alex Tovchigrechko (IDD package and CTL model checking)

Martin Schwarick (Symbolic numerical analysis and CSL model checking)

Christian Rohr (Simulative and approximative numerical model checking)

marcie@informatik.tu-cottbus.de

called as: /home/mcc/BenchKit/bin//../reducer/bin//../../marcie/bin/marcie --net-file=model.pnml --mcc-file=ReachabilityCardinality.xml --memory=6 --mcc-mode

parse successfull
net created successfully

Net: gen
(NrP: 4039 NrTr: 7632 NrArc: 30249)

parse formulas
formulas created successfully
place and transition orderings generation:0m 3.261sec

net check time: 0m 0.008sec

init dd package: 0m 3.317sec

TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393340 kB
MemFree: 6950076 kB
After kill :
MemTotal: 16393340 kB
MemFree: 16091940 kB

BK_TIME_CONFINEMENT_REACHED

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityCardinality -timeout 360 -rebuildPNML
check for maximal unmarked siphon
ok
check for constant places
ok
check if there are places and transitions
ok
check if there are transitions without pre-places
ok
check if at least one transition is enabled in m0
ok
check if there are transitions that can never fire
ok


initing FirstDep: 0m 0.099sec

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="marciexred"
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 marciexred"
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 r042-tajo-167813696100662"
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 ;