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.r330-tall-167889203600721.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 ResAllocation-PT-R003C100, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r330-tall-167889203600721
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.2M
-rw-r--r-- 1 mcc users 7.4K Feb 25 15:23 CTLCardinality.txt
-rw-r--r-- 1 mcc users 76K Feb 25 15:23 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K Feb 25 15:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K Feb 25 15:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.7K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Feb 25 16:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Feb 25 16:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 16:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 10K Feb 25 15:24 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 97K Feb 25 15:24 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 10K Feb 25 15:24 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 84K Feb 25 15:24 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 16:44 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:44 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 9 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 721K Mar 5 18:23 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 ResAllocation-PT-R003C100-CTLCardinality-00
FORMULA_NAME ResAllocation-PT-R003C100-CTLCardinality-01
FORMULA_NAME ResAllocation-PT-R003C100-CTLCardinality-02
FORMULA_NAME ResAllocation-PT-R003C100-CTLCardinality-03
FORMULA_NAME ResAllocation-PT-R003C100-CTLCardinality-04
FORMULA_NAME ResAllocation-PT-R003C100-CTLCardinality-05
FORMULA_NAME ResAllocation-PT-R003C100-CTLCardinality-06
FORMULA_NAME ResAllocation-PT-R003C100-CTLCardinality-07
FORMULA_NAME ResAllocation-PT-R003C100-CTLCardinality-08
FORMULA_NAME ResAllocation-PT-R003C100-CTLCardinality-09
FORMULA_NAME ResAllocation-PT-R003C100-CTLCardinality-10
FORMULA_NAME ResAllocation-PT-R003C100-CTLCardinality-11
FORMULA_NAME ResAllocation-PT-R003C100-CTLCardinality-12
FORMULA_NAME ResAllocation-PT-R003C100-CTLCardinality-13
FORMULA_NAME ResAllocation-PT-R003C100-CTLCardinality-14
FORMULA_NAME ResAllocation-PT-R003C100-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1679181299617

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=ResAllocation-PT-R003C100
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-18 23:15:00] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-18 23:15:01] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-18 23:15:01] [INFO ] Load time of PNML (sax parser for PT used): 106 ms
[2023-03-18 23:15:01] [INFO ] Transformed 600 places.
[2023-03-18 23:15:01] [INFO ] Transformed 400 transitions.
[2023-03-18 23:15:01] [INFO ] Parsed PT model containing 600 places and 400 transitions and 1794 arcs in 324 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 9 ms.
Support contains 137 out of 600 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 600/600 places, 400/400 transitions.
Applied a total of 0 rules in 53 ms. Remains 600 /600 variables (removed 0) and now considering 400/400 (removed 0) transitions.
// Phase 1: matrix 400 rows 600 cols
[2023-03-18 23:15:01] [INFO ] Computed 300 place invariants in 23 ms
[2023-03-18 23:15:01] [INFO ] Implicit Places using invariants in 498 ms returned [597, 599]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 523 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 598/600 places, 400/400 transitions.
Applied a total of 0 rules in 16 ms. Remains 598 /598 variables (removed 0) and now considering 400/400 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 592 ms. Remains : 598/600 places, 400/400 transitions.
Support contains 137 out of 598 places after structural reductions.
[2023-03-18 23:15:02] [INFO ] Flatten gal took : 74 ms
[2023-03-18 23:15:02] [INFO ] Flatten gal took : 33 ms
[2023-03-18 23:15:02] [INFO ] Input system was already deterministic with 400 transitions.
Support contains 136 out of 598 places (down from 137) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 48 resets, run finished after 534 ms. (steps per millisecond=18 ) properties (out of 90) seen :71
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 19) 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 19) 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 19) 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 19) 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 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 19) 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 19) 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 19) 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 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 19) 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 19) 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 19) 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 19) 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 19) 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 19) 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 19) 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 19) 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 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 19) seen :0
Running SMT prover for 19 properties.
// Phase 1: matrix 400 rows 598 cols
[2023-03-18 23:15:03] [INFO ] Computed 298 place invariants in 6 ms
[2023-03-18 23:15:03] [INFO ] [Real]Absence check using 298 positive place invariants in 41 ms returned sat
[2023-03-18 23:15:03] [INFO ] After 401ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0 real:17
[2023-03-18 23:15:03] [INFO ] [Nat]Absence check using 298 positive place invariants in 37 ms returned sat
[2023-03-18 23:15:04] [INFO ] After 234ms SMT Verify possible using state equation in natural domain returned unsat :16 sat :3
[2023-03-18 23:15:04] [INFO ] Deduced a trap composed of 4 places in 53 ms of which 5 ms to minimize.
[2023-03-18 23:15:04] [INFO ] Deduced a trap composed of 5 places in 57 ms of which 1 ms to minimize.
[2023-03-18 23:15:04] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 1 ms to minimize.
[2023-03-18 23:15:04] [INFO ] Deduced a trap composed of 4 places in 46 ms of which 1 ms to minimize.
[2023-03-18 23:15:04] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 0 ms to minimize.
[2023-03-18 23:15:04] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 1 ms to minimize.
[2023-03-18 23:15:04] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 1 ms to minimize.
[2023-03-18 23:15:04] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 0 ms to minimize.
[2023-03-18 23:15:04] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 1 ms to minimize.
[2023-03-18 23:15:04] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 0 ms to minimize.
[2023-03-18 23:15:04] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 585 ms
[2023-03-18 23:15:04] [INFO ] After 911ms SMT Verify possible using trap constraints in natural domain returned unsat :16 sat :3
Attempting to minimize the solution found.
Minimization took 68 ms.
[2023-03-18 23:15:04] [INFO ] After 1325ms SMT Verify possible using all constraints in natural domain returned unsat :16 sat :3
Fused 19 Parikh solutions to 1 different solutions.
Parikh walk visited 1 properties in 14 ms.
Support contains 4 out of 598 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 598/598 places, 400/400 transitions.
Performed 97 Post agglomeration using F-continuation condition.Transition count delta: 97
Deduced a syphon composed of 97 places in 1 ms
Reduce places removed 98 places and 0 transitions.
Iterating global reduction 0 with 195 rules applied. Total rules applied 195 place count 500 transition count 303
Free-agglomeration rule applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 197 place count 500 transition count 301
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 201 place count 496 transition count 301
Free-agglomeration rule applied 2 times.
Iterating global reduction 1 with 2 rules applied. Total rules applied 203 place count 496 transition count 299
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 207 place count 494 transition count 297
Free-agglomeration rule (complex) applied 97 times.
Iterating global reduction 2 with 97 rules applied. Total rules applied 304 place count 494 transition count 200
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Remove reverse transitions (loop back) rule discarded transition t5.t4 and 2 places that fell out of Prefix Of Interest.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 86 transitions
Trivial Post-agglo rules discarded 86 transitions
Performed 86 trivial Post agglomeration. Transition count delta: 86
Iterating post reduction 2 with 88 rules applied. Total rules applied 392 place count 206 transition count 112
Reduce places removed 169 places and 0 transitions.
Drop transitions removed 86 transitions
Reduce isomorphic transitions removed 86 transitions.
Iterating post reduction 3 with 255 rules applied. Total rules applied 647 place count 37 transition count 26
Ensure Unique test removed 1 places
Iterating post reduction 4 with 1 rules applied. Total rules applied 648 place count 36 transition count 26
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 5 with 17 rules applied. Total rules applied 665 place count 25 transition count 20
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 5 with 5 rules applied. Total rules applied 670 place count 25 transition count 15
Ensure Unique test removed 4 places
Iterating post reduction 6 with 4 rules applied. Total rules applied 674 place count 21 transition count 15
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 2 Pre rules applied. Total rules applied 674 place count 21 transition count 13
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 7 with 6 rules applied. Total rules applied 680 place count 17 transition count 13
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 7 with 2 rules applied. Total rules applied 682 place count 17 transition count 11
Reduce places removed 6 places and 0 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 7 rules applied. Total rules applied 689 place count 11 transition count 10
Applied a total of 689 rules in 86 ms. Remains 11 /598 variables (removed 587) and now considering 10/400 (removed 390) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 86 ms. Remains : 11/598 places, 10/400 transitions.
Finished random walk after 16 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=8 )
Successfully simplified 16 atomic propositions for a total of 16 simplifications.
[2023-03-18 23:15:04] [INFO ] Flatten gal took : 26 ms
[2023-03-18 23:15:04] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA ResAllocation-PT-R003C100-CTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-18 23:15:04] [INFO ] Flatten gal took : 25 ms
[2023-03-18 23:15:05] [INFO ] Input system was already deterministic with 400 transitions.
Support contains 105 out of 598 places (down from 119) after GAL structural reductions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 598/598 places, 400/400 transitions.
Applied a total of 0 rules in 6 ms. Remains 598 /598 variables (removed 0) and now considering 400/400 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6 ms. Remains : 598/598 places, 400/400 transitions.
[2023-03-18 23:15:05] [INFO ] Flatten gal took : 23 ms
[2023-03-18 23:15:05] [INFO ] Flatten gal took : 22 ms
[2023-03-18 23:15:05] [INFO ] Input system was already deterministic with 400 transitions.
Starting structural reductions in LTL mode, iteration 0 : 598/598 places, 400/400 transitions.
Applied a total of 0 rules in 9 ms. Remains 598 /598 variables (removed 0) and now considering 400/400 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9 ms. Remains : 598/598 places, 400/400 transitions.
[2023-03-18 23:15:05] [INFO ] Flatten gal took : 21 ms
[2023-03-18 23:15:05] [INFO ] Flatten gal took : 20 ms
[2023-03-18 23:15:05] [INFO ] Input system was already deterministic with 400 transitions.
Starting structural reductions in LTL mode, iteration 0 : 598/598 places, 400/400 transitions.
Applied a total of 0 rules in 6 ms. Remains 598 /598 variables (removed 0) and now considering 400/400 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6 ms. Remains : 598/598 places, 400/400 transitions.
[2023-03-18 23:15:05] [INFO ] Flatten gal took : 18 ms
[2023-03-18 23:15:05] [INFO ] Flatten gal took : 17 ms
[2023-03-18 23:15:05] [INFO ] Input system was already deterministic with 400 transitions.
Starting structural reductions in LTL mode, iteration 0 : 598/598 places, 400/400 transitions.
Applied a total of 0 rules in 5 ms. Remains 598 /598 variables (removed 0) and now considering 400/400 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 598/598 places, 400/400 transitions.
[2023-03-18 23:15:05] [INFO ] Flatten gal took : 15 ms
[2023-03-18 23:15:05] [INFO ] Flatten gal took : 16 ms
[2023-03-18 23:15:05] [INFO ] Input system was already deterministic with 400 transitions.
Starting structural reductions in LTL mode, iteration 0 : 598/598 places, 400/400 transitions.
Applied a total of 0 rules in 5 ms. Remains 598 /598 variables (removed 0) and now considering 400/400 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6 ms. Remains : 598/598 places, 400/400 transitions.
[2023-03-18 23:15:05] [INFO ] Flatten gal took : 15 ms
[2023-03-18 23:15:05] [INFO ] Flatten gal took : 16 ms
[2023-03-18 23:15:05] [INFO ] Input system was already deterministic with 400 transitions.
Starting structural reductions in LTL mode, iteration 0 : 598/598 places, 400/400 transitions.
Applied a total of 0 rules in 5 ms. Remains 598 /598 variables (removed 0) and now considering 400/400 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 598/598 places, 400/400 transitions.
[2023-03-18 23:15:05] [INFO ] Flatten gal took : 14 ms
[2023-03-18 23:15:05] [INFO ] Flatten gal took : 16 ms
[2023-03-18 23:15:05] [INFO ] Input system was already deterministic with 400 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 598/598 places, 400/400 transitions.
Performed 99 Post agglomeration using F-continuation condition.Transition count delta: 99
Deduced a syphon composed of 99 places in 1 ms
Reduce places removed 100 places and 0 transitions.
Iterating global reduction 0 with 199 rules applied. Total rules applied 199 place count 498 transition count 301
Applied a total of 199 rules in 26 ms. Remains 498 /598 variables (removed 100) and now considering 301/400 (removed 99) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 26 ms. Remains : 498/598 places, 301/400 transitions.
[2023-03-18 23:15:05] [INFO ] Flatten gal took : 10 ms
[2023-03-18 23:15:05] [INFO ] Flatten gal took : 11 ms
[2023-03-18 23:15:05] [INFO ] Input system was already deterministic with 301 transitions.
Starting structural reductions in LTL mode, iteration 0 : 598/598 places, 400/400 transitions.
Applied a total of 0 rules in 5 ms. Remains 598 /598 variables (removed 0) and now considering 400/400 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 598/598 places, 400/400 transitions.
[2023-03-18 23:15:05] [INFO ] Flatten gal took : 15 ms
[2023-03-18 23:15:05] [INFO ] Flatten gal took : 15 ms
[2023-03-18 23:15:05] [INFO ] Input system was already deterministic with 400 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 598/598 places, 400/400 transitions.
Performed 100 Post agglomeration using F-continuation condition.Transition count delta: 100
Deduced a syphon composed of 100 places in 0 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 0 with 201 rules applied. Total rules applied 201 place count 497 transition count 300
Applied a total of 201 rules in 23 ms. Remains 497 /598 variables (removed 101) and now considering 300/400 (removed 100) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 23 ms. Remains : 497/598 places, 300/400 transitions.
[2023-03-18 23:15:05] [INFO ] Flatten gal took : 10 ms
[2023-03-18 23:15:05] [INFO ] Flatten gal took : 11 ms
[2023-03-18 23:15:05] [INFO ] Input system was already deterministic with 300 transitions.
Finished random walk after 13 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=13 )
FORMULA ResAllocation-PT-R003C100-CTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in SI_CTL mode, iteration 0 : 598/598 places, 400/400 transitions.
Performed 99 Post agglomeration using F-continuation condition.Transition count delta: 99
Deduced a syphon composed of 99 places in 0 ms
Reduce places removed 100 places and 0 transitions.
Iterating global reduction 0 with 199 rules applied. Total rules applied 199 place count 498 transition count 301
Applied a total of 199 rules in 20 ms. Remains 498 /598 variables (removed 100) and now considering 301/400 (removed 99) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 20 ms. Remains : 498/598 places, 301/400 transitions.
[2023-03-18 23:15:05] [INFO ] Flatten gal took : 9 ms
[2023-03-18 23:15:05] [INFO ] Flatten gal took : 10 ms
[2023-03-18 23:15:05] [INFO ] Input system was already deterministic with 301 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 598/598 places, 400/400 transitions.
Performed 99 Post agglomeration using F-continuation condition.Transition count delta: 99
Deduced a syphon composed of 99 places in 0 ms
Reduce places removed 100 places and 0 transitions.
Iterating global reduction 0 with 199 rules applied. Total rules applied 199 place count 498 transition count 301
Applied a total of 199 rules in 18 ms. Remains 498 /598 variables (removed 100) and now considering 301/400 (removed 99) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 18 ms. Remains : 498/598 places, 301/400 transitions.
[2023-03-18 23:15:05] [INFO ] Flatten gal took : 10 ms
[2023-03-18 23:15:05] [INFO ] Flatten gal took : 10 ms
[2023-03-18 23:15:05] [INFO ] Input system was already deterministic with 301 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 598/598 places, 400/400 transitions.
Performed 98 Post agglomeration using F-continuation condition.Transition count delta: 98
Deduced a syphon composed of 98 places in 1 ms
Reduce places removed 99 places and 0 transitions.
Iterating global reduction 0 with 197 rules applied. Total rules applied 197 place count 499 transition count 302
Applied a total of 197 rules in 18 ms. Remains 499 /598 variables (removed 99) and now considering 302/400 (removed 98) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 18 ms. Remains : 499/598 places, 302/400 transitions.
[2023-03-18 23:15:05] [INFO ] Flatten gal took : 9 ms
[2023-03-18 23:15:05] [INFO ] Flatten gal took : 11 ms
[2023-03-18 23:15:05] [INFO ] Input system was already deterministic with 302 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 598/598 places, 400/400 transitions.
Performed 95 Post agglomeration using F-continuation condition.Transition count delta: 95
Deduced a syphon composed of 95 places in 0 ms
Reduce places removed 96 places and 0 transitions.
Iterating global reduction 0 with 191 rules applied. Total rules applied 191 place count 502 transition count 305
Applied a total of 191 rules in 21 ms. Remains 502 /598 variables (removed 96) and now considering 305/400 (removed 95) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 21 ms. Remains : 502/598 places, 305/400 transitions.
[2023-03-18 23:15:05] [INFO ] Flatten gal took : 10 ms
[2023-03-18 23:15:05] [INFO ] Flatten gal took : 10 ms
[2023-03-18 23:15:05] [INFO ] Input system was already deterministic with 305 transitions.
Starting structural reductions in LTL mode, iteration 0 : 598/598 places, 400/400 transitions.
Applied a total of 0 rules in 5 ms. Remains 598 /598 variables (removed 0) and now considering 400/400 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 598/598 places, 400/400 transitions.
[2023-03-18 23:15:06] [INFO ] Flatten gal took : 16 ms
[2023-03-18 23:15:06] [INFO ] Flatten gal took : 15 ms
[2023-03-18 23:15:06] [INFO ] Input system was already deterministic with 400 transitions.
Starting structural reductions in LTL mode, iteration 0 : 598/598 places, 400/400 transitions.
Applied a total of 0 rules in 5 ms. Remains 598 /598 variables (removed 0) and now considering 400/400 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 598/598 places, 400/400 transitions.
[2023-03-18 23:15:06] [INFO ] Flatten gal took : 14 ms
[2023-03-18 23:15:06] [INFO ] Flatten gal took : 13 ms
[2023-03-18 23:15:06] [INFO ] Input system was already deterministic with 400 transitions.
[2023-03-18 23:15:06] [INFO ] Flatten gal took : 15 ms
[2023-03-18 23:15:06] [INFO ] Flatten gal took : 14 ms
[2023-03-18 23:15:06] [INFO ] Export to MCC of 14 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 2 ms.
[2023-03-18 23:15:06] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 598 places, 400 transitions and 1790 arcs took 3 ms.
Total runtime 5188 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: 598 NrTr: 400 NrArc: 1790)

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

