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

About the Execution of ITS-Tools for BridgeAndVehicles-PT-V04P05N02

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
408.104 7767.00 13214.00 110.70 4 4 4 2 4 1 1 5 1 1 4 4 4 1 4 1 normal

Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2023-input.r037-tajo-167813690000165.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 itstools
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 r037-tajo-167813690000165
=====================================================================

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

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=itstools
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BridgeAndVehicles-PT-V04P05N02
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202303021504
[2023-03-09 02:27:07] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-09 02:27:07] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-09 02:27:07] [INFO ] Load time of PNML (sax parser for PT used): 37 ms
[2023-03-09 02:27:07] [INFO ] Transformed 28 places.
[2023-03-09 02:27:07] [INFO ] Transformed 52 transitions.
[2023-03-09 02:27:07] [INFO ] Parsed PT model containing 28 places and 52 transitions and 326 arcs in 120 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 6 ms.
Normalized transition count is 34 out of 52 initially.
// Phase 1: matrix 34 rows 28 cols
[2023-03-09 02:27:08] [INFO ] Computed 7 place invariants in 4 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 42 ms. (steps per millisecond=238 ) 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 10001 steps, including 98 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 3) seen :4
Incomplete Best-First random walk after 10001 steps, including 111 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 3) seen :3
Incomplete Best-First random walk after 10001 steps, including 125 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 3) seen :3
[2023-03-09 02:27:08] [INFO ] Flow matrix only has 34 transitions (discarded 18 similar events)
// Phase 1: matrix 34 rows 28 cols
[2023-03-09 02:27:08] [INFO ] Computed 7 place invariants in 5 ms
[2023-03-09 02:27:08] [INFO ] [Real]Absence check using 7 positive place invariants in 7 ms returned sat
[2023-03-09 02:27:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 02:27:08] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2023-03-09 02:27:08] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 02:27:08] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2023-03-09 02:27:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 02:27:08] [INFO ] [Nat]Absence check using state equation in 15 ms returned sat
[2023-03-09 02:27:08] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-03-09 02:27:08] [INFO ] [Nat]Added 6 Read/Feed constraints in 3 ms returned sat
[2023-03-09 02:27:08] [INFO ] Computed and/alt/rep : 25/123/25 causal constraints (skipped 6 transitions) in 5 ms.
[2023-03-09 02:27:08] [INFO ] Deduced a trap composed of 5 places in 32 ms of which 2 ms to minimize.
[2023-03-09 02:27:08] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 40 ms
[2023-03-09 02:27:08] [INFO ] Added : 16 causal constraints over 4 iterations in 74 ms. Result :sat
Minimization took 14 ms.
[2023-03-09 02:27:08] [INFO ] [Real]Absence check using 7 positive place invariants in 1 ms returned unsat
[2023-03-09 02:27:08] [INFO ] [Real]Absence check using 7 positive place invariants in 1 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.1 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 13 ms. Remains 25 /28 variables (removed 3) and now considering 51/52 (removed 1) transitions.
[2023-03-09 02:27:08] [INFO ] Flow matrix only has 33 transitions (discarded 18 similar events)
// Phase 1: matrix 33 rows 25 cols
[2023-03-09 02:27:08] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-09 02:27:08] [INFO ] Dead Transitions using invariants and state equation in 58 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 72 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-09 02:27:08] [INFO ] Computed 5 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 25614 resets, run finished after 722 ms. (steps per millisecond=1385 ) properties (out of 1) seen :2
Incomplete Best-First random walk after 1000001 steps, including 11483 resets, run finished after 401 ms. (steps per millisecond=2493 ) properties (out of 1) seen :2
[2023-03-09 02:27:09] [INFO ] Flow matrix only has 33 transitions (discarded 18 similar events)
// Phase 1: matrix 33 rows 25 cols
[2023-03-09 02:27:09] [INFO ] Computed 5 place invariants in 3 ms
[2023-03-09 02:27:09] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-09 02:27:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 02:27:09] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2023-03-09 02:27:09] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 02:27:09] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-09 02:27:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 02:27:09] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2023-03-09 02:27:09] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-03-09 02:27:09] [INFO ] [Nat]Added 6 Read/Feed constraints in 1 ms returned sat
[2023-03-09 02:27:09] [INFO ] Deduced a trap composed of 5 places in 29 ms of which 0 ms to minimize.
[2023-03-09 02:27:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 35 ms
[2023-03-09 02:27:09] [INFO ] Computed and/alt/rep : 24/119/24 causal constraints (skipped 6 transitions) in 3 ms.
[2023-03-09 02:27:09] [INFO ] Added : 18 causal constraints over 4 iterations in 25 ms. Result :sat
Minimization took 18 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-09 02:27:09] [INFO ] Flow matrix only has 33 transitions (discarded 18 similar events)
[2023-03-09 02:27:09] [INFO ] Invariant cache hit.
[2023-03-09 02:27:09] [INFO ] Implicit Places using invariants in 37 ms returned []
[2023-03-09 02:27:09] [INFO ] Flow matrix only has 33 transitions (discarded 18 similar events)
[2023-03-09 02:27:09] [INFO ] Invariant cache hit.
[2023-03-09 02:27:09] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-03-09 02:27:10] [INFO ] Implicit Places using invariants and state equation in 56 ms returned [6, 16]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 96 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 100 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-09 02:27:10] [INFO ] Computed 5 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 25605 resets, run finished after 575 ms. (steps per millisecond=1739 ) properties (out of 1) seen :2
Incomplete Best-First random walk after 1000001 steps, including 11495 resets, run finished after 321 ms. (steps per millisecond=3115 ) properties (out of 1) seen :2
[2023-03-09 02:27:10] [INFO ] Flow matrix only has 33 transitions (discarded 18 similar events)
// Phase 1: matrix 33 rows 23 cols
[2023-03-09 02:27:10] [INFO ] Computed 5 place invariants in 2 ms
[2023-03-09 02:27:10] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-09 02:27:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 02:27:10] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2023-03-09 02:27:10] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 02:27:11] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2023-03-09 02:27:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 02:27:11] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2023-03-09 02:27:11] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-03-09 02:27:11] [INFO ] [Nat]Added 6 Read/Feed constraints in 3 ms returned sat
[2023-03-09 02:27:11] [INFO ] Computed and/alt/rep : 24/79/24 causal constraints (skipped 6 transitions) in 7 ms.
[2023-03-09 02:27:11] [INFO ] Deduced a trap composed of 5 places in 79 ms of which 1 ms to minimize.
[2023-03-09 02:27:11] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 108 ms
[2023-03-09 02:27:11] [INFO ] Added : 9 causal constraints over 2 iterations in 154 ms. Result :sat
Minimization took 10 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 2 ms. Remains 23 /23 variables (removed 0) and now considering 51/51 (removed 0) transitions.
[2023-03-09 02:27:11] [INFO ] Flow matrix only has 33 transitions (discarded 18 similar events)
[2023-03-09 02:27:11] [INFO ] Invariant cache hit.
[2023-03-09 02:27:11] [INFO ] Implicit Places using invariants in 44 ms returned []
[2023-03-09 02:27:11] [INFO ] Flow matrix only has 33 transitions (discarded 18 similar events)
[2023-03-09 02:27:11] [INFO ] Invariant cache hit.
[2023-03-09 02:27:11] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-03-09 02:27:11] [INFO ] Implicit Places using invariants and state equation in 57 ms returned []
Implicit Place search using SMT with State Equation took 104 ms to find 0 implicit places.
[2023-03-09 02:27:11] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-09 02:27:11] [INFO ] Flow matrix only has 33 transitions (discarded 18 similar events)
[2023-03-09 02:27:11] [INFO ] Invariant cache hit.
[2023-03-09 02:27:11] [INFO ] Dead Transitions using invariants and state equation in 49 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 162 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-09 02:27:11] [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 10001 steps, including 114 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :2
[2023-03-09 02:27:11] [INFO ] Flow matrix only has 33 transitions (discarded 18 similar events)
// Phase 1: matrix 33 rows 23 cols
[2023-03-09 02:27:11] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-09 02:27:11] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-09 02:27:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 02:27:11] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2023-03-09 02:27:11] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 02:27:11] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-09 02:27:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 02:27:11] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2023-03-09 02:27:11] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-03-09 02:27:11] [INFO ] [Nat]Added 6 Read/Feed constraints in 2 ms returned sat
[2023-03-09 02:27:11] [INFO ] Computed and/alt/rep : 24/79/24 causal constraints (skipped 6 transitions) in 5 ms.
[2023-03-09 02:27:11] [INFO ] Deduced a trap composed of 5 places in 25 ms of which 2 ms to minimize.
[2023-03-09 02:27:11] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 30 ms
[2023-03-09 02:27:11] [INFO ] Added : 9 causal constraints over 2 iterations in 48 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 3 ms. Remains 23 /23 variables (removed 0) and now considering 51/51 (removed 0) transitions.
[2023-03-09 02:27:11] [INFO ] Flow matrix only has 33 transitions (discarded 18 similar events)
[2023-03-09 02:27:11] [INFO ] Invariant cache hit.
[2023-03-09 02:27:11] [INFO ] Dead Transitions using invariants and state equation in 43 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 47 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-09 02:27:11] [INFO ] Computed 5 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 25602 resets, run finished after 731 ms. (steps per millisecond=1367 ) properties (out of 1) seen :2
Incomplete Best-First random walk after 1000000 steps, including 11495 resets, run finished after 383 ms. (steps per millisecond=2610 ) properties (out of 1) seen :2
[2023-03-09 02:27:12] [INFO ] Flow matrix only has 33 transitions (discarded 18 similar events)
// Phase 1: matrix 33 rows 23 cols
[2023-03-09 02:27:12] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-09 02:27:12] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-09 02:27:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 02:27:12] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2023-03-09 02:27:12] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 02:27:12] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-09 02:27:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 02:27:12] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2023-03-09 02:27:12] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-03-09 02:27:12] [INFO ] [Nat]Added 6 Read/Feed constraints in 2 ms returned sat
[2023-03-09 02:27:12] [INFO ] Computed and/alt/rep : 24/79/24 causal constraints (skipped 6 transitions) in 3 ms.
[2023-03-09 02:27:12] [INFO ] Deduced a trap composed of 5 places in 32 ms of which 2 ms to minimize.
[2023-03-09 02:27:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 41 ms
[2023-03-09 02:27:12] [INFO ] Added : 9 causal constraints over 2 iterations in 61 ms. Result :sat
Minimization took 11 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 4 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 4 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 4 ms. Remains 23 /23 variables (removed 0) and now considering 51/51 (removed 0) transitions.
[2023-03-09 02:27:12] [INFO ] Flow matrix only has 33 transitions (discarded 18 similar events)
[2023-03-09 02:27:12] [INFO ] Invariant cache hit.
[2023-03-09 02:27:12] [INFO ] Implicit Places using invariants in 55 ms returned []
[2023-03-09 02:27:12] [INFO ] Flow matrix only has 33 transitions (discarded 18 similar events)
[2023-03-09 02:27:12] [INFO ] Invariant cache hit.
[2023-03-09 02:27:12] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-03-09 02:27:13] [INFO ] Implicit Places using invariants and state equation in 53 ms returned []
Implicit Place search using SMT with State Equation took 109 ms to find 0 implicit places.
[2023-03-09 02:27:13] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-09 02:27:13] [INFO ] Flow matrix only has 33 transitions (discarded 18 similar events)
[2023-03-09 02:27:13] [INFO ] Invariant cache hit.
[2023-03-09 02:27:13] [INFO ] Dead Transitions using invariants and state equation in 45 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 165 ms. Remains : 23/23 places, 51/51 transitions.
Ending property specific reduction for BridgeAndVehicles-PT-V04P05N02-UpperBounds-03 in 1681 ms.
[2023-03-09 02:27:13] [INFO ] Flatten gal took : 32 ms
[2023-03-09 02:27:13] [INFO ] Applying decomposition
[2023-03-09 02:27:13] [INFO ] Flatten gal took : 9 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph2191418389415195915.txt' '-o' '/tmp/graph2191418389415195915.bin' '-w' '/tmp/graph2191418389415195915.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph2191418389415195915.bin' '-l' '-1' '-v' '-w' '/tmp/graph2191418389415195915.weights' '-q' '0' '-e' '0.001'
[2023-03-09 02:27:13] [INFO ] Decomposing Gal with order
[2023-03-09 02:27:13] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-09 02:27:13] [INFO ] Removed a total of 79 redundant transitions.
[2023-03-09 02:27:13] [INFO ] Flatten gal took : 37 ms
[2023-03-09 02:27:13] [INFO ] Fuse similar labels procedure discarded/fused a total of 22 labels/synchronizations in 4 ms.
[2023-03-09 02:27:13] [INFO ] Time to serialize gal into /tmp/UpperBounds12241090354442175199.gal : 3 ms
[2023-03-09 02:27:13] [INFO ] Time to serialize properties into /tmp/UpperBounds9680633807953778239.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds12241090354442175199.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds9680633807953778239.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...284
Loading property file /tmp/UpperBounds9680633807953778239.prop.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst\_mod\_flat,2246,0.041049,4564,139,80,2508,326,104,2454,46,1061,0
Total reachable state count : 2246

Verifying 1 reachability properties.
Min sum of variable value : 0
Maximum sum along a path : 2
Bounds property BridgeAndVehicles-PT-V04P05N02-UpperBounds-03 :0 <= u2.SUR_PONT_A <= 2
FORMULA BridgeAndVehicles-PT-V04P05N02-UpperBounds-03 2 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
BridgeAndVehicles-PT-V04P05N02-UpperBounds-03,0,0.042652,4564,1,0,2508,326,143,2454,59,1061,103
ITS tools runner thread asked to quit. Dying gracefully.
Total runtime 5656 ms.

BK_STOP 1678328833646

--------------------
content from stderr:

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ 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//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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="itstools"
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 itstools"
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 r037-tajo-167813690000165"
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 ;