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-167987247200289.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-D2N050, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r522-tall-167987247200289
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 476K
-rw-r--r-- 1 mcc users 6.4K Mar 23 15:21 CTLCardinality.txt
-rw-r--r-- 1 mcc users 70K Mar 23 15:21 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K Mar 23 15:20 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K Mar 23 15:20 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Mar 23 07:07 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Mar 23 07:07 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Mar 23 07:07 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K 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 128K Mar 23 15:23 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.7K Mar 23 15:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 84K 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-D2N050-CTLCardinality-00
FORMULA_NAME Murphy-COL-D2N050-CTLCardinality-01
FORMULA_NAME Murphy-COL-D2N050-CTLCardinality-02
FORMULA_NAME Murphy-COL-D2N050-CTLCardinality-03
FORMULA_NAME Murphy-COL-D2N050-CTLCardinality-04
FORMULA_NAME Murphy-COL-D2N050-CTLCardinality-05
FORMULA_NAME Murphy-COL-D2N050-CTLCardinality-06
FORMULA_NAME Murphy-COL-D2N050-CTLCardinality-07
FORMULA_NAME Murphy-COL-D2N050-CTLCardinality-08
FORMULA_NAME Murphy-COL-D2N050-CTLCardinality-09
FORMULA_NAME Murphy-COL-D2N050-CTLCardinality-10
FORMULA_NAME Murphy-COL-D2N050-CTLCardinality-11
FORMULA_NAME Murphy-COL-D2N050-CTLCardinality-12
FORMULA_NAME Murphy-COL-D2N050-CTLCardinality-13
FORMULA_NAME Murphy-COL-D2N050-CTLCardinality-14
FORMULA_NAME Murphy-COL-D2N050-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1680887837872

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-D2N050
Applying reductions before tool marcie
Invoking reducer
Running Version 202304061127
[2023-04-07 17:17:19] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2023-04-07 17:17:19] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-04-07 17:17:19] [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 17:17:19] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-04-07 17:17:19] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 506 ms
[2023-04-07 17:17:19] [INFO ] Imported 6 HL places and 7 HL transitions for a total of 18 PT places and 21.0 transition bindings in 16 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 16 ms.
[2023-04-07 17:17:19] [INFO ] Built PT skeleton of HLPN with 6 places and 7 transitions 27 arcs in 3 ms.
[2023-04-07 17:17:19] [INFO ] Skeletonized 16 HLPN properties in 2 ms.
Initial state reduction rules removed 2 formulas.
FORMULA Murphy-COL-D2N050-CTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Murphy-COL-D2N050-CTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Remains 14 properties that can be checked using skeleton over-approximation.
Computed a total of 0 stabilizing places and 0 stable transitions
Incomplete random walk after 10137 steps, including 2 resets, run finished after 85 ms. (steps per millisecond=119 ) properties (out of 63) seen :42
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 21) seen :7
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 14) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 13) 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 13) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 13) seen :0
Running SMT prover for 13 properties.
// Phase 1: matrix 7 rows 6 cols
[2023-04-07 17:17:20] [INFO ] Computed 2 invariants in 4 ms
[2023-04-07 17:17:20] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-04-07 17:17:20] [INFO ] After 153ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:13
[2023-04-07 17:17:20] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2023-04-07 17:17:20] [INFO ] After 23ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :13
[2023-04-07 17:17:20] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-04-07 17:17:20] [INFO ] After 18ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :13
[2023-04-07 17:17:20] [INFO ] After 40ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :13
Attempting to minimize the solution found.
Minimization took 19 ms.
[2023-04-07 17:17:20] [INFO ] After 139ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :13
Finished Parikh walk after 161 steps, including 3 resets, run visited all 1 properties in 1 ms. (steps per millisecond=161 )
Parikh walk visited 13 properties in 45 ms.
[2023-04-07 17:17:20] [INFO ] Flatten gal took : 13 ms
[2023-04-07 17:17:20] [INFO ] Flatten gal took : 2 ms
Arc [2:1*[(MOD (ADD $x 1) 3)]] contains successor/predecessor on variables of sort CD
[2023-04-07 17:17:20] [INFO ] Unfolded HLPN to a Petri net with 18 places and 21 transitions 81 arcs in 10 ms.
[2023-04-07 17:17:20] [INFO ] Unfolded 14 HLPN properties in 1 ms.
Support contains 18 out of 18 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 18/18 places, 21/21 transitions.
Applied a total of 0 rules in 7 ms. Remains 18 /18 variables (removed 0) and now considering 21/21 (removed 0) transitions.
// Phase 1: matrix 21 rows 18 cols
[2023-04-07 17:17:20] [INFO ] Computed 4 invariants in 2 ms
[2023-04-07 17:17:20] [INFO ] Dead Transitions using invariants and state equation in 31 ms found 0 transitions.
[2023-04-07 17:17:20] [INFO ] Invariant cache hit.
[2023-04-07 17:17:20] [INFO ] Implicit Places using invariants in 26 ms returned []
[2023-04-07 17:17:20] [INFO ] Invariant cache hit.
[2023-04-07 17:17:20] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-04-07 17:17:20] [INFO ] Implicit Places using invariants and state equation in 59 ms returned []
Implicit Place search using SMT with State Equation took 87 ms to find 0 implicit places.
[2023-04-07 17:17:20] [INFO ] Invariant cache hit.
[2023-04-07 17:17:20] [INFO ] Dead Transitions using invariants and state equation in 42 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 169 ms. Remains : 18/18 places, 21/21 transitions.
Support contains 18 out of 18 places after structural reductions.
[2023-04-07 17:17:20] [INFO ] Flatten gal took : 4 ms
[2023-04-07 17:17:20] [INFO ] Flatten gal took : 4 ms
[2023-04-07 17:17:20] [INFO ] Input system was already deterministic with 21 transitions.
Incomplete random walk after 10048 steps, including 2 resets, run finished after 100 ms. (steps per millisecond=100 ) properties (out of 63) seen :31
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 32) 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 32) 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 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 32) 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 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 32) 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 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 32) 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 32) 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 32) 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 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 32) 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 32) seen :0
Running SMT prover for 32 properties.
[2023-04-07 17:17:21] [INFO ] Invariant cache hit.
[2023-04-07 17:17:21] [INFO ] [Real]Absence check using 2 positive place invariants in 0 ms returned sat
[2023-04-07 17:17:21] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 2 ms returned sat
[2023-04-07 17:17:21] [INFO ] After 84ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:32
[2023-04-07 17:17:21] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-04-07 17:17:21] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-04-07 17:17:21] [INFO ] After 162ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :32
[2023-04-07 17:17:21] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-04-07 17:17:21] [INFO ] After 81ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :0 sat :32
[2023-04-07 17:17:21] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
[2023-04-07 17:17:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 28 ms
[2023-04-07 17:17:21] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 1 ms to minimize.
[2023-04-07 17:17:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 25 ms
[2023-04-07 17:17:21] [INFO ] Deduced a trap composed of 2 places in 16 ms of which 2 ms to minimize.
[2023-04-07 17:17:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 22 ms
[2023-04-07 17:17:21] [INFO ] Deduced a trap composed of 2 places in 16 ms of which 0 ms to minimize.
[2023-04-07 17:17:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 20 ms
[2023-04-07 17:17:21] [INFO ] After 273ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :32
Attempting to minimize the solution found.
Minimization took 66 ms.
[2023-04-07 17:17:21] [INFO ] After 580ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :32
Parikh walk visited 1 properties in 590 ms.
Support contains 18 out of 18 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 18/18 places, 21/21 transitions.
Applied a total of 0 rules in 5 ms. Remains 18 /18 variables (removed 0) and now considering 21/21 (removed 0) transitions.
[2023-04-07 17:17:22] [INFO ] Invariant cache hit.
[2023-04-07 17:17:22] [INFO ] Dead Transitions using invariants and state equation in 31 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 37 ms. Remains : 18/18 places, 21/21 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 31) 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 31) 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 31) 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 31) 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 31) 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 31) 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 31) 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 31) 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 31) 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 31) 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 31) 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 31) 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 31) 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 31) 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 31) 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 31) 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 31) 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 31) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 31) 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 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 31) 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 31) 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 31) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 31) 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 31) 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 31) 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 31) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 31) 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 31) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 31) seen :0
Interrupted probabilistic random walk after 176638 steps, run timeout after 3001 ms. (steps per millisecond=58 ) properties seen :{}
Probabilistic random walk after 176638 steps, saw 113104 distinct states, run finished after 3002 ms. (steps per millisecond=58 ) properties seen :0
Running SMT prover for 31 properties.
[2023-04-07 17:17:25] [INFO ] Invariant cache hit.
[2023-04-07 17:17:25] [INFO ] [Real]Absence check using 2 positive place invariants in 0 ms returned sat
[2023-04-07 17:17:25] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 0 ms returned sat
[2023-04-07 17:17:25] [INFO ] After 58ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:31
[2023-04-07 17:17:25] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-04-07 17:17:25] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-04-07 17:17:25] [INFO ] After 66ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :31
[2023-04-07 17:17:25] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-04-07 17:17:26] [INFO ] After 84ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :0 sat :31
[2023-04-07 17:17:26] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
[2023-04-07 17:17:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 26 ms
[2023-04-07 17:17:26] [INFO ] After 208ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :31
Attempting to minimize the solution found.
Minimization took 64 ms.
[2023-04-07 17:17:26] [INFO ] After 408ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :31
Parikh walk visited 0 properties in 418 ms.
Support contains 18 out of 18 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 18/18 places, 21/21 transitions.
Applied a total of 0 rules in 1 ms. Remains 18 /18 variables (removed 0) and now considering 21/21 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 18/18 places, 21/21 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 18/18 places, 21/21 transitions.
Applied a total of 0 rules in 1 ms. Remains 18 /18 variables (removed 0) and now considering 21/21 (removed 0) transitions.
[2023-04-07 17:17:26] [INFO ] Invariant cache hit.
[2023-04-07 17:17:26] [INFO ] Implicit Places using invariants in 17 ms returned []
[2023-04-07 17:17:26] [INFO ] Invariant cache hit.
[2023-04-07 17:17:26] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-04-07 17:17:26] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 44 ms to find 0 implicit places.
[2023-04-07 17:17:26] [INFO ] Redundant transitions in 0 ms returned []
[2023-04-07 17:17:26] [INFO ] Invariant cache hit.
[2023-04-07 17:17:26] [INFO ] Dead Transitions using invariants and state equation in 30 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 84 ms. Remains : 18/18 places, 21/21 transitions.
Applied a total of 0 rules in 1 ms. Remains 18 /18 variables (removed 0) and now considering 21/21 (removed 0) transitions.
Running SMT prover for 31 properties.
[2023-04-07 17:17:26] [INFO ] Invariant cache hit.
[2023-04-07 17:17:26] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-04-07 17:17:26] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-04-07 17:17:26] [INFO ] After 59ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:31
[2023-04-07 17:17:26] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-04-07 17:17:26] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-04-07 17:17:26] [INFO ] After 82ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :31
[2023-04-07 17:17:26] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-04-07 17:17:26] [INFO ] After 61ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :0 sat :31
[2023-04-07 17:17:27] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
[2023-04-07 17:17:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 26 ms
[2023-04-07 17:17:27] [INFO ] Deduced a trap composed of 2 places in 23 ms of which 0 ms to minimize.
[2023-04-07 17:17:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 38 ms
[2023-04-07 17:17:27] [INFO ] After 201ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :31
Attempting to minimize the solution found.
Minimization took 58 ms.
[2023-04-07 17:17:27] [INFO ] After 411ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :31
[2023-04-07 17:17:27] [INFO ] Flatten gal took : 2 ms
[2023-04-07 17:17:27] [INFO ] Flatten gal took : 3 ms
[2023-04-07 17:17:27] [INFO ] Input system was already deterministic with 21 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 18/18 places, 21/21 transitions.
Applied a total of 0 rules in 1 ms. Remains 18 /18 variables (removed 0) and now considering 21/21 (removed 0) transitions.
[2023-04-07 17:17:27] [INFO ] Invariant cache hit.
[2023-04-07 17:17:27] [INFO ] Dead Transitions using invariants and state equation in 30 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31 ms. Remains : 18/18 places, 21/21 transitions.
[2023-04-07 17:17:27] [INFO ] Flatten gal took : 2 ms
[2023-04-07 17:17:27] [INFO ] Flatten gal took : 1 ms
[2023-04-07 17:17:27] [INFO ] Input system was already deterministic with 21 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 18/18 places, 21/21 transitions.
Applied a total of 0 rules in 2 ms. Remains 18 /18 variables (removed 0) and now considering 21/21 (removed 0) transitions.
[2023-04-07 17:17:27] [INFO ] Invariant cache hit.
[2023-04-07 17:17:27] [INFO ] Dead Transitions using invariants and state equation in 28 ms found 0 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 31 ms. Remains : 18/18 places, 21/21 transitions.
[2023-04-07 17:17:27] [INFO ] Flatten gal took : 3 ms
[2023-04-07 17:17:27] [INFO ] Flatten gal took : 2 ms
[2023-04-07 17:17:27] [INFO ] Input system was already deterministic with 21 transitions.
Starting structural reductions in LTL mode, iteration 0 : 18/18 places, 21/21 transitions.
Applied a total of 0 rules in 0 ms. Remains 18 /18 variables (removed 0) and now considering 21/21 (removed 0) transitions.
[2023-04-07 17:17:27] [INFO ] Invariant cache hit.
[2023-04-07 17:17:27] [INFO ] Dead Transitions using invariants and state equation in 31 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 32 ms. Remains : 18/18 places, 21/21 transitions.
[2023-04-07 17:17:27] [INFO ] Flatten gal took : 3 ms
[2023-04-07 17:17:27] [INFO ] Flatten gal took : 3 ms
[2023-04-07 17:17:27] [INFO ] Input system was already deterministic with 21 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 18/18 places, 21/21 transitions.
Applied a total of 0 rules in 1 ms. Remains 18 /18 variables (removed 0) and now considering 21/21 (removed 0) transitions.
[2023-04-07 17:17:27] [INFO ] Invariant cache hit.
[2023-04-07 17:17:27] [INFO ] Dead Transitions using invariants and state equation in 27 ms found 0 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 29 ms. Remains : 18/18 places, 21/21 transitions.
[2023-04-07 17:17:27] [INFO ] Flatten gal took : 2 ms
[2023-04-07 17:17:27] [INFO ] Flatten gal took : 1 ms
[2023-04-07 17:17:27] [INFO ] Input system was already deterministic with 21 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 2394488 steps, run timeout after 3001 ms. (steps per millisecond=797 ) properties seen :{}
Probabilistic random walk after 2394488 steps, saw 1509024 distinct states, run finished after 3001 ms. (steps per millisecond=797 ) properties seen :0
Running SMT prover for 1 properties.
[2023-04-07 17:17:30] [INFO ] Invariant cache hit.
[2023-04-07 17:17:30] [INFO ] After 29ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-07 17:17:30] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-04-07 17:17:30] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-04-07 17:17:30] [INFO ] After 10ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-07 17:17:30] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-04-07 17:17:30] [INFO ] After 4ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-07 17:17:30] [INFO ] After 8ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 3 ms.
[2023-04-07 17:17:30] [INFO ] After 42ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 65 ms.
Support contains 9 out of 18 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 18/18 places, 21/21 transitions.
Applied a total of 0 rules in 1 ms. Remains 18 /18 variables (removed 0) and now considering 21/21 (removed 0) transitions.
[2023-04-07 17:17:30] [INFO ] Invariant cache hit.
[2023-04-07 17:17:30] [INFO ] Dead Transitions using invariants and state equation in 29 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 31 ms. Remains : 18/18 places, 21/21 transitions.
Incomplete random walk after 100000 steps, including 2 resets, run finished after 87 ms. (steps per millisecond=1149 ) properties (out of 2) seen :1
Running SMT prover for 1 properties.
[2023-04-07 17:17:30] [INFO ] Invariant cache hit.
[2023-04-07 17:17:30] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-04-07 17:17:30] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 3 ms returned sat
[2023-04-07 17:17:30] [INFO ] After 7ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-04-07 17:17:30] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-04-07 17:17:30] [INFO ] After 2ms SMT Verify possible using 6 Read/Feed constraints in real domain returned unsat :0 sat :1
[2023-04-07 17:17:30] [INFO ] After 5ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-07 17:17:30] [INFO ] After 35ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-07 17:17:30] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-04-07 17:17:30] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-04-07 17:17:30] [INFO ] After 6ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-07 17:17:30] [INFO ] After 1ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-07 17:17:30] [INFO ] After 4ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 1 ms.
[2023-04-07 17:17:30] [INFO ] After 30ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Incomplete random walk after 1000007 steps, including 2 resets, run finished after 462 ms. (steps per millisecond=2164 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 524 ms. (steps per millisecond=1908 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 2563593 steps, run timeout after 3001 ms. (steps per millisecond=854 ) properties seen :{}
Probabilistic random walk after 2563593 steps, saw 1613165 distinct states, run finished after 3001 ms. (steps per millisecond=854 ) properties seen :0
Running SMT prover for 1 properties.
[2023-04-07 17:17:34] [INFO ] Invariant cache hit.
[2023-04-07 17:17:34] [INFO ] After 22ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-07 17:17:34] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2023-04-07 17:17:34] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-04-07 17:17:34] [INFO ] After 17ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-07 17:17:34] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-04-07 17:17:34] [INFO ] After 5ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-07 17:17:34] [INFO ] After 8ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 3 ms.
[2023-04-07 17:17:34] [INFO ] After 60ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 54 ms.
Support contains 9 out of 18 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 18/18 places, 21/21 transitions.
Applied a total of 0 rules in 1 ms. Remains 18 /18 variables (removed 0) and now considering 21/21 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 18/18 places, 21/21 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 18/18 places, 21/21 transitions.
Applied a total of 0 rules in 1 ms. Remains 18 /18 variables (removed 0) and now considering 21/21 (removed 0) transitions.
[2023-04-07 17:17:34] [INFO ] Invariant cache hit.
[2023-04-07 17:17:34] [INFO ] Implicit Places using invariants in 25 ms returned []
[2023-04-07 17:17:34] [INFO ] Invariant cache hit.
[2023-04-07 17:17:34] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-04-07 17:17:34] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 50 ms to find 0 implicit places.
[2023-04-07 17:17:34] [INFO ] Redundant transitions in 0 ms returned []
[2023-04-07 17:17:34] [INFO ] Invariant cache hit.
[2023-04-07 17:17:34] [INFO ] Dead Transitions using invariants and state equation in 28 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 87 ms. Remains : 18/18 places, 21/21 transitions.
Incomplete random walk after 100000 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=2631 ) properties (out of 2) seen :1
Running SMT prover for 1 properties.
[2023-04-07 17:17:35] [INFO ] Invariant cache hit.
[2023-04-07 17:17:35] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-04-07 17:17:35] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 2 ms returned sat
[2023-04-07 17:17:35] [INFO ] After 11ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-04-07 17:17:35] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-04-07 17:17:35] [INFO ] After 2ms SMT Verify possible using 6 Read/Feed constraints in real domain returned unsat :0 sat :1
[2023-04-07 17:17:35] [INFO ] After 4ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-07 17:17:35] [INFO ] After 42ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-07 17:17:35] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-04-07 17:17:35] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-04-07 17:17:35] [INFO ] After 7ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-07 17:17:35] [INFO ] After 2ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-07 17:17:35] [INFO ] After 4ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 1 ms.
[2023-04-07 17:17:35] [INFO ] After 35ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished random walk after 109 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=109 )
Parikh walk visited 0 properties in 0 ms.
Incomplete random walk after 10016 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=2003 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 2389781 steps, run timeout after 3001 ms. (steps per millisecond=796 ) properties seen :{}
Probabilistic random walk after 2389781 steps, saw 1505835 distinct states, run finished after 3001 ms. (steps per millisecond=796 ) properties seen :0
Running SMT prover for 1 properties.
[2023-04-07 17:17:38] [INFO ] Invariant cache hit.
[2023-04-07 17:17:38] [INFO ] [Real]Absence check using 2 positive place invariants in 0 ms returned sat
[2023-04-07 17:17:38] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-04-07 17:17:38] [INFO ] After 30ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-07 17:17:38] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-04-07 17:17:38] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-04-07 17:17:38] [INFO ] After 8ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-07 17:17:38] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-04-07 17:17:38] [INFO ] After 11ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-07 17:17:38] [INFO ] After 14ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 7 ms.
[2023-04-07 17:17:38] [INFO ] After 48ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 3 out of 18 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 18/18 places, 21/21 transitions.
Graph (complete) has 69 edges and 18 vertex of which 9 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.8 ms
Discarding 9 places :
Also discarding 6 output transitions
Drop transitions removed 6 transitions
Drop transitions removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 4 place count 9 transition count 12
Applied a total of 4 rules in 11 ms. Remains 9 /18 variables (removed 9) and now considering 12/21 (removed 9) transitions.
// Phase 1: matrix 12 rows 9 cols
[2023-04-07 17:17:38] [INFO ] Computed 0 invariants in 0 ms
[2023-04-07 17:17:38] [INFO ] Dead Transitions using invariants and state equation in 18 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 34 ms. Remains : 9/18 places, 12/21 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Probably explored full state space saw : 216 states, properties seen :0
Probabilistic random walk after 1080 steps, saw 216 distinct states, run finished after 7 ms. (steps per millisecond=154 ) properties seen :0
Explored full state space saw : 216 states, properties seen :0
Exhaustive walk after 1080 steps, saw 216 distinct states, run finished after 18 ms. (steps per millisecond=60 ) properties seen :0
Parikh walk visited 0 properties in 0 ms.
Successfully simplified 1 atomic propositions using reductions for a total of 1 simplifications.
FORMULA Murphy-COL-D2N050-CTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Starting structural reductions in LTL mode, iteration 0 : 18/18 places, 21/21 transitions.
Applied a total of 0 rules in 0 ms. Remains 18 /18 variables (removed 0) and now considering 21/21 (removed 0) transitions.
// Phase 1: matrix 21 rows 18 cols
[2023-04-07 17:17:38] [INFO ] Computed 4 invariants in 1 ms
[2023-04-07 17:17:38] [INFO ] Dead Transitions using invariants and state equation in 24 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 24 ms. Remains : 18/18 places, 21/21 transitions.
[2023-04-07 17:17:38] [INFO ] Flatten gal took : 1 ms
[2023-04-07 17:17:38] [INFO ] Flatten gal took : 1 ms
[2023-04-07 17:17:38] [INFO ] Input system was already deterministic with 21 transitions.
Starting structural reductions in LTL mode, iteration 0 : 18/18 places, 21/21 transitions.
Applied a total of 0 rules in 0 ms. Remains 18 /18 variables (removed 0) and now considering 21/21 (removed 0) transitions.
[2023-04-07 17:17:38] [INFO ] Invariant cache hit.
[2023-04-07 17:17:38] [INFO ] Dead Transitions using invariants and state equation in 23 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 24 ms. Remains : 18/18 places, 21/21 transitions.
[2023-04-07 17:17:38] [INFO ] Flatten gal took : 2 ms
[2023-04-07 17:17:38] [INFO ] Flatten gal took : 2 ms
[2023-04-07 17:17:38] [INFO ] Input system was already deterministic with 21 transitions.
Starting structural reductions in LTL mode, iteration 0 : 18/18 places, 21/21 transitions.
Applied a total of 0 rules in 0 ms. Remains 18 /18 variables (removed 0) and now considering 21/21 (removed 0) transitions.
[2023-04-07 17:17:38] [INFO ] Invariant cache hit.
[2023-04-07 17:17:38] [INFO ] Dead Transitions using invariants and state equation in 20 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 21 ms. Remains : 18/18 places, 21/21 transitions.
[2023-04-07 17:17:38] [INFO ] Flatten gal took : 1 ms
[2023-04-07 17:17:38] [INFO ] Flatten gal took : 1 ms
[2023-04-07 17:17:38] [INFO ] Input system was already deterministic with 21 transitions.
Starting structural reductions in LTL mode, iteration 0 : 18/18 places, 21/21 transitions.
Applied a total of 0 rules in 1 ms. Remains 18 /18 variables (removed 0) and now considering 21/21 (removed 0) transitions.
[2023-04-07 17:17:38] [INFO ] Invariant cache hit.
[2023-04-07 17:17:38] [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 : 18/18 places, 21/21 transitions.
[2023-04-07 17:17:38] [INFO ] Flatten gal took : 2 ms
[2023-04-07 17:17:38] [INFO ] Flatten gal took : 2 ms
[2023-04-07 17:17:38] [INFO ] Input system was already deterministic with 21 transitions.
Starting structural reductions in LTL mode, iteration 0 : 18/18 places, 21/21 transitions.
Applied a total of 0 rules in 0 ms. Remains 18 /18 variables (removed 0) and now considering 21/21 (removed 0) transitions.
[2023-04-07 17:17:38] [INFO ] Invariant cache hit.
[2023-04-07 17:17:38] [INFO ] Dead Transitions using invariants and state equation in 28 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 30 ms. Remains : 18/18 places, 21/21 transitions.
[2023-04-07 17:17:38] [INFO ] Flatten gal took : 2 ms
[2023-04-07 17:17:38] [INFO ] Flatten gal took : 1 ms
[2023-04-07 17:17:38] [INFO ] Input system was already deterministic with 21 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 18/18 places, 21/21 transitions.
Applied a total of 0 rules in 1 ms. Remains 18 /18 variables (removed 0) and now considering 21/21 (removed 0) transitions.
[2023-04-07 17:17:38] [INFO ] Invariant cache hit.
[2023-04-07 17:17:38] [INFO ] Dead Transitions using invariants and state equation in 24 ms found 0 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 27 ms. Remains : 18/18 places, 21/21 transitions.
[2023-04-07 17:17:38] [INFO ] Flatten gal took : 2 ms
[2023-04-07 17:17:38] [INFO ] Flatten gal took : 1 ms
[2023-04-07 17:17:38] [INFO ] Input system was already deterministic with 21 transitions.
Starting structural reductions in LTL mode, iteration 0 : 18/18 places, 21/21 transitions.
Applied a total of 0 rules in 0 ms. Remains 18 /18 variables (removed 0) and now considering 21/21 (removed 0) transitions.
[2023-04-07 17:17:38] [INFO ] Invariant cache hit.
[2023-04-07 17:17:38] [INFO ] Dead Transitions using invariants and state equation in 21 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 22 ms. Remains : 18/18 places, 21/21 transitions.
[2023-04-07 17:17:38] [INFO ] Flatten gal took : 2 ms
[2023-04-07 17:17:38] [INFO ] Flatten gal took : 1 ms
[2023-04-07 17:17:38] [INFO ] Input system was already deterministic with 21 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 18/18 places, 21/21 transitions.
Applied a total of 0 rules in 1 ms. Remains 18 /18 variables (removed 0) and now considering 21/21 (removed 0) transitions.
[2023-04-07 17:17:38] [INFO ] Invariant cache hit.
[2023-04-07 17:17:38] [INFO ] Dead Transitions using invariants and state equation in 22 ms found 0 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 24 ms. Remains : 18/18 places, 21/21 transitions.
[2023-04-07 17:17:38] [INFO ] Flatten gal took : 2 ms
[2023-04-07 17:17:38] [INFO ] Flatten gal took : 1 ms
[2023-04-07 17:17:38] [INFO ] Input system was already deterministic with 21 transitions.
Starting structural reductions in LTL mode, iteration 0 : 18/18 places, 21/21 transitions.
Applied a total of 0 rules in 0 ms. Remains 18 /18 variables (removed 0) and now considering 21/21 (removed 0) transitions.
[2023-04-07 17:17:38] [INFO ] Invariant cache hit.
[2023-04-07 17:17:38] [INFO ] Dead Transitions using invariants and state equation in 24 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 25 ms. Remains : 18/18 places, 21/21 transitions.
[2023-04-07 17:17:38] [INFO ] Flatten gal took : 1 ms
[2023-04-07 17:17:38] [INFO ] Flatten gal took : 1 ms
[2023-04-07 17:17:38] [INFO ] Input system was already deterministic with 21 transitions.
Starting structural reductions in LTL mode, iteration 0 : 18/18 places, 21/21 transitions.
Applied a total of 0 rules in 0 ms. Remains 18 /18 variables (removed 0) and now considering 21/21 (removed 0) transitions.
[2023-04-07 17:17:38] [INFO ] Invariant cache hit.
[2023-04-07 17:17:38] [INFO ] Dead Transitions using invariants and state equation in 23 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 23 ms. Remains : 18/18 places, 21/21 transitions.
[2023-04-07 17:17:38] [INFO ] Flatten gal took : 1 ms
[2023-04-07 17:17:38] [INFO ] Flatten gal took : 1 ms
[2023-04-07 17:17:38] [INFO ] Input system was already deterministic with 21 transitions.
[2023-04-07 17:17:38] [INFO ] Flatten gal took : 2 ms
[2023-04-07 17:17:38] [INFO ] Flatten gal took : 1 ms
[2023-04-07 17:17:38] [INFO ] Export to MCC of 13 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 2 ms.
[2023-04-07 17:17:38] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 18 places, 21 transitions and 81 arcs took 0 ms.
Total runtime 19266 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: 18 NrTr: 21 NrArc: 81)

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