net check time: 0m 0.000sec

init dd package: 0m 2.793sec


RS generation: 0m 0.209sec


-> reachability set: #nodes 4140 (4.1e+03) #states 1,419,511,971,601,939,502,357,423,537,093,994,181,923,624,388,856,767,315,968 (57)



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

checking: AG [EF [1<=p352]]
normalized: ~ [E [true U ~ [E [true U 1<=p352]]]]

abstracting: (1<=p352)
states: 186,021,624,640,774,564,715,349,211,529,086,709,896,495,413,690,026,164,224 (56)
-> the formula is FALSE

FORMULA ResAllocation-PT-R003C100-CTLCardinality-09 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.573sec

checking: AG [EF [~ [p444<=p107]]]
normalized: ~ [E [true U ~ [E [true U ~ [p444<=p107]]]]]

abstracting: (p444<=p107)
states: 1,133,633,414,729,810,928,641,893,363,311,490,768,908,560,931,523,462,692,864 (57)
-> the formula is TRUE

FORMULA ResAllocation-PT-R003C100-CTLCardinality-06 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.227sec

checking: EX [EG [AX [[1<=p512 | p448<=0]]]]
normalized: EX [EG [~ [EX [~ [[1<=p512 | p448<=0]]]]]]

abstracting: (p448<=0)
states: 1,233,490,379,408,678,079,888,279,728,758,302,308,226,434,627,735,956,488,192 (57)
abstracting: (1<=p512)
states: 364,792,523,563,760,544,513,643,255,191,701,008,379,548,678,505,176,760,320 (56)
...
EG iterations: 2
.-> the formula is TRUE

