Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r522-tall-167987247200321.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool marciexred
Input is Murphy-COL-D4N050, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r522-tall-167987247200321
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 396K
-rw-r--r-- 1 mcc users 5.7K Mar 23 15:21 CTLCardinality.txt
-rw-r--r-- 1 mcc users 58K Mar 23 15:21 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.1K Mar 23 15:20 CTLFireability.txt
-rw-r--r-- 1 mcc users 33K Mar 23 15:20 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.0K Mar 23 07:07 LTLCardinality.txt
-rw-r--r-- 1 mcc users 21K Mar 23 07:07 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Mar 23 07:07 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 23 07:07 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Mar 26 22:42 NewModel
-rw-r--r-- 1 mcc users 12K Mar 23 15:23 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 125K Mar 23 15:23 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.3K Mar 23 15:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 41K Mar 23 15:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 23 07:07 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 23 07:07 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 26 22:42 equiv_pt
-rw-r--r-- 1 mcc users 7 Mar 26 22:42 instance
-rw-r--r-- 1 mcc users 5 Mar 26 22:42 iscolored
-rw-r--r-- 1 mcc users 20K Mar 31 16:48 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1680891550907

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=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Murphy-COL-D4N050
Applying reductions before tool marcie
Invoking reducer
Running Version 202304061127
[2023-04-07 18:19:12] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2023-04-07 18:19:12] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-04-07 18:19:12] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2023-04-07 18:19:12] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-04-07 18:19:12] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 389 ms
[2023-04-07 18:19:12] [INFO ] Imported 6 HL places and 7 HL transitions for a total of 30 PT places and 35.0 transition bindings in 16 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 211 ms.
[2023-04-07 18:19:13] [INFO ] Built PT skeleton of HLPN with 6 places and 7 transitions 27 arcs in 4 ms.
[2023-04-07 18:19:13] [INFO ] Skeletonized 16 HLPN properties in 1 ms.
Initial state reduction rules removed 1 formulas.
FORMULA Murphy-COL-D4N050-CTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Remains 15 properties that can be checked using skeleton over-approximation.
Computed a total of 0 stabilizing places and 0 stable transitions
Incomplete random walk after 10117 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=219 ) properties (out of 47) seen :37
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 108 ms. (steps per millisecond=92 ) properties (out of 10) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 8) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 7) 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 7) seen :3
Running SMT prover for 4 properties.
// Phase 1: matrix 7 rows 6 cols
[2023-04-07 18:19:13] [INFO ] Computed 2 invariants in 4 ms
[2023-04-07 18:19:13] [INFO ] After 130ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-04-07 18:19:13] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-04-07 18:19:13] [INFO ] After 37ms SMT Verify possible using all constraints in natural domain returned unsat :4 sat :0
Fused 4 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Successfully simplified 4 atomic propositions for a total of 15 simplifications.
FORMULA Murphy-COL-D4N050-CTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Murphy-COL-D4N050-CTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-04-07 18:19:13] [INFO ] Flatten gal took : 12 ms
[2023-04-07 18:19:13] [INFO ] Flatten gal took : 2 ms
Arc [2:1*[(MOD (ADD $x 1) 5)]] contains successor/predecessor on variables of sort CD
[2023-04-07 18:19:13] [INFO ] Unfolded HLPN to a Petri net with 30 places and 35 transitions 135 arcs in 6 ms.
[2023-04-07 18:19:13] [INFO ] Unfolded 13 HLPN properties in 1 ms.
Support contains 30 out of 30 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 35/35 transitions.
Applied a total of 0 rules in 4 ms. Remains 30 /30 variables (removed 0) and now considering 35/35 (removed 0) transitions.
// Phase 1: matrix 35 rows 30 cols
[2023-04-07 18:19:13] [INFO ] Computed 6 invariants in 1 ms
[2023-04-07 18:19:13] [INFO ] Dead Transitions using invariants and state equation in 72 ms found 0 transitions.
[2023-04-07 18:19:13] [INFO ] Invariant cache hit.
[2023-04-07 18:19:13] [INFO ] Implicit Places using invariants in 35 ms returned []
[2023-04-07 18:19:13] [INFO ] Invariant cache hit.
[2023-04-07 18:19:13] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-04-07 18:19:13] [INFO ] Implicit Places using invariants and state equation in 38 ms returned []
Implicit Place search using SMT with State Equation took 74 ms to find 0 implicit places.
[2023-04-07 18:19:13] [INFO ] Invariant cache hit.
[2023-04-07 18:19:13] [INFO ] Dead Transitions using invariants and state equation in 51 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 205 ms. Remains : 30/30 places, 35/35 transitions.
Support contains 30 out of 30 places after structural reductions.
[2023-04-07 18:19:13] [INFO ] Flatten gal took : 7 ms
[2023-04-07 18:19:13] [INFO ] Flatten gal took : 6 ms
[2023-04-07 18:19:14] [INFO ] Input system was already deterministic with 35 transitions.
FORMULA Murphy-COL-D4N050-CTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10010 steps, including 2 resets, run finished after 90 ms. (steps per millisecond=111 ) properties (out of 39) seen :21
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 18) seen :0
Running SMT prover for 18 properties.
[2023-04-07 18:19:14] [INFO ] Invariant cache hit.
[2023-04-07 18:19:14] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-04-07 18:19:14] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2023-04-07 18:19:14] [INFO ] After 71ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:18
[2023-04-07 18:19:14] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-04-07 18:19:14] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2023-04-07 18:19:14] [INFO ] After 103ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :16
[2023-04-07 18:19:14] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-04-07 18:19:14] [INFO ] After 64ms SMT Verify possible using 10 Read/Feed constraints in natural domain returned unsat :2 sat :16
[2023-04-07 18:19:14] [INFO ] Deduced a trap composed of 2 places in 76 ms of which 4 ms to minimize.
[2023-04-07 18:19:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 83 ms
[2023-04-07 18:19:14] [INFO ] After 285ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :16
Attempting to minimize the solution found.
Minimization took 91 ms.
[2023-04-07 18:19:14] [INFO ] After 551ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :16
Fused 18 Parikh solutions to 16 different solutions.
Parikh walk visited 3 properties in 338 ms.
Support contains 30 out of 30 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 30/30 places, 35/35 transitions.
Applied a total of 0 rules in 11 ms. Remains 30 /30 variables (removed 0) and now considering 35/35 (removed 0) transitions.
[2023-04-07 18:19:15] [INFO ] Invariant cache hit.
[2023-04-07 18:19:15] [INFO ] Dead Transitions using invariants and state equation in 58 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 79 ms. Remains : 30/30 places, 35/35 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 119 ms. (steps per millisecond=84 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 13) 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 13) 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 13) 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 13) 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 13) 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 13) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 11) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 10) seen :0
Running SMT prover for 10 properties.
[2023-04-07 18:19:15] [INFO ] Invariant cache hit.
[2023-04-07 18:19:15] [INFO ] [Real]Absence check using 2 positive place invariants in 0 ms returned sat
[2023-04-07 18:19:15] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2023-04-07 18:19:15] [INFO ] After 103ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:10
[2023-04-07 18:19:15] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-04-07 18:19:15] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2023-04-07 18:19:15] [INFO ] After 92ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :10
[2023-04-07 18:19:15] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-04-07 18:19:15] [INFO ] After 45ms SMT Verify possible using 10 Read/Feed constraints in natural domain returned unsat :0 sat :10
[2023-04-07 18:19:16] [INFO ] Deduced a trap composed of 5 places in 30 ms of which 1 ms to minimize.
[2023-04-07 18:19:16] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 34 ms
[2023-04-07 18:19:16] [INFO ] After 131ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :10
Attempting to minimize the solution found.
Minimization took 71 ms.
[2023-04-07 18:19:16] [INFO ] After 359ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :10
Parikh walk visited 1 properties in 253 ms.
Support contains 25 out of 30 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 30/30 places, 35/35 transitions.
Applied a total of 0 rules in 2 ms. Remains 30 /30 variables (removed 0) and now considering 35/35 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 30/30 places, 35/35 transitions.
Incomplete random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 9) 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 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 23 ms. (steps per millisecond=434 ) 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
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 9) 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 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 9) 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 9) seen :0
Interrupted probabilistic random walk after 201093 steps, run timeout after 3001 ms. (steps per millisecond=67 ) properties seen :{}
Probabilistic random walk after 201093 steps, saw 137997 distinct states, run finished after 3003 ms. (steps per millisecond=66 ) properties seen :0
Running SMT prover for 9 properties.
[2023-04-07 18:19:19] [INFO ] Invariant cache hit.
[2023-04-07 18:19:19] [INFO ] [Real]Absence check using 2 positive place invariants in 0 ms returned sat
[2023-04-07 18:19:19] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 0 ms returned sat
[2023-04-07 18:19:19] [INFO ] After 34ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2023-04-07 18:19:19] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2023-04-07 18:19:19] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 5 ms returned sat
[2023-04-07 18:19:19] [INFO ] After 46ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :9
[2023-04-07 18:19:19] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-04-07 18:19:19] [INFO ] After 28ms SMT Verify possible using 10 Read/Feed constraints in natural domain returned unsat :0 sat :9
[2023-04-07 18:19:19] [INFO ] Deduced a trap composed of 2 places in 23 ms of which 1 ms to minimize.
[2023-04-07 18:19:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 35 ms
[2023-04-07 18:19:19] [INFO ] After 103ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :9
Attempting to minimize the solution found.
Minimization took 36 ms.
[2023-04-07 18:19:19] [INFO ] After 236ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :9
Parikh walk visited 0 properties in 234 ms.
Support contains 25 out of 30 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 30/30 places, 35/35 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 35/35 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 30/30 places, 35/35 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 30/30 places, 35/35 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 35/35 (removed 0) transitions.
[2023-04-07 18:19:20] [INFO ] Invariant cache hit.
[2023-04-07 18:19:20] [INFO ] Implicit Places using invariants in 35 ms returned []
[2023-04-07 18:19:20] [INFO ] Invariant cache hit.
[2023-04-07 18:19:20] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-04-07 18:19:20] [INFO ] Implicit Places using invariants and state equation in 55 ms returned []
Implicit Place search using SMT with State Equation took 90 ms to find 0 implicit places.
[2023-04-07 18:19:20] [INFO ] Redundant transitions in 1 ms returned []
[2023-04-07 18:19:20] [INFO ] Invariant cache hit.
[2023-04-07 18:19:20] [INFO ] Dead Transitions using invariants and state equation in 61 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 161 ms. Remains : 30/30 places, 35/35 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 35/35 (removed 0) transitions.
Running SMT prover for 9 properties.
[2023-04-07 18:19:20] [INFO ] Invariant cache hit.
[2023-04-07 18:19:20] [INFO ] [Real]Absence check using 2 positive place invariants in 0 ms returned sat
[2023-04-07 18:19:20] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 0 ms returned sat
[2023-04-07 18:19:20] [INFO ] After 29ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2023-04-07 18:19:20] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-04-07 18:19:20] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2023-04-07 18:19:20] [INFO ] After 48ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :9
[2023-04-07 18:19:20] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-04-07 18:19:20] [INFO ] After 33ms SMT Verify possible using 10 Read/Feed constraints in natural domain returned unsat :0 sat :9
[2023-04-07 18:19:20] [INFO ] After 84ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :9
Attempting to minimize the solution found.
Minimization took 29 ms.
[2023-04-07 18:19:20] [INFO ] After 212ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :9
Successfully simplified 2 atomic propositions for a total of 12 simplifications.
[2023-04-07 18:19:20] [INFO ] Flatten gal took : 5 ms
[2023-04-07 18:19:20] [INFO ] Flatten gal took : 4 ms
[2023-04-07 18:19:20] [INFO ] Input system was already deterministic with 35 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 35/35 transitions.
Applied a total of 0 rules in 0 ms. Remains 30 /30 variables (removed 0) and now considering 35/35 (removed 0) transitions.
[2023-04-07 18:19:20] [INFO ] Invariant cache hit.
[2023-04-07 18:19:20] [INFO ] Dead Transitions using invariants and state equation in 36 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 36 ms. Remains : 30/30 places, 35/35 transitions.
[2023-04-07 18:19:20] [INFO ] Flatten gal took : 3 ms
[2023-04-07 18:19:20] [INFO ] Flatten gal took : 2 ms
[2023-04-07 18:19:20] [INFO ] Input system was already deterministic with 35 transitions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 35/35 transitions.
Applied a total of 0 rules in 0 ms. Remains 30 /30 variables (removed 0) and now considering 35/35 (removed 0) transitions.
[2023-04-07 18:19:20] [INFO ] Invariant cache hit.
[2023-04-07 18:19:20] [INFO ] Dead Transitions using invariants and state equation in 38 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 40 ms. Remains : 30/30 places, 35/35 transitions.
[2023-04-07 18:19:20] [INFO ] Flatten gal took : 3 ms
[2023-04-07 18:19:20] [INFO ] Flatten gal took : 3 ms
[2023-04-07 18:19:20] [INFO ] Input system was already deterministic with 35 transitions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 35/35 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 35/35 (removed 0) transitions.
[2023-04-07 18:19:20] [INFO ] Invariant cache hit.
[2023-04-07 18:19:20] [INFO ] Dead Transitions using invariants and state equation in 27 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 28 ms. Remains : 30/30 places, 35/35 transitions.
[2023-04-07 18:19:20] [INFO ] Flatten gal took : 2 ms
[2023-04-07 18:19:20] [INFO ] Flatten gal took : 2 ms
[2023-04-07 18:19:20] [INFO ] Input system was already deterministic with 35 transitions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 35/35 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 35/35 (removed 0) transitions.
[2023-04-07 18:19:20] [INFO ] Invariant cache hit.
[2023-04-07 18:19:20] [INFO ] Dead Transitions using invariants and state equation in 43 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 44 ms. Remains : 30/30 places, 35/35 transitions.
[2023-04-07 18:19:20] [INFO ] Flatten gal took : 2 ms
[2023-04-07 18:19:20] [INFO ] Flatten gal took : 2 ms
[2023-04-07 18:19:20] [INFO ] Input system was already deterministic with 35 transitions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 35/35 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 35/35 (removed 0) transitions.
[2023-04-07 18:19:20] [INFO ] Invariant cache hit.
[2023-04-07 18:19:20] [INFO ] Dead Transitions using invariants and state equation in 25 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 26 ms. Remains : 30/30 places, 35/35 transitions.
[2023-04-07 18:19:20] [INFO ] Flatten gal took : 2 ms
[2023-04-07 18:19:20] [INFO ] Flatten gal took : 2 ms
[2023-04-07 18:19:20] [INFO ] Input system was already deterministic with 35 transitions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 35/35 transitions.
Applied a total of 0 rules in 0 ms. Remains 30 /30 variables (removed 0) and now considering 35/35 (removed 0) transitions.
[2023-04-07 18:19:20] [INFO ] Invariant cache hit.
[2023-04-07 18:19:20] [INFO ] Dead Transitions using invariants and state equation in 26 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 27 ms. Remains : 30/30 places, 35/35 transitions.
[2023-04-07 18:19:20] [INFO ] Flatten gal took : 2 ms
[2023-04-07 18:19:20] [INFO ] Flatten gal took : 2 ms
[2023-04-07 18:19:20] [INFO ] Input system was already deterministic with 35 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 30/30 places, 35/35 transitions.
Applied a total of 0 rules in 2 ms. Remains 30 /30 variables (removed 0) and now considering 35/35 (removed 0) transitions.
[2023-04-07 18:19:20] [INFO ] Invariant cache hit.
[2023-04-07 18:19:20] [INFO ] Dead Transitions using invariants and state equation in 30 ms found 0 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 33 ms. Remains : 30/30 places, 35/35 transitions.
[2023-04-07 18:19:20] [INFO ] Flatten gal took : 2 ms
[2023-04-07 18:19:20] [INFO ] Flatten gal took : 2 ms
[2023-04-07 18:19:20] [INFO ] Input system was already deterministic with 35 transitions.
Finished random walk after 111 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=111 )
FORMULA Murphy-COL-D4N050-CTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Parikh walk visited 0 properties in 0 ms.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 35/35 transitions.
Applied a total of 0 rules in 0 ms. Remains 30 /30 variables (removed 0) and now considering 35/35 (removed 0) transitions.
[2023-04-07 18:19:20] [INFO ] Invariant cache hit.
[2023-04-07 18:19:20] [INFO ] Dead Transitions using invariants and state equation in 26 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 27 ms. Remains : 30/30 places, 35/35 transitions.
[2023-04-07 18:19:20] [INFO ] Flatten gal took : 2 ms
[2023-04-07 18:19:20] [INFO ] Flatten gal took : 2 ms
[2023-04-07 18:19:20] [INFO ] Input system was already deterministic with 35 transitions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 35/35 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 35/35 (removed 0) transitions.
[2023-04-07 18:19:20] [INFO ] Invariant cache hit.
[2023-04-07 18:19:20] [INFO ] Dead Transitions using invariants and state equation in 27 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 29 ms. Remains : 30/30 places, 35/35 transitions.
[2023-04-07 18:19:20] [INFO ] Flatten gal took : 2 ms
[2023-04-07 18:19:20] [INFO ] Flatten gal took : 2 ms
[2023-04-07 18:19:21] [INFO ] Input system was already deterministic with 35 transitions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 35/35 transitions.
Applied a total of 0 rules in 0 ms. Remains 30 /30 variables (removed 0) and now considering 35/35 (removed 0) transitions.
[2023-04-07 18:19:21] [INFO ] Invariant cache hit.
[2023-04-07 18:19:21] [INFO ] Dead Transitions using invariants and state equation in 35 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 39 ms. Remains : 30/30 places, 35/35 transitions.
[2023-04-07 18:19:21] [INFO ] Flatten gal took : 2 ms
[2023-04-07 18:19:21] [INFO ] Flatten gal took : 2 ms
[2023-04-07 18:19:21] [INFO ] Input system was already deterministic with 35 transitions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 35/35 transitions.
Applied a total of 0 rules in 0 ms. Remains 30 /30 variables (removed 0) and now considering 35/35 (removed 0) transitions.
[2023-04-07 18:19:21] [INFO ] Invariant cache hit.
[2023-04-07 18:19:21] [INFO ] Dead Transitions using invariants and state equation in 34 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 36 ms. Remains : 30/30 places, 35/35 transitions.
[2023-04-07 18:19:21] [INFO ] Flatten gal took : 2 ms
[2023-04-07 18:19:21] [INFO ] Flatten gal took : 2 ms
[2023-04-07 18:19:21] [INFO ] Input system was already deterministic with 35 transitions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 35/35 transitions.
Applied a total of 0 rules in 2 ms. Remains 30 /30 variables (removed 0) and now considering 35/35 (removed 0) transitions.
[2023-04-07 18:19:21] [INFO ] Invariant cache hit.
[2023-04-07 18:19:21] [INFO ] Dead Transitions using invariants and state equation in 36 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 39 ms. Remains : 30/30 places, 35/35 transitions.
[2023-04-07 18:19:21] [INFO ] Flatten gal took : 1 ms
[2023-04-07 18:19:21] [INFO ] Flatten gal took : 3 ms
[2023-04-07 18:19:21] [INFO ] Input system was already deterministic with 35 transitions.
[2023-04-07 18:19:21] [INFO ] Flatten gal took : 3 ms
[2023-04-07 18:19:21] [INFO ] Flatten gal took : 3 ms
[2023-04-07 18:19:21] [INFO ] Export to MCC of 11 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 2 ms.
[2023-04-07 18:19:21] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 30 places, 35 transitions and 135 arcs took 3 ms.
Total runtime 8886 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=CTLCardinality.xml --memory=6 --mcc-mode

