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

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

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
5450.684 18508.00 27103.00 101.40 4 4 4 2 4 1 1 5 5 2 4 4 1 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-167813695200005.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-V04P05N02, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r042-tajo-167813695200005
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 528K
-rw-r--r-- 1 mcc users 7.8K Feb 25 12:04 CTLCardinality.txt
-rw-r--r-- 1 mcc users 77K Feb 25 12:04 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.3K Feb 25 12:03 CTLFireability.txt
-rw-r--r-- 1 mcc users 60K Feb 25 12:03 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.6K Feb 25 15:35 LTLCardinality.txt
-rw-r--r-- 1 mcc users 21K Feb 25 15:35 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.0K 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 15K Feb 25 12:05 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 141K Feb 25 12:05 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Feb 25 12:05 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 80K Feb 25 12:05 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Feb 25 15:35 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K 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 37K 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-V04P05N02-UpperBounds-00
FORMULA_NAME BridgeAndVehicles-COL-V04P05N02-UpperBounds-01
FORMULA_NAME BridgeAndVehicles-COL-V04P05N02-UpperBounds-02
FORMULA_NAME BridgeAndVehicles-COL-V04P05N02-UpperBounds-03
FORMULA_NAME BridgeAndVehicles-COL-V04P05N02-UpperBounds-04
FORMULA_NAME BridgeAndVehicles-COL-V04P05N02-UpperBounds-05
FORMULA_NAME BridgeAndVehicles-COL-V04P05N02-UpperBounds-06
FORMULA_NAME BridgeAndVehicles-COL-V04P05N02-UpperBounds-07
FORMULA_NAME BridgeAndVehicles-COL-V04P05N02-UpperBounds-08
FORMULA_NAME BridgeAndVehicles-COL-V04P05N02-UpperBounds-09
FORMULA_NAME BridgeAndVehicles-COL-V04P05N02-UpperBounds-10
FORMULA_NAME BridgeAndVehicles-COL-V04P05N02-UpperBounds-11
FORMULA_NAME BridgeAndVehicles-COL-V04P05N02-UpperBounds-12
FORMULA_NAME BridgeAndVehicles-COL-V04P05N02-UpperBounds-13
FORMULA_NAME BridgeAndVehicles-COL-V04P05N02-UpperBounds-14
FORMULA_NAME BridgeAndVehicles-COL-V04P05N02-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1678688538243

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-V04P05N02
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-13 06:22:20] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-13 06:22:20] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-13 06:22:20] [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:22:20] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-13 06:22:20] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 499 ms
[2023-03-13 06:22:20] [INFO ] Imported 15 HL places and 11 HL transitions for a total of 28 PT places and 346.0 transition bindings in 22 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 6 ms.
[2023-03-13 06:22:20] [INFO ] Built PT skeleton of HLPN with 15 places and 11 transitions 56 arcs in 5 ms.
[2023-03-13 06:22:20] [INFO ] Skeletonized 16 HLPN properties in 0 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 06:22:20] [INFO ] Computed 4 place invariants in 5 ms
FORMULA BridgeAndVehicles-COL-V04P05N02-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V04P05N02-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V04P05N02-UpperBounds-10 4 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V04P05N02-UpperBounds-08 5 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V04P05N02-UpperBounds-07 5 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V04P05N02-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V04P05N02-UpperBounds-04 4 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V04P05N02-UpperBounds-00 4 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
[2023-03-13 06:22:20] [INFO ] Invariant cache hit.
[2023-03-13 06:22:20] [INFO ] [Real]Absence check using 4 positive place invariants in 6 ms returned sat
[2023-03-13 06:22:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 06:22:20] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2023-03-13 06:22:20] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 06:22:21] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-13 06:22:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 06:22:21] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2023-03-13 06:22:21] [INFO ] Computed and/alt/rep : 6/9/6 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-13 06:22:21] [INFO ] Added : 2 causal constraints over 1 iterations in 47 ms. Result :sat
Minimization took 11 ms.
[2023-03-13 06:22:21] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-13 06:22:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 06:22:21] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2023-03-13 06:22:21] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 06:22:21] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-13 06:22:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 06:22:21] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2023-03-13 06:22:21] [INFO ] Computed and/alt/rep : 6/9/6 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-13 06:22:21] [INFO ] Added : 2 causal constraints over 1 iterations in 34 ms. Result :sat
Minimization took 3 ms.
[2023-03-13 06:22:21] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-13 06:22:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 06:22:21] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2023-03-13 06:22:21] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 06:22:21] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-13 06:22:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 06:22:21] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2023-03-13 06:22:21] [INFO ] Computed and/alt/rep : 6/9/6 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-13 06:22:21] [INFO ] Added : 2 causal constraints over 1 iterations in 17 ms. Result :sat
Minimization took 4 ms.
[2023-03-13 06:22:21] [INFO ] [Real]Absence check using 4 positive place invariants in 11 ms returned sat
[2023-03-13 06:22:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 06:22:21] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2023-03-13 06:22:21] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 06:22:21] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-13 06:22:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 06:22:21] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2023-03-13 06:22:21] [INFO ] Computed and/alt/rep : 6/9/6 causal constraints (skipped 0 transitions) in 0 ms.
[2023-03-13 06:22:21] [INFO ] Added : 2 causal constraints over 1 iterations in 4 ms. Result :sat
Minimization took 3 ms.
[2023-03-13 06:22:21] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-13 06:22:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 06:22:21] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2023-03-13 06:22:21] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 06:22:21] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-13 06:22:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 06:22:21] [INFO ] [Nat]Absence check using state equation in 25 ms returned sat
[2023-03-13 06:22:21] [INFO ] Computed and/alt/rep : 6/9/6 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-13 06:22:21] [INFO ] Added : 3 causal constraints over 1 iterations in 23 ms. Result :sat
Minimization took 39 ms.
[2023-03-13 06:22:21] [INFO ] [Real]Absence check using 4 positive place invariants in 0 ms returned sat
[2023-03-13 06:22:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 06:22:21] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2023-03-13 06:22:21] [INFO ] Computed and/alt/rep : 6/9/6 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-13 06:22:21] [INFO ] Added : 2 causal constraints over 1 iterations in 5 ms. Result :sat
Minimization took 3 ms.
[2023-03-13 06:22:21] [INFO ] [Real]Absence check using 4 positive place invariants in 0 ms returned sat
[2023-03-13 06:22:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 06:22:21] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2023-03-13 06:22:21] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 06:22:21] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-13 06:22:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 06:22:21] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2023-03-13 06:22:21] [INFO ] Computed and/alt/rep : 6/9/6 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-13 06:22:21] [INFO ] Added : 2 causal constraints over 1 iterations in 14 ms. Result :sat
Minimization took 18 ms.
[2023-03-13 06:22:21] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-13 06:22:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 06:22:21] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2023-03-13 06:22:21] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 06:22:21] [INFO ] [Nat]Absence check using 4 positive place invariants in 4 ms returned sat
[2023-03-13 06:22:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 06:22:21] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2023-03-13 06:22:21] [INFO ] Computed and/alt/rep : 6/9/6 causal constraints (skipped 0 transitions) in 11 ms.
[2023-03-13 06:22:21] [INFO ] Added : 2 causal constraints over 1 iterations in 24 ms. Result :sat
Minimization took 4 ms.
Current structural bounds on expressions (after SMT) : [4, 4, 4, 1, 4, 4, 1, 1]
Arc [1:1*[(MOD (ADD $cA 1) 5)]] contains successor/predecessor on variables of sort voitureA
Arc [6:1*[(MOD (ADD (MOD (MINUS $cB 1) 5) 5) 5)]] contains successor/predecessor on variables of sort voitureB
Arc [13:1*[(MOD (ADD $cpt 1) 3)]] 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:22:21] [INFO ] Unfolded HLPN to a Petri net with 28 places and 52 transitions 326 arcs in 15 ms.
[2023-03-13 06:22:21] [INFO ] Unfolded 8 HLPN properties in 0 ms.
Incomplete random walk after 10000 steps, including 230 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 8) seen :19
FORMULA BridgeAndVehicles-COL-V04P05N02-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-COL-V04P05N02-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-COL-V04P05N02-UpperBounds-11 4 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-COL-V04P05N02-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-COL-V04P05N02-UpperBounds-02 4 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-COL-V04P05N02-UpperBounds-01 4 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 98 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 2) seen :4
Incomplete Best-First random walk after 10001 steps, including 97 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 2) seen :4
[2023-03-13 06:22:21] [INFO ] Flow matrix only has 34 transitions (discarded 18 similar events)
// Phase 1: matrix 34 rows 28 cols
[2023-03-13 06:22:22] [INFO ] Computed 7 place invariants in 9 ms
[2023-03-13 06:22:22] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2023-03-13 06:22:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 06:22:22] [INFO ] [Real]Absence check using state equation in 44 ms returned sat
[2023-03-13 06:22:22] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 06:22:22] [INFO ] [Nat]Absence check using 7 positive place invariants in 5 ms returned sat
[2023-03-13 06:22:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 06:22:22] [INFO ] [Nat]Absence check using state equation in 14 ms returned sat
[2023-03-13 06:22:22] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-03-13 06:22:22] [INFO ] [Nat]Added 6 Read/Feed constraints in 9 ms returned sat
[2023-03-13 06:22:22] [INFO ] Deduced a trap composed of 6 places in 58 ms of which 13 ms to minimize.
[2023-03-13 06:22:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 69 ms
[2023-03-13 06:22:22] [INFO ] Computed and/alt/rep : 25/123/25 causal constraints (skipped 6 transitions) in 7 ms.
[2023-03-13 06:22:22] [INFO ] Deduced a trap composed of 6 places in 27 ms of which 0 ms to minimize.
[2023-03-13 06:22:22] [INFO ] Deduced a trap composed of 5 places in 39 ms of which 1 ms to minimize.
[2023-03-13 06:22:22] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 105 ms
[2023-03-13 06:22:22] [INFO ] Added : 16 causal constraints over 5 iterations in 147 ms. Result :sat
Minimization took 15 ms.
[2023-03-13 06:22:22] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2023-03-13 06:22:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 06:22:22] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2023-03-13 06:22:22] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 06:22:22] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2023-03-13 06:22:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 06:22:22] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2023-03-13 06:22:22] [INFO ] [Nat]Added 6 Read/Feed constraints in 3 ms returned sat
[2023-03-13 06:22:22] [INFO ] Computed and/alt/rep : 25/123/25 causal constraints (skipped 6 transitions) in 12 ms.
[2023-03-13 06:22:22] [INFO ] Deduced a trap composed of 6 places in 29 ms of which 1 ms to minimize.
[2023-03-13 06:22:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 35 ms
[2023-03-13 06:22:22] [INFO ] Added : 8 causal constraints over 2 iterations in 111 ms. Result :sat
Minimization took 11 ms.
Current structural bounds on expressions (after SMT) : [4, 4] Max seen :[2, 2]
Support contains 2 out of 28 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 28/28 places, 52/52 transitions.
Graph (complete) has 146 edges and 28 vertex of which 26 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 26 ms. Remains 26 /28 variables (removed 2) and now considering 52/52 (removed 0) transitions.
[2023-03-13 06:22:22] [INFO ] Flow matrix only has 34 transitions (discarded 18 similar events)
// Phase 1: matrix 34 rows 26 cols
[2023-03-13 06:22:22] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-13 06:22:22] [INFO ] Dead Transitions using invariants and state equation in 58 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 86 ms. Remains : 26/28 places, 52/52 transitions.
Normalized transition count is 34 out of 52 initially.
// Phase 1: matrix 34 rows 26 cols
[2023-03-13 06:22:22] [INFO ] Computed 5 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 22976 resets, run finished after 1067 ms. (steps per millisecond=937 ) properties (out of 2) seen :4
Incomplete Best-First random walk after 1000000 steps, including 9809 resets, run finished after 671 ms. (steps per millisecond=1490 ) properties (out of 2) seen :4
Incomplete Best-First random walk after 1000000 steps, including 9696 resets, run finished after 459 ms. (steps per millisecond=2178 ) properties (out of 2) seen :4
[2023-03-13 06:22:24] [INFO ] Flow matrix only has 34 transitions (discarded 18 similar events)
// Phase 1: matrix 34 rows 26 cols
[2023-03-13 06:22:24] [INFO ] Computed 5 place invariants in 2 ms
[2023-03-13 06:22:24] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-13 06:22:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 06:22:24] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2023-03-13 06:22:24] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 06:22:25] [INFO ] [Nat]Absence check using 5 positive place invariants in 5 ms returned sat
[2023-03-13 06:22:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 06:22:25] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2023-03-13 06:22:25] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-03-13 06:22:25] [INFO ] [Nat]Added 6 Read/Feed constraints in 4 ms returned sat
[2023-03-13 06:22:25] [INFO ] Computed and/alt/rep : 25/123/25 causal constraints (skipped 6 transitions) in 2 ms.
[2023-03-13 06:22:25] [INFO ] Added : 6 causal constraints over 2 iterations in 20 ms. Result :sat
Minimization took 11 ms.
[2023-03-13 06:22:25] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-13 06:22:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 06:22:25] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2023-03-13 06:22:25] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 06:22:25] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-13 06:22:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 06:22:25] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2023-03-13 06:22:25] [INFO ] [Nat]Added 6 Read/Feed constraints in 1 ms returned sat
[2023-03-13 06:22:25] [INFO ] Deduced a trap composed of 6 places in 26 ms of which 1 ms to minimize.
[2023-03-13 06:22:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 30 ms
[2023-03-13 06:22:25] [INFO ] Computed and/alt/rep : 25/123/25 causal constraints (skipped 6 transitions) in 3 ms.
[2023-03-13 06:22:25] [INFO ] Added : 17 causal constraints over 4 iterations in 30 ms. Result :sat
Minimization took 18 ms.
Current structural bounds on expressions (after SMT) : [4, 4] Max seen :[2, 2]
Support contains 2 out of 26 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 26/26 places, 52/52 transitions.
Applied a total of 0 rules in 3 ms. Remains 26 /26 variables (removed 0) and now considering 52/52 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 26/26 places, 52/52 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 26/26 places, 52/52 transitions.
Applied a total of 0 rules in 3 ms. Remains 26 /26 variables (removed 0) and now considering 52/52 (removed 0) transitions.
[2023-03-13 06:22:25] [INFO ] Flow matrix only has 34 transitions (discarded 18 similar events)
[2023-03-13 06:22:25] [INFO ] Invariant cache hit.
[2023-03-13 06:22:25] [INFO ] Implicit Places using invariants in 33 ms returned []
[2023-03-13 06:22:25] [INFO ] Flow matrix only has 34 transitions (discarded 18 similar events)
[2023-03-13 06:22:25] [INFO ] Invariant cache hit.
[2023-03-13 06:22:25] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-03-13 06:22:25] [INFO ] Implicit Places using invariants and state equation in 61 ms returned [7, 15]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 110 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 24/26 places, 52/52 transitions.
Applied a total of 0 rules in 1 ms. Remains 24 /24 variables (removed 0) and now considering 52/52 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 114 ms. Remains : 24/26 places, 52/52 transitions.
Normalized transition count is 34 out of 52 initially.
// Phase 1: matrix 34 rows 24 cols
[2023-03-13 06:22:25] [INFO ] Computed 5 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 22968 resets, run finished after 635 ms. (steps per millisecond=1574 ) properties (out of 2) seen :4
Incomplete Best-First random walk after 1000000 steps, including 9802 resets, run finished after 328 ms. (steps per millisecond=3048 ) properties (out of 2) seen :4
Incomplete Best-First random walk after 1000000 steps, including 9691 resets, run finished after 314 ms. (steps per millisecond=3184 ) properties (out of 2) seen :4
[2023-03-13 06:22:26] [INFO ] Flow matrix only has 34 transitions (discarded 18 similar events)
// Phase 1: matrix 34 rows 24 cols
[2023-03-13 06:22:26] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-13 06:22:26] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-13 06:22:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 06:22:26] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2023-03-13 06:22:26] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 06:22:26] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-13 06:22:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 06:22:26] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2023-03-13 06:22:26] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-03-13 06:22:26] [INFO ] [Nat]Added 6 Read/Feed constraints in 2 ms returned sat
[2023-03-13 06:22:26] [INFO ] Computed and/alt/rep : 25/83/25 causal constraints (skipped 6 transitions) in 9 ms.
[2023-03-13 06:22:26] [INFO ] Deduced a trap composed of 5 places in 38 ms of which 0 ms to minimize.
[2023-03-13 06:22:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 45 ms
[2023-03-13 06:22:26] [INFO ] Added : 15 causal constraints over 3 iterations in 69 ms. Result :sat
Minimization took 12 ms.
[2023-03-13 06:22:26] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-13 06:22:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 06:22:26] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2023-03-13 06:22:26] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 06:22:26] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-13 06:22:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 06:22:26] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2023-03-13 06:22:26] [INFO ] [Nat]Added 6 Read/Feed constraints in 1 ms returned sat
[2023-03-13 06:22:26] [INFO ] Computed and/alt/rep : 25/83/25 causal constraints (skipped 6 transitions) in 4 ms.
[2023-03-13 06:22:26] [INFO ] Added : 19 causal constraints over 6 iterations in 28 ms. Result :sat
Minimization took 11 ms.
Current structural bounds on expressions (after SMT) : [4, 4] Max seen :[2, 2]
Support contains 2 out of 24 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 24/24 places, 52/52 transitions.
Applied a total of 0 rules in 2 ms. Remains 24 /24 variables (removed 0) and now considering 52/52 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 24/24 places, 52/52 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 24/24 places, 52/52 transitions.
Applied a total of 0 rules in 2 ms. Remains 24 /24 variables (removed 0) and now considering 52/52 (removed 0) transitions.
[2023-03-13 06:22:27] [INFO ] Flow matrix only has 34 transitions (discarded 18 similar events)
[2023-03-13 06:22:27] [INFO ] Invariant cache hit.
[2023-03-13 06:22:27] [INFO ] Implicit Places using invariants in 29 ms returned []
[2023-03-13 06:22:27] [INFO ] Flow matrix only has 34 transitions (discarded 18 similar events)
[2023-03-13 06:22:27] [INFO ] Invariant cache hit.
[2023-03-13 06:22:27] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-03-13 06:22:27] [INFO ] Implicit Places using invariants and state equation in 51 ms returned []
Implicit Place search using SMT with State Equation took 106 ms to find 0 implicit places.
[2023-03-13 06:22:27] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-13 06:22:27] [INFO ] Flow matrix only has 34 transitions (discarded 18 similar events)
[2023-03-13 06:22:27] [INFO ] Invariant cache hit.
[2023-03-13 06:22:27] [INFO ] Dead Transitions using invariants and state equation in 46 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 161 ms. Remains : 24/24 places, 52/52 transitions.
Starting property specific reduction for BridgeAndVehicles-COL-V04P05N02-UpperBounds-03
Normalized transition count is 34 out of 52 initially.
// Phase 1: matrix 34 rows 24 cols
[2023-03-13 06:22:27] [INFO ] Computed 5 place invariants in 1 ms
Incomplete random walk after 10000 steps, including 229 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :2
Incomplete Best-First random walk after 10000 steps, including 98 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :2
[2023-03-13 06:22:27] [INFO ] Flow matrix only has 34 transitions (discarded 18 similar events)
// Phase 1: matrix 34 rows 24 cols
[2023-03-13 06:22:27] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-13 06:22:27] [INFO ] [Real]Absence check using 5 positive place invariants in 17 ms returned sat
[2023-03-13 06:22:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 06:22:27] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2023-03-13 06:22:27] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 06:22:27] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-13 06:22:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 06:22:27] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2023-03-13 06:22:27] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-03-13 06:22:27] [INFO ] [Nat]Added 6 Read/Feed constraints in 2 ms returned sat
[2023-03-13 06:22:27] [INFO ] Computed and/alt/rep : 25/83/25 causal constraints (skipped 6 transitions) in 2 ms.
[2023-03-13 06:22:27] [INFO ] Deduced a trap composed of 5 places in 19 ms of which 0 ms to minimize.
[2023-03-13 06:22:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 24 ms
[2023-03-13 06:22:27] [INFO ] Added : 15 causal constraints over 3 iterations in 41 ms. Result :sat
Minimization took 12 ms.
Current structural bounds on expressions (after SMT) : [5] Max seen :[2]
Support contains 1 out of 24 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 24/24 places, 52/52 transitions.
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 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 23 transition count 51
Applied a total of 2 rules in 5 ms. Remains 23 /24 variables (removed 1) and now considering 51/52 (removed 1) transitions.
[2023-03-13 06:22:27] [INFO ] Flow matrix only has 33 transitions (discarded 18 similar events)
// Phase 1: matrix 33 rows 23 cols
[2023-03-13 06:22:27] [INFO ] Computed 5 place invariants in 0 ms
[2023-03-13 06:22:27] [INFO ] Dead Transitions using invariants and state equation in 34 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 45 ms. Remains : 23/24 places, 51/52 transitions.
Normalized transition count is 33 out of 51 initially.
// Phase 1: matrix 33 rows 23 cols
[2023-03-13 06:22:27] [INFO ] Computed 5 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 25614 resets, run finished after 757 ms. (steps per millisecond=1321 ) properties (out of 1) seen :2
Incomplete Best-First random walk after 1000000 steps, including 11498 resets, run finished after 351 ms. (steps per millisecond=2849 ) properties (out of 1) seen :2
[2023-03-13 06:22:28] [INFO ] Flow matrix only has 33 transitions (discarded 18 similar events)
// Phase 1: matrix 33 rows 23 cols
[2023-03-13 06:22:28] [INFO ] Computed 5 place invariants in 0 ms
[2023-03-13 06:22:28] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-13 06:22:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 06:22:28] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2023-03-13 06:22:28] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 06:22:28] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-13 06:22:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 06:22:28] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2023-03-13 06:22:28] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-03-13 06:22:28] [INFO ] [Nat]Added 6 Read/Feed constraints in 1 ms returned sat
[2023-03-13 06:22:28] [INFO ] Computed and/alt/rep : 24/79/24 causal constraints (skipped 6 transitions) in 3 ms.
[2023-03-13 06:22:28] [INFO ] Deduced a trap composed of 5 places in 18 ms of which 1 ms to minimize.
[2023-03-13 06:22:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 23 ms
[2023-03-13 06:22:28] [INFO ] Added : 17 causal constraints over 5 iterations in 54 ms. Result :sat
Minimization took 12 ms.
Current structural bounds on expressions (after SMT) : [5] Max seen :[2]
Support contains 1 out of 23 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 23/23 places, 51/51 transitions.
Applied a total of 0 rules in 2 ms. Remains 23 /23 variables (removed 0) and now considering 51/51 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 23/23 places, 51/51 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 23/23 places, 51/51 transitions.
Applied a total of 0 rules in 2 ms. Remains 23 /23 variables (removed 0) and now considering 51/51 (removed 0) transitions.
[2023-03-13 06:22:28] [INFO ] Flow matrix only has 33 transitions (discarded 18 similar events)
[2023-03-13 06:22:28] [INFO ] Invariant cache hit.
[2023-03-13 06:22:28] [INFO ] Implicit Places using invariants in 44 ms returned []
[2023-03-13 06:22:28] [INFO ] Flow matrix only has 33 transitions (discarded 18 similar events)
[2023-03-13 06:22:28] [INFO ] Invariant cache hit.
[2023-03-13 06:22:28] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-03-13 06:22:28] [INFO ] Implicit Places using invariants and state equation in 53 ms returned []
Implicit Place search using SMT with State Equation took 99 ms to find 0 implicit places.
[2023-03-13 06:22:28] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-13 06:22:28] [INFO ] Flow matrix only has 33 transitions (discarded 18 similar events)
[2023-03-13 06:22:28] [INFO ] Invariant cache hit.
[2023-03-13 06:22:28] [INFO ] Dead Transitions using invariants and state equation in 41 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 150 ms. Remains : 23/23 places, 51/51 transitions.
Ending property specific reduction for BridgeAndVehicles-COL-V04P05N02-UpperBounds-03 in 1622 ms.
Starting property specific reduction for BridgeAndVehicles-COL-V04P05N02-UpperBounds-09
Normalized transition count is 34 out of 52 initially.
// Phase 1: matrix 34 rows 24 cols
[2023-03-13 06:22:28] [INFO ] Computed 5 place invariants in 1 ms
Incomplete random walk after 10000 steps, including 229 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :2
Incomplete Best-First random walk after 10000 steps, including 96 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :2
[2023-03-13 06:22:28] [INFO ] Flow matrix only has 34 transitions (discarded 18 similar events)
// Phase 1: matrix 34 rows 24 cols
[2023-03-13 06:22:28] [INFO ] Computed 5 place invariants in 0 ms
[2023-03-13 06:22:28] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-13 06:22:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 06:22:28] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2023-03-13 06:22:28] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 06:22:28] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-13 06:22:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 06:22:28] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2023-03-13 06:22:28] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-03-13 06:22:28] [INFO ] [Nat]Added 6 Read/Feed constraints in 1 ms returned sat
[2023-03-13 06:22:28] [INFO ] Computed and/alt/rep : 25/83/25 causal constraints (skipped 6 transitions) in 2 ms.
[2023-03-13 06:22:28] [INFO ] Added : 19 causal constraints over 6 iterations in 22 ms. Result :sat
Minimization took 13 ms.
Current structural bounds on expressions (after SMT) : [5] Max seen :[2]
Support contains 1 out of 24 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 24/24 places, 52/52 transitions.
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 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 23 transition count 51
Applied a total of 2 rules in 3 ms. Remains 23 /24 variables (removed 1) and now considering 51/52 (removed 1) transitions.
[2023-03-13 06:22:28] [INFO ] Flow matrix only has 33 transitions (discarded 18 similar events)
// Phase 1: matrix 33 rows 23 cols
[2023-03-13 06:22:28] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-13 06:22:28] [INFO ] Dead Transitions using invariants and state equation in 44 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61 ms. Remains : 23/24 places, 51/52 transitions.
Normalized transition count is 33 out of 51 initially.
// Phase 1: matrix 33 rows 23 cols
[2023-03-13 06:22:29] [INFO ] Computed 5 place invariants in 2 ms
Incomplete random walk after 1000000 steps, including 25573 resets, run finished after 596 ms. (steps per millisecond=1677 ) properties (out of 1) seen :2
Incomplete Best-First random walk after 1000001 steps, including 11490 resets, run finished after 329 ms. (steps per millisecond=3039 ) properties (out of 1) seen :2
[2023-03-13 06:22:29] [INFO ] Flow matrix only has 33 transitions (discarded 18 similar events)
// Phase 1: matrix 33 rows 23 cols
[2023-03-13 06:22:29] [INFO ] Computed 5 place invariants in 2 ms
[2023-03-13 06:22:29] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-13 06:22:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 06:22:29] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2023-03-13 06:22:29] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-03-13 06:22:29] [INFO ] [Real]Added 6 Read/Feed constraints in 1 ms returned sat
[2023-03-13 06:22:29] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 06:22:30] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-13 06:22:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 06:22:30] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2023-03-13 06:22:30] [INFO ] [Nat]Added 6 Read/Feed constraints in 1 ms returned sat
[2023-03-13 06:22:30] [INFO ] Computed and/alt/rep : 24/79/24 causal constraints (skipped 6 transitions) in 4 ms.
[2023-03-13 06:22:30] [INFO ] Added : 16 causal constraints over 4 iterations in 26 ms. Result :sat
Minimization took 16 ms.
Current structural bounds on expressions (after SMT) : [5] Max seen :[2]
Support contains 1 out of 23 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 23/23 places, 51/51 transitions.
Applied a total of 0 rules in 2 ms. Remains 23 /23 variables (removed 0) and now considering 51/51 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 23/23 places, 51/51 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 23/23 places, 51/51 transitions.
Applied a total of 0 rules in 2 ms. Remains 23 /23 variables (removed 0) and now considering 51/51 (removed 0) transitions.
[2023-03-13 06:22:30] [INFO ] Flow matrix only has 33 transitions (discarded 18 similar events)
[2023-03-13 06:22:30] [INFO ] Invariant cache hit.
[2023-03-13 06:22:30] [INFO ] Implicit Places using invariants in 42 ms returned []
[2023-03-13 06:22:30] [INFO ] Flow matrix only has 33 transitions (discarded 18 similar events)
[2023-03-13 06:22:30] [INFO ] Invariant cache hit.
[2023-03-13 06:22:30] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-03-13 06:22:30] [INFO ] Implicit Places using invariants and state equation in 52 ms returned []
Implicit Place search using SMT with State Equation took 97 ms to find 0 implicit places.
[2023-03-13 06:22:30] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-13 06:22:30] [INFO ] Flow matrix only has 33 transitions (discarded 18 similar events)
[2023-03-13 06:22:30] [INFO ] Invariant cache hit.
[2023-03-13 06:22:30] [INFO ] Dead Transitions using invariants and state equation in 38 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 156 ms. Remains : 23/23 places, 51/51 transitions.
Ending property specific reduction for BridgeAndVehicles-COL-V04P05N02-UpperBounds-09 in 1448 ms.
[2023-03-13 06:22:30] [INFO ] Flatten gal took : 43 ms
[2023-03-13 06:22:30] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/UpperBounds.sr.xml took 2 ms.
[2023-03-13 06:22:30] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 24 places, 52 transitions and 306 arcs took 1 ms.
Total runtime 10216 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_V04P05N02_unf
(NrP: 24 NrTr: 52 NrArc: 306)

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

net check time: 0m 0.000sec

init dd package: 0m 3.490sec


RS generation: 0m 0.023sec


-> reachability set: #nodes 1453 (1.5e+03) #states 2,874 (3)



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

checking: place_bound(p7)
normalized: place_bound(p7)

-> the formula is 2

FORMULA BridgeAndVehicles-COL-V04P05N02-UpperBounds-03 2 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: place_bound(p13)
normalized: place_bound(p13)

-> the formula is 2

FORMULA BridgeAndVehicles-COL-V04P05N02-UpperBounds-09 2 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

totally nodes used: 7635 (7.6e+03)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 17919 70945 88864
used/not used/entry size/cache size: 72193 67036671 16 1024MB
basic ops cache: hits/miss/sum: 699 1958 2657
used/not used/entry size/cache size: 3898 16773318 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: 378 1453 1831
used/not used/entry size/cache size: 1453 8387155 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 67101327
1 7475
2 44
3 6
4 8
5 2
6 2
7 0
8 0
9 0
>= 10 0

Total processing time: 0m 6.165sec


BK_STOP 1678688556751

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


iterations count:2870 (55), effective:199 (3)

initing FirstDep: 0m 0.000sec

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-V04P05N02"
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-V04P05N02, 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-167813695200005"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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