fond
Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r042-tajo-167813695300117
Last Updated
May 14, 2023

About the Execution of Marcie+red for BridgeAndVehicles-COL-V80P20N10

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
8712.888 823176.00 850435.00 566.70 80 80 80 80 80 80 80 1 1 1 80 10 10 1 1 1 normal

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 536K
-rw-r--r-- 1 mcc users 9.8K Feb 25 12:17 CTLCardinality.txt
-rw-r--r-- 1 mcc users 102K Feb 25 12:17 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Feb 25 12:13 CTLFireability.txt
-rw-r--r-- 1 mcc users 41K Feb 25 12:13 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 4.2K Feb 25 15:36 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Feb 25 15:36 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K Feb 25 15:36 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 15:36 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Feb 25 12:39 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 119K Feb 25 12:39 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Feb 25 12:35 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 82K Feb 25 12:35 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Feb 25 15:36 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Feb 25 15:36 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 45K 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 positive values
NUM_VECTOR

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

=== Now, execution of the tool begins

BK_START 1678695289364

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=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BridgeAndVehicles-COL-V80P20N10
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-13 08:14:50] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-13 08:14:51] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-13 08:14:51] [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 08:14:51] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-13 08:14:51] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 413 ms
[2023-03-13 08:14:51] [INFO ] Imported 15 HL places and 11 HL transitions for a total of 188 PT places and 289218.0 transition bindings in 16 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 4 ms.
[2023-03-13 08:14:51] [INFO ] Built PT skeleton of HLPN with 15 places and 11 transitions 56 arcs in 3 ms.
[2023-03-13 08:14:51] [INFO ] Skeletonized 16 HLPN properties in 1 ms.
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce redundant transitions removed 1 transitions.
// Phase 1: matrix 10 rows 12 cols
[2023-03-13 08:14:51] [INFO ] Computed 4 place invariants in 3 ms
FORMULA BridgeAndVehicles-COL-V80P20N10-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V80P20N10-UpperBounds-10 80 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V80P20N10-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V80P20N10-UpperBounds-05 80 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V80P20N10-UpperBounds-02 80 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V80P20N10-UpperBounds-00 80 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
[2023-03-13 08:14:51] [INFO ] Invariant cache hit.
[2023-03-13 08:14:51] [INFO ] [Real]Absence check using 4 positive place invariants in 5 ms returned sat
[2023-03-13 08:14:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 08:14:51] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2023-03-13 08:14:51] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 08:14:51] [INFO ] [Nat]Absence check using 4 positive place invariants in 3 ms returned sat
[2023-03-13 08:14:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 08:14:51] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2023-03-13 08:14:51] [INFO ] Computed and/alt/rep : 6/9/6 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-13 08:14:51] [INFO ] Added : 2 causal constraints over 1 iterations in 9 ms. Result :sat
Minimization took 7 ms.
[2023-03-13 08:14:51] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-13 08:14:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 08:14:51] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2023-03-13 08:14:51] [INFO ] Computed and/alt/rep : 6/9/6 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-13 08:14:51] [INFO ] Added : 2 causal constraints over 1 iterations in 10 ms. Result :sat
Minimization took 4 ms.
[2023-03-13 08:14:51] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-13 08:14:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 08:14:51] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2023-03-13 08:14:51] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 08:14:51] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-13 08:14:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 08:14:51] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2023-03-13 08:14:51] [INFO ] Computed and/alt/rep : 6/9/6 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-13 08:14:51] [INFO ] Added : 4 causal constraints over 1 iterations in 5 ms. Result :sat
Minimization took 3 ms.
[2023-03-13 08:14:51] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-13 08:14:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 08:14:51] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2023-03-13 08:14:51] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 08:14:51] [INFO ] [Nat]Absence check using 4 positive place invariants in 0 ms returned sat
[2023-03-13 08:14:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 08:14:51] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2023-03-13 08:14:51] [INFO ] Computed and/alt/rep : 6/9/6 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-13 08:14:51] [INFO ] Added : 2 causal constraints over 1 iterations in 5 ms. Result :sat
Minimization took 2 ms.
[2023-03-13 08:14:51] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-13 08:14:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 08:14:51] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2023-03-13 08:14:51] [INFO ] Computed and/alt/rep : 6/9/6 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-13 08:14:51] [INFO ] Added : 2 causal constraints over 1 iterations in 10 ms. Result :sat
Minimization took 2 ms.
[2023-03-13 08:14:51] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 08:14:51] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-13 08:14:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 08:14:51] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2023-03-13 08:14:52] [INFO ] Computed and/alt/rep : 6/9/6 causal constraints (skipped 0 transitions) in 8 ms.
[2023-03-13 08:14:52] [INFO ] Added : 2 causal constraints over 1 iterations in 11 ms. Result :sat
Minimization took 2 ms.
[2023-03-13 08:14:52] [INFO ] [Real]Absence check using 4 positive place invariants in 7 ms returned sat
[2023-03-13 08:14:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 08:14:52] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2023-03-13 08:14:52] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 08:14:52] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-13 08:14:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 08:14:52] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2023-03-13 08:14:52] [INFO ] Computed and/alt/rep : 6/9/6 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-13 08:14:52] [INFO ] Added : 2 causal constraints over 1 iterations in 15 ms. Result :sat
Minimization took 4 ms.
[2023-03-13 08:14:52] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-13 08:14:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 08:14:52] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2023-03-13 08:14:52] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 08:14:52] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-13 08:14:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 08:14:52] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2023-03-13 08:14:52] [INFO ] Computed and/alt/rep : 6/9/6 causal constraints (skipped 0 transitions) in 5 ms.
[2023-03-13 08:14:52] [INFO ] Added : 2 causal constraints over 1 iterations in 10 ms. Result :sat
Minimization took 9 ms.
[2023-03-13 08:14:52] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-13 08:14:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 08:14:52] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2023-03-13 08:14:52] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 08:14:52] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-13 08:14:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 08:14:52] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2023-03-13 08:14:52] [INFO ] Computed and/alt/rep : 6/9/6 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-13 08:14:52] [INFO ] Added : 2 causal constraints over 1 iterations in 8 ms. Result :sat
Minimization took 3 ms.
[2023-03-13 08:14:52] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-13 08:14:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 08:14:52] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2023-03-13 08:14:52] [INFO ] Computed and/alt/rep : 6/9/6 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-13 08:14:52] [INFO ] Added : 2 causal constraints over 1 iterations in 5 ms. Result :sat
Minimization took 4 ms.
[2023-03-13 08:14:52] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 08:14:52] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-13 08:14:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 08:14:52] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2023-03-13 08:14:52] [INFO ] Computed and/alt/rep : 6/9/6 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-13 08:14:52] [INFO ] Added : 2 causal constraints over 1 iterations in 4 ms. Result :sat
Minimization took 3 ms.
[2023-03-13 08:14:52] [INFO ] [Real]Absence check using 4 positive place invariants in 0 ms returned sat
[2023-03-13 08:14:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 08:14:52] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2023-03-13 08:14:52] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 08:14:52] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-13 08:14:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 08:14:52] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2023-03-13 08:14:52] [INFO ] Computed and/alt/rep : 6/9/6 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-13 08:14:52] [INFO ] Added : 2 causal constraints over 1 iterations in 6 ms. Result :sat
Minimization took 2 ms.
Current structural bounds on expressions (after SMT) : [80, 80, 80, 80, 1, 1, 20, 20, 1, 1]
Arc [1:1*[(MOD (ADD $cA 1) 81)]] contains successor/predecessor on variables of sort voitureA
Arc [6:1*[(MOD (ADD (MOD (MINUS $cB 1) 81) 81) 81)]] 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 08:14:52] [INFO ] Unfolded HLPN to a Petri net with 188 places and 2108 transitions 15950 arcs in 92 ms.
[2023-03-13 08:14:52] [INFO ] Unfolded 10 HLPN properties in 0 ms.
Incomplete random walk after 10000 steps, including 14 resets, run finished after 165 ms. (steps per millisecond=60 ) properties (out of 10) seen :318
FORMULA BridgeAndVehicles-COL-V80P20N10-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-COL-V80P20N10-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-COL-V80P20N10-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-COL-V80P20N10-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-COL-V80P20N10-UpperBounds-04 80 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-COL-V80P20N10-UpperBounds-03 80 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 4) seen :162
FORMULA BridgeAndVehicles-COL-V80P20N10-UpperBounds-06 80 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BridgeAndVehicles-COL-V80P20N10-UpperBounds-01 80 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10000 steps, including 5 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 2) seen :20
[2023-03-13 08:14:52] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
// Phase 1: matrix 370 rows 188 cols
[2023-03-13 08:14:52] [INFO ] Computed 7 place invariants in 57 ms
[2023-03-13 08:14:52] [INFO ] [Real]Absence check using 7 positive place invariants in 4 ms returned sat
[2023-03-13 08:14:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 08:14:53] [INFO ] [Real]Absence check using state equation in 104 ms returned sat
[2023-03-13 08:14:53] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 08:14:53] [INFO ] [Nat]Absence check using 7 positive place invariants in 4 ms returned sat
[2023-03-13 08:14:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 08:14:53] [INFO ] [Nat]Absence check using state equation in 112 ms returned sat
[2023-03-13 08:14:53] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-13 08:14:53] [INFO ] [Nat]Added 22 Read/Feed constraints in 74 ms returned sat
[2023-03-13 08:14:53] [INFO ] Deduced a trap composed of 5 places in 514 ms of which 3 ms to minimize.
[2023-03-13 08:14:54] [INFO ] Deduced a trap composed of 6 places in 298 ms of which 1 ms to minimize.
[2023-03-13 08:14:54] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 909 ms
[2023-03-13 08:14:54] [INFO ] Computed and/alt/rep : 170/338/170 causal constraints (skipped 197 transitions) in 88 ms.
[2023-03-13 08:14:54] [INFO ] Deduced a trap composed of 14 places in 229 ms of which 1 ms to minimize.
[2023-03-13 08:14:54] [INFO ] Deduced a trap composed of 5 places in 257 ms of which 2 ms to minimize.
[2023-03-13 08:14:54] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 536 ms
[2023-03-13 08:14:54] [INFO ] Added : 11 causal constraints over 3 iterations in 721 ms. Result :sat
Minimization took 86 ms.
[2023-03-13 08:14:55] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned sat
[2023-03-13 08:14:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 08:14:55] [INFO ] [Real]Absence check using state equation in 82 ms returned sat
[2023-03-13 08:14:55] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 08:14:55] [INFO ] [Nat]Absence check using 7 positive place invariants in 3 ms returned sat
[2023-03-13 08:14:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 08:14:55] [INFO ] [Nat]Absence check using state equation in 84 ms returned sat
[2023-03-13 08:14:55] [INFO ] [Nat]Added 22 Read/Feed constraints in 50 ms returned sat
[2023-03-13 08:14:55] [INFO ] Deduced a trap composed of 5 places in 294 ms of which 2 ms to minimize.
[2023-03-13 08:14:55] [INFO ] Deduced a trap composed of 6 places in 299 ms of which 1 ms to minimize.
[2023-03-13 08:14:56] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 713 ms
[2023-03-13 08:14:56] [INFO ] Computed and/alt/rep : 170/338/170 causal constraints (skipped 197 transitions) in 128 ms.
[2023-03-13 08:14:56] [INFO ] Deduced a trap composed of 14 places in 235 ms of which 0 ms to minimize.
[2023-03-13 08:14:56] [INFO ] Deduced a trap composed of 5 places in 271 ms of which 1 ms to minimize.
[2023-03-13 08:14:56] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 556 ms
[2023-03-13 08:14:56] [INFO ] Added : 11 causal constraints over 3 iterations in 831 ms. Result :sat
Minimization took 107 ms.
Current structural bounds on expressions (after SMT) : [20, 20] Max seen :[10, 10]
Support contains 1 out of 188 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 188/188 places, 2108/2108 transitions.
Graph (complete) has 1882 edges and 188 vertex of which 186 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.9 ms
Discarding 2 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 9 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 185 transition count 2107
Applied a total of 3 rules in 427 ms. Remains 185 /188 variables (removed 3) and now considering 2107/2108 (removed 1) transitions.
[2023-03-13 08:14:57] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
// Phase 1: matrix 369 rows 185 cols
[2023-03-13 08:14:57] [INFO ] Computed 5 place invariants in 12 ms
[2023-03-13 08:14:58] [INFO ] Dead Transitions using invariants and state equation in 759 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1187 ms. Remains : 185/188 places, 2107/2108 transitions.
Normalized transition count is 369 out of 2107 initially.
// Phase 1: matrix 369 rows 185 cols
[2023-03-13 08:14:58] [INFO ] Computed 5 place invariants in 8 ms
Incomplete random walk after 1000000 steps, including 1643 resets, run finished after 6795 ms. (steps per millisecond=147 ) properties (out of 2) seen :20
Incomplete Best-First random walk after 1000007 steps, including 695 resets, run finished after 2598 ms. (steps per millisecond=384 ) properties (out of 2) seen :20
Incomplete Best-First random walk after 1000001 steps, including 696 resets, run finished after 2535 ms. (steps per millisecond=394 ) properties (out of 2) seen :20
[2023-03-13 08:15:10] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
// Phase 1: matrix 369 rows 185 cols
[2023-03-13 08:15:10] [INFO ] Computed 5 place invariants in 6 ms
[2023-03-13 08:15:10] [INFO ] [Real]Absence check using 5 positive place invariants in 4 ms returned sat
[2023-03-13 08:15:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 08:15:10] [INFO ] [Real]Absence check using state equation in 82 ms returned sat
[2023-03-13 08:15:10] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 08:15:10] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2023-03-13 08:15:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 08:15:10] [INFO ] [Nat]Absence check using state equation in 73 ms returned sat
[2023-03-13 08:15:10] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-13 08:15:11] [INFO ] [Nat]Added 22 Read/Feed constraints in 54 ms returned sat
[2023-03-13 08:15:11] [INFO ] Computed and/alt/rep : 170/338/170 causal constraints (skipped 196 transitions) in 66 ms.
[2023-03-13 08:15:11] [INFO ] Added : 11 causal constraints over 3 iterations in 201 ms. Result :sat
Minimization took 90 ms.
[2023-03-13 08:15:11] [INFO ] [Real]Absence check using 5 positive place invariants in 5 ms returned sat
[2023-03-13 08:15:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 08:15:11] [INFO ] [Real]Absence check using state equation in 92 ms returned sat
[2023-03-13 08:15:11] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 08:15:11] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2023-03-13 08:15:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 08:15:11] [INFO ] [Nat]Absence check using state equation in 69 ms returned sat
[2023-03-13 08:15:11] [INFO ] [Nat]Added 22 Read/Feed constraints in 52 ms returned sat
[2023-03-13 08:15:11] [INFO ] Computed and/alt/rep : 170/338/170 causal constraints (skipped 196 transitions) in 59 ms.
[2023-03-13 08:15:11] [INFO ] Added : 11 causal constraints over 3 iterations in 247 ms. Result :sat
Minimization took 85 ms.
Current structural bounds on expressions (after SMT) : [20, 20] Max seen :[10, 10]
Support contains 1 out of 185 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 185/185 places, 2107/2107 transitions.
Applied a total of 0 rules in 218 ms. Remains 185 /185 variables (removed 0) and now considering 2107/2107 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 219 ms. Remains : 185/185 places, 2107/2107 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 185/185 places, 2107/2107 transitions.
Applied a total of 0 rules in 249 ms. Remains 185 /185 variables (removed 0) and now considering 2107/2107 (removed 0) transitions.
[2023-03-13 08:15:13] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
[2023-03-13 08:15:13] [INFO ] Invariant cache hit.
[2023-03-13 08:15:13] [INFO ] Implicit Places using invariants in 370 ms returned []
[2023-03-13 08:15:13] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
[2023-03-13 08:15:13] [INFO ] Invariant cache hit.
[2023-03-13 08:15:13] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-13 08:15:14] [INFO ] Implicit Places using invariants and state equation in 1491 ms returned [83, 166]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1875 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 183/185 places, 2107/2107 transitions.
Applied a total of 0 rules in 195 ms. Remains 183 /183 variables (removed 0) and now considering 2107/2107 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 2323 ms. Remains : 183/185 places, 2107/2107 transitions.
Normalized transition count is 369 out of 2107 initially.
// Phase 1: matrix 369 rows 183 cols
[2023-03-13 08:15:15] [INFO ] Computed 5 place invariants in 8 ms
Incomplete random walk after 1000000 steps, including 1643 resets, run finished after 5757 ms. (steps per millisecond=173 ) properties (out of 2) seen :14
Incomplete Best-First random walk after 1000001 steps, including 696 resets, run finished after 2220 ms. (steps per millisecond=450 ) properties (out of 2) seen :20
Incomplete Best-First random walk after 1000000 steps, including 695 resets, run finished after 2215 ms. (steps per millisecond=451 ) properties (out of 2) seen :20
[2023-03-13 08:15:25] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
// Phase 1: matrix 369 rows 183 cols
[2023-03-13 08:15:25] [INFO ] Computed 5 place invariants in 5 ms
[2023-03-13 08:15:25] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2023-03-13 08:15:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 08:15:25] [INFO ] [Real]Absence check using state equation in 73 ms returned sat
[2023-03-13 08:15:25] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-13 08:15:25] [INFO ] [Real]Added 22 Read/Feed constraints in 34 ms returned sat
[2023-03-13 08:15:25] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 08:15:25] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-13 08:15:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 08:15:25] [INFO ] [Nat]Absence check using state equation in 61 ms returned sat
[2023-03-13 08:15:25] [INFO ] [Nat]Added 22 Read/Feed constraints in 41 ms returned sat
[2023-03-13 08:15:25] [INFO ] Computed and/alt/rep : 170/338/170 causal constraints (skipped 196 transitions) in 49 ms.
[2023-03-13 08:15:26] [INFO ] Added : 10 causal constraints over 2 iterations in 412 ms. Result :sat
Minimization took 82 ms.
[2023-03-13 08:15:26] [INFO ] [Real]Absence check using 5 positive place invariants in 4 ms returned sat
[2023-03-13 08:15:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 08:15:26] [INFO ] [Real]Absence check using state equation in 88 ms returned sat
[2023-03-13 08:15:26] [INFO ] [Real]Added 22 Read/Feed constraints in 33 ms returned sat
[2023-03-13 08:15:26] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 08:15:26] [INFO ] [Nat]Absence check using 5 positive place invariants in 4 ms returned sat
[2023-03-13 08:15:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 08:15:26] [INFO ] [Nat]Absence check using state equation in 79 ms returned sat
[2023-03-13 08:15:26] [INFO ] [Nat]Added 22 Read/Feed constraints in 42 ms returned sat
[2023-03-13 08:15:26] [INFO ] Computed and/alt/rep : 170/338/170 causal constraints (skipped 196 transitions) in 71 ms.
[2023-03-13 08:15:27] [INFO ] Added : 10 causal constraints over 2 iterations in 442 ms. Result :sat
Minimization took 81 ms.
Current structural bounds on expressions (after SMT) : [20, 20] Max seen :[10, 10]
Support contains 1 out of 183 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 183/183 places, 2107/2107 transitions.
Applied a total of 0 rules in 200 ms. Remains 183 /183 variables (removed 0) and now considering 2107/2107 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 200 ms. Remains : 183/183 places, 2107/2107 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 183/183 places, 2107/2107 transitions.
Applied a total of 0 rules in 173 ms. Remains 183 /183 variables (removed 0) and now considering 2107/2107 (removed 0) transitions.
[2023-03-13 08:15:28] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
[2023-03-13 08:15:28] [INFO ] Invariant cache hit.
[2023-03-13 08:15:28] [INFO ] Implicit Places using invariants in 379 ms returned []
[2023-03-13 08:15:28] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
[2023-03-13 08:15:28] [INFO ] Invariant cache hit.
[2023-03-13 08:15:28] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-13 08:15:30] [INFO ] Implicit Places using invariants and state equation in 1686 ms returned []
Implicit Place search using SMT with State Equation took 2068 ms to find 0 implicit places.
[2023-03-13 08:15:30] [INFO ] Redundant transitions in 194 ms returned []
[2023-03-13 08:15:30] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
[2023-03-13 08:15:30] [INFO ] Invariant cache hit.
[2023-03-13 08:15:31] [INFO ] Dead Transitions using invariants and state equation in 764 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3211 ms. Remains : 183/183 places, 2107/2107 transitions.
Starting property specific reduction for BridgeAndVehicles-COL-V80P20N10-UpperBounds-11
Normalized transition count is 369 out of 2107 initially.
// Phase 1: matrix 369 rows 183 cols
[2023-03-13 08:15:31] [INFO ] Computed 5 place invariants in 3 ms
Incomplete random walk after 10000 steps, including 16 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 1) seen :7
Incomplete Best-First random walk after 10005 steps, including 6 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 1) seen :10
[2023-03-13 08:15:31] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
// Phase 1: matrix 369 rows 183 cols
[2023-03-13 08:15:31] [INFO ] Computed 5 place invariants in 4 ms
[2023-03-13 08:15:31] [INFO ] [Real]Absence check using 5 positive place invariants in 4 ms returned sat
[2023-03-13 08:15:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 08:15:31] [INFO ] [Real]Absence check using state equation in 73 ms returned sat
[2023-03-13 08:15:31] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-13 08:15:31] [INFO ] [Real]Added 22 Read/Feed constraints in 31 ms returned sat
[2023-03-13 08:15:31] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 08:15:31] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-13 08:15:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 08:15:31] [INFO ] [Nat]Absence check using state equation in 61 ms returned sat
[2023-03-13 08:15:31] [INFO ] [Nat]Added 22 Read/Feed constraints in 30 ms returned sat
[2023-03-13 08:15:31] [INFO ] Computed and/alt/rep : 170/338/170 causal constraints (skipped 196 transitions) in 40 ms.
[2023-03-13 08:15:31] [INFO ] Added : 10 causal constraints over 2 iterations in 318 ms. Result :sat
Minimization took 55 ms.
Current structural bounds on expressions (after SMT) : [20] Max seen :[10]
Support contains 1 out of 183 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 183/183 places, 2107/2107 transitions.
Applied a total of 0 rules in 163 ms. Remains 183 /183 variables (removed 0) and now considering 2107/2107 (removed 0) transitions.
[2023-03-13 08:15:32] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
[2023-03-13 08:15:32] [INFO ] Invariant cache hit.
[2023-03-13 08:15:33] [INFO ] Dead Transitions using invariants and state equation in 789 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 954 ms. Remains : 183/183 places, 2107/2107 transitions.
Normalized transition count is 369 out of 2107 initially.
// Phase 1: matrix 369 rows 183 cols
[2023-03-13 08:15:33] [INFO ] Computed 5 place invariants in 4 ms
Incomplete random walk after 1000000 steps, including 1643 resets, run finished after 5425 ms. (steps per millisecond=184 ) properties (out of 1) seen :8
Incomplete Best-First random walk after 1000001 steps, including 695 resets, run finished after 2203 ms. (steps per millisecond=453 ) properties (out of 1) seen :10
[2023-03-13 08:15:40] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
// Phase 1: matrix 369 rows 183 cols
[2023-03-13 08:15:40] [INFO ] Computed 5 place invariants in 8 ms
[2023-03-13 08:15:40] [INFO ] [Real]Absence check using 5 positive place invariants in 4 ms returned sat
[2023-03-13 08:15:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 08:15:41] [INFO ] [Real]Absence check using state equation in 77 ms returned sat
[2023-03-13 08:15:41] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-13 08:15:41] [INFO ] [Real]Added 22 Read/Feed constraints in 33 ms returned sat
[2023-03-13 08:15:41] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 08:15:41] [INFO ] [Nat]Absence check using 5 positive place invariants in 4 ms returned sat
[2023-03-13 08:15:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 08:15:41] [INFO ] [Nat]Absence check using state equation in 88 ms returned sat
[2023-03-13 08:15:41] [INFO ] [Nat]Added 22 Read/Feed constraints in 44 ms returned sat
[2023-03-13 08:15:41] [INFO ] Computed and/alt/rep : 170/338/170 causal constraints (skipped 196 transitions) in 63 ms.
[2023-03-13 08:15:41] [INFO ] Added : 10 causal constraints over 2 iterations in 387 ms. Result :sat
Minimization took 81 ms.
Current structural bounds on expressions (after SMT) : [20] Max seen :[10]
Support contains 1 out of 183 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 183/183 places, 2107/2107 transitions.
Applied a total of 0 rules in 162 ms. Remains 183 /183 variables (removed 0) and now considering 2107/2107 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 162 ms. Remains : 183/183 places, 2107/2107 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 183/183 places, 2107/2107 transitions.
Applied a total of 0 rules in 161 ms. Remains 183 /183 variables (removed 0) and now considering 2107/2107 (removed 0) transitions.
[2023-03-13 08:15:42] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
[2023-03-13 08:15:42] [INFO ] Invariant cache hit.
[2023-03-13 08:15:42] [INFO ] Implicit Places using invariants in 397 ms returned []
[2023-03-13 08:15:42] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
[2023-03-13 08:15:42] [INFO ] Invariant cache hit.
[2023-03-13 08:15:42] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-13 08:15:44] [INFO ] Implicit Places using invariants and state equation in 1708 ms returned []
Implicit Place search using SMT with State Equation took 2107 ms to find 0 implicit places.
[2023-03-13 08:15:44] [INFO ] Redundant transitions in 48 ms returned []
[2023-03-13 08:15:44] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
[2023-03-13 08:15:44] [INFO ] Invariant cache hit.
[2023-03-13 08:15:45] [INFO ] Dead Transitions using invariants and state equation in 797 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3127 ms. Remains : 183/183 places, 2107/2107 transitions.
Ending property specific reduction for BridgeAndVehicles-COL-V80P20N10-UpperBounds-11 in 14181 ms.
Starting property specific reduction for BridgeAndVehicles-COL-V80P20N10-UpperBounds-12
Normalized transition count is 369 out of 2107 initially.
// Phase 1: matrix 369 rows 183 cols
[2023-03-13 08:15:45] [INFO ] Computed 5 place invariants in 6 ms
Incomplete random walk after 10000 steps, including 16 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 1) seen :5
Incomplete Best-First random walk after 10000 steps, including 6 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 1) seen :10
[2023-03-13 08:15:45] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
// Phase 1: matrix 369 rows 183 cols
[2023-03-13 08:15:45] [INFO ] Computed 5 place invariants in 4 ms
[2023-03-13 08:15:45] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2023-03-13 08:15:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 08:15:45] [INFO ] [Real]Absence check using state equation in 61 ms returned sat
[2023-03-13 08:15:45] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-13 08:15:45] [INFO ] [Real]Added 22 Read/Feed constraints in 45 ms returned sat
[2023-03-13 08:15:45] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 08:15:45] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-13 08:15:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 08:15:45] [INFO ] [Nat]Absence check using state equation in 73 ms returned sat
[2023-03-13 08:15:45] [INFO ] [Nat]Added 22 Read/Feed constraints in 34 ms returned sat
[2023-03-13 08:15:45] [INFO ] Computed and/alt/rep : 170/338/170 causal constraints (skipped 196 transitions) in 73 ms.
[2023-03-13 08:15:46] [INFO ] Added : 10 causal constraints over 2 iterations in 315 ms. Result :sat
Minimization took 57 ms.
Current structural bounds on expressions (after SMT) : [20] Max seen :[10]
Support contains 1 out of 183 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 183/183 places, 2107/2107 transitions.
Applied a total of 0 rules in 198 ms. Remains 183 /183 variables (removed 0) and now considering 2107/2107 (removed 0) transitions.
[2023-03-13 08:15:46] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
[2023-03-13 08:15:46] [INFO ] Invariant cache hit.
[2023-03-13 08:15:47] [INFO ] Dead Transitions using invariants and state equation in 722 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 921 ms. Remains : 183/183 places, 2107/2107 transitions.
Normalized transition count is 369 out of 2107 initially.
// Phase 1: matrix 369 rows 183 cols
[2023-03-13 08:15:47] [INFO ] Computed 5 place invariants in 3 ms
Incomplete random walk after 1000000 steps, including 1643 resets, run finished after 5399 ms. (steps per millisecond=185 ) properties (out of 1) seen :8
Incomplete Best-First random walk after 1000001 steps, including 696 resets, run finished after 2214 ms. (steps per millisecond=451 ) properties (out of 1) seen :10
[2023-03-13 08:15:55] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
// Phase 1: matrix 369 rows 183 cols
[2023-03-13 08:15:55] [INFO ] Computed 5 place invariants in 4 ms
[2023-03-13 08:15:55] [INFO ] [Real]Absence check using 5 positive place invariants in 4 ms returned sat
[2023-03-13 08:15:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 08:15:55] [INFO ] [Real]Absence check using state equation in 79 ms returned sat
[2023-03-13 08:15:55] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-13 08:15:55] [INFO ] [Real]Added 22 Read/Feed constraints in 33 ms returned sat
[2023-03-13 08:15:55] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 08:15:55] [INFO ] [Nat]Absence check using 5 positive place invariants in 4 ms returned sat
[2023-03-13 08:15:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 08:15:55] [INFO ] [Nat]Absence check using state equation in 76 ms returned sat
[2023-03-13 08:15:55] [INFO ] [Nat]Added 22 Read/Feed constraints in 42 ms returned sat
[2023-03-13 08:15:55] [INFO ] Computed and/alt/rep : 170/338/170 causal constraints (skipped 196 transitions) in 53 ms.
[2023-03-13 08:15:55] [INFO ] Added : 10 causal constraints over 2 iterations in 424 ms. Result :sat
Minimization took 84 ms.
Current structural bounds on expressions (after SMT) : [20] Max seen :[10]
Support contains 1 out of 183 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 183/183 places, 2107/2107 transitions.
Applied a total of 0 rules in 162 ms. Remains 183 /183 variables (removed 0) and now considering 2107/2107 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 163 ms. Remains : 183/183 places, 2107/2107 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 183/183 places, 2107/2107 transitions.
Applied a total of 0 rules in 162 ms. Remains 183 /183 variables (removed 0) and now considering 2107/2107 (removed 0) transitions.
[2023-03-13 08:15:56] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
[2023-03-13 08:15:56] [INFO ] Invariant cache hit.
[2023-03-13 08:15:56] [INFO ] Implicit Places using invariants in 370 ms returned []
[2023-03-13 08:15:56] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
[2023-03-13 08:15:56] [INFO ] Invariant cache hit.
[2023-03-13 08:15:57] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-13 08:15:58] [INFO ] Implicit Places using invariants and state equation in 1514 ms returned []
Implicit Place search using SMT with State Equation took 1886 ms to find 0 implicit places.
[2023-03-13 08:15:58] [INFO ] Redundant transitions in 106 ms returned []
[2023-03-13 08:15:58] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
[2023-03-13 08:15:58] [INFO ] Invariant cache hit.
[2023-03-13 08:15:59] [INFO ] Dead Transitions using invariants and state equation in 733 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2898 ms. Remains : 183/183 places, 2107/2107 transitions.
Ending property specific reduction for BridgeAndVehicles-COL-V80P20N10-UpperBounds-12 in 13971 ms.
[2023-03-13 08:15:59] [INFO ] Flatten gal took : 211 ms
[2023-03-13 08:15:59] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/UpperBounds.sr.xml took 2 ms.
[2023-03-13 08:15:59] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 183 places, 2107 transitions and 15624 arcs took 16 ms.
Total runtime 68666 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=UpperBounds.xml --memory=6 --mcc-mode