parse successfull
net created successfully

Net: Petri
(NrP: 30 NrTr: 35 NrArc: 135)

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

net check time: 0m 0.000sec

init dd package: 0m 2.778sec


RS generation: 1m14.074sec


-> reachability set: #nodes 80010 (8.0e+04) #states 7,258,754,799,509,878,656 (18)



starting MCC model checker
--------------------------

checking: AX [~ [sum(p24, p23, p22, p21, p20)<=sum(p9, p8, p7, p6, p5)]]
normalized: ~ [EX [sum(p24, p23, p22, p21, p20)<=sum(p9, p8, p7, p6, p5)]]

abstracting: (sum(p24, p23, p22, p21, p20)<=sum(p9, p8, p7, p6, p5))
MC time: 5m21.016sec

checking: E [sum(p4, p3, p2, p1, p0)<=13 U EX [AG [EF [~ [sum(p29, p28, p27, p26, p25)<=5]]]]]
normalized: E [sum(p4, p3, p2, p1, p0)<=13 U EX [~ [E [true U ~ [E [true U ~ [sum(p29, p28, p27, p26, p25)<=5]]]]]]]

abstracting: (sum(p29, p28, p27, p26, p25)<=5)
states: 1,286,337,977,588,041,768 (18)
.abstracting: (sum(p4, p3, p2, p1, p0)<=13)
MC time: 4m52.000sec