net check time: 0m 0.000sec

init dd package: 0m 2.747sec


RS generation: 0m 2.467sec


-> reachability set: #nodes 15348 (1.5e+04) #states 41,538,421,296 (10)



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

checking: [AF [5<=sum(p2, p1, p0)] & AX [AF [39<=sum(p11, p10, p9)]]]
normalized: [~ [EX [EG [~ [39<=sum(p11, p10, p9)]]]] & ~ [EG [~ [5<=sum(p2, p1, p0)]]]]

abstracting: (5<=sum(p2, p1, p0))
states: 41,519,567,520 (10)
.
EG iterations: 1
abstracting: (39<=sum(p11, p10, p9))
states: 0

EG iterations: 0
.-> the formula is FALSE

FORMULA Murphy-COL-D2N050-CTLCardinality-14 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.755sec

checking: A [AF [9<=sum(p11, p10, p9)] U [sum(p8, p7, p6)<=10 & 10<=sum(p17, p16, p15)]]
normalized: [~ [EG [~ [[sum(p8, p7, p6)<=10 & 10<=sum(p17, p16, p15)]]]] & ~ [E [~ [[sum(p8, p7, p6)<=10 & 10<=sum(p17, p16, p15)]] U [EG [~ [9<=sum(p11, p10, p9)]] & ~ [[sum(p8, p7, p6)<=10 & 10<=sum(p17, p16, p15)]]]]]]