FORMULA ResAllocation-PT-R003C100-CTLCardinality-07 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.784sec

checking: AF [[~ [p245<=0] & AF [1<=p530]]]
normalized: ~ [EG [~ [[~ [EG [~ [1<=p530]]] & ~ [p245<=0]]]]]

abstracting: (p245<=0)
states: 736,796,520,783,070,536,845,591,952,968,633,215,613,425,921,933,229,162,496 (56)
abstracting: (1<=p530)
states: 364,502,826,002,362,257,151,038,279,179,474,770,626,553,474,632,766,193,664 (56)
..............................................................
before gc: list nodes free: 1074388

after gc: idd nodes used:476246, unused:63523754; list nodes free:287247816
.............................
before gc: list nodes free: 1046938

after gc: idd nodes used:486682, unused:63513318; list nodes free:287183754
..........................................................
EG iterations: 149
.......
before gc: list nodes free: 1061663

after gc: idd nodes used:108504, unused:63891496; list nodes free:288908973
................................
before gc: list nodes free: 1063179

after gc: idd nodes used:538643, unused:63461357; list nodes free:286974455
......
before gc: list nodes free: 977640

after gc: idd nodes used:816940, unused:63183060; list nodes free:285624156
....
before gc: list nodes free: 959426

after gc: idd nodes used:629089, unused:63370911; list nodes free:286560635
..
before gc: list nodes free: 902206