checking: AX [sum(p24, p23, p22, p21, p20)<=sum(p29, p28, p27, p26, p25)]
normalized: ~ [EX [~ [sum(p24, p23, p22, p21, p20)<=sum(p29, p28, p27, p26, p25)]]]

abstracting: (sum(p24, p23, p22, p21, p20)<=sum(p29, p28, p27, p26, p25))
states: 5,651,299,068,445,576,824 (18)
.-> the formula is TRUE

FORMULA Murphy-COL-D4N050-CTLCardinality-15 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m17.256sec

checking: EF [EX [[~ [sum(p29, p28, p27, p26, p25)<=sum(p4, p3, p2, p1, p0)] | ~ [sum(p29, p28, p27, p26, p25)<=62]]]]
normalized: E [true U EX [[~ [sum(p29, p28, p27, p26, p25)<=62] | ~ [sum(p29, p28, p27, p26, p25)<=sum(p4, p3, p2, p1, p0)]]]]

abstracting: (sum(p29, p28, p27, p26, p25)<=sum(p4, p3, p2, p1, p0))
MC time: 4m50.000sec

checking: [EX [~ [sum(p19, p18, p17, p16, p15)<=sum(p4, p3, p2, p1, p0)]] | EG [~ [sum(p14, p13, p12, p11, p10)<=74]]]
normalized: [EG [~ [sum(p14, p13, p12, p11, p10)<=74]] | EX [~ [sum(p19, p18, p17, p16, p15)<=sum(p4, p3, p2, p1, p0)]]]