abstracting: (10<=sum(p17, p16, p15))
states: 0
abstracting: (sum(p8, p7, p6)<=10)
states: 163,745,712 (8)
abstracting: (9<=sum(p11, p10, p9))
states: 0

EG iterations: 0
abstracting: (10<=sum(p17, p16, p15))
states: 0
abstracting: (sum(p8, p7, p6)<=10)
states: 163,745,712 (8)
abstracting: (10<=sum(p17, p16, p15))
states: 0
abstracting: (sum(p8, p7, p6)<=10)
states: 163,745,712 (8)

EG iterations: 0
-> the formula is FALSE

FORMULA Murphy-COL-D2N050-CTLCardinality-11 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.679sec

checking: EF [[62<=sum(p17, p16, p15) & [sum(p14, p13, p12)<=sum(p2, p1, p0) | AF [EG [~ [sum(p8, p7, p6)<=47]]]]]]
normalized: E [true U [62<=sum(p17, p16, p15) & [sum(p14, p13, p12)<=sum(p2, p1, p0) | ~ [EG [~ [EG [~ [sum(p8, p7, p6)<=47]]]]]]]]

abstracting: (sum(p8, p7, p6)<=47)
states: 7,564,237,488 (9)
.
EG iterations: 1
.
EG iterations: 1
abstracting: (sum(p14, p13, p12)<=sum(p2, p1, p0))
states: 41,532,068,128 (10)
abstracting: (62<=sum(p17, p16, p15))
states: 0
-> the formula is FALSE