after gc: idd nodes used:636899, unused:63363101; list nodes free:286529572
.MC time: 5m27.092sec

checking: AG [EF [AG [p390<=p186]]]
normalized: ~ [E [true U ~ [E [true U ~ [E [true U ~ [p390<=p186]]]]]]]

abstracting: (p390<=p186)
states: 1,257,867,770,541,950,290,133,148,167,130,194,727,468,611,761,385,714,483,200 (57)
-> the formula is TRUE

FORMULA ResAllocation-PT-R003C100-CTLCardinality-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.713sec

checking: EX [EX [~ [E [EF [p257<=p220] U AX [p513<=0]]]]]
normalized: EX [EX [~ [E [E [true U p257<=p220] U ~ [EX [~ [p513<=0]]]]]]]

abstracting: (p513<=0)
states: 729,472,990,600,432,068,092,859,995,784,267,839,731,473,510,601,974,611,968 (56)
.abstracting: (p257<=p220)
states: 825,303,596,731,067,261,110,177,865,048,848,418,614,356,986,866,729,746,432 (56)
..-> the formula is FALSE

FORMULA ResAllocation-PT-R003C100-CTLCardinality-00 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 2.302sec

checking: EG [A [EX [p357<=0] U [p1<=1 & 1<=p259]]]
normalized: EG [[~ [EG [~ [[p1<=1 & 1<=p259]]]] & ~ [E [~ [[p1<=1 & 1<=p259]] U [~ [EX [p357<=0]] & ~ [[p1<=1 & 1<=p259]]]]]]]