abstracting: (sum(p19, p18, p17, p16, p15)<=sum(p4, p3, p2, p1, p0))
MC time: 4m21.000sec

checking: AX [[EX [~ [sum(p4, p3, p2, p1, p0)<=31]] & [[86<=sum(p4, p3, p2, p1, p0) | 60<=sum(p29, p28, p27, p26, p25)] & [~ [34<=sum(p29, p28, p27, p26, p25)] | EF [55<=sum(p29, p28, p27, p26, p25)]]]]]
normalized: ~ [EX [~ [[[[E [true U 55<=sum(p29, p28, p27, p26, p25)] | ~ [34<=sum(p29, p28, p27, p26, p25)]] & [86<=sum(p4, p3, p2, p1, p0) | 60<=sum(p29, p28, p27, p26, p25)]] & EX [~ [sum(p4, p3, p2, p1, p0)<=31]]]]]]

abstracting: (sum(p4, p3, p2, p1, p0)<=31)
MC time: 3m55.000sec

checking: E [~ [AF [[AF [24<=sum(p14, p13, p12, p11, p10)] | [EG [sum(p19, p18, p17, p16, p15)<=44] | AG [~ [sum(p19, p18, p17, p16, p15)<=36]]]]]] U [sum(p19, p18, p17, p16, p15)<=sum(p9, p8, p7, p6, p5) & AF [AX [[2<=sum(p14, p13, p12, p11, p10) & [sum(p14, p13, p12, p11, p10)<=sum(p19, p18, p17, p16, p15) | sum(p19, p18, p17, p16, p15)<=11]]]]]]
normalized: E [EG [~ [[[~ [E [true U sum(p19, p18, p17, p16, p15)<=36]] | EG [sum(p19, p18, p17, p16, p15)<=44]] | ~ [EG [~ [24<=sum(p14, p13, p12, p11, p10)]]]]]] U [sum(p19, p18, p17, p16, p15)<=sum(p9, p8, p7, p6, p5) & ~ [EG [EX [~ [[2<=sum(p14, p13, p12, p11, p10) & [sum(p14, p13, p12, p11, p10)<=sum(p19, p18, p17, p16, p15) | sum(p19, p18, p17, p16, p15)<=11]]]]]]]]