FORMULA Murphy-COL-D2N050-CTLCardinality-01 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m17.397sec

checking: A [~ [EG [28<=sum(p2, p1, p0)]] U [EX [~ [[AX [sum(p5, p4, p3)<=43] | ~ [6<=sum(p11, p10, p9)]]]] | 21<=sum(p14, p13, p12)]]
normalized: [~ [EG [~ [[21<=sum(p14, p13, p12) | EX [~ [[~ [6<=sum(p11, p10, p9)] | ~ [EX [~ [sum(p5, p4, p3)<=43]]]]]]]]]] & ~ [E [~ [[21<=sum(p14, p13, p12) | EX [~ [[~ [6<=sum(p11, p10, p9)] | ~ [EX [~ [sum(p5, p4, p3)<=43]]]]]]]] U [EG [28<=sum(p2, p1, p0)] & ~ [[21<=sum(p14, p13, p12) | EX [~ [[~ [6<=sum(p11, p10, p9)] | ~ [EX [~ [sum(p5, p4, p3)<=43]]]]]]]]]]]]

abstracting: (sum(p5, p4, p3)<=43)
states: 6,151,178,880 (9)
.abstracting: (6<=sum(p11, p10, p9))
states: 0
.abstracting: (21<=sum(p14, p13, p12))
states: 0
abstracting: (28<=sum(p2, p1, p0))
states: 39,564,370,944 (10)
.
EG iterations: 1
abstracting: (sum(p5, p4, p3)<=43)
states: 6,151,178,880 (9)
.abstracting: (6<=sum(p11, p10, p9))
states: 0
.abstracting: (21<=sum(p14, p13, p12))
states: 0
abstracting: (sum(p5, p4, p3)<=43)
states: 6,151,178,880 (9)
.abstracting: (6<=sum(p11, p10, p9))
states: 0
.abstracting: (21<=sum(p14, p13, p12))
states: 0

