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

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

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
16217.571 3600000.00 3604623.00 84549.40 50 1 1 1 1 50 1 ? 1 1 1 50 1 50 50 50 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-167813690100261.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-V50P50N20, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r037-tajo-167813690100261
=====================================================================

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

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-V50P50N20
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202303021504
[2023-03-09 04:47:54] [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 04:47:54] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-09 04:47:54] [INFO ] Load time of PNML (sax parser for PT used): 182 ms
[2023-03-09 04:47:54] [INFO ] Transformed 138 places.
[2023-03-09 04:47:54] [INFO ] Transformed 2348 transitions.
[2023-03-09 04:47:54] [INFO ] Parsed PT model containing 138 places and 2348 transitions and 18090 arcs in 301 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-09 04:47:54] [INFO ] Computed 7 place invariants in 41 ms
FORMULA BridgeAndVehicles-PT-V50P50N20-UpperBounds-13 50 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 23 resets, run finished after 248 ms. (steps per millisecond=40 ) 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 10001 steps, including 8 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 3) seen :11
Incomplete Best-First random walk after 10000 steps, including 8 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 3) seen :7
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 3) seen :22
[2023-03-09 04:47:55] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
// Phase 1: matrix 290 rows 138 cols
[2023-03-09 04:47:55] [INFO ] Computed 7 place invariants in 9 ms
[2023-03-09 04:47:55] [INFO ] [Real]Absence check using 7 positive place invariants in 5 ms returned unsat
[2023-03-09 04:47:55] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned unsat
[2023-03-09 04:47:55] [INFO ] [Real]Absence check using 7 positive place invariants in 4 ms returned sat
[2023-03-09 04:47:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 04:47:55] [INFO ] [Real]Absence check using state equation in 83 ms returned sat
[2023-03-09 04:47:55] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 04:47:55] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2023-03-09 04:47:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 04:47:55] [INFO ] [Nat]Absence check using state equation in 57 ms returned sat
[2023-03-09 04:47:55] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-09 04:47:55] [INFO ] [Nat]Added 42 Read/Feed constraints in 98 ms returned sat
[2023-03-09 04:47:55] [INFO ] Computed and/alt/rep : 120/238/120 causal constraints (skipped 167 transitions) in 123 ms.
[2023-03-09 04:47:56] [INFO ] Added : 20 causal constraints over 4 iterations in 245 ms. Result :sat
Minimization took 146 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 5 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 500 ms. Remains 135 /138 variables (removed 3) and now considering 2347/2348 (removed 1) transitions.
[2023-03-09 04:47:57] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
// Phase 1: matrix 289 rows 135 cols
[2023-03-09 04:47:57] [INFO ] Computed 5 place invariants in 9 ms
[2023-03-09 04:47:58] [INFO ] Dead Transitions using invariants and state equation in 968 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1469 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-09 04:47:58] [INFO ] Computed 5 place invariants in 9 ms
Incomplete random walk after 1000000 steps, including 2681 resets, run finished after 6070 ms. (steps per millisecond=164 ) properties (out of 1) seen :9
Incomplete Best-First random walk after 1000001 steps, including 1064 resets, run finished after 2319 ms. (steps per millisecond=431 ) properties (out of 1) seen :20
[2023-03-09 04:48:06] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
// Phase 1: matrix 289 rows 135 cols
[2023-03-09 04:48:06] [INFO ] Computed 5 place invariants in 3 ms
[2023-03-09 04:48:06] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-09 04:48:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 04:48:06] [INFO ] [Real]Absence check using state equation in 60 ms returned sat
[2023-03-09 04:48:06] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 04:48:06] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-09 04:48:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 04:48:06] [INFO ] [Nat]Absence check using state equation in 56 ms returned sat
[2023-03-09 04:48:06] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-09 04:48:06] [INFO ] [Nat]Added 42 Read/Feed constraints in 21 ms returned sat
[2023-03-09 04:48:07] [INFO ] Deduced a trap composed of 5 places in 251 ms of which 4 ms to minimize.
[2023-03-09 04:48:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 278 ms
[2023-03-09 04:48:07] [INFO ] Computed and/alt/rep : 120/238/120 causal constraints (skipped 166 transitions) in 59 ms.
[2023-03-09 04:48:07] [INFO ] Added : 21 causal constraints over 5 iterations in 283 ms. Result :sat
Minimization took 167 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 353 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 355 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 252 ms. Remains 135 /135 variables (removed 0) and now considering 2347/2347 (removed 0) transitions.
[2023-03-09 04:48:08] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
[2023-03-09 04:48:08] [INFO ] Invariant cache hit.
[2023-03-09 04:48:09] [INFO ] Implicit Places using invariants in 412 ms returned []
[2023-03-09 04:48:09] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
[2023-03-09 04:48:09] [INFO ] Invariant cache hit.
[2023-03-09 04:48:09] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-09 04:48:10] [INFO ] Implicit Places using invariants and state equation in 1067 ms returned [52, 108]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1493 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 208 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 1953 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-09 04:48:10] [INFO ] Computed 5 place invariants in 7 ms
Incomplete random walk after 1000000 steps, including 2682 resets, run finished after 5695 ms. (steps per millisecond=175 ) properties (out of 1) seen :7
Incomplete Best-First random walk after 1000001 steps, including 1064 resets, run finished after 2171 ms. (steps per millisecond=460 ) properties (out of 1) seen :20
[2023-03-09 04:48:18] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
// Phase 1: matrix 289 rows 133 cols
[2023-03-09 04:48:18] [INFO ] Computed 5 place invariants in 6 ms
[2023-03-09 04:48:18] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2023-03-09 04:48:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 04:48:18] [INFO ] [Real]Absence check using state equation in 176 ms returned sat
[2023-03-09 04:48:18] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 04:48:18] [INFO ] [Nat]Absence check using 5 positive place invariants in 4 ms returned sat
[2023-03-09 04:48:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 04:48:19] [INFO ] [Nat]Absence check using state equation in 172 ms returned sat
[2023-03-09 04:48:19] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-09 04:48:19] [INFO ] [Nat]Added 42 Read/Feed constraints in 24 ms returned sat
[2023-03-09 04:48:19] [INFO ] Computed and/alt/rep : 120/238/120 causal constraints (skipped 166 transitions) in 90 ms.
[2023-03-09 04:48:19] [INFO ] Added : 20 causal constraints over 4 iterations in 274 ms. Result :sat
Minimization took 112 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 259 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 250 ms. Remains 133 /133 variables (removed 0) and now considering 2347/2347 (removed 0) transitions.
[2023-03-09 04:48:20] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
[2023-03-09 04:48:20] [INFO ] Invariant cache hit.
[2023-03-09 04:48:21] [INFO ] Implicit Places using invariants in 388 ms returned []
[2023-03-09 04:48:21] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
[2023-03-09 04:48:21] [INFO ] Invariant cache hit.
[2023-03-09 04:48:21] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-09 04:48:21] [INFO ] Implicit Places using invariants and state equation in 795 ms returned []
Implicit Place search using SMT with State Equation took 1185 ms to find 0 implicit places.
[2023-03-09 04:48:21] [INFO ] Redundant transitions in 154 ms returned []
[2023-03-09 04:48:21] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
[2023-03-09 04:48:21] [INFO ] Invariant cache hit.
[2023-03-09 04:48:22] [INFO ] Dead Transitions using invariants and state equation in 850 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2446 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-09 04:48:22] [INFO ] Computed 5 place invariants in 3 ms
Incomplete random walk after 10000 steps, including 26 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 1) seen :5
Incomplete Best-First random walk after 10000 steps, including 10 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 1) seen :20
[2023-03-09 04:48:22] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
// Phase 1: matrix 289 rows 133 cols
[2023-03-09 04:48:22] [INFO ] Computed 5 place invariants in 2 ms
[2023-03-09 04:48:23] [INFO ] [Real]Absence check using 5 positive place invariants in 8 ms returned sat
[2023-03-09 04:48:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 04:48:23] [INFO ] [Real]Absence check using state equation in 131 ms returned sat
[2023-03-09 04:48:23] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 04:48:23] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-09 04:48:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 04:48:23] [INFO ] [Nat]Absence check using state equation in 194 ms returned sat
[2023-03-09 04:48:23] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-09 04:48:23] [INFO ] [Nat]Added 42 Read/Feed constraints in 27 ms returned sat
[2023-03-09 04:48:23] [INFO ] Computed and/alt/rep : 120/238/120 causal constraints (skipped 166 transitions) in 78 ms.
[2023-03-09 04:48:23] [INFO ] Added : 20 causal constraints over 4 iterations in 264 ms. Result :sat
Minimization took 108 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 208 ms. Remains 133 /133 variables (removed 0) and now considering 2347/2347 (removed 0) transitions.
[2023-03-09 04:48:24] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
[2023-03-09 04:48:24] [INFO ] Invariant cache hit.
[2023-03-09 04:48:25] [INFO ] Dead Transitions using invariants and state equation in 827 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1036 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-09 04:48:25] [INFO ] Computed 5 place invariants in 4 ms
Incomplete random walk after 1000000 steps, including 2682 resets, run finished after 5573 ms. (steps per millisecond=179 ) properties (out of 1) seen :9
Incomplete Best-First random walk after 1000000 steps, including 1064 resets, run finished after 2160 ms. (steps per millisecond=462 ) properties (out of 1) seen :20
[2023-03-09 04:48:33] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
// Phase 1: matrix 289 rows 133 cols
[2023-03-09 04:48:33] [INFO ] Computed 5 place invariants in 4 ms
[2023-03-09 04:48:33] [INFO ] [Real]Absence check using 5 positive place invariants in 4 ms returned sat
[2023-03-09 04:48:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 04:48:33] [INFO ] [Real]Absence check using state equation in 202 ms returned sat
[2023-03-09 04:48:33] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 04:48:33] [INFO ] [Nat]Absence check using 5 positive place invariants in 4 ms returned sat
[2023-03-09 04:48:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 04:48:33] [INFO ] [Nat]Absence check using state equation in 183 ms returned sat
[2023-03-09 04:48:33] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-09 04:48:33] [INFO ] [Nat]Added 42 Read/Feed constraints in 23 ms returned sat
[2023-03-09 04:48:33] [INFO ] Computed and/alt/rep : 120/238/120 causal constraints (skipped 166 transitions) in 93 ms.
[2023-03-09 04:48:34] [INFO ] Added : 20 causal constraints over 4 iterations in 260 ms. Result :sat
Minimization took 106 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 207 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 207 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 196 ms. Remains 133 /133 variables (removed 0) and now considering 2347/2347 (removed 0) transitions.
[2023-03-09 04:48:35] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
[2023-03-09 04:48:35] [INFO ] Invariant cache hit.
[2023-03-09 04:48:35] [INFO ] Implicit Places using invariants in 384 ms returned []
[2023-03-09 04:48:35] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
[2023-03-09 04:48:35] [INFO ] Invariant cache hit.
[2023-03-09 04:48:35] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-09 04:48:36] [INFO ] Implicit Places using invariants and state equation in 932 ms returned []
Implicit Place search using SMT with State Equation took 1332 ms to find 0 implicit places.
[2023-03-09 04:48:36] [INFO ] Redundant transitions in 157 ms returned []
[2023-03-09 04:48:36] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
[2023-03-09 04:48:36] [INFO ] Invariant cache hit.
[2023-03-09 04:48:37] [INFO ] Dead Transitions using invariants and state equation in 875 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2579 ms. Remains : 133/133 places, 2347/2347 transitions.
Ending property specific reduction for BridgeAndVehicles-PT-V50P50N20-UpperBounds-07 in 14725 ms.
[2023-03-09 04:48:38] [INFO ] Flatten gal took : 245 ms
[2023-03-09 04:48:38] [INFO ] Applying decomposition
[2023-03-09 04:48:38] [INFO ] Flatten gal took : 141 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/graph14273732959871488251.txt' '-o' '/tmp/graph14273732959871488251.bin' '-w' '/tmp/graph14273732959871488251.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph14273732959871488251.bin' '-l' '-1' '-v' '-w' '/tmp/graph14273732959871488251.weights' '-q' '0' '-e' '0.001'
[2023-03-09 04:48:38] [INFO ] Decomposing Gal with order
[2023-03-09 04:48:38] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-09 04:48:39] [INFO ] Removed a total of 4373 redundant transitions.
[2023-03-09 04:48:39] [INFO ] Flatten gal took : 872 ms
[2023-03-09 04:48:39] [INFO ] Fuse similar labels procedure discarded/fused a total of 327 labels/synchronizations in 34 ms.
[2023-03-09 04:48:39] [INFO ] Time to serialize gal into /tmp/UpperBounds16581550029899964037.gal : 10 ms
[2023-03-09 04:48:39] [INFO ] Time to serialize properties into /tmp/UpperBounds10614065329454641516.prop : 0 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/UpperBounds16581550029899964037.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds10614065329454641516.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 ...285
Loading property file /tmp/UpperBounds10614065329454641516.prop.
Detected timeout of ITS tools.
[2023-03-09 05:08:54] [INFO ] Flatten gal took : 129 ms
[2023-03-09 05:08:54] [INFO ] Time to serialize gal into /tmp/UpperBounds2885565256247878114.gal : 32 ms
[2023-03-09 05:08:54] [INFO ] Time to serialize properties into /tmp/UpperBounds1930973891531646149.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/UpperBounds2885565256247878114.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds1930973891531646149.prop' '--nowitness' '--gen-order' 'FOLLOW'

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 ...304
Loading property file /tmp/UpperBounds1930973891531646149.prop.
Detected timeout of ITS tools.
[2023-03-09 05:29:11] [INFO ] Flatten gal took : 306 ms
[2023-03-09 05:29:14] [INFO ] Input system was already deterministic with 2347 transitions.
[2023-03-09 05:29:14] [INFO ] Transformed 133 places.
[2023-03-09 05:29:14] [INFO ] Transformed 2347 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2023-03-09 05:29:14] [INFO ] Time to serialize gal into /tmp/UpperBounds18372607854632960826.gal : 31 ms
[2023-03-09 05:29:14] [INFO ] Time to serialize properties into /tmp/UpperBounds15476856531165105159.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/UpperBounds18372607854632960826.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds15476856531165105159.prop' '--nowitness' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

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 ...351
Successfully loaded order from file /home/mcc/execution/model.ord
Loading property file /tmp/UpperBounds15476856531165105159.prop.
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393356 kB
MemFree: 10466732 kB
After kill :
MemTotal: 16393356 kB
MemFree: 16017000 kB

BK_TIME_CONFINEMENT_REACHED

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//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//../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-V50P50N20"
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-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 r037-tajo-167813690100261"
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 ;