abstracting: (sum(p19, p18, p17, p16, p15)<=11)
states: 7,258,754,799,509,878,656 (18)
abstracting: (sum(p14, p13, p12, p11, p10)<=sum(p19, p18, p17, p16, p15))
MC time: 3m31.004sec

checking: [EG [AX [1<=0]] | EF [[[~ [E [sum(p19, p18, p17, p16, p15)<=sum(p14, p13, p12, p11, p10) U 6<=sum(p14, p13, p12, p11, p10)]] | [~ [sum(p9, p8, p7, p6, p5)<=sum(p4, p3, p2, p1, p0)] & ~ [49<=sum(p9, p8, p7, p6, p5)]]] | [~ [sum(p4, p3, p2, p1, p0)<=73] | ~ [sum(p19, p18, p17, p16, p15)<=sum(p14, p13, p12, p11, p10)]]]]]
normalized: [E [true U [[~ [sum(p19, p18, p17, p16, p15)<=sum(p14, p13, p12, p11, p10)] | ~ [sum(p4, p3, p2, p1, p0)<=73]] | [[~ [49<=sum(p9, p8, p7, p6, p5)] & ~ [sum(p9, p8, p7, p6, p5)<=sum(p4, p3, p2, p1, p0)]] | ~ [E [sum(p19, p18, p17, p16, p15)<=sum(p14, p13, p12, p11, p10) U 6<=sum(p14, p13, p12, p11, p10)]]]]] | EG [~ [EX [~ [1<=0]]]]]