abstracting: (1<=p259)
states: 682,715,450,820,645,449,182,035,336,709,040,531,654,347,107,144,663,302,144 (56)
abstracting: (p1<=1)
states: 1,419,511,971,601,939,502,357,423,537,093,994,181,923,624,388,856,767,315,968 (57)
abstracting: (p357<=0)
states: 729,506,542,989,792,021,639,122,201,927,598,472,337,860,811,964,465,283,072 (56)
.abstracting: (1<=p259)
states: 682,715,450,820,645,449,182,035,336,709,040,531,654,347,107,144,663,302,144 (56)
abstracting: (p1<=1)
states: 1,419,511,971,601,939,502,357,423,537,093,994,181,923,624,388,856,767,315,968 (57)
abstracting: (1<=p259)
states: 682,715,450,820,645,449,182,035,336,709,040,531,654,347,107,144,663,302,144 (56)
abstracting: (p1<=1)
states: 1,419,511,971,601,939,502,357,423,537,093,994,181,923,624,388,856,767,315,968 (57)
..........
before gc: list nodes free: 892083

after gc: idd nodes used:129595, unused:63870405; list nodes free:288813567
...............................................
before gc: list nodes free: 981783

after gc: idd nodes used:577505, unused:63422495; list nodes free:286731825
.......................
before gc: list nodes free: 937762

after gc: idd nodes used:585990, unused:63414010; list nodes free:286702457
............................
before gc: list nodes free: 892489

after gc: idd nodes used:403161, unused:63596839; list nodes free:287577379
..........................................
EG iterations: 150
............
before gc: list nodes free: 958965

after gc: idd nodes used:272129, unused:63727871; list nodes free:288157687
...........................
before gc: list nodes free: 1251045

after gc: idd nodes used:750025, unused:63249975; list nodes free:285980944
......
before gc: list nodes free: 1217323

after gc: idd nodes used:914157, unused:63085843; list nodes free:285172362
...
before gc: list nodes free: 1255147

after gc: idd nodes used:830031, unused:63169969; list nodes free:285634030
MC time: 6m 3.118sec

checking: AX [EG [AG [AX [[p212<=p465 | p374<=0]]]]]
normalized: ~ [EX [~ [EG [~ [E [true U EX [~ [[p212<=p465 | p374<=0]]]]]]]]]

abstracting: (p374<=0)
states: 1,054,758,700,131,806,689,202,533,693,189,705,875,386,142,684,022,384,361,472 (57)
abstracting: (p212<=p465)
states: 1,232,060,357,260,483,728,819,408,988,669,728,805,221,579,029,865,669,066,752 (57)
..
EG iterations: 1
.-> the formula is FALSE

FORMULA ResAllocation-PT-R003C100-CTLCardinality-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 2.476sec

checking: EX [[AF [AG [~ [p329<=p140]]] & [~ [p89<=p232] & p42<=0]]]
normalized: EX [[[p42<=0 & ~ [p89<=p232]] & ~ [EG [E [true U p329<=p140]]]]]

abstracting: (p329<=p140)
states: 912,224,834,378,398,949,654,931,802,099,047,783,347,430,228,452,056,236,032 (56)

EG iterations: 0
abstracting: (p89<=p232)
states: 826,276,387,036,122,578,486,320,666,726,297,713,999,310,874,957,781,663,744 (56)
abstracting: (p42<=0)
states: 1,235,659,428,010,454,229,430,307,131,667,191,117,681,917,181,197,788,643,328 (57)
.-> the formula is FALSE

FORMULA ResAllocation-PT-R003C100-CTLCardinality-04 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.562sec

checking: AX [[AF [[[AX [p540<=0] & [EX [1<=p152] & [1<=p217 | p61<=p17]]] | p190<=p432]] | AG [~ [p454<=0]]]]
normalized: ~ [EX [~ [[~ [E [true U p454<=0]] | ~ [EG [~ [[p190<=p432 | [[[1<=p217 | p61<=p17] & EX [1<=p152]] & ~ [EX [~ [p540<=0]]]]]]]]]]]]

