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-167813695200041.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-COL-V20P20N10, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r042-tajo-167813695200041
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 516K
-rw-r--r-- 1 mcc users 8.1K Feb 25 12:07 CTLCardinality.txt
-rw-r--r-- 1 mcc users 77K Feb 25 12:07 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K Feb 25 12:06 CTLFireability.txt
-rw-r--r-- 1 mcc users 43K Feb 25 12:06 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.8K Feb 25 15:35 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Feb 25 15:35 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Feb 25 15:35 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Feb 25 15:35 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 25 12:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 110K Feb 25 12:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 14K Feb 25 12:14 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 104K Feb 25 12:14 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Feb 25 15:35 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Feb 25 15:35 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:22 equiv_pt
-rw-r--r-- 1 mcc users 10 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 5 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 39K 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-COL-V20P20N10-CTLCardinality-00
FORMULA_NAME BridgeAndVehicles-COL-V20P20N10-CTLCardinality-01
FORMULA_NAME BridgeAndVehicles-COL-V20P20N10-CTLCardinality-02
FORMULA_NAME BridgeAndVehicles-COL-V20P20N10-CTLCardinality-03
FORMULA_NAME BridgeAndVehicles-COL-V20P20N10-CTLCardinality-04
FORMULA_NAME BridgeAndVehicles-COL-V20P20N10-CTLCardinality-05
FORMULA_NAME BridgeAndVehicles-COL-V20P20N10-CTLCardinality-06
FORMULA_NAME BridgeAndVehicles-COL-V20P20N10-CTLCardinality-07
FORMULA_NAME BridgeAndVehicles-COL-V20P20N10-CTLCardinality-08
FORMULA_NAME BridgeAndVehicles-COL-V20P20N10-CTLCardinality-09
FORMULA_NAME BridgeAndVehicles-COL-V20P20N10-CTLCardinality-10
FORMULA_NAME BridgeAndVehicles-COL-V20P20N10-CTLCardinality-11
FORMULA_NAME BridgeAndVehicles-COL-V20P20N10-CTLCardinality-12
FORMULA_NAME BridgeAndVehicles-COL-V20P20N10-CTLCardinality-13
FORMULA_NAME BridgeAndVehicles-COL-V20P20N10-CTLCardinality-14
FORMULA_NAME BridgeAndVehicles-COL-V20P20N10-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1678688607492

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-COL-V20P20N10
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-13 06:23:29] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-13 06:23:29] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-13 06:23:29] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2023-03-13 06:23:29] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-13 06:23:29] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 442 ms
[2023-03-13 06:23:29] [INFO ] Imported 15 HL places and 11 HL transitions for a total of 68 PT places and 19578.0 transition bindings in 17 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 14 ms.
[2023-03-13 06:23:29] [INFO ] Built PT skeleton of HLPN with 15 places and 11 transitions 56 arcs in 4 ms.
[2023-03-13 06:23:29] [INFO ] Skeletonized 16 HLPN properties in 1 ms.
Computed a total of 12 stabilizing places and 6 stable transitions
Graph (complete) has 51 edges and 15 vertex of which 13 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Remains 16 properties that can be checked using skeleton over-approximation.
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce redundant transitions removed 1 transitions.
Computed a total of 9 stabilizing places and 6 stable transitions
Graph (complete) has 22 edges and 12 vertex of which 10 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 522 ms. (steps per millisecond=19 ) properties (out of 80) seen :28
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 52) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=76 ) properties (out of 52) 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 52) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 51) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 51) 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 51) 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 51) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 50) 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 50) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 50) 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 50) 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 50) 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 50) 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 50) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 50) 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 50) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 50) 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 50) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=76 ) properties (out of 50) 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 50) 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 50) 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 50) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 50) 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 50) 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 50) 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 50) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 50) 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 50) 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 50) 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 50) 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 50) 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 50) 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 50) 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 50) 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 50) 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 50) 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 50) 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 50) 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 50) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 50) 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 50) 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 50) 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 50) 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 50) 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 50) 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 50) 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 50) 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 50) 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 50) 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 50) 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 50) seen :0
Running SMT prover for 50 properties.
// Phase 1: matrix 10 rows 12 cols
[2023-03-13 06:23:30] [INFO ] Computed 4 place invariants in 4 ms
[2023-03-13 06:23:30] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-13 06:23:30] [INFO ] After 241ms SMT Verify possible using all constraints in real domain returned unsat :36 sat :0 real:14
[2023-03-13 06:23:30] [INFO ] [Nat]Absence check using 4 positive place invariants in 0 ms returned sat
[2023-03-13 06:23:30] [INFO ] After 16ms SMT Verify possible using state equation in natural domain returned unsat :45 sat :5
[2023-03-13 06:23:31] [INFO ] After 32ms SMT Verify possible using trap constraints in natural domain returned unsat :45 sat :5
Attempting to minimize the solution found.
Minimization took 12 ms.
[2023-03-13 06:23:31] [INFO ] After 89ms SMT Verify possible using all constraints in natural domain returned unsat :45 sat :5
Fused 50 Parikh solutions to 4 different solutions.
Finished Parikh walk after 61 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=61 )
Parikh walk visited 5 properties in 4 ms.
Successfully simplified 45 atomic propositions for a total of 16 simplifications.
FORMULA BridgeAndVehicles-COL-V20P20N10-CTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V20P20N10-CTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-13 06:23:31] [INFO ] Initial state reduction rules for CTL removed 4 formulas.
[2023-03-13 06:23:31] [INFO ] Flatten gal took : 21 ms
[2023-03-13 06:23:31] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA BridgeAndVehicles-COL-V20P20N10-CTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V20P20N10-CTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V20P20N10-CTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V20P20N10-CTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V20P20N10-CTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-13 06:23:31] [INFO ] Flatten gal took : 3 ms
Arc [1:1*[(MOD (ADD $cA 1) 21)]] contains successor/predecessor on variables of sort voitureA
Arc [6:1*[(MOD (ADD (MOD (MINUS $cB 1) 21) 21) 21)]] contains successor/predecessor on variables of sort voitureB
Arc [13:1*[(MOD (ADD $cpt 1) 11)]] contains successor/predecessor on variables of sort compteur
Arc [14:1*[(MOD (ADD $s 1) 2)]] contains successor/predecessor on variables of sort sens
[2023-03-13 06:23:31] [INFO ] Unfolded HLPN to a Petri net with 68 places and 548 transitions 4070 arcs in 29 ms.
[2023-03-13 06:23:31] [INFO ] Unfolded 9 HLPN properties in 1 ms.
Support contains 15 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 15 ms. Remains 68 /68 variables (removed 0) and now considering 548/548 (removed 0) transitions.
[2023-03-13 06:23:31] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
// Phase 1: matrix 130 rows 68 cols
[2023-03-13 06:23:31] [INFO ] Computed 7 place invariants in 10 ms
[2023-03-13 06:23:31] [INFO ] Dead Transitions using invariants and state equation in 223 ms found 0 transitions.
[2023-03-13 06:23:31] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
[2023-03-13 06:23:31] [INFO ] Invariant cache hit.
[2023-03-13 06:23:31] [INFO ] Implicit Places using invariants in 97 ms returned []
[2023-03-13 06:23:31] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
[2023-03-13 06:23:31] [INFO ] Invariant cache hit.
[2023-03-13 06:23:31] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-13 06:23:31] [INFO ] Implicit Places using invariants and state equation in 175 ms returned []
Implicit Place search using SMT with State Equation took 274 ms to find 0 implicit places.
[2023-03-13 06:23:31] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
[2023-03-13 06:23:31] [INFO ] Invariant cache hit.
[2023-03-13 06:23:31] [INFO ] Dead Transitions using invariants and state equation in 174 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 690 ms. Remains : 68/68 places, 548/548 transitions.
Support contains 15 out of 68 places after structural reductions.
[2023-03-13 06:23:31] [INFO ] Flatten gal took : 44 ms
[2023-03-13 06:23:31] [INFO ] Flatten gal took : 40 ms
[2023-03-13 06:23:32] [INFO ] Input system was already deterministic with 548 transitions.
Incomplete random walk after 10000 steps, including 56 resets, run finished after 266 ms. (steps per millisecond=37 ) properties (out of 46) seen :18
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 28) seen :1
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 27) seen :1
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 26) 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 26) 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 26) 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 26) 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 26) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 26) 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 26) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 26) 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 26) 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 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 26) 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 26) 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 26) 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 26) 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 26) 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 26) 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 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 26) 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 26) 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 26) 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 26) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 26) 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 26) 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 26) 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 26) seen :0
Running SMT prover for 26 properties.
[2023-03-13 06:23:32] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
[2023-03-13 06:23:32] [INFO ] Invariant cache hit.
[2023-03-13 06:23:32] [INFO ] [Real]Absence check using 7 positive place invariants in 1 ms returned sat
[2023-03-13 06:23:32] [INFO ] After 60ms SMT Verify possible using all constraints in real domain returned unsat :17 sat :0 real:9
[2023-03-13 06:23:32] [INFO ] [Nat]Absence check using 7 positive place invariants in 1 ms returned sat
[2023-03-13 06:23:32] [INFO ] After 37ms SMT Verify possible using state equation in natural domain returned unsat :24 sat :2
[2023-03-13 06:23:32] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-13 06:23:32] [INFO ] After 30ms SMT Verify possible using 22 Read/Feed constraints in natural domain returned unsat :24 sat :2
[2023-03-13 06:23:32] [INFO ] After 65ms SMT Verify possible using trap constraints in natural domain returned unsat :24 sat :2
Attempting to minimize the solution found.
Minimization took 22 ms.
[2023-03-13 06:23:32] [INFO ] After 160ms SMT Verify possible using all constraints in natural domain returned unsat :24 sat :2
Fused 26 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 2 ms.
Support contains 4 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 38 ms. Remains 66 /68 variables (removed 2) and now considering 548/548 (removed 0) transitions.
[2023-03-13 06:23:32] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
// Phase 1: matrix 130 rows 66 cols
[2023-03-13 06:23:32] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-13 06:23:32] [INFO ] Dead Transitions using invariants and state equation in 145 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 185 ms. Remains : 66/68 places, 548/548 transitions.
Incomplete random walk after 10000 steps, including 56 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 21 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 565806 steps, run timeout after 3001 ms. (steps per millisecond=188 ) properties seen :{}
Probabilistic random walk after 565806 steps, saw 139973 distinct states, run finished after 3005 ms. (steps per millisecond=188 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-13 06:23:36] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
[2023-03-13 06:23:36] [INFO ] Invariant cache hit.
[2023-03-13 06:23:36] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-13 06:23:36] [INFO ] After 38ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-13 06:23:36] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-13 06:23:36] [INFO ] After 50ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-13 06:23:36] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-13 06:23:36] [INFO ] After 36ms SMT Verify possible using 22 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-13 06:23:36] [INFO ] After 67ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 86 ms.
[2023-03-13 06:23:36] [INFO ] After 242ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 6 ms.
Support contains 4 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 39 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 39 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 36 ms. Remains 66 /66 variables (removed 0) and now considering 548/548 (removed 0) transitions.
[2023-03-13 06:23:36] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
[2023-03-13 06:23:36] [INFO ] Invariant cache hit.
[2023-03-13 06:23:36] [INFO ] Implicit Places using invariants in 96 ms returned []
[2023-03-13 06:23:36] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
[2023-03-13 06:23:36] [INFO ] Invariant cache hit.
[2023-03-13 06:23:36] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-13 06:23:36] [INFO ] Implicit Places using invariants and state equation in 245 ms returned [23, 47]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 346 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 26 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 409 ms. Remains : 64/66 places, 548/548 transitions.
Incomplete random walk after 10000 steps, including 56 resets, run finished after 124 ms. (steps per millisecond=80 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 20 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 21 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 646241 steps, run timeout after 3001 ms. (steps per millisecond=215 ) properties seen :{}
Probabilistic random walk after 646241 steps, saw 158508 distinct states, run finished after 3001 ms. (steps per millisecond=215 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-13 06:23:40] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
// Phase 1: matrix 130 rows 64 cols
[2023-03-13 06:23:40] [INFO ] Computed 5 place invariants in 5 ms
[2023-03-13 06:23:40] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-13 06:23:40] [INFO ] After 51ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-13 06:23:40] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-13 06:23:40] [INFO ] After 59ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-13 06:23:40] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-13 06:23:40] [INFO ] After 27ms SMT Verify possible using 22 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-13 06:23:40] [INFO ] After 100ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 32 ms.
[2023-03-13 06:23:40] [INFO ] After 242ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 7 ms.
Support contains 4 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 28 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 29 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 27 ms. Remains 64 /64 variables (removed 0) and now considering 548/548 (removed 0) transitions.
[2023-03-13 06:23:40] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
[2023-03-13 06:23:40] [INFO ] Invariant cache hit.
[2023-03-13 06:23:40] [INFO ] Implicit Places using invariants in 129 ms returned []
[2023-03-13 06:23:40] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
[2023-03-13 06:23:40] [INFO ] Invariant cache hit.
[2023-03-13 06:23:40] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-13 06:23:40] [INFO ] Implicit Places using invariants and state equation in 211 ms returned []
Implicit Place search using SMT with State Equation took 342 ms to find 0 implicit places.
[2023-03-13 06:23:40] [INFO ] Redundant transitions in 29 ms returned []
[2023-03-13 06:23:40] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
[2023-03-13 06:23:40] [INFO ] Invariant cache hit.
[2023-03-13 06:23:40] [INFO ] Dead Transitions using invariants and state equation in 197 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 606 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
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 1 with 2 rules applied. Total rules applied 420 place count 64 transition count 128
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 422 place count 62 transition count 128
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 424 place count 62 transition count 128
Applied a total of 424 rules in 9 ms. Remains 62 /64 variables (removed 2) and now considering 128/548 (removed 420) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 128 rows 62 cols
[2023-03-13 06:23:41] [INFO ] Computed 5 place invariants in 2 ms
[2023-03-13 06:23:41] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-13 06:23:41] [INFO ] After 22ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-13 06:23:41] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-13 06:23:41] [INFO ] After 28ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-13 06:23:41] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-13 06:23:41] [INFO ] After 13ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-13 06:23:41] [INFO ] After 32ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 15 ms.
[2023-03-13 06:23:41] [INFO ] After 97ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Successfully simplified 24 atomic propositions for a total of 9 simplifications.
[2023-03-13 06:23:41] [INFO ] Flatten gal took : 27 ms
[2023-03-13 06:23:41] [INFO ] Flatten gal took : 27 ms
[2023-03-13 06:23:41] [INFO ] Input system was already deterministic with 548 transitions.
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.3 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.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 0 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 64 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 65 ms. Remains : 61/68 places, 544/548 transitions.
[2023-03-13 06:23:41] [INFO ] Flatten gal took : 18 ms
[2023-03-13 06:23:41] [INFO ] Flatten gal took : 20 ms
[2023-03-13 06:23:41] [INFO ] Input system was already deterministic with 544 transitions.
Finished random walk after 57 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=57 )
FORMULA BridgeAndVehicles-COL-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 4 ms. Remains 67 /68 variables (removed 1) and now considering 548/548 (removed 0) transitions.
[2023-03-13 06:23:41] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
// Phase 1: matrix 130 rows 67 cols
[2023-03-13 06:23:41] [INFO ] Computed 6 place invariants in 4 ms
[2023-03-13 06:23:41] [INFO ] Dead Transitions using invariants and state equation in 197 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 204 ms. Remains : 67/68 places, 548/548 transitions.
[2023-03-13 06:23:41] [INFO ] Flatten gal took : 18 ms
[2023-03-13 06:23:41] [INFO ] Flatten gal took : 18 ms
[2023-03-13 06:23:41] [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 3 ms. Remains 66 /68 variables (removed 2) and now considering 548/548 (removed 0) transitions.
[2023-03-13 06:23:41] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
// Phase 1: matrix 130 rows 66 cols
[2023-03-13 06:23:41] [INFO ] Computed 5 place invariants in 2 ms
[2023-03-13 06:23:41] [INFO ] Dead Transitions using invariants and state equation in 167 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 173 ms. Remains : 66/68 places, 548/548 transitions.
[2023-03-13 06:23:41] [INFO ] Flatten gal took : 15 ms
[2023-03-13 06:23:41] [INFO ] Flatten gal took : 16 ms
[2023-03-13 06:23:41] [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 06:23:41] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
// Phase 1: matrix 130 rows 68 cols
[2023-03-13 06:23:41] [INFO ] Computed 7 place invariants in 4 ms
[2023-03-13 06:23:42] [INFO ] Dead Transitions using invariants and state equation in 192 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 197 ms. Remains : 68/68 places, 548/548 transitions.
[2023-03-13 06:23:42] [INFO ] Flatten gal took : 17 ms
[2023-03-13 06:23:42] [INFO ] Flatten gal took : 18 ms
[2023-03-13 06:23:42] [INFO ] Input system was already deterministic with 548 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 67 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 21 ms. Remains 67 /68 variables (removed 1) and now considering 548/548 (removed 0) transitions.
[2023-03-13 06:23:42] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
// Phase 1: matrix 130 rows 67 cols
[2023-03-13 06:23:42] [INFO ] Computed 6 place invariants in 3 ms
[2023-03-13 06:23:42] [INFO ] Dead Transitions using invariants and state equation in 169 ms found 0 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 191 ms. Remains : 67/68 places, 548/548 transitions.
[2023-03-13 06:23:42] [INFO ] Flatten gal took : 14 ms
[2023-03-13 06:23:42] [INFO ] Flatten gal took : 17 ms
[2023-03-13 06:23:42] [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 06:23:42] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
// Phase 1: matrix 129 rows 65 cols
[2023-03-13 06:23:42] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-13 06:23:42] [INFO ] Dead Transitions using invariants and state equation in 177 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 185 ms. Remains : 65/68 places, 547/548 transitions.
[2023-03-13 06:23:42] [INFO ] Flatten gal took : 14 ms
[2023-03-13 06:23:42] [INFO ] Flatten gal took : 15 ms
[2023-03-13 06:23:42] [INFO ] Input system was already deterministic with 547 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 5 ms. Remains 65 /68 variables (removed 3) and now considering 547/548 (removed 1) transitions.
[2023-03-13 06:23:42] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
[2023-03-13 06:23:42] [INFO ] Invariant cache hit.
[2023-03-13 06:23:42] [INFO ] Dead Transitions using invariants and state equation in 163 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 170 ms. Remains : 65/68 places, 547/548 transitions.
[2023-03-13 06:23:42] [INFO ] Flatten gal took : 13 ms
[2023-03-13 06:23:42] [INFO ] Flatten gal took : 16 ms
[2023-03-13 06:23:42] [INFO ] Input system was already deterministic with 547 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 06:23:43] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
[2023-03-13 06:23:43] [INFO ] Invariant cache hit.
[2023-03-13 06:23:43] [INFO ] Dead Transitions using invariants and state equation in 183 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 191 ms. Remains : 65/68 places, 547/548 transitions.
[2023-03-13 06:23:43] [INFO ] Flatten gal took : 13 ms
[2023-03-13 06:23:43] [INFO ] Flatten gal took : 14 ms
[2023-03-13 06:23:43] [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 67 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
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 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 66 transition count 547
Applied a total of 3 rules in 25 ms. Remains 66 /68 variables (removed 2) and now considering 547/548 (removed 1) transitions.
[2023-03-13 06:23:43] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
// Phase 1: matrix 129 rows 66 cols
[2023-03-13 06:23:43] [INFO ] Computed 6 place invariants in 1 ms
[2023-03-13 06:23:43] [INFO ] Dead Transitions using invariants and state equation in 178 ms found 0 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 205 ms. Remains : 66/68 places, 547/548 transitions.
[2023-03-13 06:23:43] [INFO ] Flatten gal took : 12 ms
[2023-03-13 06:23:43] [INFO ] Flatten gal took : 13 ms
[2023-03-13 06:23:43] [INFO ] Input system was already deterministic with 547 transitions.
[2023-03-13 06:23:43] [INFO ] Flatten gal took : 15 ms
[2023-03-13 06:23:43] [INFO ] Flatten gal took : 15 ms
[2023-03-13 06:23:43] [INFO ] Export to MCC of 8 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 1 ms.
[2023-03-13 06:23:43] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 68 places, 548 transitions and 4070 arcs took 5 ms.
Total runtime 14456 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.006sec

net check time: 0m 0.000sec

init dd package: 0m 3.405sec


RS generation: 0m30.052sec


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



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

checking: EX [0<=0]
normalized: EX [0<=0]

abstracting: (0<=0)
states: 6,732,570 (6)
.-> the formula is TRUE

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

MC time: 0m10.856sec

checking: EF [AX [1<=0]]
normalized: E [true U ~ [EX [~ [1<=0]]]]

abstracting: (1<=0)
states: 0
.-> the formula is TRUE

FORMULA BridgeAndVehicles-COL-V20P20N10-CTLCardinality-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 1m18.652sec

checking: AF [EG [p24<=p22]]
normalized: ~ [EG [~ [EG [p24<=p22]]]]

abstracting: (p24<=p22)
states: 4,108,980 (6)
.............................................................................................
EG iterations: 93
..................................................
before gc: list nodes free: 825165

after gc: idd nodes used:2410444, unused:61589556; list nodes free:350735760
............................................................................................
EG iterations: 142
-> the formula is TRUE

FORMULA BridgeAndVehicles-COL-V20P20N10-CTLCardinality-15 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 3m18.400sec

checking: EX [EG [AF [sum(p54, p53)<=p0]]]
normalized: EX [EG [~ [EG [~ [sum(p54, p53)<=p0]]]]]

abstracting: (sum(p54, p53)<=p0)
states: 6,732,570 (6)
.
EG iterations: 1

EG iterations: 0
.-> the formula is TRUE

FORMULA BridgeAndVehicles-COL-V20P20N10-CTLCardinality-13 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m14.926sec

checking: AX [[~ [A [AX [p24<=p23] U [26<=p50 | [p24<=8 & p0<=14]]]] | AF [EG [~ [12<=p0]]]]]
normalized: ~ [EX [~ [[~ [[~ [EG [~ [[26<=p50 | [p24<=8 & p0<=14]]]]] & ~ [E [~ [[26<=p50 | [p24<=8 & p0<=14]]] U [EX [~ [p24<=p23]] & ~ [[26<=p50 | [p24<=8 & p0<=14]]]]]]]] | ~ [EG [~ [EG [~ [12<=p0]]]]]]]]]

abstracting: (12<=p0)
states: 6,547,858 (6)
.....................................
EG iterations: 37

EG iterations: 0
abstracting: (p0<=14)
states: 1,120,080 (6)
abstracting: (p24<=8)
states: 5,000,572 (6)
abstracting: (26<=p50)
states: 0
abstracting: (p24<=p23)
states: 3,542,615 (6)
.abstracting: (p0<=14)
states: 1,120,080 (6)
abstracting: (p24<=8)
states: 5,000,572 (6)
abstracting: (26<=p50)
states: 0
abstracting: (p0<=14)
states: 1,120,080 (6)
abstracting: (p24<=8)
states: 5,000,572 (6)
abstracting: (26<=p50)
states: 0
.
EG iterations: 1
.-> the formula is TRUE

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

MC time: 0m36.003sec

checking: E [EG [p24<=p47] U E [~ [p48<=p25] U AX [p23<=sum(p67, p66)]]]
normalized: E [EG [p24<=p47] U E [~ [p48<=p25] U ~ [EX [~ [p23<=sum(p67, p66)]]]]]

abstracting: (p23<=sum(p67, p66))
states: 798,363 (5)
.abstracting: (p48<=p25)
states: 1,481,838 (6)
abstracting: (p24<=p47)
states: 1,481,898 (6)
......................................................................................................
EG iterations: 102
-> the formula is FALSE

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

MC time: 1m24.067sec

checking: AF [[[p50<=p25 & [53<=p49 | p49<=88]] & AG [sum(p52, p51)<=p47]]]
normalized: ~ [EG [~ [[~ [E [true U ~ [sum(p52, p51)<=p47]]] & [p50<=p25 & [53<=p49 | p49<=88]]]]]]

abstracting: (p49<=88)
states: 6,732,570 (6)
abstracting: (53<=p49)
states: 0
abstracting: (p50<=p25)
states: 988,158 (5)
abstracting: (sum(p52, p51)<=p47)
states: 4,978,359 (6)

EG iterations: 0
-> the formula is FALSE

FORMULA BridgeAndVehicles-COL-V20P20N10-CTLCardinality-08 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m13.483sec

checking: ~ [E [~ [[[AF [p22<=p49] | sum(p67, p66)<=p48] & AX [1<=0]]] U [AF [[p50<=p25 | 1<=p22]] & E [AG [p25<=18] U ~ [[p50<=p47 | AG [p22<=2]]]]]]]
normalized: ~ [E [~ [[~ [EX [~ [1<=0]]] & [sum(p67, p66)<=p48 | ~ [EG [~ [p22<=p49]]]]]] U [E [~ [E [true U ~ [p25<=18]]] U ~ [[p50<=p47 | ~ [E [true U ~ [p22<=2]]]]]] & ~ [EG [~ [[p50<=p25 | 1<=p22]]]]]]]

abstracting: (1<=p22)
states: 6,547,764 (6)
abstracting: (p50<=p25)
states: 988,158 (5)
..............................................................................................................................
EG iterations: 126
abstracting: (p22<=2)
states: 1,181,778 (6)
abstracting: (p50<=p47)
states: 930,138 (5)
abstracting: (p25<=18)
states: 6,732,570 (6)
abstracting: (p22<=p49)
states: 2,882,212 (6)

before gc: list nodes free: 2889231

after gc: idd nodes used:4561978, unused:59438022; list nodes free:335845547
.
EG iterations: 1
abstracting: (sum(p67, p66)<=p48)
states: 6,679,616 (6)
abstracting: (1<=0)
states: 0
.-> the formula is FALSE

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

MC time: 2m23.079sec

totally nodes used: 128728210 (1.3e+08)
number of garbage collections: 2
fire ops cache: hits/miss/sum: 239325791 726169029 965494820
used/not used/entry size/cache size: 18630157 48478707 16 1024MB
basic ops cache: hits/miss/sum: 81804709 112672836 194477545
used/not used/entry size/cache size: 5427878 11349338 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 66 66
used/not used/entry size/cache size: 1 16777215 12 192MB
state nr cache: hits/miss/sum: 10312318 7147661 17459979
used/not used/entry size/cache size: 1259273 7129335 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 60623626
1 5584792
2 681172
3 164590
4 40584
5 7126
6 2751
7 1036
8 667
9 538
>= 10 1982

Total processing time: 10m19.007sec


BK_STOP 1678689243350

--------------------
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.000sec

432177 471634 483487 462707 451020
iterations count:558473 (1019), effective:9187 (16)

initing FirstDep: 0m 0.000sec

8748 11994 59162 398684 457453 450437 546089 636210 720886 800811 889865 991051 1061659 1121716 1175754 1218346 1255128 1286601 1312847 1342516 1356710
iterations count:2137236 (3900), effective:11852 (21)

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

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

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

iterations count:5271 (9), effective:53 (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-COL-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-COL-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-167813695200041"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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