abstracting: (1<=0)
states: 0
..
EG iterations: 1
abstracting: (6<=sum(p14, p13, p12, p11, p10))
MC time: 3m10.005sec

checking: [[EF [AG [AF [sum(p24, p23, p22, p21, p20)<=sum(p29, p28, p27, p26, p25)]]] | ~ [A [E [sum(p4, p3, p2, p1, p0)<=sum(p29, p28, p27, p26, p25) U EG [sum(p14, p13, p12, p11, p10)<=sum(p9, p8, p7, p6, p5)]] U AX [E [sum(p9, p8, p7, p6, p5)<=sum(p24, p23, p22, p21, p20) U 99<=sum(p4, p3, p2, p1, p0)]]]]] | [AF [[AF [~ [sum(p29, p28, p27, p26, p25)<=19]] & EX [89<=sum(p9, p8, p7, p6, p5)]]] | AX [AF [~ [sum(p9, p8, p7, p6, p5)<=27]]]]]
normalized: [[~ [EX [EG [sum(p9, p8, p7, p6, p5)<=27]]] | ~ [EG [~ [[EX [89<=sum(p9, p8, p7, p6, p5)] & ~ [EG [sum(p29, p28, p27, p26, p25)<=19]]]]]]] | [~ [[~ [EG [EX [~ [E [sum(p9, p8, p7, p6, p5)<=sum(p24, p23, p22, p21, p20) U 99<=sum(p4, p3, p2, p1, p0)]]]]] & ~ [E [EX [~ [E [sum(p9, p8, p7, p6, p5)<=sum(p24, p23, p22, p21, p20) U 99<=sum(p4, p3, p2, p1, p0)]]] U [~ [E [sum(p4, p3, p2, p1, p0)<=sum(p29, p28, p27, p26, p25) U EG [sum(p14, p13, p12, p11, p10)<=sum(p9, p8, p7, p6, p5)]]] & EX [~ [E [sum(p9, p8, p7, p6, p5)<=sum(p24, p23, p22, p21, p20) U 99<=sum(p4, p3, p2, p1, p0)]]]]]]]] | E [true U ~ [E [true U EG [~ [sum(p24, p23, p22, p21, p20)<=sum(p29, p28, p27, p26, p25)]]]]]]]