abstracting: (p540<=0)
states: 869,329,172,602,009,075,836,943,669,485,190,546,851,774,577,652,820,606,976 (56)
.abstracting: (1<=p152)
states: 364,753,227,539,767,443,032,213,527,696,393,876,376,744,420,626,812,370,944 (56)
.abstracting: (p61<=p17)
states: 1,051,872,752,980,972,280,721,353,718,390,671,704,368,035,859,606,332,768,256 (57)
abstracting: (1<=p217)
states: 682,715,450,806,300,974,956,179,076,779,172,356,102,118,870,377,809,575,936 (56)
abstracting: (p190<=p432)
states: 1,082,439,381,684,237,938,345,760,635,202,604,585,247,524,567,634,967,265,280 (57)
..........................
before gc: list nodes free: 928743

after gc: idd nodes used:557499, unused:63442501; list nodes free:286872037
.........
before gc: list nodes free: 994780

after gc: idd nodes used:727693, unused:63272307; list nodes free:286086365
...
before gc: list nodes free: 957906

after gc: idd nodes used:735243, unused:63264757; list nodes free:286070953
.
before gc: list nodes free: 947998

after gc: idd nodes used:765747, unused:63234253; list nodes free:285921909
.
before gc: list nodes free: 932959

after gc: idd nodes used:773483, unused:63226517; list nodes free:285890741
.
before gc: list nodes free: 926095

after gc: idd nodes used:778760, unused:63221240; list nodes free:285870200
.
before gc: list nodes free: 918494

after gc: idd nodes used:780906, unused:63219094; list nodes free:285866408
.MC time: 6m55.207sec

checking: E [EF [[AG [p274<=p121] & [~ [1<=p539] & p294<=p416]]] U AG [[[p120<=0 | p471<=p452] | [[p442<=1 & 1<=p434] | [~ [1<=p182] & p119<=p570]]]]]
normalized: E [E [true U [[p294<=p416 & ~ [1<=p539]] & ~ [E [true U ~ [p274<=p121]]]]] U ~ [E [true U ~ [[[[p119<=p570 & ~ [1<=p182]] | [p442<=1 & 1<=p434]] | [p120<=0 | p471<=p452]]]]]]

abstracting: (p471<=p452)
states: 917,504,168,060,582,487,437,110,572,824,037,274,277,262,701,836,065,832,960 (56)
abstracting: (p120<=0)
states: 868,736,415,191,743,802,709,295,064,262,668,952,173,546,997,106,773,852,160 (56)
abstracting: (1<=p434)
states: 364,753,258,717,318,939,341,562,248,597,926,043,825,428,368,105,674,899,456 (56)
abstracting: (p442<=1)
states: 1,419,511,971,601,939,502,357,423,537,093,994,181,923,624,388,856,767,315,968 (57)
abstracting: (1<=p182)
states: 364,753,273,499,907,823,099,864,831,954,666,478,776,137,325,651,163,086,848 (56)
abstracting: (p119<=p570)
states: 833,257,378,974,927,633,099,925,504,881,159,774,214,999,287,163,946,795,008 (56)
abstracting: (p274<=p121)
states: 1,133,632,595,175,099,725,597,735,475,655,506,447,851,445,234,702,080,802,816 (57)
abstracting: (1<=p539)
states: 683,032,251,582,690,482,256,105,783,148,576,659,724,045,179,046,120,652,800 (56)
abstracting: (p294<=p416)
states: 1,281,290,305,715,710,597,665,863,645,432,367,334,579,836,940,663,551,688,704 (57)
-> the formula is FALSE

FORMULA ResAllocation-PT-R003C100-CTLCardinality-12 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 1.984sec

checking: [EX [[AG [EX [0<=0]] & AX [[EG [1<=p331] & E [p306<=0 U p436<=p35]]]]] & [A [[p440<=p227 | [~ [[1<=p385 & EX [p216<=0]]] | ~ [AF [p143<=p173]]]] U AX [~ [EX [p487<=0]]]] & [EF [[EF [p494<=p87] | AG [AF [1<=p475]]]] | EG [E [A [p453<=p510 U 1<=p566] U 1<=p459]]]]]
normalized: [[[EG [E [[~ [EG [~ [1<=p566]]] & ~ [E [~ [1<=p566] U [~ [p453<=p510] & ~ [1<=p566]]]]] U 1<=p459]] | E [true U [~ [E [true U EG [~ [1<=p475]]]] | E [true U p494<=p87]]]] & [~ [EG [EX [EX [p487<=0]]]] & ~ [E [EX [EX [p487<=0]] U [~ [[p440<=p227 | [EG [~ [p143<=p173]] | ~ [[1<=p385 & EX [p216<=0]]]]]] & EX [EX [p487<=0]]]]]]] & EX [[~ [EX [~ [[E [p306<=0 U p436<=p35] & EG [1<=p331]]]]] & ~ [E [true U ~ [EX [0<=0]]]]]]]

abstracting: (0<=0)
states: 1,419,511,971,601,939,502,357,423,537,093,994,181,923,624,388,856,767,315,968 (57)
.abstracting: (1<=p331)
states: 682,715,450,820,591,623,199,994,744,764,488,573,711,387,401,761,660,600,320 (56)
......................
before gc: list nodes free: 822391

after gc: idd nodes used:308161, unused:63691839; list nodes free:288003589
....................................
before gc: list nodes free: 1040224

after gc: idd nodes used:593047, unused:63406953; list nodes free:286683103
.....................
before gc: list nodes free: 994526

after gc: idd nodes used:565610, unused:63434390; list nodes free:286841568
......................
before gc: list nodes free: 977891

