Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2023-input.r042-tajo-167813695400201.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2023-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool marciexred
Input is BridgeAndVehicles-PT-V20P20N10, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r042-tajo-167813695400201
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.2M
-rw-r--r-- 1 mcc users 11K Feb 25 12:08 CTLCardinality.txt
-rw-r--r-- 1 mcc users 89K Feb 25 12:08 CTLCardinality.xml
-rw-r--r-- 1 mcc users 40K Feb 25 12:07 CTLFireability.txt
-rw-r--r-- 1 mcc users 169K Feb 25 12:07 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 4.8K Feb 25 15:35 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 15:35 LTLCardinality.xml
-rw-r--r-- 1 mcc users 51K Feb 25 15:35 LTLFireability.txt
-rw-r--r-- 1 mcc users 165K Feb 25 15:35 LTLFireability.xml
-rw-r--r-- 1 mcc users 20K Feb 25 12:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 142K Feb 25 12:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 194K Feb 25 12:15 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 798K Feb 25 12:15 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 15:35 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.7K Feb 25 15:35 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 10 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 434K 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 BridgeAndVehicles-PT-V20P20N10-CTLCardinality-00
FORMULA_NAME BridgeAndVehicles-PT-V20P20N10-CTLCardinality-01
FORMULA_NAME BridgeAndVehicles-PT-V20P20N10-CTLCardinality-02
FORMULA_NAME BridgeAndVehicles-PT-V20P20N10-CTLCardinality-03
FORMULA_NAME BridgeAndVehicles-PT-V20P20N10-CTLCardinality-04
FORMULA_NAME BridgeAndVehicles-PT-V20P20N10-CTLCardinality-05
FORMULA_NAME BridgeAndVehicles-PT-V20P20N10-CTLCardinality-06
FORMULA_NAME BridgeAndVehicles-PT-V20P20N10-CTLCardinality-07
FORMULA_NAME BridgeAndVehicles-PT-V20P20N10-CTLCardinality-08
FORMULA_NAME BridgeAndVehicles-PT-V20P20N10-CTLCardinality-09
FORMULA_NAME BridgeAndVehicles-PT-V20P20N10-CTLCardinality-10
FORMULA_NAME BridgeAndVehicles-PT-V20P20N10-CTLCardinality-11
FORMULA_NAME BridgeAndVehicles-PT-V20P20N10-CTLCardinality-12
FORMULA_NAME BridgeAndVehicles-PT-V20P20N10-CTLCardinality-13
FORMULA_NAME BridgeAndVehicles-PT-V20P20N10-CTLCardinality-14
FORMULA_NAME BridgeAndVehicles-PT-V20P20N10-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1678700409512

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=BridgeAndVehicles-PT-V20P20N10
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-13 09:40:11] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-13 09:40:11] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-13 09:40:11] [INFO ] Load time of PNML (sax parser for PT used): 79 ms
[2023-03-13 09:40:11] [INFO ] Transformed 68 places.
[2023-03-13 09:40:11] [INFO ] Transformed 548 transitions.
[2023-03-13 09:40:11] [INFO ] Parsed PT model containing 68 places and 548 transitions and 4070 arcs in 161 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 22 ms.
Support contains 51 out of 68 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 68/68 places, 548/548 transitions.
Applied a total of 0 rules in 14 ms. Remains 68 /68 variables (removed 0) and now considering 548/548 (removed 0) transitions.
[2023-03-13 09:40:11] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
// Phase 1: matrix 130 rows 68 cols
[2023-03-13 09:40:11] [INFO ] Computed 7 place invariants in 10 ms
[2023-03-13 09:40:12] [INFO ] Dead Transitions using invariants and state equation in 411 ms found 0 transitions.
[2023-03-13 09:40:12] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
[2023-03-13 09:40:12] [INFO ] Invariant cache hit.
[2023-03-13 09:40:12] [INFO ] Implicit Places using invariants in 43 ms returned []
[2023-03-13 09:40:12] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
[2023-03-13 09:40:12] [INFO ] Invariant cache hit.
[2023-03-13 09:40:12] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-13 09:40:12] [INFO ] Implicit Places using invariants and state equation in 154 ms returned []
Implicit Place search using SMT with State Equation took 199 ms to find 0 implicit places.
[2023-03-13 09:40:12] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
[2023-03-13 09:40:12] [INFO ] Invariant cache hit.
[2023-03-13 09:40:12] [INFO ] Dead Transitions using invariants and state equation in 257 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 912 ms. Remains : 68/68 places, 548/548 transitions.
Support contains 51 out of 68 places after structural reductions.
[2023-03-13 09:40:12] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2023-03-13 09:40:12] [INFO ] Flatten gal took : 63 ms
FORMULA BridgeAndVehicles-PT-V20P20N10-CTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-13 09:40:12] [INFO ] Flatten gal took : 32 ms
[2023-03-13 09:40:13] [INFO ] Input system was already deterministic with 548 transitions.
Support contains 50 out of 68 places (down from 51) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 56 resets, run finished after 389 ms. (steps per millisecond=25 ) properties (out of 78) seen :28
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 50) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 50) seen :1
Incomplete Best-First random walk after 1006 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 49) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 48) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 48) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 48) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 48) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 48) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=37 ) properties (out of 48) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 48) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 48) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 48) 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 48) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 48) 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 48) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 48) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 48) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 48) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 48) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 48) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 48) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 48) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 48) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 48) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 48) 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 48) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 48) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 48) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 48) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 48) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 48) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 48) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 48) 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 48) 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 48) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 48) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 48) 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 48) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 48) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 48) 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 48) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 48) 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 48) 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 48) 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 48) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 48) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 48) 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 48) seen :0
Running SMT prover for 48 properties.
[2023-03-13 09:40:13] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
[2023-03-13 09:40:13] [INFO ] Invariant cache hit.
[2023-03-13 09:40:14] [INFO ] [Real]Absence check using 7 positive place invariants in 1 ms returned sat
[2023-03-13 09:40:14] [INFO ] After 393ms SMT Verify possible using all constraints in real domain returned unsat :26 sat :0 real:22
[2023-03-13 09:40:14] [INFO ] [Nat]Absence check using 7 positive place invariants in 1 ms returned sat
[2023-03-13 09:40:14] [INFO ] After 101ms SMT Verify possible using state equation in natural domain returned unsat :44 sat :4
[2023-03-13 09:40:14] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-13 09:40:14] [INFO ] After 47ms SMT Verify possible using 22 Read/Feed constraints in natural domain returned unsat :44 sat :4
[2023-03-13 09:40:14] [INFO ] After 138ms SMT Verify possible using trap constraints in natural domain returned unsat :44 sat :4
Attempting to minimize the solution found.
Minimization took 53 ms.
[2023-03-13 09:40:14] [INFO ] After 423ms SMT Verify possible using all constraints in natural domain returned unsat :44 sat :4
Fused 48 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 10 ms.
Support contains 3 out of 68 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 68/68 places, 548/548 transitions.
Graph (complete) has 562 edges and 68 vertex of which 66 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Discarding 2 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 55 ms. Remains 66 /68 variables (removed 2) and now considering 548/548 (removed 0) transitions.
[2023-03-13 09:40:14] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
// Phase 1: matrix 130 rows 66 cols
[2023-03-13 09:40:14] [INFO ] Computed 5 place invariants in 2 ms
[2023-03-13 09:40:15] [INFO ] Dead Transitions using invariants and state equation in 514 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 570 ms. Remains : 66/68 places, 548/548 transitions.
Incomplete random walk after 10000 steps, including 56 resets, run finished after 139 ms. (steps per millisecond=71 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 20 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 557990 steps, run timeout after 3001 ms. (steps per millisecond=185 ) properties seen :{}
Probabilistic random walk after 557990 steps, saw 138070 distinct states, run finished after 3002 ms. (steps per millisecond=185 ) properties seen :0
Running SMT prover for 4 properties.
[2023-03-13 09:40:18] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
[2023-03-13 09:40:18] [INFO ] Invariant cache hit.
[2023-03-13 09:40:18] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-13 09:40:18] [INFO ] After 111ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-13 09:40:18] [INFO ] [Nat]Absence check using 5 positive place invariants in 0 ms returned sat
[2023-03-13 09:40:18] [INFO ] After 75ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-13 09:40:18] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-13 09:40:19] [INFO ] After 30ms SMT Verify possible using 22 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-13 09:40:19] [INFO ] After 79ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 23 ms.
[2023-03-13 09:40:19] [INFO ] After 215ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 18 ms.
Support contains 3 out of 66 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 66/66 places, 548/548 transitions.
Applied a total of 0 rules in 20 ms. Remains 66 /66 variables (removed 0) and now considering 548/548 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20 ms. Remains : 66/66 places, 548/548 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 66/66 places, 548/548 transitions.
Applied a total of 0 rules in 43 ms. Remains 66 /66 variables (removed 0) and now considering 548/548 (removed 0) transitions.
[2023-03-13 09:40:19] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
[2023-03-13 09:40:19] [INFO ] Invariant cache hit.
[2023-03-13 09:40:19] [INFO ] Implicit Places using invariants in 165 ms returned []
[2023-03-13 09:40:19] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
[2023-03-13 09:40:19] [INFO ] Invariant cache hit.
[2023-03-13 09:40:19] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-13 09:40:19] [INFO ] Implicit Places using invariants and state equation in 215 ms returned [22, 48]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 387 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 64/66 places, 548/548 transitions.
Applied a total of 0 rules in 45 ms. Remains 64 /64 variables (removed 0) and now considering 548/548 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 476 ms. Remains : 64/66 places, 548/548 transitions.
Incomplete random walk after 10000 steps, including 56 resets, run finished after 158 ms. (steps per millisecond=63 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 20 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 488453 steps, run timeout after 3001 ms. (steps per millisecond=162 ) properties seen :{}
Probabilistic random walk after 488453 steps, saw 122218 distinct states, run finished after 3001 ms. (steps per millisecond=162 ) properties seen :0
Running SMT prover for 4 properties.
[2023-03-13 09:40:23] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
// Phase 1: matrix 130 rows 64 cols
[2023-03-13 09:40:23] [INFO ] Computed 5 place invariants in 5 ms
[2023-03-13 09:40:23] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-13 09:40:23] [INFO ] After 54ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-13 09:40:23] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-13 09:40:23] [INFO ] After 57ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-13 09:40:23] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-13 09:40:23] [INFO ] After 47ms SMT Verify possible using 22 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-13 09:40:23] [INFO ] After 133ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 44 ms.
[2023-03-13 09:40:23] [INFO ] After 273ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 8 ms.
Support contains 3 out of 64 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 64/64 places, 548/548 transitions.
Applied a total of 0 rules in 17 ms. Remains 64 /64 variables (removed 0) and now considering 548/548 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 64/64 places, 548/548 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 64/64 places, 548/548 transitions.
Applied a total of 0 rules in 17 ms. Remains 64 /64 variables (removed 0) and now considering 548/548 (removed 0) transitions.
[2023-03-13 09:40:23] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
[2023-03-13 09:40:23] [INFO ] Invariant cache hit.
[2023-03-13 09:40:23] [INFO ] Implicit Places using invariants in 189 ms returned []
[2023-03-13 09:40:23] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
[2023-03-13 09:40:23] [INFO ] Invariant cache hit.
[2023-03-13 09:40:23] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-13 09:40:23] [INFO ] Implicit Places using invariants and state equation in 154 ms returned []
Implicit Place search using SMT with State Equation took 347 ms to find 0 implicit places.
[2023-03-13 09:40:23] [INFO ] Redundant transitions in 31 ms returned []
[2023-03-13 09:40:23] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
[2023-03-13 09:40:23] [INFO ] Invariant cache hit.
[2023-03-13 09:40:24] [INFO ] Dead Transitions using invariants and state equation in 301 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 722 ms. Remains : 64/64 places, 548/548 transitions.
Ensure Unique test removed 418 transitions
Reduce isomorphic transitions removed 418 transitions.
Iterating post reduction 0 with 418 rules applied. Total rules applied 418 place count 64 transition count 130
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 422 place count 62 transition count 128
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 1 with 2 rules applied. Total rules applied 424 place count 62 transition count 126
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 426 place count 60 transition count 126
Applied a total of 426 rules in 14 ms. Remains 60 /64 variables (removed 4) and now considering 126/548 (removed 422) transitions.
Running SMT prover for 4 properties.
// Phase 1: matrix 126 rows 60 cols
[2023-03-13 09:40:24] [INFO ] Computed 5 place invariants in 3 ms
[2023-03-13 09:40:24] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-13 09:40:24] [INFO ] After 113ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-13 09:40:24] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-13 09:40:24] [INFO ] After 50ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-13 09:40:24] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-13 09:40:24] [INFO ] After 23ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-13 09:40:24] [INFO ] After 71ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 49 ms.
[2023-03-13 09:40:24] [INFO ] After 228ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Successfully simplified 44 atomic propositions for a total of 15 simplifications.
Initial state reduction rules removed 1 formulas.
FORMULA BridgeAndVehicles-PT-V20P20N10-CTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V20P20N10-CTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V20P20N10-CTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V20P20N10-CTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V20P20N10-CTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-13 09:40:24] [INFO ] Initial state reduction rules for CTL removed 3 formulas.
[2023-03-13 09:40:24] [INFO ] Flatten gal took : 33 ms
[2023-03-13 09:40:24] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA BridgeAndVehicles-PT-V20P20N10-CTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V20P20N10-CTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V20P20N10-CTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V20P20N10-CTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-13 09:40:24] [INFO ] Flatten gal took : 35 ms
[2023-03-13 09:40:24] [INFO ] Input system was already deterministic with 548 transitions.
Support contains 18 out of 68 places (down from 28) after GAL structural reductions.
Computed a total of 51 stabilizing places and 84 stable transitions
Graph (complete) has 1190 edges and 68 vertex of which 66 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.5 ms
Starting structural reductions in SI_CTL mode, iteration 0 : 68/68 places, 548/548 transitions.
Graph (complete) has 1190 edges and 68 vertex of which 66 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.4 ms
Discarding 2 places :
Also discarding 0 output transitions
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2 place count 65 transition count 547
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 65 transition count 547
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 63 transition count 546
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 10 place count 61 transition count 544
Applied a total of 10 rules in 163 ms. Remains 61 /68 variables (removed 7) and now considering 544/548 (removed 4) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 164 ms. Remains : 61/68 places, 544/548 transitions.
[2023-03-13 09:40:24] [INFO ] Flatten gal took : 37 ms
[2023-03-13 09:40:25] [INFO ] Flatten gal took : 55 ms
[2023-03-13 09:40:25] [INFO ] Input system was already deterministic with 544 transitions.
Finished random walk after 62 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=62 )
FORMULA BridgeAndVehicles-PT-V20P20N10-CTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in LTL mode, iteration 0 : 68/68 places, 548/548 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 67 transition count 548
Applied a total of 1 rules in 6 ms. Remains 67 /68 variables (removed 1) and now considering 548/548 (removed 0) transitions.
[2023-03-13 09:40:25] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
// Phase 1: matrix 130 rows 67 cols
[2023-03-13 09:40:25] [INFO ] Computed 6 place invariants in 2 ms
[2023-03-13 09:40:25] [INFO ] Dead Transitions using invariants and state equation in 214 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 222 ms. Remains : 67/68 places, 548/548 transitions.
[2023-03-13 09:40:25] [INFO ] Flatten gal took : 16 ms
[2023-03-13 09:40:25] [INFO ] Flatten gal took : 17 ms
[2023-03-13 09:40:25] [INFO ] Input system was already deterministic with 548 transitions.
Starting structural reductions in LTL mode, iteration 0 : 68/68 places, 548/548 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 66 transition count 548
Applied a total of 2 rules in 16 ms. Remains 66 /68 variables (removed 2) and now considering 548/548 (removed 0) transitions.
[2023-03-13 09:40:25] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
// Phase 1: matrix 130 rows 66 cols
[2023-03-13 09:40:25] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-13 09:40:25] [INFO ] Dead Transitions using invariants and state equation in 221 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 243 ms. Remains : 66/68 places, 548/548 transitions.
[2023-03-13 09:40:25] [INFO ] Flatten gal took : 22 ms
[2023-03-13 09:40:25] [INFO ] Flatten gal took : 30 ms
[2023-03-13 09:40:25] [INFO ] Input system was already deterministic with 548 transitions.
Starting structural reductions in LTL mode, iteration 0 : 68/68 places, 548/548 transitions.
Applied a total of 0 rules in 3 ms. Remains 68 /68 variables (removed 0) and now considering 548/548 (removed 0) transitions.
[2023-03-13 09:40:25] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
// Phase 1: matrix 130 rows 68 cols
[2023-03-13 09:40:25] [INFO ] Computed 7 place invariants in 1 ms
[2023-03-13 09:40:26] [INFO ] Dead Transitions using invariants and state equation in 410 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 416 ms. Remains : 68/68 places, 548/548 transitions.
[2023-03-13 09:40:26] [INFO ] Flatten gal took : 16 ms
[2023-03-13 09:40:26] [INFO ] Flatten gal took : 12 ms
[2023-03-13 09:40:26] [INFO ] Input system was already deterministic with 548 transitions.
Starting structural reductions in LTL mode, iteration 0 : 68/68 places, 548/548 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 66 transition count 548
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 65 transition count 547
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 65 transition count 547
Applied a total of 4 rules in 6 ms. Remains 65 /68 variables (removed 3) and now considering 547/548 (removed 1) transitions.
[2023-03-13 09:40:26] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
// Phase 1: matrix 129 rows 65 cols
[2023-03-13 09:40:26] [INFO ] Computed 5 place invariants in 0 ms
[2023-03-13 09:40:26] [INFO ] Dead Transitions using invariants and state equation in 231 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 243 ms. Remains : 65/68 places, 547/548 transitions.
[2023-03-13 09:40:26] [INFO ] Flatten gal took : 12 ms
[2023-03-13 09:40:26] [INFO ] Flatten gal took : 13 ms
[2023-03-13 09:40:26] [INFO ] Input system was already deterministic with 547 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 68/68 places, 548/548 transitions.
Graph (complete) has 1190 edges and 68 vertex of which 66 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 0 output transitions
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2 place count 65 transition count 547
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 65 transition count 547
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 63 transition count 546
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 10 place count 61 transition count 544
Applied a total of 10 rules in 28 ms. Remains 61 /68 variables (removed 7) and now considering 544/548 (removed 4) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 28 ms. Remains : 61/68 places, 544/548 transitions.
[2023-03-13 09:40:26] [INFO ] Flatten gal took : 10 ms
[2023-03-13 09:40:26] [INFO ] Flatten gal took : 11 ms
[2023-03-13 09:40:26] [INFO ] Input system was already deterministic with 544 transitions.
[2023-03-13 09:40:26] [INFO ] Flatten gal took : 13 ms
[2023-03-13 09:40:26] [INFO ] Flatten gal took : 13 ms
[2023-03-13 09:40:26] [INFO ] Export to MCC of 5 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 1 ms.
[2023-03-13 09:40:26] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 68 places, 548 transitions and 4070 arcs took 7 ms.
Total runtime 15245 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: 68 NrTr: 548 NrArc: 4070)

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