EG iterations: 0
-> the formula is FALSE

FORMULA Murphy-COL-D2N050-CTLCardinality-08 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 5.685sec

checking: AF [[[sum(p5, p4, p3)<=sum(p2, p1, p0) & AX [80<=sum(p14, p13, p12)]] | [~ [sum(p8, p7, p6)<=27] & EX [~ [sum(p11, p10, p9)<=36]]]]]
normalized: ~ [EG [~ [[[EX [~ [sum(p11, p10, p9)<=36]] & ~ [sum(p8, p7, p6)<=27]] | [sum(p5, p4, p3)<=sum(p2, p1, p0) & ~ [EX [~ [80<=sum(p14, p13, p12)]]]]]]]]

abstracting: (80<=sum(p14, p13, p12))
states: 0
.abstracting: (sum(p5, p4, p3)<=sum(p2, p1, p0))
MC time: 6m37.014sec

checking: E [sum(p2, p1, p0)<=16 U AX [[AG [80<=sum(p8, p7, p6)] & [A [EG [61<=sum(p11, p10, p9)] U ~ [sum(p11, p10, p9)<=sum(p17, p16, p15)]] & AX [sum(p14, p13, p12)<=8]]]]]
normalized: E [sum(p2, p1, p0)<=16 U ~ [EX [~ [[[[~ [EG [sum(p11, p10, p9)<=sum(p17, p16, p15)]] & ~ [E [sum(p11, p10, p9)<=sum(p17, p16, p15) U [sum(p11, p10, p9)<=sum(p17, p16, p15) & ~ [EG [61<=sum(p11, p10, p9)]]]]]] & ~ [EX [~ [sum(p14, p13, p12)<=8]]]] & ~ [E [true U ~ [80<=sum(p8, p7, p6)]]]]]]]]

