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.r043-tajo-167813696600261.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 smartxred
Input is BridgeAndVehicles-PT-V50P50N20, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r043-tajo-167813696600261
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 6.6M
-rw-r--r-- 1 mcc users 18K Feb 25 12:28 CTLCardinality.txt
-rw-r--r-- 1 mcc users 110K Feb 25 12:28 CTLCardinality.xml
-rw-r--r-- 1 mcc users 343K Feb 25 12:25 CTLFireability.txt
-rw-r--r-- 1 mcc users 1.4M Feb 25 12:25 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 12K Feb 25 15:36 LTLCardinality.txt
-rw-r--r-- 1 mcc users 45K Feb 25 15:36 LTLCardinality.xml
-rw-r--r-- 1 mcc users 198K Feb 25 15:36 LTLFireability.txt
-rw-r--r-- 1 mcc users 579K Feb 25 15:36 LTLFireability.xml
-rw-r--r-- 1 mcc users 24K Feb 25 12:53 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 128K Feb 25 12:53 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 398K Feb 25 12:50 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 1.5M Feb 25 12:50 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 3.3K Feb 25 15:36 UpperBounds.txt
-rw-r--r-- 1 mcc users 7.3K Feb 25 15:36 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 2.0M 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-V50P50N20-UpperBounds-00
FORMULA_NAME BridgeAndVehicles-PT-V50P50N20-UpperBounds-01
FORMULA_NAME BridgeAndVehicles-PT-V50P50N20-UpperBounds-02
FORMULA_NAME BridgeAndVehicles-PT-V50P50N20-UpperBounds-03
FORMULA_NAME BridgeAndVehicles-PT-V50P50N20-UpperBounds-04
FORMULA_NAME BridgeAndVehicles-PT-V50P50N20-UpperBounds-05
FORMULA_NAME BridgeAndVehicles-PT-V50P50N20-UpperBounds-06
FORMULA_NAME BridgeAndVehicles-PT-V50P50N20-UpperBounds-07
FORMULA_NAME BridgeAndVehicles-PT-V50P50N20-UpperBounds-08
FORMULA_NAME BridgeAndVehicles-PT-V50P50N20-UpperBounds-09
FORMULA_NAME BridgeAndVehicles-PT-V50P50N20-UpperBounds-10
FORMULA_NAME BridgeAndVehicles-PT-V50P50N20-UpperBounds-11
FORMULA_NAME BridgeAndVehicles-PT-V50P50N20-UpperBounds-12
FORMULA_NAME BridgeAndVehicles-PT-V50P50N20-UpperBounds-13
FORMULA_NAME BridgeAndVehicles-PT-V50P50N20-UpperBounds-14
FORMULA_NAME BridgeAndVehicles-PT-V50P50N20-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1678780352199

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=smartxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BridgeAndVehicles-PT-V50P50N20
Applying reductions before tool smart
Invoking reducer
Running Version 202303021504
[2023-03-14 07:52:33] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-14 07:52:33] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-14 07:52:33] [INFO ] Load time of PNML (sax parser for PT used): 140 ms
[2023-03-14 07:52:33] [INFO ] Transformed 138 places.
[2023-03-14 07:52:33] [INFO ] Transformed 2348 transitions.
[2023-03-14 07:52:33] [INFO ] Parsed PT model containing 138 places and 2348 transitions and 18090 arcs in 215 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 10 ms.
FORMULA BridgeAndVehicles-PT-V50P50N20-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V50P50N20-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V50P50N20-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Normalized transition count is 290 out of 2348 initially.
// Phase 1: matrix 290 rows 138 cols
[2023-03-14 07:52:33] [INFO ] Computed 7 place invariants in 37 ms
FORMULA BridgeAndVehicles-PT-V50P50N20-UpperBounds-13 50 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 23 resets, run finished after 156 ms. (steps per millisecond=64 ) properties (out of 12) seen :261
FORMULA BridgeAndVehicles-PT-V50P50N20-UpperBounds-15 50 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-PT-V50P50N20-UpperBounds-14 50 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-PT-V50P50N20-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-PT-V50P50N20-UpperBounds-11 50 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-PT-V50P50N20-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-PT-V50P50N20-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-PT-V50P50N20-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-PT-V50P50N20-UpperBounds-05 50 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-PT-V50P50N20-UpperBounds-00 50 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 8 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 3) seen :8
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 3) seen :11
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 3) seen :22
[2023-03-14 07:52:34] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
// Phase 1: matrix 290 rows 138 cols
[2023-03-14 07:52:34] [INFO ] Computed 7 place invariants in 13 ms
[2023-03-14 07:52:34] [INFO ] [Real]Absence check using 7 positive place invariants in 5 ms returned unsat
[2023-03-14 07:52:34] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned unsat
[2023-03-14 07:52:34] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned sat
[2023-03-14 07:52:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 07:52:34] [INFO ] [Real]Absence check using state equation in 68 ms returned sat
[2023-03-14 07:52:34] [INFO ] Solution in real domain found non-integer solution.
[2023-03-14 07:52:34] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2023-03-14 07:52:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-14 07:52:34] [INFO ] [Nat]Absence check using state equation in 55 ms returned sat
[2023-03-14 07:52:34] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-14 07:52:34] [INFO ] [Nat]Added 42 Read/Feed constraints in 93 ms returned sat
[2023-03-14 07:52:35] [INFO ] Computed and/alt/rep : 120/238/120 causal constraints (skipped 167 transitions) in 111 ms.
[2023-03-14 07:52:35] [INFO ] Added : 20 causal constraints over 4 iterations in 251 ms. Result :sat
Minimization took 97 ms.
Current structural bounds on expressions (after SMT) : [1, 1, 50] Max seen :[1, 1, 20]
FORMULA BridgeAndVehicles-PT-V50P50N20-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA BridgeAndVehicles-PT-V50P50N20-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 1 out of 138 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 138/138 places, 2348/2348 transitions.
Graph (complete) has 1302 edges and 138 vertex of which 136 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.11 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 8 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 135 transition count 2347
Applied a total of 3 rules in 405 ms. Remains 135 /138 variables (removed 3) and now considering 2347/2348 (removed 1) transitions.
[2023-03-14 07:52:36] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
// Phase 1: matrix 289 rows 135 cols
[2023-03-14 07:52:36] [INFO ] Computed 5 place invariants in 10 ms
[2023-03-14 07:52:37] [INFO ] Dead Transitions using invariants and state equation in 1012 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1419 ms. Remains : 135/138 places, 2347/2348 transitions.
Normalized transition count is 289 out of 2347 initially.
// Phase 1: matrix 289 rows 135 cols
[2023-03-14 07:52:37] [INFO ] Computed 5 place invariants in 3 ms
Incomplete random walk after 1000000 steps, including 2682 resets, run finished after 8796 ms. (steps per millisecond=113 ) properties (out of 1) seen :9
Incomplete Best-First random walk after 1000001 steps, including 1065 resets, run finished after 3176 ms. (steps per millisecond=314 ) properties (out of 1) seen :20
[2023-03-14 07:52:49] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
// Phase 1: matrix 289 rows 135 cols
[2023-03-14 07:52:49] [INFO ] Computed 5 place invariants in 7 ms
[2023-03-14 07:52:49] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2023-03-14 07:52:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 07:52:49] [INFO ] [Real]Absence check using state equation in 87 ms returned sat
[2023-03-14 07:52:49] [INFO ] Solution in real domain found non-integer solution.
[2023-03-14 07:52:49] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2023-03-14 07:52:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-14 07:52:49] [INFO ] [Nat]Absence check using state equation in 59 ms returned sat
[2023-03-14 07:52:49] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-14 07:52:49] [INFO ] [Nat]Added 42 Read/Feed constraints in 32 ms returned sat
[2023-03-14 07:52:50] [INFO ] Deduced a trap composed of 5 places in 355 ms of which 7 ms to minimize.
[2023-03-14 07:52:50] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 401 ms
[2023-03-14 07:52:50] [INFO ] Computed and/alt/rep : 120/238/120 causal constraints (skipped 166 transitions) in 71 ms.
[2023-03-14 07:52:50] [INFO ] Added : 21 causal constraints over 5 iterations in 381 ms. Result :sat
Minimization took 188 ms.
Current structural bounds on expressions (after SMT) : [50] Max seen :[20]
Support contains 1 out of 135 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 135/135 places, 2347/2347 transitions.
Applied a total of 0 rules in 207 ms. Remains 135 /135 variables (removed 0) and now considering 2347/2347 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 207 ms. Remains : 135/135 places, 2347/2347 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 135/135 places, 2347/2347 transitions.
Applied a total of 0 rules in 489 ms. Remains 135 /135 variables (removed 0) and now considering 2347/2347 (removed 0) transitions.
[2023-03-14 07:52:51] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
[2023-03-14 07:52:51] [INFO ] Invariant cache hit.
[2023-03-14 07:52:52] [INFO ] Implicit Places using invariants in 453 ms returned []
[2023-03-14 07:52:52] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
[2023-03-14 07:52:52] [INFO ] Invariant cache hit.
[2023-03-14 07:52:52] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-14 07:52:53] [INFO ] Implicit Places using invariants and state equation in 1003 ms returned [52, 108]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1463 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 133/135 places, 2347/2347 transitions.
Applied a total of 0 rules in 171 ms. Remains 133 /133 variables (removed 0) and now considering 2347/2347 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 2124 ms. Remains : 133/135 places, 2347/2347 transitions.
Normalized transition count is 289 out of 2347 initially.
// Phase 1: matrix 289 rows 133 cols
[2023-03-14 07:52:53] [INFO ] Computed 5 place invariants in 6 ms
Incomplete random walk after 1000000 steps, including 2682 resets, run finished after 6511 ms. (steps per millisecond=153 ) properties (out of 1) seen :8
Incomplete Best-First random walk after 1000000 steps, including 1063 resets, run finished after 2586 ms. (steps per millisecond=386 ) properties (out of 1) seen :20
[2023-03-14 07:53:02] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
// Phase 1: matrix 289 rows 133 cols
[2023-03-14 07:53:02] [INFO ] Computed 5 place invariants in 4 ms
[2023-03-14 07:53:02] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2023-03-14 07:53:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 07:53:02] [INFO ] [Real]Absence check using state equation in 188 ms returned sat
[2023-03-14 07:53:02] [INFO ] Solution in real domain found non-integer solution.
[2023-03-14 07:53:03] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2023-03-14 07:53:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-14 07:53:03] [INFO ] [Nat]Absence check using state equation in 188 ms returned sat
[2023-03-14 07:53:03] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-14 07:53:03] [INFO ] [Nat]Added 42 Read/Feed constraints in 46 ms returned sat
[2023-03-14 07:53:03] [INFO ] Computed and/alt/rep : 120/238/120 causal constraints (skipped 166 transitions) in 98 ms.
[2023-03-14 07:53:03] [INFO ] Added : 20 causal constraints over 4 iterations in 285 ms. Result :sat
Minimization took 99 ms.
Current structural bounds on expressions (after SMT) : [50] Max seen :[20]
Support contains 1 out of 133 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 133/133 places, 2347/2347 transitions.
Applied a total of 0 rules in 258 ms. Remains 133 /133 variables (removed 0) and now considering 2347/2347 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 260 ms. Remains : 133/133 places, 2347/2347 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 133/133 places, 2347/2347 transitions.
Applied a total of 0 rules in 243 ms. Remains 133 /133 variables (removed 0) and now considering 2347/2347 (removed 0) transitions.
[2023-03-14 07:53:04] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
[2023-03-14 07:53:04] [INFO ] Invariant cache hit.
[2023-03-14 07:53:05] [INFO ] Implicit Places using invariants in 406 ms returned []
[2023-03-14 07:53:05] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
[2023-03-14 07:53:05] [INFO ] Invariant cache hit.
[2023-03-14 07:53:05] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-14 07:53:06] [INFO ] Implicit Places using invariants and state equation in 810 ms returned []
Implicit Place search using SMT with State Equation took 1218 ms to find 0 implicit places.
[2023-03-14 07:53:06] [INFO ] Redundant transitions in 178 ms returned []
[2023-03-14 07:53:06] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
[2023-03-14 07:53:06] [INFO ] Invariant cache hit.
[2023-03-14 07:53:07] [INFO ] Dead Transitions using invariants and state equation in 886 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2539 ms. Remains : 133/133 places, 2347/2347 transitions.
Starting property specific reduction for BridgeAndVehicles-PT-V50P50N20-UpperBounds-07
Normalized transition count is 289 out of 2347 initially.
// Phase 1: matrix 289 rows 133 cols
[2023-03-14 07:53:07] [INFO ] Computed 5 place invariants in 4 ms
Incomplete random walk after 10000 steps, including 26 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 1) seen :5
Incomplete Best-First random walk after 10000 steps, including 10 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 1) seen :20
[2023-03-14 07:53:07] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
// Phase 1: matrix 289 rows 133 cols
[2023-03-14 07:53:07] [INFO ] Computed 5 place invariants in 4 ms
[2023-03-14 07:53:07] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2023-03-14 07:53:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 07:53:07] [INFO ] [Real]Absence check using state equation in 172 ms returned sat
[2023-03-14 07:53:07] [INFO ] Solution in real domain found non-integer solution.
[2023-03-14 07:53:07] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-14 07:53:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-14 07:53:07] [INFO ] [Nat]Absence check using state equation in 129 ms returned sat
[2023-03-14 07:53:07] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-14 07:53:07] [INFO ] [Nat]Added 42 Read/Feed constraints in 28 ms returned sat
[2023-03-14 07:53:07] [INFO ] Computed and/alt/rep : 120/238/120 causal constraints (skipped 166 transitions) in 88 ms.
[2023-03-14 07:53:08] [INFO ] Added : 20 causal constraints over 4 iterations in 266 ms. Result :sat
Minimization took 103 ms.
Current structural bounds on expressions (after SMT) : [50] Max seen :[20]
Support contains 1 out of 133 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 133/133 places, 2347/2347 transitions.
Applied a total of 0 rules in 255 ms. Remains 133 /133 variables (removed 0) and now considering 2347/2347 (removed 0) transitions.
[2023-03-14 07:53:08] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
[2023-03-14 07:53:08] [INFO ] Invariant cache hit.
[2023-03-14 07:53:09] [INFO ] Dead Transitions using invariants and state equation in 844 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1101 ms. Remains : 133/133 places, 2347/2347 transitions.
Normalized transition count is 289 out of 2347 initially.
// Phase 1: matrix 289 rows 133 cols
[2023-03-14 07:53:09] [INFO ] Computed 5 place invariants in 7 ms
Incomplete random walk after 1000000 steps, including 2682 resets, run finished after 7068 ms. (steps per millisecond=141 ) properties (out of 1) seen :10
Incomplete Best-First random walk after 1000000 steps, including 1064 resets, run finished after 3260 ms. (steps per millisecond=306 ) properties (out of 1) seen :20
[2023-03-14 07:53:20] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
// Phase 1: matrix 289 rows 133 cols
[2023-03-14 07:53:20] [INFO ] Computed 5 place invariants in 2 ms
[2023-03-14 07:53:20] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2023-03-14 07:53:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 07:53:20] [INFO ] [Real]Absence check using state equation in 180 ms returned sat
[2023-03-14 07:53:20] [INFO ] Solution in real domain found non-integer solution.
[2023-03-14 07:53:20] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2023-03-14 07:53:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-14 07:53:20] [INFO ] [Nat]Absence check using state equation in 184 ms returned sat
[2023-03-14 07:53:20] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-14 07:53:20] [INFO ] [Nat]Added 42 Read/Feed constraints in 27 ms returned sat
[2023-03-14 07:53:20] [INFO ] Computed and/alt/rep : 120/238/120 causal constraints (skipped 166 transitions) in 69 ms.
[2023-03-14 07:53:21] [INFO ] Added : 20 causal constraints over 4 iterations in 245 ms. Result :sat
Minimization took 98 ms.
Current structural bounds on expressions (after SMT) : [50] Max seen :[20]
Support contains 1 out of 133 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 133/133 places, 2347/2347 transitions.
Applied a total of 0 rules in 198 ms. Remains 133 /133 variables (removed 0) and now considering 2347/2347 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 200 ms. Remains : 133/133 places, 2347/2347 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 133/133 places, 2347/2347 transitions.
Applied a total of 0 rules in 231 ms. Remains 133 /133 variables (removed 0) and now considering 2347/2347 (removed 0) transitions.
[2023-03-14 07:53:22] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
[2023-03-14 07:53:22] [INFO ] Invariant cache hit.
[2023-03-14 07:53:22] [INFO ] Implicit Places using invariants in 319 ms returned []
[2023-03-14 07:53:22] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
[2023-03-14 07:53:22] [INFO ] Invariant cache hit.
[2023-03-14 07:53:22] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-14 07:53:23] [INFO ] Implicit Places using invariants and state equation in 603 ms returned []
Implicit Place search using SMT with State Equation took 924 ms to find 0 implicit places.
[2023-03-14 07:53:23] [INFO ] Redundant transitions in 163 ms returned []
[2023-03-14 07:53:23] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
[2023-03-14 07:53:23] [INFO ] Invariant cache hit.
[2023-03-14 07:53:23] [INFO ] Dead Transitions using invariants and state equation in 725 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2054 ms. Remains : 133/133 places, 2347/2347 transitions.
Ending property specific reduction for BridgeAndVehicles-PT-V50P50N20-UpperBounds-07 in 16804 ms.
[2023-03-14 07:53:24] [INFO ] Flatten gal took : 335 ms
[2023-03-14 07:53:24] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/UpperBounds.sr.xml took 4 ms.
[2023-03-14 07:53:24] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 133 places, 2347 transitions and 17884 arcs took 36 ms.
Total runtime 51001 ms.
There are residual formulas that ITS could not solve within timeout
======================================================
========== this is Smart for the MCC'2018 ============
======================================================
Running BridgeAndVehicles (PT), instance V50P50N20
Examination UpperBounds
Parser /home/mcc/BenchKit/bin//../reducer/bin//../../smart/bin//parser/UpperBoundParse.jar
Model checker /home/mcc/BenchKit/bin//../reducer/bin//../../smart/bin//upper_bound//smart

PNML FILE: model.pnml
Petri model created: 133 places, 2347 transitions, 17884 arcs.
Final Score: 9954.787
Took : 37 seconds
Bounds file is: UpperBounds.xml
FORMULA BridgeAndVehicles-PT-V50P50N20-UpperBounds-07 20 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS

BK_STOP 1678780618326

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

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-V50P50N20"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="smartxred"
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 smartxred"
echo " Input is BridgeAndVehicles-PT-V50P50N20, 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 r043-tajo-167813696600261"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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