parse successfull
net created successfully

Net: BridgeAndVehicles_COL_V80P20N10_unf
(NrP: 183 NrTr: 2107 NrArc: 15624)

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

net check time: 0m 0.001sec

init dd package: 0m 3.126sec


RS generation: 12m16.595sec


-> reachability set: #nodes 4365987 (4.4e+06) #states 1,428,245,394 (9)



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

checking: place_bound(p83)
normalized: place_bound(p83)

-> the formula is 10

FORMULA BridgeAndVehicles-COL-V80P20N10-UpperBounds-11 10 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

checking: place_bound(p83)
normalized: place_bound(p83)

-> the formula is 10

FORMULA BridgeAndVehicles-COL-V80P20N10-UpperBounds-12 10 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

totally nodes used: 44748155 (4.5e+07)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 449833766 2590601735 3040435501
used/not used/entry size/cache size: 67108864 0 16 1024MB
basic ops cache: hits/miss/sum: 14664623 2261453 16926076
used/not used/entry size/cache size: 2569882 14207334 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 0 0
used/not used/entry size/cache size: 0 16777216 12 192MB
state nr cache: hits/miss/sum: 719683 4371194 5090877
used/not used/entry size/cache size: 3430280 4958328 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 36312959
1 20497940
2 7572630
3 2128018
4 476232
5 89808
6 15367
7 2769
8 954
9 674
>= 10 11513