abstracting: (80<=sum(p8, p7, p6))
states: 19,273,762,944 (10)
abstracting: (sum(p14, p13, p12)<=8)
states: 41,538,421,296 (10)
.abstracting: (61<=sum(p11, p10, p9))
states: 0
.
EG iterations: 1
abstracting: (sum(p11, p10, p9)<=sum(p17, p16, p15))
states: 39,038,423,718 (10)
abstracting: (sum(p11, p10, p9)<=sum(p17, p16, p15))
states: 39,038,423,718 (10)
abstracting: (sum(p11, p10, p9)<=sum(p17, p16, p15))
states: 39,038,423,718 (10)
.
EG iterations: 1
.abstracting: (sum(p2, p1, p0)<=16)
states: 527,909,184 (8)
-> the formula is FALSE

FORMULA Murphy-COL-D2N050-CTLCardinality-00 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m16.984sec

checking: EF [[5<=sum(p11, p10, p9) | AG [[5<=sum(p8, p7, p6) | [[~ [9<=sum(p2, p1, p0)] & ~ [sum(p14, p13, p12)<=sum(p5, p4, p3)]] | sum(p14, p13, p12)<=65]]]]]
normalized: E [true U [5<=sum(p11, p10, p9) | ~ [E [true U ~ [[5<=sum(p8, p7, p6) | [sum(p14, p13, p12)<=65 | [~ [sum(p14, p13, p12)<=sum(p5, p4, p3)] & ~ [9<=sum(p2, p1, p0)]]]]]]]]]

abstracting: (9<=sum(p2, p1, p0))
states: 41,443,192,080 (10)
abstracting: (sum(p14, p13, p12)<=sum(p5, p4, p3))
states: 41,529,733,248 (10)
abstracting: (sum(p14, p13, p12)<=65)
states: 41,538,421,296 (10)
abstracting: (5<=sum(p8, p7, p6))
states: 41,519,567,520 (10)
abstracting: (5<=sum(p11, p10, p9))
states: 0
-> the formula is TRUE

FORMULA Murphy-COL-D2N050-CTLCardinality-09 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m14.916sec

checking: AF [[AX [~ [E [[sum(p8, p7, p6)<=2 & sum(p14, p13, p12)<=sum(p5, p4, p3)] U sum(p17, p16, p15)<=23]]] & [AX [AF [[sum(p14, p13, p12)<=56 | 67<=sum(p11, p10, p9)]]] & 56<=sum(p14, p13, p12)]]]
normalized: ~ [EG [~ [[[56<=sum(p14, p13, p12) & ~ [EX [EG [~ [[sum(p14, p13, p12)<=56 | 67<=sum(p11, p10, p9)]]]]]] & ~ [EX [E [[sum(p8, p7, p6)<=2 & sum(p14, p13, p12)<=sum(p5, p4, p3)] U sum(p17, p16, p15)<=23]]]]]]]

abstracting: (sum(p17, p16, p15)<=23)
states: 41,538,421,296 (10)
abstracting: (sum(p14, p13, p12)<=sum(p5, p4, p3))
states: 41,529,733,248 (10)
abstracting: (sum(p8, p7, p6)<=2)
states: 3,596,400 (6)
.abstracting: (67<=sum(p11, p10, p9))
states: 0
abstracting: (sum(p14, p13, p12)<=56)
states: 41,538,421,296 (10)
.
EG iterations: 1
.abstracting: (56<=sum(p14, p13, p12))
states: 0

EG iterations: 0
-> the formula is FALSE

FORMULA Murphy-COL-D2N050-CTLCardinality-07 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.578sec

checking: AX [[[EG [~ [E [EX [sum(p14, p13, p12)<=44] U 14<=sum(p17, p16, p15)]]] | [sum(p2, p1, p0)<=sum(p14, p13, p12) | sum(p14, p13, p12)<=53]] | [AG [sum(p14, p13, p12)<=sum(p11, p10, p9)] | [94<=sum(p11, p10, p9) | [[sum(p14, p13, p12)<=39 & 18<=sum(p14, p13, p12)] & [~ [sum(p17, p16, p15)<=91] & EG [sum(p2, p1, p0)<=77]]]]]]]
normalized: ~ [EX [~ [[[[94<=sum(p11, p10, p9) | [[EG [sum(p2, p1, p0)<=77] & ~ [sum(p17, p16, p15)<=91]] & [sum(p14, p13, p12)<=39 & 18<=sum(p14, p13, p12)]]] | ~ [E [true U ~ [sum(p14, p13, p12)<=sum(p11, p10, p9)]]]] | [[sum(p2, p1, p0)<=sum(p14, p13, p12) | sum(p14, p13, p12)<=53] | EG [~ [E [EX [sum(p14, p13, p12)<=44] U 14<=sum(p17, p16, p15)]]]]]]]]

abstracting: (14<=sum(p17, p16, p15))
states: 0
abstracting: (sum(p14, p13, p12)<=44)
states: 41,538,421,296 (10)
.
EG iterations: 0
abstracting: (sum(p14, p13, p12)<=53)
states: 41,538,421,296 (10)
abstracting: (sum(p2, p1, p0)<=sum(p14, p13, p12))
states: 12,789,312 (7)
abstracting: (sum(p14, p13, p12)<=sum(p11, p10, p9))
states: 11,538,450,360 (10)
abstracting: (18<=sum(p14, p13, p12))
states: 0
abstracting: (sum(p14, p13, p12)<=39)
states: 41,538,421,296 (10)
abstracting: (sum(p17, p16, p15)<=91)
states: 41,538,421,296 (10)
abstracting: (sum(p2, p1, p0)<=77)
states: 21,267,222,192 (10)
.
EG iterations: 1
abstracting: (94<=sum(p11, p10, p9))
states: 0
.-> the formula is TRUE

