fond
Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r042-tajo-167813696000647
Last Updated
May 14, 2023

About the Execution of Marcie+red for CANConstruction-PT-040

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
9663.632 3600000.00 3660035.00 476.90 TF?T?FTTTTFFFTF? normal

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-167813696000647.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-040, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r042-tajo-167813696000647
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.9M
-rw-r--r-- 1 mcc users 11K Feb 25 21:25 CTLCardinality.txt
-rw-r--r-- 1 mcc users 94K Feb 25 21:25 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.3K Feb 25 21:20 CTLFireability.txt
-rw-r--r-- 1 mcc users 63K Feb 25 21:20 CTLFireability.xml
-rw-r--r-- 1 mcc users 5.1K Feb 25 15:40 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 15:40 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.1K Feb 25 15:40 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 15:40 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 25 21:27 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 79K Feb 25 21:27 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Feb 25 21:26 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 72K Feb 25 21:26 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Feb 25 15:40 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K 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 2.5M 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-040-ReachabilityFireability-00
FORMULA_NAME CANConstruction-PT-040-ReachabilityFireability-01
FORMULA_NAME CANConstruction-PT-040-ReachabilityFireability-02
FORMULA_NAME CANConstruction-PT-040-ReachabilityFireability-03
FORMULA_NAME CANConstruction-PT-040-ReachabilityFireability-04
FORMULA_NAME CANConstruction-PT-040-ReachabilityFireability-05
FORMULA_NAME CANConstruction-PT-040-ReachabilityFireability-06
FORMULA_NAME CANConstruction-PT-040-ReachabilityFireability-07
FORMULA_NAME CANConstruction-PT-040-ReachabilityFireability-08
FORMULA_NAME CANConstruction-PT-040-ReachabilityFireability-09
FORMULA_NAME CANConstruction-PT-040-ReachabilityFireability-10
FORMULA_NAME CANConstruction-PT-040-ReachabilityFireability-11
FORMULA_NAME CANConstruction-PT-040-ReachabilityFireability-12
FORMULA_NAME CANConstruction-PT-040-ReachabilityFireability-13
FORMULA_NAME CANConstruction-PT-040-ReachabilityFireability-14
FORMULA_NAME CANConstruction-PT-040-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1678737779266

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=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CANConstruction-PT-040
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-13 20:03:01] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-03-13 20:03:01] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-13 20:03:01] [INFO ] Load time of PNML (sax parser for PT used): 200 ms
[2023-03-13 20:03:01] [INFO ] Transformed 3682 places.
[2023-03-13 20:03:01] [INFO ] Transformed 6720 transitions.
[2023-03-13 20:03:01] [INFO ] Parsed PT model containing 3682 places and 6720 transitions and 20000 arcs in 346 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 17 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 14 resets, run finished after 773 ms. (steps per millisecond=12 ) properties (out of 16) seen :7
FORMULA CANConstruction-PT-040-ReachabilityFireability-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-040-ReachabilityFireability-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-040-ReachabilityFireability-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-040-ReachabilityFireability-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-040-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-040-ReachabilityFireability-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-040-ReachabilityFireability-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 9) 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 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 9) 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 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 9) 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 9) 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 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 9) seen :0
Running SMT prover for 9 properties.
// Phase 1: matrix 6720 rows 3682 cols
[2023-03-13 20:03:03] [INFO ] Computed 81 place invariants in 81 ms
[2023-03-13 20:03:04] [INFO ] [Real]Absence check using 41 positive place invariants in 125 ms returned sat
[2023-03-13 20:03:05] [INFO ] [Real]Absence check using 41 positive and 40 generalized place invariants in 44 ms returned sat
[2023-03-13 20:03:05] [INFO ] After 1670ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2023-03-13 20:03:06] [INFO ] [Nat]Absence check using 41 positive place invariants in 83 ms returned sat
[2023-03-13 20:03:06] [INFO ] [Nat]Absence check using 41 positive and 40 generalized place invariants in 51 ms returned sat
[2023-03-13 20:03:11] [INFO ] After 4512ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :8
[2023-03-13 20:03:11] [INFO ] State equation strengthened by 3160 read => feed constraints.
[2023-03-13 20:03:15] [INFO ] After 3599ms SMT Verify possible using 3160 Read/Feed constraints in natural domain returned unsat :1 sat :8
[2023-03-13 20:03:19] [INFO ] After 8196ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :8
Attempting to minimize the solution found.
Minimization took 3462 ms.
[2023-03-13 20:03:23] [INFO ] After 17995ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :8
FORMULA CANConstruction-PT-040-ReachabilityFireability-03 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 9 Parikh solutions to 8 different solutions.
Parikh walk visited 0 properties in 289 ms.
Support contains 161 out of 3682 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3682/3682 places, 6720/6720 transitions.
Drop transitions removed 197 transitions
Trivial Post-agglo rules discarded 197 transitions
Performed 197 trivial Post agglomeration. Transition count delta: 197
Iterating post reduction 0 with 197 rules applied. Total rules applied 197 place count 3682 transition count 6523
Reduce places removed 197 places and 0 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Iterating post reduction 1 with 204 rules applied. Total rules applied 401 place count 3485 transition count 6516
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 408 place count 3478 transition count 6516
Performed 25 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 25 Pre rules applied. Total rules applied 408 place count 3478 transition count 6491
Deduced a syphon composed of 25 places in 12 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 3 with 50 rules applied. Total rules applied 458 place count 3453 transition count 6491
Discarding 1467 places :
Symmetric choice reduction at 3 with 1467 rule applications. Total rules 1925 place count 1986 transition count 3557
Iterating global reduction 3 with 1467 rules applied. Total rules applied 3392 place count 1986 transition count 3557
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Deduced a syphon composed of 13 places in 3 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 3 with 26 rules applied. Total rules applied 3418 place count 1973 transition count 3544
Free-agglomeration rule applied 20 times.
Iterating global reduction 3 with 20 rules applied. Total rules applied 3438 place count 1973 transition count 3524
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 3 with 20 rules applied. Total rules applied 3458 place count 1953 transition count 3524
Free-agglomeration rule (complex) applied 38 times.
Iterating global reduction 4 with 38 rules applied. Total rules applied 3496 place count 1953 transition count 3486
Reduce places removed 38 places and 0 transitions.
Iterating post reduction 4 with 38 rules applied. Total rules applied 3534 place count 1915 transition count 3486
Partial Free-agglomeration rule applied 81 times.
Drop transitions removed 81 transitions
Iterating global reduction 5 with 81 rules applied. Total rules applied 3615 place count 1915 transition count 3486
Partial Free-agglomeration rule applied 20 times.
Drop transitions removed 20 transitions
Iterating global reduction 5 with 20 rules applied. Total rules applied 3635 place count 1915 transition count 3486
Applied a total of 3635 rules in 2119 ms. Remains 1915 /3682 variables (removed 1767) and now considering 3486/6720 (removed 3234) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2120 ms. Remains : 1915/3682 places, 3486/6720 transitions.
Incomplete random walk after 10000 steps, including 31 resets, run finished after 249 ms. (steps per millisecond=40 ) properties (out of 8) seen :5
FORMULA CANConstruction-PT-040-ReachabilityFireability-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-040-ReachabilityFireability-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-040-ReachabilityFireability-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-040-ReachabilityFireability-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-040-ReachabilityFireability-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
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
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 3486 rows 1915 cols
[2023-03-13 20:03:25] [INFO ] Computed 81 place invariants in 16 ms
[2023-03-13 20:03:26] [INFO ] [Real]Absence check using 41 positive place invariants in 79 ms returned sat
[2023-03-13 20:03:26] [INFO ] [Real]Absence check using 41 positive and 40 generalized place invariants in 15 ms returned sat
[2023-03-13 20:03:26] [INFO ] After 520ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-13 20:03:26] [INFO ] [Nat]Absence check using 41 positive place invariants in 43 ms returned sat
[2023-03-13 20:03:26] [INFO ] [Nat]Absence check using 41 positive and 40 generalized place invariants in 12 ms returned sat
[2023-03-13 20:03:28] [INFO ] After 1291ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-13 20:03:28] [INFO ] State equation strengthened by 3217 read => feed constraints.
[2023-03-13 20:03:29] [INFO ] After 1423ms SMT Verify possible using 3217 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-13 20:03:31] [INFO ] After 2785ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 779 ms.
[2023-03-13 20:03:31] [INFO ] After 5244ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 57 ms.
Support contains 100 out of 1915 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1915/1915 places, 3486/3486 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 1915 transition count 3485
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 2 rules applied. Total rules applied 3 place count 1914 transition count 3484
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 4 place count 1913 transition count 3484
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 4 place count 1913 transition count 3483
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 6 place count 1912 transition count 3483
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 11 place count 1907 transition count 3473
Iterating global reduction 3 with 5 rules applied. Total rules applied 16 place count 1907 transition count 3473
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Deduced a syphon composed of 24 places in 1 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 3 with 48 rules applied. Total rules applied 64 place count 1883 transition count 3449
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 0
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 74 place count 1878 transition count 3449
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 75 place count 1878 transition count 3448
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 76 place count 1877 transition count 3448
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 4 with 2 rules applied. Total rules applied 78 place count 1877 transition count 3446
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 80 place count 1875 transition count 3446
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 5 with 3 rules applied. Total rules applied 83 place count 1875 transition count 3446
Applied a total of 83 rules in 1148 ms. Remains 1875 /1915 variables (removed 40) and now considering 3446/3486 (removed 40) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1150 ms. Remains : 1875/1915 places, 3446/3486 transitions.
Incomplete random walk after 10000 steps, including 32 resets, run finished after 175 ms. (steps per millisecond=57 ) properties (out of 3) 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 3) 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 3) 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 3) seen :0
Interrupted probabilistic random walk after 142190 steps, run timeout after 3001 ms. (steps per millisecond=47 ) properties seen :{}
Probabilistic random walk after 142190 steps, saw 61198 distinct states, run finished after 3003 ms. (steps per millisecond=47 ) properties seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 3446 rows 1875 cols
[2023-03-13 20:03:36] [INFO ] Computed 81 place invariants in 30 ms
[2023-03-13 20:03:36] [INFO ] [Real]Absence check using 41 positive place invariants in 25 ms returned sat
[2023-03-13 20:03:36] [INFO ] [Real]Absence check using 41 positive and 40 generalized place invariants in 12 ms returned sat
[2023-03-13 20:03:36] [INFO ] After 430ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-13 20:03:37] [INFO ] [Nat]Absence check using 41 positive place invariants in 24 ms returned sat
[2023-03-13 20:03:37] [INFO ] [Nat]Absence check using 41 positive and 40 generalized place invariants in 12 ms returned sat
[2023-03-13 20:03:38] [INFO ] After 1083ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-13 20:03:38] [INFO ] State equation strengthened by 3246 read => feed constraints.
[2023-03-13 20:03:39] [INFO ] After 1109ms SMT Verify possible using 3246 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-13 20:03:40] [INFO ] After 2013ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 767 ms.
[2023-03-13 20:03:41] [INFO ] After 4219ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 13 ms.
Support contains 100 out of 1875 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1875/1875 places, 3446/3446 transitions.
Applied a total of 0 rules in 137 ms. Remains 1875 /1875 variables (removed 0) and now considering 3446/3446 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 137 ms. Remains : 1875/1875 places, 3446/3446 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1875/1875 places, 3446/3446 transitions.
Applied a total of 0 rules in 169 ms. Remains 1875 /1875 variables (removed 0) and now considering 3446/3446 (removed 0) transitions.
[2023-03-13 20:03:41] [INFO ] Invariant cache hit.
[2023-03-13 20:03:42] [INFO ] Implicit Places using invariants in 1097 ms returned [5, 11, 17, 23, 30, 36, 42, 52, 65, 72, 78, 84, 91, 96, 100, 107, 111, 119, 123, 129, 133, 140, 146, 151, 156, 162, 169, 182, 188, 192, 198, 203, 210, 217, 223, 230, 236, 243]
Discarding 38 places :
Implicit Place search using SMT only with invariants took 1116 ms to find 38 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 1837/1875 places, 3446/3446 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 1837 transition count 3442
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 1833 transition count 3442
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 22 place count 1819 transition count 3428
Iterating global reduction 2 with 14 rules applied. Total rules applied 36 place count 1819 transition count 3428
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 58 place count 1808 transition count 3417
Applied a total of 58 rules in 456 ms. Remains 1808 /1837 variables (removed 29) and now considering 3417/3446 (removed 29) transitions.
// Phase 1: matrix 3417 rows 1808 cols
[2023-03-13 20:03:42] [INFO ] Computed 43 place invariants in 33 ms
[2023-03-13 20:03:44] [INFO ] Implicit Places using invariants in 1072 ms returned []
[2023-03-13 20:03:44] [INFO ] Invariant cache hit.
[2023-03-13 20:03:44] [INFO ] State equation strengthened by 3184 read => feed constraints.
[2023-03-13 20:04:02] [INFO ] Implicit Places using invariants and state equation in 18856 ms returned []
Implicit Place search using SMT with State Equation took 19963 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 1808/1875 places, 3417/3446 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 21706 ms. Remains : 1808/1875 places, 3417/3446 transitions.
Incomplete random walk after 10000 steps, including 32 resets, run finished after 216 ms. (steps per millisecond=46 ) properties (out of 3) 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 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) 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
Interrupted probabilistic random walk after 126933 steps, run timeout after 3001 ms. (steps per millisecond=42 ) properties seen :{}
Probabilistic random walk after 126933 steps, saw 55580 distinct states, run finished after 3001 ms. (steps per millisecond=42 ) properties seen :0
Running SMT prover for 3 properties.
[2023-03-13 20:04:06] [INFO ] Invariant cache hit.
[2023-03-13 20:04:06] [INFO ] [Real]Absence check using 41 positive place invariants in 33 ms returned sat
[2023-03-13 20:04:06] [INFO ] [Real]Absence check using 41 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-13 20:04:06] [INFO ] After 381ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-13 20:04:06] [INFO ] [Nat]Absence check using 41 positive place invariants in 33 ms returned sat
[2023-03-13 20:04:06] [INFO ] [Nat]Absence check using 41 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-13 20:04:08] [INFO ] After 1192ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-13 20:04:08] [INFO ] State equation strengthened by 3184 read => feed constraints.
[2023-03-13 20:04:09] [INFO ] After 1311ms SMT Verify possible using 3184 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-13 20:04:10] [INFO ] After 2320ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 830 ms.
[2023-03-13 20:04:11] [INFO ] After 4725ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 25 ms.
Support contains 100 out of 1808 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1808/1808 places, 3417/3417 transitions.
Applied a total of 0 rules in 223 ms. Remains 1808 /1808 variables (removed 0) and now considering 3417/3417 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 223 ms. Remains : 1808/1808 places, 3417/3417 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1808/1808 places, 3417/3417 transitions.
Applied a total of 0 rules in 232 ms. Remains 1808 /1808 variables (removed 0) and now considering 3417/3417 (removed 0) transitions.
[2023-03-13 20:04:11] [INFO ] Invariant cache hit.
[2023-03-13 20:04:12] [INFO ] Implicit Places using invariants in 1137 ms returned []
[2023-03-13 20:04:12] [INFO ] Invariant cache hit.
[2023-03-13 20:04:13] [INFO ] State equation strengthened by 3184 read => feed constraints.
[2023-03-13 20:04:30] [INFO ] Implicit Places using invariants and state equation in 17680 ms returned []
Implicit Place search using SMT with State Equation took 18823 ms to find 0 implicit places.
[2023-03-13 20:04:30] [INFO ] Redundant transitions in 246 ms returned []
[2023-03-13 20:04:30] [INFO ] Invariant cache hit.
[2023-03-13 20:04:32] [INFO ] Dead Transitions using invariants and state equation in 1401 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20746 ms. Remains : 1808/1808 places, 3417/3417 transitions.
Graph (trivial) has 2485 edges and 1808 vertex of which 834 / 1808 are part of one of the 21 SCC in 4 ms
Free SCC test removed 813 places
Drop transitions removed 1605 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 1607 transitions.
Graph (complete) has 1967 edges and 995 vertex of which 980 are kept as prefixes of interest. Removing 15 places using SCC suffix rule.1 ms
Discarding 15 places :
Also discarding 0 output transitions
Drop transitions removed 77 transitions
Trivial Post-agglo rules discarded 77 transitions
Performed 77 trivial Post agglomeration. Transition count delta: 77
Iterating post reduction 0 with 77 rules applied. Total rules applied 79 place count 980 transition count 1733
Reduce places removed 77 places and 0 transitions.
Ensure Unique test removed 75 transitions
Reduce isomorphic transitions removed 75 transitions.
Performed 632 Post agglomeration using F-continuation condition.Transition count delta: 632
Iterating post reduction 1 with 784 rules applied. Total rules applied 863 place count 903 transition count 1026
Reduce places removed 632 places and 0 transitions.
Ensure Unique test removed 615 transitions
Reduce isomorphic transitions removed 615 transitions.
Iterating post reduction 2 with 1247 rules applied. Total rules applied 2110 place count 271 transition count 411
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 2110 place count 271 transition count 410
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 2112 place count 270 transition count 410
Discarding 17 places :
Symmetric choice reduction at 3 with 17 rule applications. Total rules 2129 place count 253 transition count 390
Iterating global reduction 3 with 17 rules applied. Total rules applied 2146 place count 253 transition count 390
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 2149 place count 253 transition count 387
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 2151 place count 251 transition count 383
Iterating global reduction 4 with 2 rules applied. Total rules applied 2153 place count 251 transition count 383
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 4 with 20 rules applied. Total rules applied 2173 place count 241 transition count 373
Drop transitions removed 29 transitions
Redundant transition composition rules discarded 29 transitions
Iterating global reduction 4 with 29 rules applied. Total rules applied 2202 place count 241 transition count 344
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -14
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 2212 place count 236 transition count 358
Free-agglomeration rule applied 17 times.
Iterating global reduction 4 with 17 rules applied. Total rules applied 2229 place count 236 transition count 341
Reduce places removed 17 places and 0 transitions.
Iterating post reduction 4 with 17 rules applied. Total rules applied 2246 place count 219 transition count 341
Partial Free-agglomeration rule applied 32 times.
Drop transitions removed 32 transitions
Iterating global reduction 5 with 32 rules applied. Total rules applied 2278 place count 219 transition count 341
Applied a total of 2278 rules in 196 ms. Remains 219 /1808 variables (removed 1589) and now considering 341/3417 (removed 3076) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 341 rows 219 cols
[2023-03-13 20:04:32] [INFO ] Computed 28 place invariants in 2 ms
[2023-03-13 20:04:32] [INFO ] [Real]Absence check using 26 positive place invariants in 4 ms returned sat
[2023-03-13 20:04:32] [INFO ] [Real]Absence check using 26 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-13 20:04:32] [INFO ] After 57ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-13 20:04:32] [INFO ] [Nat]Absence check using 26 positive place invariants in 3 ms returned sat
[2023-03-13 20:04:32] [INFO ] [Nat]Absence check using 26 positive and 2 generalized place invariants in 0 ms returned sat
[2023-03-13 20:04:32] [INFO ] After 129ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-13 20:04:32] [INFO ] After 214ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 76 ms.
[2023-03-13 20:04:32] [INFO ] After 350ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
[2023-03-13 20:04:32] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 4 ms.
[2023-03-13 20:04:32] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1808 places, 3417 transitions and 13357 arcs took 26 ms.
[2023-03-13 20:04:33] [INFO ] Flatten gal took : 238 ms
Total runtime 92217 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=ReachabilityFireability.xml --memory=6 --mcc-mode

parse successfull
net created successfully

Net: gen
(NrP: 1808 NrTr: 3417 NrArc: 13357)

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

net check time: 0m 0.001sec

init dd package: 0m 2.918sec

TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393356 kB
MemFree: 6481668 kB
After kill :
MemTotal: 16393356 kB
MemFree: 16100112 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 ReachabilityFireability -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.021sec

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-040"
export BK_EXAMINATION="ReachabilityFireability"
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-040, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r042-tajo-167813696000647"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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