Total processing time: 12m32.624sec


BK_STOP 1678696112540

--------------------
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 UpperBounds -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.003sec

252797 272796 272518 273432 273475 278146 270761 269234 272089 274575 267104 268879 270186 271992 267591 267515 269577 265984 266555 267952 265497 266029 266910 265150 265592 269235 302892 303062 284206 300771 302934 284186 284346 300955 287931 282918 284477 300443 301471 283997 284286 298568 300229 299825 283944 284415 297082 284305 283929 283945 284413 286635 287359 283926 283956 283940 286799 286825 283924 284014 283948 286446 286696 286873 4256035
iterations count:6501382 (3085), effective:80006 (37)

initing FirstDep: 0m 0.005sec

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-V80P20N10"
export BK_EXAMINATION="UpperBounds"
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-V80P20N10, examination is UpperBounds"
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-167813695300117"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/BridgeAndVehicles-COL-V80P20N10.tgz
mv BridgeAndVehicles-COL-V80P20N10 execution
cd execution
if [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "UpperBounds" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] || [ "UpperBounds" = "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 [ "UpperBounds" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "UpperBounds" != "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 "UpperBounds.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property UpperBounds.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "UpperBounds.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 '' UpperBounds.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] ; then
echo "FORMULA_NAME UpperBounds"
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 ;