net check time: 0m 0.000sec

init dd package: 0m 3.284sec


RS generation: 0m25.707sec


-> reachability set: #nodes 1360582 (1.4e+06) #states 6,732,570 (6)



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

checking: AF [EG [AX [1<=0]]]
normalized: ~ [EG [~ [EG [~ [EX [~ [1<=0]]]]]]]

abstracting: (1<=0)
states: 0
..
EG iterations: 1
...................................................................................................
before gc: list nodes free: 1041964

after gc: idd nodes used:2025134, unused:61974866; list nodes free:445510452
........................................................
before gc: list nodes free: 24101770

after gc: idd nodes used:1927920, unused:62072080; list nodes free:446455809
...............................................................................................................................
EG iterations: 282
-> the formula is TRUE

FORMULA BridgeAndVehicles-PT-V20P20N10-CTLCardinality-09 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 8m57.540sec

checking: AX [[AF [EG [~ [12<=p25]]] | ~ [A [AX [p22<=p0] U [[p25<=14 & p22<=8] | 26<=p55]]]]]
normalized: ~ [EX [~ [[~ [EG [~ [EG [~ [12<=p25]]]]] | ~ [[~ [E [~ [[[p25<=14 & p22<=8] | 26<=p55]] U [~ [[[p25<=14 & p22<=8] | 26<=p55]] & EX [~ [p22<=p0]]]]] & ~ [EG [~ [[[p25<=14 & p22<=8] | 26<=p55]]]]]]]]]]

