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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 648K
-rw-r--r-- 1 mcc users 9.5K Feb 25 12:04 CTLCardinality.txt
-rw-r--r-- 1 mcc users 89K Feb 25 12:04 CTLCardinality.xml
-rw-r--r-- 1 mcc users 13K Feb 25 12:03 CTLFireability.txt
-rw-r--r-- 1 mcc users 81K 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 4.3K Feb 25 15:35 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 15:35 LTLCardinality.xml
-rw-r--r-- 1 mcc users 7.2K Feb 25 15:35 LTLFireability.txt
-rw-r--r-- 1 mcc users 30K Feb 25 15:35 LTLFireability.xml
-rw-r--r-- 1 mcc users 19K Feb 25 12:06 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 163K Feb 25 12:06 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 19K Feb 25 12:05 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 97K 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_col
-rw-r--r-- 1 mcc users 10 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 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-PT-V04P05N02-UpperBounds-00
FORMULA_NAME BridgeAndVehicles-PT-V04P05N02-UpperBounds-01
FORMULA_NAME BridgeAndVehicles-PT-V04P05N02-UpperBounds-02
FORMULA_NAME BridgeAndVehicles-PT-V04P05N02-UpperBounds-03
FORMULA_NAME BridgeAndVehicles-PT-V04P05N02-UpperBounds-04
FORMULA_NAME BridgeAndVehicles-PT-V04P05N02-UpperBounds-05
FORMULA_NAME BridgeAndVehicles-PT-V04P05N02-UpperBounds-06
FORMULA_NAME BridgeAndVehicles-PT-V04P05N02-UpperBounds-07
FORMULA_NAME BridgeAndVehicles-PT-V04P05N02-UpperBounds-08
FORMULA_NAME BridgeAndVehicles-PT-V04P05N02-UpperBounds-09
FORMULA_NAME BridgeAndVehicles-PT-V04P05N02-UpperBounds-10
FORMULA_NAME BridgeAndVehicles-PT-V04P05N02-UpperBounds-11
FORMULA_NAME BridgeAndVehicles-PT-V04P05N02-UpperBounds-12
FORMULA_NAME BridgeAndVehicles-PT-V04P05N02-UpperBounds-13
FORMULA_NAME BridgeAndVehicles-PT-V04P05N02-UpperBounds-14
FORMULA_NAME BridgeAndVehicles-PT-V04P05N02-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1678699054581

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-PT-V04P05N02
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-13 09:17:36] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-13 09:17:36] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-13 09:17:36] [INFO ] Load time of PNML (sax parser for PT used): 33 ms
[2023-03-13 09:17:36] [INFO ] Transformed 28 places.
[2023-03-13 09:17:36] [INFO ] Transformed 52 transitions.
[2023-03-13 09:17:36] [INFO ] Parsed PT model containing 28 places and 52 transitions and 326 arcs in 109 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 5 ms.
Normalized transition count is 34 out of 52 initially.
// Phase 1: matrix 34 rows 28 cols
[2023-03-13 09:17:36] [INFO ] Computed 7 place invariants in 3 ms
FORMULA BridgeAndVehicles-PT-V04P05N02-UpperBounds-11 4 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V04P05N02-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V04P05N02-UpperBounds-07 5 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V04P05N02-UpperBounds-04 4 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V04P05N02-UpperBounds-00 4 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 229 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 11) seen :27
FORMULA BridgeAndVehicles-PT-V04P05N02-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-PT-V04P05N02-UpperBounds-14 4 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-PT-V04P05N02-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-PT-V04P05N02-UpperBounds-12 4 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-PT-V04P05N02-UpperBounds-10 4 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-PT-V04P05N02-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-PT-V04P05N02-UpperBounds-02 4 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-PT-V04P05N02-UpperBounds-01 4 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 97 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 3) seen :4
Incomplete Best-First random walk after 10001 steps, including 111 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 3) seen :3
Incomplete Best-First random walk after 10001 steps, including 125 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 3) seen :3
[2023-03-13 09:17:36] [INFO ] Flow matrix only has 34 transitions (discarded 18 similar events)
// Phase 1: matrix 34 rows 28 cols
[2023-03-13 09:17:36] [INFO ] Computed 7 place invariants in 4 ms
[2023-03-13 09:17:36] [INFO ] [Real]Absence check using 7 positive place invariants in 4 ms returned sat
[2023-03-13 09:17:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 09:17:36] [INFO ] [Real]Absence check using state equation in 30 ms returned sat
[2023-03-13 09:17:36] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 09:17:36] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2023-03-13 09:17:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 09:17:36] [INFO ] [Nat]Absence check using state equation in 19 ms returned sat
[2023-03-13 09:17:36] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-03-13 09:17:36] [INFO ] [Nat]Added 6 Read/Feed constraints in 1 ms returned sat
[2023-03-13 09:17:36] [INFO ] Computed and/alt/rep : 25/123/25 causal constraints (skipped 6 transitions) in 3 ms.
[2023-03-13 09:17:36] [INFO ] Deduced a trap composed of 5 places in 49 ms of which 2 ms to minimize.
[2023-03-13 09:17:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 57 ms
[2023-03-13 09:17:36] [INFO ] Added : 16 causal constraints over 4 iterations in 103 ms. Result :sat
Minimization took 13 ms.
[2023-03-13 09:17:36] [INFO ] [Real]Absence check using 7 positive place invariants in 1 ms returned unsat
[2023-03-13 09:17:36] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned unsat
Current structural bounds on expressions (after SMT) : [4, 1, 1] Max seen :[2, 1, 1]
FORMULA BridgeAndVehicles-PT-V04P05N02-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA BridgeAndVehicles-PT-V04P05N02-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 1 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.0 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 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 25 transition count 51
Applied a total of 3 rules in 12 ms. Remains 25 /28 variables (removed 3) and now considering 51/52 (removed 1) transitions.
[2023-03-13 09:17:36] [INFO ] Flow matrix only has 33 transitions (discarded 18 similar events)
// Phase 1: matrix 33 rows 25 cols
[2023-03-13 09:17:36] [INFO ] Computed 5 place invariants in 0 ms
[2023-03-13 09:17:36] [INFO ] Dead Transitions using invariants and state equation in 52 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 64 ms. Remains : 25/28 places, 51/52 transitions.
Normalized transition count is 33 out of 51 initially.
// Phase 1: matrix 33 rows 25 cols
[2023-03-13 09:17:36] [INFO ] Computed 5 place invariants in 2 ms
Incomplete random walk after 1000000 steps, including 25615 resets, run finished after 728 ms. (steps per millisecond=1373 ) properties (out of 1) seen :2
Incomplete Best-First random walk after 1000001 steps, including 11488 resets, run finished after 400 ms. (steps per millisecond=2500 ) properties (out of 1) seen :2
[2023-03-13 09:17:38] [INFO ] Flow matrix only has 33 transitions (discarded 18 similar events)
// Phase 1: matrix 33 rows 25 cols
[2023-03-13 09:17:38] [INFO ] Computed 5 place invariants in 4 ms
[2023-03-13 09:17:38] [INFO ] [Real]Absence check using 5 positive place invariants in 15 ms returned sat
[2023-03-13 09:17:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 09:17:38] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2023-03-13 09:17:38] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 09:17:38] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-13 09:17:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 09:17:38] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2023-03-13 09:17:38] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-03-13 09:17:38] [INFO ] [Nat]Added 6 Read/Feed constraints in 1 ms returned sat
[2023-03-13 09:17:38] [INFO ] Deduced a trap composed of 5 places in 27 ms of which 1 ms to minimize.
[2023-03-13 09:17:38] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 38 ms
[2023-03-13 09:17:38] [INFO ] Computed and/alt/rep : 24/119/24 causal constraints (skipped 6 transitions) in 4 ms.
[2023-03-13 09:17:38] [INFO ] Added : 18 causal constraints over 4 iterations in 62 ms. Result :sat
Minimization took 22 ms.
Current structural bounds on expressions (after SMT) : [4] Max seen :[2]
Support contains 1 out of 25 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 25/25 places, 51/51 transitions.
Applied a total of 0 rules in 2 ms. Remains 25 /25 variables (removed 0) and now considering 51/51 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 25/25 places, 51/51 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 25/25 places, 51/51 transitions.
Applied a total of 0 rules in 2 ms. Remains 25 /25 variables (removed 0) and now considering 51/51 (removed 0) transitions.
[2023-03-13 09:17:38] [INFO ] Flow matrix only has 33 transitions (discarded 18 similar events)
[2023-03-13 09:17:38] [INFO ] Invariant cache hit.
[2023-03-13 09:17:38] [INFO ] Implicit Places using invariants in 55 ms returned []
[2023-03-13 09:17:38] [INFO ] Flow matrix only has 33 transitions (discarded 18 similar events)
[2023-03-13 09:17:38] [INFO ] Invariant cache hit.
[2023-03-13 09:17:38] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-03-13 09:17:38] [INFO ] Implicit Places using invariants and state equation in 143 ms returned [6, 16]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 202 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 23/25 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 2 iterations and 206 ms. Remains : 23/25 places, 51/51 transitions.
Normalized transition count is 33 out of 51 initially.
// Phase 1: matrix 33 rows 23 cols
[2023-03-13 09:17:38] [INFO ] Computed 5 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 25603 resets, run finished after 744 ms. (steps per millisecond=1344 ) properties (out of 1) seen :2
Incomplete Best-First random walk after 1000000 steps, including 11493 resets, run finished after 470 ms. (steps per millisecond=2127 ) properties (out of 1) seen :2
[2023-03-13 09:17:39] [INFO ] Flow matrix only has 33 transitions (discarded 18 similar events)
// Phase 1: matrix 33 rows 23 cols
[2023-03-13 09:17:39] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-13 09:17:39] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-13 09:17:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 09:17:39] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2023-03-13 09:17:39] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 09:17:39] [INFO ] [Nat]Absence check using 5 positive place invariants in 6 ms returned sat
[2023-03-13 09:17:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 09:17:39] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2023-03-13 09:17:39] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-03-13 09:17:39] [INFO ] [Nat]Added 6 Read/Feed constraints in 2 ms returned sat
[2023-03-13 09:17:39] [INFO ] Computed and/alt/rep : 24/79/24 causal constraints (skipped 6 transitions) in 3 ms.
[2023-03-13 09:17:39] [INFO ] Deduced a trap composed of 5 places in 22 ms of which 0 ms to minimize.
[2023-03-13 09:17:39] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 27 ms
[2023-03-13 09:17:39] [INFO ] Added : 9 causal constraints over 2 iterations in 46 ms. Result :sat
Minimization took 9 ms.
Current structural bounds on expressions (after SMT) : [4] 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 3 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 3 ms. Remains 23 /23 variables (removed 0) and now considering 51/51 (removed 0) transitions.
[2023-03-13 09:17:39] [INFO ] Flow matrix only has 33 transitions (discarded 18 similar events)
[2023-03-13 09:17:39] [INFO ] Invariant cache hit.
[2023-03-13 09:17:39] [INFO ] Implicit Places using invariants in 41 ms returned []
[2023-03-13 09:17:39] [INFO ] Flow matrix only has 33 transitions (discarded 18 similar events)
[2023-03-13 09:17:39] [INFO ] Invariant cache hit.
[2023-03-13 09:17:39] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-03-13 09:17:39] [INFO ] Implicit Places using invariants and state equation in 60 ms returned []
Implicit Place search using SMT with State Equation took 103 ms to find 0 implicit places.
[2023-03-13 09:17:39] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-13 09:17:39] [INFO ] Flow matrix only has 33 transitions (discarded 18 similar events)
[2023-03-13 09:17:39] [INFO ] Invariant cache hit.
[2023-03-13 09:17:40] [INFO ] Dead Transitions using invariants and state equation in 37 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 151 ms. Remains : 23/23 places, 51/51 transitions.
Starting property specific reduction for BridgeAndVehicles-PT-V04P05N02-UpperBounds-03
Normalized transition count is 33 out of 51 initially.
// Phase 1: matrix 33 rows 23 cols
[2023-03-13 09:17:40] [INFO ] Computed 5 place invariants in 1 ms
Incomplete random walk after 10000 steps, including 256 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :2
Incomplete Best-First random walk after 10000 steps, including 115 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :2
[2023-03-13 09:17:40] [INFO ] Flow matrix only has 33 transitions (discarded 18 similar events)
// Phase 1: matrix 33 rows 23 cols
[2023-03-13 09:17:40] [INFO ] Computed 5 place invariants in 0 ms
[2023-03-13 09:17:40] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-13 09:17:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 09:17:40] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2023-03-13 09:17:40] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 09:17:40] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-13 09:17:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 09:17:40] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2023-03-13 09:17:40] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-03-13 09:17:40] [INFO ] [Nat]Added 6 Read/Feed constraints in 2 ms returned sat
[2023-03-13 09:17:40] [INFO ] Computed and/alt/rep : 24/79/24 causal constraints (skipped 6 transitions) in 3 ms.
[2023-03-13 09:17:40] [INFO ] Deduced a trap composed of 5 places in 20 ms of which 1 ms to minimize.
[2023-03-13 09:17:40] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 24 ms
[2023-03-13 09:17:40] [INFO ] Added : 9 causal constraints over 2 iterations in 40 ms. Result :sat
Minimization took 9 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 3 ms. Remains 23 /23 variables (removed 0) and now considering 51/51 (removed 0) transitions.
[2023-03-13 09:17:40] [INFO ] Flow matrix only has 33 transitions (discarded 18 similar events)
[2023-03-13 09:17:40] [INFO ] Invariant cache hit.
[2023-03-13 09:17:40] [INFO ] Dead Transitions using invariants and state equation in 39 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 43 ms. Remains : 23/23 places, 51/51 transitions.
Normalized transition count is 33 out of 51 initially.
// Phase 1: matrix 33 rows 23 cols
[2023-03-13 09:17:40] [INFO ] Computed 5 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 25606 resets, run finished after 683 ms. (steps per millisecond=1464 ) properties (out of 1) seen :2
Incomplete Best-First random walk after 1000000 steps, including 11497 resets, run finished after 297 ms. (steps per millisecond=3367 ) properties (out of 1) seen :2
[2023-03-13 09:17:41] [INFO ] Flow matrix only has 33 transitions (discarded 18 similar events)
// Phase 1: matrix 33 rows 23 cols
[2023-03-13 09:17:41] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-13 09:17:41] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-13 09:17:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 09:17:41] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2023-03-13 09:17:41] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 09:17:41] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-13 09:17:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 09:17:41] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2023-03-13 09:17:41] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-03-13 09:17:41] [INFO ] [Nat]Added 6 Read/Feed constraints in 2 ms returned sat
[2023-03-13 09:17:41] [INFO ] Computed and/alt/rep : 24/79/24 causal constraints (skipped 6 transitions) in 3 ms.
[2023-03-13 09:17:41] [INFO ] Deduced a trap composed of 5 places in 21 ms of which 1 ms to minimize.
[2023-03-13 09:17:41] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 26 ms
[2023-03-13 09:17:41] [INFO ] Added : 9 causal constraints over 2 iterations in 43 ms. Result :sat
Minimization took 8 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 2 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 3 ms. Remains 23 /23 variables (removed 0) and now considering 51/51 (removed 0) transitions.
[2023-03-13 09:17:41] [INFO ] Flow matrix only has 33 transitions (discarded 18 similar events)
[2023-03-13 09:17:41] [INFO ] Invariant cache hit.
[2023-03-13 09:17:41] [INFO ] Implicit Places using invariants in 44 ms returned []
[2023-03-13 09:17:41] [INFO ] Flow matrix only has 33 transitions (discarded 18 similar events)
[2023-03-13 09:17:41] [INFO ] Invariant cache hit.
[2023-03-13 09:17:41] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-03-13 09:17:41] [INFO ] Implicit Places using invariants and state equation in 44 ms returned []
Implicit Place search using SMT with State Equation took 95 ms to find 0 implicit places.
[2023-03-13 09:17:41] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-13 09:17:41] [INFO ] Flow matrix only has 33 transitions (discarded 18 similar events)
[2023-03-13 09:17:41] [INFO ] Invariant cache hit.
[2023-03-13 09:17:41] [INFO ] Dead Transitions using invariants and state equation in 33 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 137 ms. Remains : 23/23 places, 51/51 transitions.
Ending property specific reduction for BridgeAndVehicles-PT-V04P05N02-UpperBounds-03 in 1464 ms.
[2023-03-13 09:17:41] [INFO ] Flatten gal took : 33 ms
[2023-03-13 09:17:41] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/UpperBounds.sr.xml took 2 ms.
[2023-03-13 09:17:41] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 23 places, 51 transitions and 304 arcs took 2 ms.
Total runtime 5480 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_PT_V04P05N02
(NrP: 23 NrTr: 51 NrArc: 304)

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

net check time: 0m 0.000sec

init dd package: 0m 3.204sec


RS generation: 0m 0.022sec


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



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

checking: place_bound(p6)
normalized: place_bound(p6)

-> the formula is 2

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

MC time: 0m 0.000sec

totally nodes used: 8157 (8.2e+03)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 25704 91037 116741
used/not used/entry size/cache size: 89995 67018869 16 1024MB
basic ops cache: hits/miss/sum: 508 1544 2052
used/not used/entry size/cache size: 3261 16773955 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: 312 1548 1860
used/not used/entry size/cache size: 1548 8387060 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 67101014
1 7768
2 39
3 10
4 11
5 8
6 3
7 0
8 1
9 3
>= 10 7

Total processing time: 0m 5.259sec


BK_STOP 1678699067129

--------------------
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:
++ 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
++ sed s/.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.002sec


iterations count:3349 (65), effective:211 (4)

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-PT-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-PT-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-167813695400165"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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