FORMULA Murphy-COL-D2N050-CTLCardinality-04 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m17.095sec

checking: EF [[[AX [EX [[sum(p5, p4, p3)<=38 | sum(p11, p10, p9)<=63]]] & AX [~ [sum(p17, p16, p15)<=9]]] & [93<=sum(p14, p13, p12) & [EX [~ [A [sum(p8, p7, p6)<=sum(p11, p10, p9) U sum(p2, p1, p0)<=sum(p11, p10, p9)]]] & ~ [E [A [sum(p5, p4, p3)<=90 U sum(p8, p7, p6)<=76] U E [sum(p11, p10, p9)<=18 U 9<=sum(p14, p13, p12)]]]]]]]
normalized: E [true U [[93<=sum(p14, p13, p12) & [~ [E [[~ [EG [~ [sum(p8, p7, p6)<=76]]] & ~ [E [~ [sum(p8, p7, p6)<=76] U [~ [sum(p5, p4, p3)<=90] & ~ [sum(p8, p7, p6)<=76]]]]] U E [sum(p11, p10, p9)<=18 U 9<=sum(p14, p13, p12)]]] & EX [~ [[~ [EG [~ [sum(p2, p1, p0)<=sum(p11, p10, p9)]]] & ~ [E [~ [sum(p2, p1, p0)<=sum(p11, p10, p9)] U [~ [sum(p8, p7, p6)<=sum(p11, p10, p9)] & ~ [sum(p2, p1, p0)<=sum(p11, p10, p9)]]]]]]]]] & [~ [EX [sum(p17, p16, p15)<=9]] & ~ [EX [~ [EX [[sum(p5, p4, p3)<=38 | sum(p11, p10, p9)<=63]]]]]]]]

abstracting: (sum(p11, p10, p9)<=63)
states: 41,538,421,296 (10)
abstracting: (sum(p5, p4, p3)<=38)
states: 4,582,395,072 (9)
..abstracting: (sum(p17, p16, p15)<=9)
states: 41,538,421,296 (10)
.abstracting: (sum(p2, p1, p0)<=sum(p11, p10, p9))
states: 2,563,434 (6)
abstracting: (sum(p8, p7, p6)<=sum(p11, p10, p9))
states: 2,563,434 (6)
abstracting: (sum(p2, p1, p0)<=sum(p11, p10, p9))
states: 2,563,434 (6)
abstracting: (sum(p2, p1, p0)<=sum(p11, p10, p9))
states: 2,563,434 (6)
.
EG iterations: 1
.abstracting: (9<=sum(p14, p13, p12))
states: 0
abstracting: (sum(p11, p10, p9)<=18)
states: 41,538,421,296 (10)
abstracting: (sum(p8, p7, p6)<=76)
states: 20,767,847,472 (10)
abstracting: (sum(p5, p4, p3)<=90)
states: 27,613,813,248 (10)
abstracting: (sum(p8, p7, p6)<=76)
states: 20,767,847,472 (10)
abstracting: (sum(p8, p7, p6)<=76)
states: 20,767,847,472 (10)
.
EG iterations: 1
abstracting: (93<=sum(p14, p13, p12))
states: 0
-> the formula is FALSE

FORMULA Murphy-COL-D2N050-CTLCardinality-05 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m12.967sec

checking: EG [[EX [[A [93<=sum(p17, p16, p15) U A [91<=sum(p11, p10, p9) U sum(p2, p1, p0)<=sum(p5, p4, p3)]] & sum(p5, p4, p3)<=sum(p2, p1, p0)]] | AG [[[26<=sum(p17, p16, p15) | ~ [sum(p17, p16, p15)<=sum(p2, p1, p0)]] & [EX [~ [sum(p5, p4, p3)<=sum(p14, p13, p12)]] & [~ [sum(p14, p13, p12)<=44] | ~ [18<=sum(p11, p10, p9)]]]]]]]
normalized: EG [[~ [E [true U ~ [[[[~ [18<=sum(p11, p10, p9)] | ~ [sum(p14, p13, p12)<=44]] & EX [~ [sum(p5, p4, p3)<=sum(p14, p13, p12)]]] & [26<=sum(p17, p16, p15) | ~ [sum(p17, p16, p15)<=sum(p2, p1, p0)]]]]]] | EX [[sum(p5, p4, p3)<=sum(p2, p1, p0) & [~ [EG [~ [[~ [EG [~ [sum(p2, p1, p0)<=sum(p5, p4, p3)]]] & ~ [E [~ [sum(p2, p1, p0)<=sum(p5, p4, p3)] U [~ [91<=sum(p11, p10, p9)] & ~ [sum(p2, p1, p0)<=sum(p5, p4, p3)]]]]]]]] & ~ [E [~ [[~ [EG [~ [sum(p2, p1, p0)<=sum(p5, p4, p3)]]] & ~ [E [~ [sum(p2, p1, p0)<=sum(p5, p4, p3)] U [~ [91<=sum(p11, p10, p9)] & ~ [sum(p2, p1, p0)<=sum(p5, p4, p3)]]]]]] U [~ [93<=sum(p17, p16, p15)] & ~ [[~ [EG [~ [sum(p2, p1, p0)<=sum(p5, p4, p3)]]] & ~ [E [~ [sum(p2, p1, p0)<=sum(p5, p4, p3)] U [~ [91<=sum(p11, p10, p9)] & ~ [sum(p2, p1, p0)<=sum(p5, p4, p3)]]]]]]]]]]]]]]

abstracting: (sum(p2, p1, p0)<=sum(p5, p4, p3))
MC time: 12m58.000sec

checking: A [E [~ [[[~ [[sum(p5, p4, p3)<=84 & 82<=sum(p5, p4, p3)]] & AF [sum(p2, p1, p0)<=sum(p5, p4, p3)]] | [sum(p17, p16, p15)<=sum(p2, p1, p0) & ~ [[42<=sum(p5, p4, p3) & sum(p17, p16, p15)<=12]]]]] U [AG [AF [sum(p8, p7, p6)<=70]] | [AF [EX [sum(p11, p10, p9)<=sum(p5, p4, p3)]] & AG [sum(p17, p16, p15)<=86]]]] U sum(p5, p4, p3)<=2]
normalized: [~ [EG [~ [sum(p5, p4, p3)<=2]]] & ~ [E [~ [sum(p5, p4, p3)<=2] U [~ [E [~ [[[sum(p17, p16, p15)<=sum(p2, p1, p0) & ~ [[42<=sum(p5, p4, p3) & sum(p17, p16, p15)<=12]]] | [~ [EG [~ [sum(p2, p1, p0)<=sum(p5, p4, p3)]]] & ~ [[sum(p5, p4, p3)<=84 & 82<=sum(p5, p4, p3)]]]]] U [[~ [E [true U ~ [sum(p17, p16, p15)<=86]]] & ~ [EG [~ [EX [sum(p11, p10, p9)<=sum(p5, p4, p3)]]]]] | ~ [E [true U EG [~ [sum(p8, p7, p6)<=70]]]]]]] & ~ [sum(p5, p4, p3)<=2]]]]]