abstracting: (26<=p55)
states: 0
abstracting: (p22<=8)
states: 5,000,572 (6)
abstracting: (p25<=14)
states: 1,120,080 (6)
.
EG iterations: 1
abstracting: (p22<=p0)
states: 3,542,615 (6)
.abstracting: (26<=p55)
states: 0
abstracting: (p22<=8)
states: 5,000,572 (6)
abstracting: (p25<=14)
states: 1,120,080 (6)
abstracting: (26<=p55)
states: 0
abstracting: (p22<=8)
states: 5,000,572 (6)
abstracting: (p25<=14)
states: 1,120,080 (6)
abstracting: (12<=p25)
states: 6,547,858 (6)
.....................................
EG iterations: 37

EG iterations: 0
.-> the formula is TRUE

FORMULA BridgeAndVehicles-PT-V20P20N10-CTLCardinality-02 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m42.157sec

checking: AG [[EG [~ [p0<=p48]] | E [p9<=p59 U p12<=p66]]]
normalized: ~ [E [true U ~ [[E [p9<=p59 U p12<=p66] | EG [~ [p0<=p48]]]]]]

abstracting: (p0<=p48)
states: 733,487 (5)
...........................................................................
before gc: list nodes free: 53907483

after gc: idd nodes used:3700494, unused:60299506; list nodes free:433408662
.....................................................
before gc: list nodes free: 18210179