abstracting: (sum(p24, p23, p22, p21, p20)<=sum(p29, p28, p27, p26, p25))
states: 5,651,299,068,445,576,824 (18)
..
EG iterations: 2
abstracting: (99<=sum(p4, p3, p2, p1, p0))
MC time: 2m51.001sec

checking: AG [[~ [E [AX [sum(p19, p18, p17, p16, p15)<=33] U [AX [sum(p4, p3, p2, p1, p0)<=sum(p19, p18, p17, p16, p15)] & sum(p14, p13, p12, p11, p10)<=75]]] | [[sum(p29, p28, p27, p26, p25)<=96 & [sum(p24, p23, p22, p21, p20)<=sum(p14, p13, p12, p11, p10) & ~ [sum(p19, p18, p17, p16, p15)<=10]]] & [[sum(p29, p28, p27, p26, p25)<=99 & sum(p4, p3, p2, p1, p0)<=30] & [sum(p4, p3, p2, p1, p0)<=sum(p24, p23, p22, p21, p20) & ~ [sum(p4, p3, p2, p1, p0)<=9]]]]]]
normalized: ~ [E [true U ~ [[[[[sum(p4, p3, p2, p1, p0)<=sum(p24, p23, p22, p21, p20) & ~ [sum(p4, p3, p2, p1, p0)<=9]] & [sum(p29, p28, p27, p26, p25)<=99 & sum(p4, p3, p2, p1, p0)<=30]] & [sum(p29, p28, p27, p26, p25)<=96 & [sum(p24, p23, p22, p21, p20)<=sum(p14, p13, p12, p11, p10) & ~ [sum(p19, p18, p17, p16, p15)<=10]]]] | ~ [E [~ [EX [~ [sum(p19, p18, p17, p16, p15)<=33]]] U [sum(p14, p13, p12, p11, p10)<=75 & ~ [EX [~ [sum(p4, p3, p2, p1, p0)<=sum(p19, p18, p17, p16, p15)]]]]]]]]]]

abstracting: (sum(p4, p3, p2, p1, p0)<=sum(p19, p18, p17, p16, p15))
MC time: 2m34.000sec

