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

About the Execution of Smart+red for BridgeAndVehicles-PT-V20P20N10

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
518.495 86490.00 102504.00 112.80 20 20 1 20 20 20 20 20 20 1 20 1 20 20 ? 20 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.r043-tajo-167813696500205.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-V20P20N10, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r043-tajo-167813696500205
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.2M
-rw-r--r-- 1 mcc users 11K Feb 25 12:08 CTLCardinality.txt
-rw-r--r-- 1 mcc users 89K Feb 25 12:08 CTLCardinality.xml
-rw-r--r-- 1 mcc users 40K Feb 25 12:07 CTLFireability.txt
-rw-r--r-- 1 mcc users 169K Feb 25 12:07 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 4.8K Feb 25 15:35 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 15:35 LTLCardinality.xml
-rw-r--r-- 1 mcc users 51K Feb 25 15:35 LTLFireability.txt
-rw-r--r-- 1 mcc users 165K Feb 25 15:35 LTLFireability.xml
-rw-r--r-- 1 mcc users 20K Feb 25 12:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 142K Feb 25 12:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 194K Feb 25 12:15 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 798K Feb 25 12:15 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 15:35 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.7K 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 434K 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-V20P20N10-UpperBounds-00
FORMULA_NAME BridgeAndVehicles-PT-V20P20N10-UpperBounds-01
FORMULA_NAME BridgeAndVehicles-PT-V20P20N10-UpperBounds-02
FORMULA_NAME BridgeAndVehicles-PT-V20P20N10-UpperBounds-03
FORMULA_NAME BridgeAndVehicles-PT-V20P20N10-UpperBounds-04
FORMULA_NAME BridgeAndVehicles-PT-V20P20N10-UpperBounds-05
FORMULA_NAME BridgeAndVehicles-PT-V20P20N10-UpperBounds-06
FORMULA_NAME BridgeAndVehicles-PT-V20P20N10-UpperBounds-07
FORMULA_NAME BridgeAndVehicles-PT-V20P20N10-UpperBounds-08
FORMULA_NAME BridgeAndVehicles-PT-V20P20N10-UpperBounds-09
FORMULA_NAME BridgeAndVehicles-PT-V20P20N10-UpperBounds-10
FORMULA_NAME BridgeAndVehicles-PT-V20P20N10-UpperBounds-11
FORMULA_NAME BridgeAndVehicles-PT-V20P20N10-UpperBounds-12
FORMULA_NAME BridgeAndVehicles-PT-V20P20N10-UpperBounds-13
FORMULA_NAME BridgeAndVehicles-PT-V20P20N10-UpperBounds-14
FORMULA_NAME BridgeAndVehicles-PT-V20P20N10-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1678779212570

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-V20P20N10
Applying reductions before tool smart
Invoking reducer
Running Version 202303021504
[2023-03-14 07:33:34] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-14 07:33:34] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-14 07:33:34] [INFO ] Load time of PNML (sax parser for PT used): 74 ms
[2023-03-14 07:33:34] [INFO ] Transformed 68 places.
[2023-03-14 07:33:34] [INFO ] Transformed 548 transitions.
[2023-03-14 07:33:34] [INFO ] Parsed PT model containing 68 places and 548 transitions and 4070 arcs in 142 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 5 ms.
FORMULA BridgeAndVehicles-PT-V20P20N10-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Normalized transition count is 130 out of 548 initially.
// Phase 1: matrix 130 rows 68 cols
[2023-03-14 07:33:34] [INFO ] Computed 7 place invariants in 24 ms
FORMULA BridgeAndVehicles-PT-V20P20N10-UpperBounds-12 20 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V20P20N10-UpperBounds-10 20 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V20P20N10-UpperBounds-04 20 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V20P20N10-UpperBounds-03 20 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V20P20N10-UpperBounds-01 20 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V20P20N10-UpperBounds-00 20 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 56 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 9) seen :128
FORMULA BridgeAndVehicles-PT-V20P20N10-UpperBounds-15 20 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-PT-V20P20N10-UpperBounds-13 20 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-PT-V20P20N10-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-PT-V20P20N10-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-PT-V20P20N10-UpperBounds-08 20 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-PT-V20P20N10-UpperBounds-07 20 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-PT-V20P20N10-UpperBounds-06 20 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-PT-V20P20N10-UpperBounds-05 20 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10003 steps, including 20 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 1) seen :10
[2023-03-14 07:33:34] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
// Phase 1: matrix 130 rows 68 cols
[2023-03-14 07:33:34] [INFO ] Computed 7 place invariants in 3 ms
[2023-03-14 07:33:34] [INFO ] [Real]Absence check using 7 positive place invariants in 6 ms returned sat
[2023-03-14 07:33:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 07:33:34] [INFO ] [Real]Absence check using state equation in 52 ms returned sat
[2023-03-14 07:33:34] [INFO ] Solution in real domain found non-integer solution.
[2023-03-14 07:33:34] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2023-03-14 07:33:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-14 07:33:34] [INFO ] [Nat]Absence check using state equation in 37 ms returned sat
[2023-03-14 07:33:34] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-14 07:33:34] [INFO ] [Nat]Added 22 Read/Feed constraints in 31 ms returned sat
[2023-03-14 07:33:35] [INFO ] Computed and/alt/rep : 50/98/50 causal constraints (skipped 77 transitions) in 39 ms.
[2023-03-14 07:33:35] [INFO ] Added : 10 causal constraints over 2 iterations in 77 ms. Result :sat
Minimization took 51 ms.
Current structural bounds on expressions (after SMT) : [20] Max seen :[10]
Support contains 1 out of 68 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 68/68 places, 548/548 transitions.
Graph (complete) has 562 edges and 68 vertex of which 66 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.16 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 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 65 transition count 547
Applied a total of 3 rules in 101 ms. Remains 65 /68 variables (removed 3) and now considering 547/548 (removed 1) transitions.
[2023-03-14 07:33:35] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
// Phase 1: matrix 129 rows 65 cols
[2023-03-14 07:33:35] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-14 07:33:35] [INFO ] Dead Transitions using invariants and state equation in 234 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 341 ms. Remains : 65/68 places, 547/548 transitions.
Normalized transition count is 129 out of 547 initially.
// Phase 1: matrix 129 rows 65 cols
[2023-03-14 07:33:35] [INFO ] Computed 5 place invariants in 13 ms
Incomplete random walk after 1000000 steps, including 6490 resets, run finished after 2448 ms. (steps per millisecond=408 ) properties (out of 1) seen :10
Incomplete Best-First random walk after 1000000 steps, including 2551 resets, run finished after 1348 ms. (steps per millisecond=741 ) properties (out of 1) seen :10
[2023-03-14 07:33:39] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
// Phase 1: matrix 129 rows 65 cols
[2023-03-14 07:33:39] [INFO ] Computed 5 place invariants in 4 ms
[2023-03-14 07:33:39] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2023-03-14 07:33:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 07:33:39] [INFO ] [Real]Absence check using state equation in 65 ms returned sat
[2023-03-14 07:33:39] [INFO ] Solution in real domain found non-integer solution.
[2023-03-14 07:33:39] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-14 07:33:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-14 07:33:39] [INFO ] [Nat]Absence check using state equation in 47 ms returned sat
[2023-03-14 07:33:39] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-14 07:33:39] [INFO ] [Nat]Added 22 Read/Feed constraints in 10 ms returned sat
[2023-03-14 07:33:39] [INFO ] Computed and/alt/rep : 50/98/50 causal constraints (skipped 76 transitions) in 53 ms.
[2023-03-14 07:33:39] [INFO ] Deduced a trap composed of 15 places in 126 ms of which 7 ms to minimize.
[2023-03-14 07:33:39] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 155 ms
[2023-03-14 07:33:39] [INFO ] Added : 11 causal constraints over 3 iterations in 319 ms. Result :sat
Minimization took 43 ms.
Current structural bounds on expressions (after SMT) : [20] Max seen :[10]
Support contains 1 out of 65 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 65/65 places, 547/547 transitions.
Applied a total of 0 rules in 33 ms. Remains 65 /65 variables (removed 0) and now considering 547/547 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 33 ms. Remains : 65/65 places, 547/547 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 65/65 places, 547/547 transitions.
Applied a total of 0 rules in 33 ms. Remains 65 /65 variables (removed 0) and now considering 547/547 (removed 0) transitions.
[2023-03-14 07:33:40] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
[2023-03-14 07:33:40] [INFO ] Invariant cache hit.
[2023-03-14 07:33:40] [INFO ] Implicit Places using invariants in 426 ms returned []
[2023-03-14 07:33:40] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
[2023-03-14 07:33:40] [INFO ] Invariant cache hit.
[2023-03-14 07:33:40] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-14 07:33:40] [INFO ] Implicit Places using invariants and state equation in 328 ms returned [22, 48]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 760 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 63/65 places, 547/547 transitions.
Applied a total of 0 rules in 20 ms. Remains 63 /63 variables (removed 0) and now considering 547/547 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 813 ms. Remains : 63/65 places, 547/547 transitions.
Normalized transition count is 129 out of 547 initially.
// Phase 1: matrix 129 rows 63 cols
[2023-03-14 07:33:40] [INFO ] Computed 5 place invariants in 2 ms
Incomplete random walk after 1000001 steps, including 6490 resets, run finished after 2313 ms. (steps per millisecond=432 ) properties (out of 1) seen :8
Incomplete Best-First random walk after 1000001 steps, including 2550 resets, run finished after 1030 ms. (steps per millisecond=970 ) properties (out of 1) seen :10
[2023-03-14 07:33:44] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
// Phase 1: matrix 129 rows 63 cols
[2023-03-14 07:33:44] [INFO ] Computed 5 place invariants in 2 ms
[2023-03-14 07:33:44] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-14 07:33:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 07:33:44] [INFO ] [Real]Absence check using state equation in 43 ms returned sat
[2023-03-14 07:33:44] [INFO ] Solution in real domain found non-integer solution.
[2023-03-14 07:33:44] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-14 07:33:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-14 07:33:44] [INFO ] [Nat]Absence check using state equation in 31 ms returned sat
[2023-03-14 07:33:44] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-14 07:33:44] [INFO ] [Nat]Added 22 Read/Feed constraints in 5 ms returned sat
[2023-03-14 07:33:44] [INFO ] Deduced a trap composed of 5 places in 140 ms of which 1 ms to minimize.
[2023-03-14 07:33:44] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 159 ms
[2023-03-14 07:33:44] [INFO ] Computed and/alt/rep : 50/98/50 causal constraints (skipped 76 transitions) in 40 ms.
[2023-03-14 07:33:44] [INFO ] Deduced a trap composed of 15 places in 90 ms of which 1 ms to minimize.
[2023-03-14 07:33:44] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 103 ms
[2023-03-14 07:33:44] [INFO ] Added : 11 causal constraints over 3 iterations in 198 ms. Result :sat
Minimization took 26 ms.
Current structural bounds on expressions (after SMT) : [20] Max seen :[10]
Support contains 1 out of 63 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 63/63 places, 547/547 transitions.
Applied a total of 0 rules in 22 ms. Remains 63 /63 variables (removed 0) and now considering 547/547 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22 ms. Remains : 63/63 places, 547/547 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 63/63 places, 547/547 transitions.
Applied a total of 0 rules in 21 ms. Remains 63 /63 variables (removed 0) and now considering 547/547 (removed 0) transitions.
[2023-03-14 07:33:44] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
[2023-03-14 07:33:44] [INFO ] Invariant cache hit.
[2023-03-14 07:33:45] [INFO ] Implicit Places using invariants in 198 ms returned []
[2023-03-14 07:33:45] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
[2023-03-14 07:33:45] [INFO ] Invariant cache hit.
[2023-03-14 07:33:45] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-14 07:33:45] [INFO ] Implicit Places using invariants and state equation in 239 ms returned []
Implicit Place search using SMT with State Equation took 441 ms to find 0 implicit places.
[2023-03-14 07:33:45] [INFO ] Redundant transitions in 28 ms returned []
[2023-03-14 07:33:45] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
[2023-03-14 07:33:45] [INFO ] Invariant cache hit.
[2023-03-14 07:33:45] [INFO ] Dead Transitions using invariants and state equation in 213 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 711 ms. Remains : 63/63 places, 547/547 transitions.
Starting property specific reduction for BridgeAndVehicles-PT-V20P20N10-UpperBounds-14
Normalized transition count is 129 out of 547 initially.
// Phase 1: matrix 129 rows 63 cols
[2023-03-14 07:33:45] [INFO ] Computed 5 place invariants in 1 ms
Incomplete random walk after 10000 steps, including 65 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 1) seen :6
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :10
[2023-03-14 07:33:45] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
// Phase 1: matrix 129 rows 63 cols
[2023-03-14 07:33:45] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-14 07:33:45] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2023-03-14 07:33:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 07:33:45] [INFO ] [Real]Absence check using state equation in 43 ms returned sat
[2023-03-14 07:33:45] [INFO ] Solution in real domain found non-integer solution.
[2023-03-14 07:33:45] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-14 07:33:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-14 07:33:45] [INFO ] [Nat]Absence check using state equation in 26 ms returned sat
[2023-03-14 07:33:45] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-14 07:33:45] [INFO ] [Nat]Added 22 Read/Feed constraints in 4 ms returned sat
[2023-03-14 07:33:45] [INFO ] Deduced a trap composed of 5 places in 77 ms of which 1 ms to minimize.
[2023-03-14 07:33:45] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 85 ms
[2023-03-14 07:33:46] [INFO ] Computed and/alt/rep : 50/98/50 causal constraints (skipped 76 transitions) in 16 ms.
[2023-03-14 07:33:46] [INFO ] Deduced a trap composed of 15 places in 74 ms of which 0 ms to minimize.
[2023-03-14 07:33:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 85 ms
[2023-03-14 07:33:46] [INFO ] Added : 11 causal constraints over 3 iterations in 141 ms. Result :sat
Minimization took 42 ms.
Current structural bounds on expressions (after SMT) : [20] Max seen :[10]
Support contains 1 out of 63 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 63/63 places, 547/547 transitions.
Applied a total of 0 rules in 29 ms. Remains 63 /63 variables (removed 0) and now considering 547/547 (removed 0) transitions.
[2023-03-14 07:33:46] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
[2023-03-14 07:33:46] [INFO ] Invariant cache hit.
[2023-03-14 07:33:46] [INFO ] Dead Transitions using invariants and state equation in 243 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 273 ms. Remains : 63/63 places, 547/547 transitions.
Normalized transition count is 129 out of 547 initially.
// Phase 1: matrix 129 rows 63 cols
[2023-03-14 07:33:46] [INFO ] Computed 5 place invariants in 4 ms
Incomplete random walk after 1000000 steps, including 6488 resets, run finished after 2163 ms. (steps per millisecond=462 ) properties (out of 1) seen :8
Incomplete Best-First random walk after 1000000 steps, including 2545 resets, run finished after 914 ms. (steps per millisecond=1094 ) properties (out of 1) seen :10
[2023-03-14 07:33:49] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
// Phase 1: matrix 129 rows 63 cols
[2023-03-14 07:33:49] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-14 07:33:49] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-14 07:33:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 07:33:49] [INFO ] [Real]Absence check using state equation in 34 ms returned sat
[2023-03-14 07:33:49] [INFO ] Solution in real domain found non-integer solution.
[2023-03-14 07:33:49] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-14 07:33:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-14 07:33:49] [INFO ] [Nat]Absence check using state equation in 30 ms returned sat
[2023-03-14 07:33:49] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-14 07:33:49] [INFO ] [Nat]Added 22 Read/Feed constraints in 5 ms returned sat
[2023-03-14 07:33:49] [INFO ] Deduced a trap composed of 5 places in 114 ms of which 1 ms to minimize.
[2023-03-14 07:33:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 125 ms
[2023-03-14 07:33:49] [INFO ] Computed and/alt/rep : 50/98/50 causal constraints (skipped 76 transitions) in 24 ms.
[2023-03-14 07:33:50] [INFO ] Deduced a trap composed of 15 places in 88 ms of which 1 ms to minimize.
[2023-03-14 07:33:50] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 114 ms
[2023-03-14 07:33:50] [INFO ] Added : 11 causal constraints over 3 iterations in 185 ms. Result :sat
Minimization took 31 ms.
Current structural bounds on expressions (after SMT) : [20] Max seen :[10]
Support contains 1 out of 63 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 63/63 places, 547/547 transitions.
Applied a total of 0 rules in 20 ms. Remains 63 /63 variables (removed 0) and now considering 547/547 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20 ms. Remains : 63/63 places, 547/547 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 63/63 places, 547/547 transitions.
Applied a total of 0 rules in 16 ms. Remains 63 /63 variables (removed 0) and now considering 547/547 (removed 0) transitions.
[2023-03-14 07:33:50] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
[2023-03-14 07:33:50] [INFO ] Invariant cache hit.
[2023-03-14 07:33:50] [INFO ] Implicit Places using invariants in 121 ms returned []
[2023-03-14 07:33:50] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
[2023-03-14 07:33:50] [INFO ] Invariant cache hit.
[2023-03-14 07:33:50] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-14 07:33:50] [INFO ] Implicit Places using invariants and state equation in 246 ms returned []
Implicit Place search using SMT with State Equation took 384 ms to find 0 implicit places.
[2023-03-14 07:33:50] [INFO ] Redundant transitions in 3 ms returned []
[2023-03-14 07:33:50] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
[2023-03-14 07:33:50] [INFO ] Invariant cache hit.
[2023-03-14 07:33:50] [INFO ] Dead Transitions using invariants and state equation in 174 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 582 ms. Remains : 63/63 places, 547/547 transitions.
Ending property specific reduction for BridgeAndVehicles-PT-V20P20N10-UpperBounds-14 in 5111 ms.
[2023-03-14 07:33:51] [INFO ] Flatten gal took : 103 ms
[2023-03-14 07:33:51] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/UpperBounds.sr.xml took 2 ms.
[2023-03-14 07:33:51] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 63 places, 547 transitions and 3984 arcs took 4 ms.
Total runtime 16738 ms.
There are residual formulas that ITS could not solve within timeout
======================================================
========== this is Smart for the MCC'2018 ============
======================================================
Running BridgeAndVehicles (PT), instance V20P20N10
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: 63 places, 547 transitions, 3984 arcs.
Final Score: 1913.884
Took : 51 seconds
Bounds file is: UpperBounds.xml

BK_STOP 1678779299060

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
++ perl -pe 's/.*\.//g'
+ 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
free(): double free detected in tcache 2
/home/mcc/BenchKit/bin//../reducer/bin//../../smart/bin//smart.sh: line 116: 613 Aborted ${SMART}/smart ${INPUT_SM}

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

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