after gc: idd nodes used:3848961, unused:60151039; list nodes free:433023768
....................................................................................................................................................
EG iterations: 276
abstracting: (p12<=p66)
states: 6,502,220 (6)
abstracting: (p9<=p59)
states: 6,374,121 (6)
-> the formula is TRUE

FORMULA BridgeAndVehicles-PT-V20P20N10-CTLCardinality-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 10m55.377sec

checking: E [EG [p22<=p52] U E [~ [p49<=p23] U AX [p0<=sum(p54, p53)]]]
normalized: E [EG [p22<=p52] U E [~ [p49<=p23] U ~ [EX [~ [p0<=sum(p54, p53)]]]]]

abstracting: (p0<=sum(p54, p53))
states: 798,363 (5)
.abstracting: (p49<=p23)
states: 1,481,838 (6)
abstracting: (p22<=p52)
states: 1,481,898 (6)
......................................................................................................
EG iterations: 102
-> the formula is FALSE

FORMULA BridgeAndVehicles-PT-V20P20N10-CTLCardinality-03 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 1m24.573sec

checking: ~ [E [~ [[[AF [p24<=p56] | sum(p54, p53)<=p49] & AX [1<=0]]] U [AF [[1<=p24 | p55<=p23]] & E [AG [p23<=18] U ~ [[p55<=p52 | AG [p24<=2]]]]]]]
normalized: ~ [E [~ [[~ [EX [~ [1<=0]]] & [sum(p54, p53)<=p49 | ~ [EG [~ [p24<=p56]]]]]] U [E [~ [E [true U ~ [p23<=18]]] U ~ [[p55<=p52 | ~ [E [true U ~ [p24<=2]]]]]] & ~ [EG [~ [[1<=p24 | p55<=p23]]]]]]]