abstracting: (sum(p5, p4, p3)<=2)
states: 6,270,912 (6)
abstracting: (sum(p8, p7, p6)<=70)
states: 17,783,074,800 (10)
.
EG iterations: 1
abstracting: (sum(p11, p10, p9)<=sum(p5, p4, p3))
states: 41,536,452,402 (10)
.........
EG iterations: 8
abstracting: (sum(p17, p16, p15)<=86)
states: 41,538,421,296 (10)
abstracting: (82<=sum(p5, p4, p3))
states: 18,277,535,088 (10)
abstracting: (sum(p5, p4, p3)<=84)
states: 24,738,067,872 (10)
abstracting: (sum(p2, p1, p0)<=sum(p5, p4, p3))
MC time: 9m44.000sec

checking: A [[sum(p14, p13, p12)<=35 | [~ [[~ [[[sum(p8, p7, p6)<=sum(p2, p1, p0) & sum(p8, p7, p6)<=33] | [92<=sum(p17, p16, p15) & 82<=sum(p2, p1, p0)]]] & E [EG [16<=sum(p8, p7, p6)] U sum(p8, p7, p6)<=sum(p14, p13, p12)]]] & E [AX [~ [32<=sum(p2, p1, p0)]] U ~ [EX [sum(p14, p13, p12)<=50]]]]] U EX [[~ [A [AX [sum(p14, p13, p12)<=sum(p2, p1, p0)] U [56<=sum(p17, p16, p15) | sum(p2, p1, p0)<=65]]] | AF [[E [sum(p8, p7, p6)<=40 U 81<=sum(p2, p1, p0)] & [sum(p17, p16, p15)<=sum(p2, p1, p0) & 89<=sum(p11, p10, p9)]]]]]]
normalized: [~ [EG [~ [EX [[~ [EG [~ [[[sum(p17, p16, p15)<=sum(p2, p1, p0) & 89<=sum(p11, p10, p9)] & E [sum(p8, p7, p6)<=40 U 81<=sum(p2, p1, p0)]]]]] | ~ [[~ [EG [~ [[56<=sum(p17, p16, p15) | sum(p2, p1, p0)<=65]]]] & ~ [E [~ [[56<=sum(p17, p16, p15) | sum(p2, p1, p0)<=65]] U [EX [~ [sum(p14, p13, p12)<=sum(p2, p1, p0)]] & ~ [[56<=sum(p17, p16, p15) | sum(p2, p1, p0)<=65]]]]]]]]]]]] & ~ [E [~ [EX [[~ [EG [~ [[[sum(p17, p16, p15)<=sum(p2, p1, p0) & 89<=sum(p11, p10, p9)] & E [sum(p8, p7, p6)<=40 U 81<=sum(p2, p1, p0)]]]]] | ~ [[~ [EG [~ [[56<=sum(p17, p16, p15) | sum(p2, p1, p0)<=65]]]] & ~ [E [~ [[56<=sum(p17, p16, p15) | sum(p2, p1, p0)<=65]] U [EX [~ [sum(p14, p13, p12)<=sum(p2, p1, p0)]] & ~ [[56<=sum(p17, p16, p15) | sum(p2, p1, p0)<=65]]]]]]]]]] U [~ [[sum(p14, p13, p12)<=35 | [E [~ [EX [32<=sum(p2, p1, p0)]] U ~ [EX [sum(p14, p13, p12)<=50]]] & ~ [[E [EG [16<=sum(p8, p7, p6)] U sum(p8, p7, p6)<=sum(p14, p13, p12)] & ~ [[[92<=sum(p17, p16, p15) & 82<=sum(p2, p1, p0)] | [sum(p8, p7, p6)<=sum(p2, p1, p0) & sum(p8, p7, p6)<=33]]]]]]]] & ~ [EX [[~ [EG [~ [[[sum(p17, p16, p15)<=sum(p2, p1, p0) & 89<=sum(p11, p10, p9)] & E [sum(p8, p7, p6)<=40 U 81<=sum(p2, p1, p0)]]]]] | ~ [[~ [EG [~ [[56<=sum(p17, p16, p15) | sum(p2, p1, p0)<=65]]]] & ~ [E [~ [[56<=sum(p17, p16, p15) | sum(p2, p1, p0)<=65]] U [EX [~ [sum(p14, p13, p12)<=sum(p2, p1, p0)]] & ~ [[56<=sum(p17, p16, p15) | sum(p2, p1, p0)<=65]]]]]]]]]]]]]]

abstracting: (sum(p2, p1, p0)<=65)
states: 15,346,556,784 (10)
abstracting: (56<=sum(p17, p16, p15))
states: 0
abstracting: (sum(p14, p13, p12)<=sum(p2, p1, p0))
states: 41,532,068,128 (10)
.abstracting: (sum(p2, p1, p0)<=65)
states: 15,346,556,784 (10)
abstracting: (56<=sum(p17, p16, p15))
states: 0
abstracting: (sum(p2, p1, p0)<=65)
states: 15,346,556,784 (10)
abstracting: (56<=sum(p17, p16, p15))
states: 0
.
EG iterations: 1
abstracting: (81<=sum(p2, p1, p0))
states: 18,776,356,848 (10)
abstracting: (sum(p8, p7, p6)<=40)
states: 5,179,402,656 (9)
abstracting: (89<=sum(p11, p10, p9))
states: 0
abstracting: (sum(p17, p16, p15)<=sum(p2, p1, p0))
states: 41,520,013,832 (10)

EG iterations: 0
.abstracting: (sum(p8, p7, p6)<=33)
states: 3,248,227,440 (9)
abstracting: (sum(p8, p7, p6)<=sum(p2, p1, p0))
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 7889124 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16103188 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:7459 (355), effective:1786 (85)

initing FirstDep: 0m 0.000sec


iterations count:21 (1), effective:0 (0)

iterations count:569 (27), effective:140 (6)

idd.h:1025: Timeout: after 396 sec


iterations count:1206 (57), effective:239 (11)

iterations count:21 (1), effective:0 (0)

iterations count:21 (1), effective:0 (0)

iterations count:21 (1), effective:0 (0)

iterations count:43 (2), effective:6 (0)

iterations count:21 (1), effective:0 (0)

idd.h:1025: Timeout: after 777 sec


iterations count:1510 (71), effective:380 (18)

idd.h:1025: Timeout: after 583 sec


iterations count:21 (1), effective:0 (0)

idd.h:1025: Timeout: after 437 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-D2N050"
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-D2N050, 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-167987247200289"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/Murphy-COL-D2N050.tgz
mv Murphy-COL-D2N050 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 ;