checking: A [A [EF [[AG [[12<=sum(p9, p8, p7, p6, p5) & 53<=sum(p9, p8, p7, p6, p5)]] | [sum(p24, p23, p22, p21, p20)<=sum(p14, p13, p12, p11, p10) | ~ [sum(p14, p13, p12, p11, p10)<=29]]]] U [AG [[62<=sum(p4, p3, p2, p1, p0) & 28<=sum(p9, p8, p7, p6, p5)]] | [sum(p9, p8, p7, p6, p5)<=93 | [sum(p4, p3, p2, p1, p0)<=sum(p19, p18, p17, p16, p15) & sum(p9, p8, p7, p6, p5)<=sum(p24, p23, p22, p21, p20)]]]] U AX [AX [A [[sum(p24, p23, p22, p21, p20)<=sum(p29, p28, p27, p26, p25) | sum(p19, p18, p17, p16, p15)<=sum(p24, p23, p22, p21, p20)] U AX [sum(p14, p13, p12, p11, p10)<=sum(p24, p23, p22, p21, p20)]]]]]
normalized: [~ [EG [EX [EX [~ [[~ [E [EX [~ [sum(p14, p13, p12, p11, p10)<=sum(p24, p23, p22, p21, p20)]] U [~ [[sum(p24, p23, p22, p21, p20)<=sum(p29, p28, p27, p26, p25) | sum(p19, p18, p17, p16, p15)<=sum(p24, p23, p22, p21, p20)]] & EX [~ [sum(p14, p13, p12, p11, p10)<=sum(p24, p23, p22, p21, p20)]]]]] & ~ [EG [EX [~ [sum(p14, p13, p12, p11, p10)<=sum(p24, p23, p22, p21, p20)]]]]]]]]]] & ~ [E [EX [EX [~ [[~ [E [EX [~ [sum(p14, p13, p12, p11, p10)<=sum(p24, p23, p22, p21, p20)]] U [~ [[sum(p24, p23, p22, p21, p20)<=sum(p29, p28, p27, p26, p25) | sum(p19, p18, p17, p16, p15)<=sum(p24, p23, p22, p21, p20)]] & EX [~ [sum(p14, p13, p12, p11, p10)<=sum(p24, p23, p22, p21, p20)]]]]] & ~ [EG [EX [~ [sum(p14, p13, p12, p11, p10)<=sum(p24, p23, p22, p21, p20)]]]]]]]] U [EX [EX [~ [[~ [E [EX [~ [sum(p14, p13, p12, p11, p10)<=sum(p24, p23, p22, p21, p20)]] U [~ [[sum(p24, p23, p22, p21, p20)<=sum(p29, p28, p27, p26, p25) | sum(p19, p18, p17, p16, p15)<=sum(p24, p23, p22, p21, p20)]] & EX [~ [sum(p14, p13, p12, p11, p10)<=sum(p24, p23, p22, p21, p20)]]]]] & ~ [EG [EX [~ [sum(p14, p13, p12, p11, p10)<=sum(p24, p23, p22, p21, p20)]]]]]]]] & ~ [[~ [EG [~ [[[sum(p9, p8, p7, p6, p5)<=93 | [sum(p4, p3, p2, p1, p0)<=sum(p19, p18, p17, p16, p15) & sum(p9, p8, p7, p6, p5)<=sum(p24, p23, p22, p21, p20)]] | ~ [E [true U ~ [[62<=sum(p4, p3, p2, p1, p0) & 28<=sum(p9, p8, p7, p6, p5)]]]]]]]] & ~ [E [~ [[[sum(p9, p8, p7, p6, p5)<=93 | [sum(p4, p3, p2, p1, p0)<=sum(p19, p18, p17, p16, p15) & sum(p9, p8, p7, p6, p5)<=sum(p24, p23, p22, p21, p20)]] | ~ [E [true U ~ [[62<=sum(p4, p3, p2, p1, p0) & 28<=sum(p9, p8, p7, p6, p5)]]]]]] U [~ [E [true U [[sum(p24, p23, p22, p21, p20)<=sum(p14, p13, p12, p11, p10) | ~ [sum(p14, p13, p12, p11, p10)<=29]] | ~ [E [true U ~ [[12<=sum(p9, p8, p7, p6, p5) & 53<=sum(p9, p8, p7, p6, p5)]]]]]]] & ~ [[[sum(p9, p8, p7, p6, p5)<=93 | [sum(p4, p3, p2, p1, p0)<=sum(p19, p18, p17, p16, p15) & sum(p9, p8, p7, p6, p5)<=sum(p24, p23, p22, p21, p20)]] | ~ [E [true U ~ [[62<=sum(p4, p3, p2, p1, p0) & 28<=sum(p9, p8, p7, p6, p5)]]]]]]]]]]]]]]]

abstracting: (28<=sum(p9, p8, p7, p6, p5))
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 2956528 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16102096 kB

BK_TIME_CONFINEMENT_REACHED

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLCardinality -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.000sec


iterations count:45332 (1295), effective:8976 (256)

initing FirstDep: 0m 0.000sec


idd.h:1025: Timeout: after 320 sec


iterations count:59 (1), effective:6 (0)

idd.h:1025: Timeout: after 291 sec


idd.h:1025: Timeout: after 289 sec


idd.h:1025: Timeout: after 260 sec


idd.h:1025: Timeout: after 234 sec


idd.h:1025: Timeout: after 210 sec


idd.h:1025: Timeout: after 189 sec


iterations count:83 (2), effective:13 (0)

idd.h:1025: Timeout: after 170 sec


idd.h:1025: Timeout: after 153 sec


idd.h:1025: Timeout: after 138 sec

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="Murphy-COL-D4N050"
export BK_EXAMINATION="CTLCardinality"
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 Murphy-COL-D4N050, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r522-tall-167987247200321"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/Murphy-COL-D4N050.tgz
mv Murphy-COL-D4N050 execution
cd execution
if [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "UpperBounds" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] || [ "CTLCardinality" = "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 [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "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 "CTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLCardinality.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 '' CTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLCardinality"
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 ;