after gc: idd nodes used:510966, unused:63489034; list nodes free:287092508
.....................................................
EG iterations: 154
abstracting: (p436<=p35)
states: 1,323,363,751,927,128,214,273,420,427,283,452,334,369,648,754,525,655,269,376 (57)
abstracting: (p306<=0)
states: 1,233,490,346,959,490,488,443,734,553,101,191,888,164,719,114,524,639,100,928 (57)
..abstracting: (p487<=0)
states: 736,794,757,567,365,858,897,889,155,412,234,498,462,112,487,751,341,309,952 (56)
..abstracting: (p216<=0)
states: 868,737,075,429,138,760,654,094,406,611,473,583,546,994,438,711,625,646,080 (56)
.abstracting: (1<=p385)
states: 682,715,450,757,910,056,136,002,560,288,095,786,169,709,701,964,605,947,904 (56)
abstracting: (p143<=p173)
states: 1,066,997,795,660,160,448,641,451,935,517,927,396,212,957,539,854,851,244,032 (57)
.
before gc: list nodes free: 820159

after gc: idd nodes used:102896, unused:63897104; list nodes free:288931430
......................................................
before gc: list nodes free: 1101169

after gc: idd nodes used:634729, unused:63365271; list nodes free:286478171
....................
before gc: list nodes free: 1060671

after gc: idd nodes used:642900, unused:63357100; list nodes free:286468413
..................
before gc: list nodes free: 1034674

after gc: idd nodes used:671100, unused:63328900; list nodes free:286310322
.MC time: 6m54.099sec

checking: [AF [EX [[[~ [p188<=0] | ~ [1<=p115]] & EG [~ [p361<=p476]]]]] & AX [[[AG [E [1<=p29 U 1<=p328]] & [[[p293<=p3 & [p431<=0 & ~ [1<=p588]]] | ~ [p94<=0]] | [[1<=p238 & p440<=p121] | ~ [p379<=0]]]] | A [AX [EX [p509<=0]] U [1<=p571 | EG [p209<=p379]]]]]]
normalized: [~ [EX [~ [[[~ [E [~ [[1<=p571 | EG [p209<=p379]]] U [EX [~ [EX [p509<=0]]] & ~ [[1<=p571 | EG [p209<=p379]]]]]] & ~ [EG [~ [[1<=p571 | EG [p209<=p379]]]]]] | [[[~ [p379<=0] | [1<=p238 & p440<=p121]] | [~ [p94<=0] | [p293<=p3 & [p431<=0 & ~ [1<=p588]]]]] & ~ [E [true U ~ [E [1<=p29 U 1<=p328]]]]]]]]] & ~ [EG [~ [EX [[EG [~ [p361<=p476]] & [~ [1<=p115] | ~ [p188<=0]]]]]]]]

abstracting: (p188<=0)
states: 1,054,758,701,185,387,119,826,633,748,094,324,445,117,485,540,514,707,013,632 (57)
abstracting: (1<=p115)
states: 682,716,111,087,216,364,471,031,418,110,654,469,612,769,652,244,530,331,648 (56)
abstracting: (p361<=p476)
states: 912,224,623,020,697,684,055,449,878,690,862,275,763,575,873,952,481,804,288 (56)
........................................................
before gc: list nodes free: 1006001

after gc: idd nodes used:566270, unused:63433730; list nodes free:286825370
........................
before gc: list nodes free: 1069107

after gc: idd nodes used:654390, unused:63345610; list nodes free:286394824
...........................
before gc: list nodes free: 1050744

after gc: idd nodes used:580744, unused:63419256; list nodes free:286722829
...............................................
EG iterations: 154
...
EG iterations: 2
abstracting: (1<=p328)
states: 186,021,624,642,291,085,961,087,822,984,326,885,787,434,485,022,770,331,648 (56)
abstracting: (1<=p29)
states: 675,388,434,533,704,988,444,845,318,554,737,112,041,332,804,580,662,050,816 (56)
abstracting: (1<=p588)
states: 443,423,276,413,185,213,580,956,569,385,235,234,811,307,758,266,458,570,752 (56)
abstracting: (p431<=0)
states: 736,796,516,064,646,239,719,560,303,267,754,600,015,602,104,367,795,142,656 (56)
abstracting: (p293<=p3)
states: 1,032,422,842,104,890,003,214,308,004,064,981,391,194,823,004,515,901,374,464 (57)
abstracting: (p94<=0)
states: 868,751,566,678,477,229,531,808,588,819,016,310,357,222,655,351,068,819,456 (56)
abstracting: (p440<=p121)
states: 1,230,187,002,864,261,798,910,354,735,937,357,385,010,944,602,358,937,550,848 (57)
abstracting: (1<=p238)
states: 550,774,896,133,822,293,330,248,637,098,590,559,829,123,305,275,679,309,824 (56)
abstracting: (p379<=0)
states: 736,796,520,755,377,740,675,427,511,808,129,879,145,238,691,229,745,545,216 (56)
abstracting: (p209<=p379)
states: 1,065,149,079,131,873,828,601,828,585,903,514,979,992,599,252,516,565,155,840 (57)
..........
before gc: list nodes free: 921245

after gc: idd nodes used:242407, unused:63757593; list nodes free:288295486
................................................
before gc: list nodes free: 1013002

after gc: idd nodes used:602317, unused:63397683; list nodes free:286654981
........................
before gc: list nodes free: 911674

after gc: idd nodes used:583488, unused:63416512; list nodes free:286759413
MC time: 5m45.099sec