abstracting: (p55<=p23)
states: 988,158 (5)
abstracting: (1<=p24)
states: 6,547,764 (6)
............
before gc: list nodes free: 84068010

after gc: idd nodes used:3121955, unused:60878045; list nodes free:439228637
..................................................................................................................
EG iterations: 126
abstracting: (p24<=2)
states: 1,181,778 (6)
abstracting: (p55<=p52)
states: 930,138 (5)
abstracting: (p23<=18)
states: 6,732,570 (6)
abstracting: (p24<=p56)
states: 2,882,212 (6)
.
EG iterations: 1
abstracting: (sum(p54, p53)<=p49)
states: 6,679,616 (6)
abstracting: (1<=0)
states: 0
.-> the formula is FALSE

FORMULA BridgeAndVehicles-PT-V20P20N10-CTLCardinality-07 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 2m33.392sec

totally nodes used: 336212674 (3.4e+08)
number of garbage collections: 5
fire ops cache: hits/miss/sum: 579287163 1713525114 2292812277
used/not used/entry size/cache size: 62402762 4706102 16 1024MB
basic ops cache: hits/miss/sum: 174519259 163323162 337842421
used/not used/entry size/cache size: 16006973 770243 12 192MB
unary ops cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 16777216 8 128MB
abstract ops cache: hits/miss/sum: 0 14 14
used/not used/entry size/cache size: 1 16777215 12 192MB
state nr cache: hits/miss/sum: 12488657 8616409 21105066
used/not used/entry size/cache size: 2208110 6180498 32 256MB
max state cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 8388608 32 256MB
uniqueHash elements/entry size/size: 67108864 4 256MB
0 44309037
1 16789579
2 4513238
3 1137947
4 267883
5 61748
6 15086
7 4856
8 2128
9 1905
>= 10 5457

Total processing time: 25m10.962sec


BK_STOP 1678701938277

--------------------
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

432177 471634 483487 462714 451035
iterations count:558285 (1018), effective:9187 (16)

initing FirstDep: 0m 0.000sec


iterations count:1008 (1), effective:46 (0)

iterations count:45171 (82), effective:393 (0)

iterations count:12155 (22), effective:270 (0)

iterations count:548 (1), effective:0 (0)
1351602
iterations count:131126 (239), effective:913 (1)
1275099 1284503 1293325 1299895 1309526 1319002 1328029 1334808 1344488 1357347
iterations count:1033586 (1886), effective:4457 (8)

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

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="BridgeAndVehicles-PT-V20P20N10"
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 BridgeAndVehicles-PT-V20P20N10, 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 r042-tajo-167813695400201"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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