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.r138-smll-167819419300033.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 Dekker-PT-100, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r138-smll-167819419300033
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 6.4M
-rw-r--r-- 1 mcc users 8.7K Feb 26 01:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 95K Feb 26 01:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.2K Feb 26 01:46 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K Feb 26 01:46 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Feb 25 15:56 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 15:56 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K Feb 25 15:56 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Feb 25 15:56 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 26 01:50 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 117K Feb 26 01:50 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.6K Feb 26 01:48 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 41K Feb 26 01:48 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 15:56 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 15:56 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 5.9M Mar 5 18:22 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1678539011628

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=Dekker-PT-100
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-11 12:50:14] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-11 12:50:14] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-11 12:50:15] [INFO ] Load time of PNML (sax parser for PT used): 908 ms
[2023-03-11 12:50:15] [INFO ] Transformed 500 places.
[2023-03-11 12:50:15] [INFO ] Transformed 10200 transitions.
[2023-03-11 12:50:15] [INFO ] Found NUPN structural information;
[2023-03-11 12:50:15] [INFO ] Parsed PT model containing 500 places and 10200 transitions and 80200 arcs in 1101 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 22 ms.
Initial state reduction rules removed 2 formulas.
FORMULA Dekker-PT-100-CTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-100-CTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 98 out of 500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 500/500 places, 10200/10200 transitions.
Applied a total of 0 rules in 566 ms. Remains 500 /500 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
[2023-03-11 12:50:16] [INFO ] Flow matrix only has 400 transitions (discarded 9800 similar events)
// Phase 1: matrix 400 rows 500 cols
[2023-03-11 12:50:16] [INFO ] Computed 300 place invariants in 43 ms
[2023-03-11 12:50:25] [INFO ] Implicit Places using invariants in 8297 ms returned []
Implicit Place search using SMT only with invariants took 8355 ms to find 0 implicit places.
[2023-03-11 12:50:25] [INFO ] Flow matrix only has 400 transitions (discarded 9800 similar events)
[2023-03-11 12:50:25] [INFO ] Invariant cache hit.
[2023-03-11 12:50:34] [INFO ] Dead Transitions using invariants and state equation in 9179 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 18114 ms. Remains : 500/500 places, 10200/10200 transitions.
Support contains 98 out of 500 places after structural reductions.
[2023-03-11 12:50:35] [INFO ] Flatten gal took : 929 ms
[2023-03-11 12:50:35] [INFO ] Initial state reduction rules for CTL removed 3 formulas.
FORMULA Dekker-PT-100-CTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-100-CTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-100-CTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-11 12:50:36] [INFO ] Flatten gal took : 537 ms
[2023-03-11 12:50:37] [INFO ] Input system was already deterministic with 10200 transitions.
Support contains 83 out of 500 places (down from 98) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 943 ms. (steps per millisecond=10 ) properties (out of 51) seen :41
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 10) seen :0
Running SMT prover for 10 properties.
[2023-03-11 12:50:38] [INFO ] Flow matrix only has 400 transitions (discarded 9800 similar events)
[2023-03-11 12:50:38] [INFO ] Invariant cache hit.
[2023-03-11 12:50:39] [INFO ] [Real]Absence check using 200 positive place invariants in 56 ms returned sat
[2023-03-11 12:50:39] [INFO ] [Real]Absence check using 200 positive and 100 generalized place invariants in 27 ms returned sat
[2023-03-11 12:50:40] [INFO ] After 745ms SMT Verify possible using state equation in real domain returned unsat :0 sat :8 real:2
[2023-03-11 12:50:40] [INFO ] State equation strengthened by 100 read => feed constraints.
[2023-03-11 12:50:41] [INFO ] After 642ms SMT Verify possible using 100 Read/Feed constraints in real domain returned unsat :0 sat :0 real:10
[2023-03-11 12:50:41] [INFO ] After 2075ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:10
[2023-03-11 12:50:41] [INFO ] [Nat]Absence check using 200 positive place invariants in 78 ms returned sat
[2023-03-11 12:50:41] [INFO ] [Nat]Absence check using 200 positive and 100 generalized place invariants in 46 ms returned sat
[2023-03-11 12:50:42] [INFO ] After 730ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :10
[2023-03-11 12:50:43] [INFO ] After 611ms SMT Verify possible using 100 Read/Feed constraints in natural domain returned unsat :0 sat :10
[2023-03-11 12:50:44] [INFO ] Deduced a trap composed of 4 places in 1048 ms of which 8 ms to minimize.
[2023-03-11 12:50:45] [INFO ] Deduced a trap composed of 4 places in 1026 ms of which 2 ms to minimize.
[2023-03-11 12:50:46] [INFO ] Deduced a trap composed of 4 places in 748 ms of which 2 ms to minimize.
[2023-03-11 12:50:47] [INFO ] Deduced a trap composed of 4 places in 949 ms of which 2 ms to minimize.
[2023-03-11 12:50:47] [INFO ] Deduced a trap composed of 4 places in 781 ms of which 2 ms to minimize.
[2023-03-11 12:50:48] [INFO ] Deduced a trap composed of 4 places in 759 ms of which 1 ms to minimize.
[2023-03-11 12:50:49] [INFO ] Deduced a trap composed of 4 places in 719 ms of which 1 ms to minimize.
[2023-03-11 12:50:50] [INFO ] Deduced a trap composed of 4 places in 793 ms of which 1 ms to minimize.
[2023-03-11 12:50:51] [INFO ] Deduced a trap composed of 4 places in 789 ms of which 1 ms to minimize.
[2023-03-11 12:50:51] [INFO ] Deduced a trap composed of 4 places in 825 ms of which 2 ms to minimize.
[2023-03-11 12:50:52] [INFO ] Deduced a trap composed of 4 places in 757 ms of which 1 ms to minimize.
[2023-03-11 12:50:52] [INFO ] Trap strengthening procedure interrupted after too many repetitions 9603 ms
[2023-03-11 12:50:52] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 9612 ms
[2023-03-11 12:50:53] [INFO ] After 11017ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :10
Attempting to minimize the solution found.
Minimization took 400 ms.
[2023-03-11 12:50:53] [INFO ] After 12842ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :10
Fused 10 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 33 ms.
Support contains 13 out of 500 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 500/500 places, 10200/10200 transitions.
Applied a total of 0 rules in 981 ms. Remains 500 /500 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 986 ms. Remains : 500/500 places, 10200/10200 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 608 ms. (steps per millisecond=16 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 10) seen :0
Interrupted probabilistic random walk after 84638 steps, run timeout after 3002 ms. (steps per millisecond=28 ) properties seen :{}
Probabilistic random walk after 84638 steps, saw 78602 distinct states, run finished after 3004 ms. (steps per millisecond=28 ) properties seen :0
Running SMT prover for 10 properties.
[2023-03-11 12:50:59] [INFO ] Flow matrix only has 400 transitions (discarded 9800 similar events)
[2023-03-11 12:50:59] [INFO ] Invariant cache hit.
[2023-03-11 12:50:59] [INFO ] [Real]Absence check using 200 positive place invariants in 56 ms returned sat
[2023-03-11 12:50:59] [INFO ] [Real]Absence check using 200 positive and 100 generalized place invariants in 26 ms returned sat
[2023-03-11 12:51:00] [INFO ] After 691ms SMT Verify possible using state equation in real domain returned unsat :0 sat :8 real:2
[2023-03-11 12:51:00] [INFO ] State equation strengthened by 100 read => feed constraints.
[2023-03-11 12:51:00] [INFO ] After 583ms SMT Verify possible using 100 Read/Feed constraints in real domain returned unsat :0 sat :0 real:10
[2023-03-11 12:51:00] [INFO ] After 1791ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:10
[2023-03-11 12:51:01] [INFO ] [Nat]Absence check using 200 positive place invariants in 83 ms returned sat
[2023-03-11 12:51:01] [INFO ] [Nat]Absence check using 200 positive and 100 generalized place invariants in 39 ms returned sat
[2023-03-11 12:51:02] [INFO ] After 688ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :10
[2023-03-11 12:51:02] [INFO ] After 584ms SMT Verify possible using 100 Read/Feed constraints in natural domain returned unsat :0 sat :10
[2023-03-11 12:51:03] [INFO ] Deduced a trap composed of 4 places in 906 ms of which 1 ms to minimize.
[2023-03-11 12:51:04] [INFO ] Deduced a trap composed of 4 places in 888 ms of which 1 ms to minimize.
[2023-03-11 12:51:05] [INFO ] Deduced a trap composed of 4 places in 841 ms of which 1 ms to minimize.
[2023-03-11 12:51:06] [INFO ] Deduced a trap composed of 4 places in 869 ms of which 1 ms to minimize.
[2023-03-11 12:51:07] [INFO ] Deduced a trap composed of 4 places in 854 ms of which 1 ms to minimize.
[2023-03-11 12:51:08] [INFO ] Deduced a trap composed of 4 places in 852 ms of which 1 ms to minimize.
[2023-03-11 12:51:08] [INFO ] Deduced a trap composed of 4 places in 838 ms of which 1 ms to minimize.
[2023-03-11 12:51:09] [INFO ] Deduced a trap composed of 4 places in 815 ms of which 1 ms to minimize.
[2023-03-11 12:51:10] [INFO ] Deduced a trap composed of 4 places in 804 ms of which 1 ms to minimize.
[2023-03-11 12:51:11] [INFO ] Deduced a trap composed of 4 places in 793 ms of which 1 ms to minimize.
[2023-03-11 12:51:12] [INFO ] Deduced a trap composed of 4 places in 767 ms of which 1 ms to minimize.
[2023-03-11 12:51:12] [INFO ] Trap strengthening procedure interrupted after too many repetitions 9627 ms
[2023-03-11 12:51:12] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 9627 ms
[2023-03-11 12:51:13] [INFO ] After 10989ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :10
Attempting to minimize the solution found.
Minimization took 387 ms.
[2023-03-11 12:51:13] [INFO ] After 12663ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :10
Fused 10 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 16 ms.
Support contains 13 out of 500 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 500/500 places, 10200/10200 transitions.
Applied a total of 0 rules in 799 ms. Remains 500 /500 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 799 ms. Remains : 500/500 places, 10200/10200 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 500/500 places, 10200/10200 transitions.
Applied a total of 0 rules in 558 ms. Remains 500 /500 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
[2023-03-11 12:51:14] [INFO ] Flow matrix only has 400 transitions (discarded 9800 similar events)
[2023-03-11 12:51:14] [INFO ] Invariant cache hit.
[2023-03-11 12:51:25] [INFO ] Implicit Places using invariants in 10724 ms returned [200, 203, 206, 209, 212, 215, 218, 221, 224, 227, 230, 233, 236, 239, 242, 245, 248, 251, 254, 257, 260, 263, 266, 269, 272, 275, 278, 281, 284, 287, 290, 293, 296, 299, 302, 305, 308, 311, 314, 317, 320, 323, 326, 329, 332, 335, 338, 341, 344, 347, 350, 353, 356, 359, 362, 365, 368, 371, 374, 377, 380, 383, 386, 389, 392, 395, 398, 401, 404, 407, 410, 413, 416, 419, 422, 425, 428, 431, 434, 437, 440, 443, 446, 449, 452, 455, 458, 461, 464, 467, 470, 473, 476, 479, 482, 485, 488, 491, 494, 497]
Discarding 100 places :
Implicit Place search using SMT only with invariants took 10754 ms to find 100 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 400/500 places, 10200/10200 transitions.
Applied a total of 0 rules in 737 ms. Remains 400 /400 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 12053 ms. Remains : 400/500 places, 10200/10200 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 679 ms. (steps per millisecond=14 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 10) seen :0
Interrupted probabilistic random walk after 102313 steps, run timeout after 3003 ms. (steps per millisecond=34 ) properties seen :{}
Probabilistic random walk after 102313 steps, saw 94950 distinct states, run finished after 3003 ms. (steps per millisecond=34 ) properties seen :0
Running SMT prover for 10 properties.
[2023-03-11 12:51:30] [INFO ] Flow matrix only has 400 transitions (discarded 9800 similar events)
// Phase 1: matrix 400 rows 400 cols
[2023-03-11 12:51:30] [INFO ] Computed 200 place invariants in 3 ms
[2023-03-11 12:51:30] [INFO ] [Real]Absence check using 200 positive place invariants in 44 ms returned sat
[2023-03-11 12:51:31] [INFO ] After 431ms SMT Verify possible using state equation in real domain returned unsat :0 sat :10
[2023-03-11 12:51:31] [INFO ] State equation strengthened by 100 read => feed constraints.
[2023-03-11 12:51:31] [INFO ] After 536ms SMT Verify possible using 100 Read/Feed constraints in real domain returned unsat :0 sat :0 real:10
[2023-03-11 12:51:31] [INFO ] After 1378ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:10
[2023-03-11 12:51:32] [INFO ] [Nat]Absence check using 200 positive place invariants in 68 ms returned sat
[2023-03-11 12:51:32] [INFO ] After 572ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :10
[2023-03-11 12:51:33] [INFO ] After 523ms SMT Verify possible using 100 Read/Feed constraints in natural domain returned unsat :0 sat :10
[2023-03-11 12:51:33] [INFO ] Deduced a trap composed of 4 places in 551 ms of which 1 ms to minimize.
[2023-03-11 12:51:34] [INFO ] Deduced a trap composed of 4 places in 494 ms of which 1 ms to minimize.
[2023-03-11 12:51:34] [INFO ] Deduced a trap composed of 4 places in 479 ms of which 0 ms to minimize.
[2023-03-11 12:51:35] [INFO ] Deduced a trap composed of 4 places in 520 ms of which 1 ms to minimize.
[2023-03-11 12:51:35] [INFO ] Deduced a trap composed of 4 places in 421 ms of which 1 ms to minimize.
[2023-03-11 12:51:36] [INFO ] Deduced a trap composed of 4 places in 409 ms of which 1 ms to minimize.
[2023-03-11 12:51:36] [INFO ] Deduced a trap composed of 4 places in 403 ms of which 1 ms to minimize.
[2023-03-11 12:51:37] [INFO ] Deduced a trap composed of 4 places in 388 ms of which 1 ms to minimize.
[2023-03-11 12:51:37] [INFO ] Deduced a trap composed of 4 places in 407 ms of which 1 ms to minimize.
[2023-03-11 12:51:38] [INFO ] Deduced a trap composed of 4 places in 409 ms of which 2 ms to minimize.
[2023-03-11 12:51:38] [INFO ] Deduced a trap composed of 4 places in 393 ms of which 4 ms to minimize.
[2023-03-11 12:51:38] [INFO ] Trap strengthening procedure interrupted after too many repetitions 5181 ms
[2023-03-11 12:51:38] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 5182 ms
[2023-03-11 12:51:39] [INFO ] Deduced a trap composed of 4 places in 394 ms of which 1 ms to minimize.
[2023-03-11 12:51:39] [INFO ] Deduced a trap composed of 4 places in 429 ms of which 1 ms to minimize.
[2023-03-11 12:51:40] [INFO ] Deduced a trap composed of 4 places in 426 ms of which 1 ms to minimize.
[2023-03-11 12:51:40] [INFO ] Deduced a trap composed of 4 places in 412 ms of which 1 ms to minimize.
[2023-03-11 12:51:41] [INFO ] Deduced a trap composed of 4 places in 423 ms of which 3 ms to minimize.
[2023-03-11 12:51:41] [INFO ] Deduced a trap composed of 4 places in 385 ms of which 0 ms to minimize.
[2023-03-11 12:51:41] [INFO ] Deduced a trap composed of 4 places in 369 ms of which 1 ms to minimize.
[2023-03-11 12:51:42] [INFO ] Deduced a trap composed of 4 places in 372 ms of which 1 ms to minimize.
[2023-03-11 12:51:42] [INFO ] Deduced a trap composed of 4 places in 342 ms of which 1 ms to minimize.
[2023-03-11 12:51:42] [INFO ] Deduced a trap composed of 4 places in 329 ms of which 1 ms to minimize.
[2023-03-11 12:51:43] [INFO ] Deduced a trap composed of 4 places in 318 ms of which 1 ms to minimize.
[2023-03-11 12:51:43] [INFO ] Trap strengthening procedure interrupted after too many repetitions 4488 ms
[2023-03-11 12:51:43] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 4488 ms
[2023-03-11 12:51:43] [INFO ] After 10781ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :10
Attempting to minimize the solution found.
Minimization took 307 ms.
[2023-03-11 12:51:43] [INFO ] After 12067ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :10
Fused 10 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 9 ms.
Support contains 13 out of 400 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 400/400 places, 10200/10200 transitions.
Applied a total of 0 rules in 463 ms. Remains 400 /400 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 463 ms. Remains : 400/400 places, 10200/10200 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 400/400 places, 10200/10200 transitions.
Applied a total of 0 rules in 460 ms. Remains 400 /400 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
[2023-03-11 12:51:44] [INFO ] Flow matrix only has 400 transitions (discarded 9800 similar events)
[2023-03-11 12:51:44] [INFO ] Invariant cache hit.
[2023-03-11 12:51:47] [INFO ] Implicit Places using invariants in 2517 ms returned []
Implicit Place search using SMT only with invariants took 2520 ms to find 0 implicit places.
[2023-03-11 12:51:47] [INFO ] Flow matrix only has 400 transitions (discarded 9800 similar events)
[2023-03-11 12:51:47] [INFO ] Invariant cache hit.
[2023-03-11 12:51:53] [INFO ] Dead Transitions using invariants and state equation in 6516 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9502 ms. Remains : 400/400 places, 10200/10200 transitions.
Graph (complete) has 600 edges and 400 vertex of which 48 are kept as prefixes of interest. Removing 352 places using SCC suffix rule.4 ms
Discarding 352 places :
Also discarding 8976 output transitions
Drop transitions removed 8976 transitions
Ensure Unique test removed 1176 transitions
Reduce isomorphic transitions removed 1176 transitions.
Iterating post reduction 0 with 1176 rules applied. Total rules applied 1177 place count 48 transition count 48
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 1 with 24 rules applied. Total rules applied 1201 place count 32 transition count 40
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 1209 place count 32 transition count 32
Free-agglomeration rule applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 1211 place count 32 transition count 30
Ensure Unique test removed 2 places
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 1217 place count 28 transition count 28
Applied a total of 1217 rules in 56 ms. Remains 28 /400 variables (removed 372) and now considering 28/10200 (removed 10172) transitions.
Running SMT prover for 10 properties.
// Phase 1: matrix 28 rows 28 cols
[2023-03-11 12:51:53] [INFO ] Computed 14 place invariants in 1 ms
[2023-03-11 12:51:53] [INFO ] [Real]Absence check using 14 positive place invariants in 3 ms returned sat
[2023-03-11 12:51:54] [INFO ] After 54ms SMT Verify possible using state equation in real domain returned unsat :0 sat :10
[2023-03-11 12:51:54] [INFO ] After 112ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:10
[2023-03-11 12:51:54] [INFO ] After 172ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:10
[2023-03-11 12:51:54] [INFO ] [Nat]Absence check using 14 positive place invariants in 5 ms returned sat
[2023-03-11 12:51:54] [INFO ] After 49ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :10
[2023-03-11 12:51:54] [INFO ] After 97ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :10
Attempting to minimize the solution found.
Minimization took 35 ms.
[2023-03-11 12:51:54] [INFO ] After 206ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :10
[2023-03-11 12:51:54] [INFO ] Flatten gal took : 498 ms
[2023-03-11 12:51:55] [INFO ] Flatten gal took : 456 ms
[2023-03-11 12:51:56] [INFO ] Input system was already deterministic with 10200 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 500/500 places, 10200/10200 transitions.
Applied a total of 0 rules in 1289 ms. Remains 500 /500 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 1290 ms. Remains : 500/500 places, 10200/10200 transitions.
[2023-03-11 12:51:58] [INFO ] Flatten gal took : 368 ms
[2023-03-11 12:51:58] [INFO ] Flatten gal took : 412 ms
[2023-03-11 12:51:59] [INFO ] Input system was already deterministic with 10200 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 500/500 places, 10200/10200 transitions.
Applied a total of 0 rules in 846 ms. Remains 500 /500 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 847 ms. Remains : 500/500 places, 10200/10200 transitions.
[2023-03-11 12:52:00] [INFO ] Flatten gal took : 374 ms
[2023-03-11 12:52:00] [INFO ] Flatten gal took : 386 ms
[2023-03-11 12:52:01] [INFO ] Input system was already deterministic with 10200 transitions.
Starting structural reductions in LTL mode, iteration 0 : 500/500 places, 10200/10200 transitions.
Applied a total of 0 rules in 127 ms. Remains 500 /500 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 128 ms. Remains : 500/500 places, 10200/10200 transitions.
[2023-03-11 12:52:02] [INFO ] Flatten gal took : 484 ms
[2023-03-11 12:52:02] [INFO ] Flatten gal took : 678 ms
[2023-03-11 12:52:03] [INFO ] Input system was already deterministic with 10200 transitions.
Starting structural reductions in LTL mode, iteration 0 : 500/500 places, 10200/10200 transitions.
Applied a total of 0 rules in 131 ms. Remains 500 /500 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 131 ms. Remains : 500/500 places, 10200/10200 transitions.
[2023-03-11 12:52:04] [INFO ] Flatten gal took : 503 ms
[2023-03-11 12:52:04] [INFO ] Flatten gal took : 659 ms
[2023-03-11 12:52:05] [INFO ] Input system was already deterministic with 10200 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 500/500 places, 10200/10200 transitions.
Applied a total of 0 rules in 664 ms. Remains 500 /500 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 668 ms. Remains : 500/500 places, 10200/10200 transitions.
[2023-03-11 12:52:07] [INFO ] Flatten gal took : 365 ms
[2023-03-11 12:52:07] [INFO ] Flatten gal took : 405 ms
[2023-03-11 12:52:08] [INFO ] Input system was already deterministic with 10200 transitions.
Starting structural reductions in LTL mode, iteration 0 : 500/500 places, 10200/10200 transitions.
Applied a total of 0 rules in 128 ms. Remains 500 /500 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 129 ms. Remains : 500/500 places, 10200/10200 transitions.
[2023-03-11 12:52:08] [INFO ] Flatten gal took : 477 ms
[2023-03-11 12:52:09] [INFO ] Flatten gal took : 462 ms
[2023-03-11 12:52:09] [INFO ] Input system was already deterministic with 10200 transitions.
Starting structural reductions in LTL mode, iteration 0 : 500/500 places, 10200/10200 transitions.
Applied a total of 0 rules in 124 ms. Remains 500 /500 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 124 ms. Remains : 500/500 places, 10200/10200 transitions.
[2023-03-11 12:52:10] [INFO ] Flatten gal took : 362 ms
[2023-03-11 12:52:10] [INFO ] Flatten gal took : 408 ms
[2023-03-11 12:52:11] [INFO ] Input system was already deterministic with 10200 transitions.
Starting structural reductions in LTL mode, iteration 0 : 500/500 places, 10200/10200 transitions.
Applied a total of 0 rules in 124 ms. Remains 500 /500 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 124 ms. Remains : 500/500 places, 10200/10200 transitions.
[2023-03-11 12:52:12] [INFO ] Flatten gal took : 374 ms
[2023-03-11 12:52:12] [INFO ] Flatten gal took : 385 ms
[2023-03-11 12:52:13] [INFO ] Input system was already deterministic with 10200 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 500/500 places, 10200/10200 transitions.
Applied a total of 0 rules in 622 ms. Remains 500 /500 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 624 ms. Remains : 500/500 places, 10200/10200 transitions.
[2023-03-11 12:52:14] [INFO ] Flatten gal took : 359 ms
[2023-03-11 12:52:14] [INFO ] Flatten gal took : 407 ms
[2023-03-11 12:52:15] [INFO ] Input system was already deterministic with 10200 transitions.
Starting structural reductions in LTL mode, iteration 0 : 500/500 places, 10200/10200 transitions.
Applied a total of 0 rules in 188 ms. Remains 500 /500 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 188 ms. Remains : 500/500 places, 10200/10200 transitions.
[2023-03-11 12:52:15] [INFO ] Flatten gal took : 359 ms
[2023-03-11 12:52:16] [INFO ] Flatten gal took : 407 ms
[2023-03-11 12:52:17] [INFO ] Input system was already deterministic with 10200 transitions.
Starting structural reductions in LTL mode, iteration 0 : 500/500 places, 10200/10200 transitions.
Applied a total of 0 rules in 212 ms. Remains 500 /500 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 212 ms. Remains : 500/500 places, 10200/10200 transitions.
[2023-03-11 12:52:17] [INFO ] Flatten gal took : 378 ms
[2023-03-11 12:52:18] [INFO ] Flatten gal took : 400 ms
[2023-03-11 12:52:18] [INFO ] Input system was already deterministic with 10200 transitions.
[2023-03-11 12:52:19] [INFO ] Flatten gal took : 392 ms
[2023-03-11 12:52:19] [INFO ] Flatten gal took : 409 ms
[2023-03-11 12:52:19] [INFO ] Export to MCC of 11 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 3 ms.
[2023-03-11 12:52:19] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 500 places, 10200 transitions and 80200 arcs took 81 ms.
Total runtime 125003 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: 500 NrTr: 10200 NrArc: 80200)

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

net check time: 0m 0.013sec

init dd package: 0m 3.176sec

TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 10500128 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16088052 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.530sec

2285 6524 9674 12160 15542 306929

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="Dekker-PT-100"
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 Dekker-PT-100, 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 r138-smll-167819419300033"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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