checking: [[[AX [[[EF [[~ [p64<=1] | ~ [p365<=p582]]] & [1<=p409 | p381<=0]] | ~ [p595<=p466]]] & [EG [AG [1<=p87]] | [E [p113<=p48 U ~ [[AX [1<=p402] | AF [p563<=0]]]] & A [[EF [p289<=p232] & ~ [AG [p176<=p231]]] U [[EF [1<=p466] | EG [1<=p101]] & ~ [[1<=p56 | p103<=p541]]]]]]] & E [~ [AG [p95<=0]] U p131<=p528]] & [EF [[p168<=0 & p324<=1]] & [EG [AG [p342<=0]] & E [1<=p138 U AF [~ [p79<=p42]]]]]]
normalized: [[[E [1<=p138 U ~ [EG [p79<=p42]]] & EG [~ [E [true U ~ [p342<=0]]]]] & E [true U [p168<=0 & p324<=1]]] & [E [E [true U ~ [p95<=0]] U p131<=p528] & [[[[~ [EG [~ [[~ [[1<=p56 | p103<=p541]] & [EG [1<=p101] | E [true U 1<=p466]]]]]] & ~ [E [~ [[~ [[1<=p56 | p103<=p541]] & [EG [1<=p101] | E [true U 1<=p466]]]] U [~ [[E [true U ~ [p176<=p231]] & E [true U p289<=p232]]] & ~ [[~ [[1<=p56 | p103<=p541]] & [EG [1<=p101] | E [true U 1<=p466]]]]]]]] & E [p113<=p48 U ~ [[~ [EG [~ [p563<=0]]] | ~ [EX [~ [1<=p402]]]]]]] | EG [~ [E [true U ~ [1<=p87]]]]] & ~ [EX [~ [[~ [p595<=p466] | [[1<=p409 | p381<=0] & E [true U [~ [p365<=p582] | ~ [p64<=1]]]]]]]]]]]

abstracting: (p64<=1)
states: 1,419,511,971,601,939,502,357,423,537,093,994,181,923,624,388,856,767,315,968 (57)
abstracting: (p365<=p582)
states: 852,203,855,636,677,256,595,622,634,084,585,747,211,542,943,157,746,401,280 (56)
abstracting: (p381<=0)
states: 729,506,542,951,279,003,204,804,372,955,844,593,051,527,427,119,428,665,344 (56)
abstracting: (1<=p409)
states: 682,715,450,081,006,122,818,768,947,172,558,665,777,856,687,981,251,788,800 (56)
abstracting: (p595<=p466)
states: 803,338,170,148,595,461,614,561,781,266,297,858,790,148,834,314,332,143,616 (56)
.abstracting: (1<=p87)
states: 689,987,341,912,129,960,588,776,421,144,827,550,229,344,876,090,416,431,104 (56)
.
EG iterations: 1
abstracting: (1<=p402)
states: 186,021,625,072,353,214,390,600,660,312,631,254,036,107,443,975,554,596,864 (56)
.abstracting: (p563<=0)
states: 733,135,929,456,860,410,150,070,247,697,113,206,232,697,740,319,472,484,352 (56)
..............................................
before gc: list nodes free: 1066480

after gc: idd nodes used:570647, unused:63429353; list nodes free:286810573
.......................
before gc: list nodes free: 1039693

after gc: idd nodes used:636967, unused:63363033; list nodes free:286520491
..................
before gc: list nodes free: 1012933

after gc: idd nodes used:659912, unused:63340088; list nodes free:286398465
.........................
before gc: list nodes free: 1008291

after gc: idd nodes used:602028, unused:63397972; list nodes free:286628476
..........................................
EG iterations: 154
abstracting: (p113<=p48)
states: 1,002,144,348,955,128,412,137,815,611,510,819,229,387,593,743,274,623,369,216 (57)
abstracting: (1<=p466)
states: 550,775,088,097,919,579,475,171,897,606,837,755,465,393,146,155,988,156,416 (56)
abstracting: (1<=p101)
states: 682,711,238,244,399,532,504,222,116,880,750,188,471,062,072,153,092,390,912 (56)
.................
before gc: list nodes free: 1000479

after gc: idd nodes used:334623, unused:63665377; list nodes free:287884124
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 6190200 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16097976 kB

BK_TIME_CONFINEMENT_REACHED

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

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


iterations count:3045 (7), effective:600 (1)

initing FirstDep: 0m 0.001sec


iterations count:499 (1), effective:15 (0)

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

iterations count:428 (1), effective:5 (0)

net_ddint.h:600: Timeout: after 326 sec


iterations count:509 (1), effective:16 (0)

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

iterations count:567 (1), effective:26 (0)

iterations count:4244 (10), effective:668 (1)

iterations count:4388 (10), effective:688 (1)

net_ddint.h:600: Timeout: after 362 sec


iterations count:608 (1), effective:32 (0)

iterations count:522 (1), effective:19 (0)

net_ddint.h:600: Timeout: after 414 sec


iterations count:564 (1), effective:24 (0)

iterations count:429 (1), effective:5 (0)

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

iterations count:4402 (11), effective:691 (1)

iterations count:436 (1), effective:5 (0)

net_ddint.h:600: Timeout: after 413 sec


iterations count:499 (1), effective:15 (0)

iterations count:476 (1), effective:12 (0)

net_ddint.h:600: Timeout: after 344 sec


iterations count:435 (1), effective:5 (0)

iterations count:461 (1), effective:10 (0)

iterations count:463 (1), effective:9 (0)

iterations count:419 (1), effective:3 (0)

net_ddint.h:600: Timeout: after 287 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="ResAllocation-PT-R003C100"
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 ResAllocation-PT-R003C100, 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 r330-tall-167889203600721"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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