fond

jQuery Multi Level CSS Menu Css3Menu.com

Model Checking Contest 2024
14th edition, Geneva, Switzerland, June 25, 2024
Execution of r048-tajo-171620399000205
Last Updated
July 7, 2024

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

Execution Summary
Max Memory
Used (MB)		 Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
3175.308 166589.00 267274.00 69.80 20 1 1 1 1 20 1 20 20 1 20 20 1 10 1 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/mcc2024-input.r048-tajo-171620399000205.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2024-input.qcow2' backing_fmt='qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
.......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool itstools
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 r048-tajo-171620399000205
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.0M
-rw-r--r-- 1 mcc users 15K Apr 13 01:39 CTLCardinality.txt
-rw-r--r-- 1 mcc users 100K Apr 13 01:39 CTLCardinality.xml
-rw-r--r-- 1 mcc users 52K Apr 13 01:37 CTLFireability.txt
-rw-r--r-- 1 mcc users 220K Apr 13 01:37 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K Apr 22 14:29 LTLCardinality.txt
-rw-r--r-- 1 mcc users 35K Apr 22 14:29 LTLCardinality.xml
-rw-r--r-- 1 mcc users 26K Apr 22 14:29 LTLFireability.txt
-rw-r--r-- 1 mcc users 86K Apr 22 14:29 LTLFireability.xml
-rw-r--r-- 1 mcc users 25K Apr 13 01:56 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 181K Apr 13 01:56 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 156K Apr 13 01:53 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 648K Apr 13 01:53 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.4K Apr 22 14:29 UpperBounds.txt
-rw-r--r-- 1 mcc users 5.1K Apr 22 14:29 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 10 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 434K May 18 16:42 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 1716327001920

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-V20P20N10
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202405141337
[2024-05-21 21:30:03] [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]
[2024-05-21 21:30:03] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 21:30:03] [INFO ] Load time of PNML (sax parser for PT used): 108 ms
[2024-05-21 21:30:03] [INFO ] Transformed 68 places.
[2024-05-21 21:30:03] [INFO ] Transformed 548 transitions.
[2024-05-21 21:30:03] [INFO ] Parsed PT model containing 68 places and 548 transitions and 4070 arcs in 238 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 8 ms.
Reduction of identical properties reduced properties to check from 16 to 13
FORMULA BridgeAndVehicles-PT-V20P20N10-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V20P20N10-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 0, 20, 20, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 20, 20, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
[2024-05-21 21:30:03] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
// Phase 1: matrix 130 rows 68 cols
[2024-05-21 21:30:03] [INFO ] Computed 7 invariants in 17 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 20, 20, 0, 0, 0, 0, 0, 0] Max Struct:[20, 2, 2, 20, 20, 20, 1, 20, 1, 20, 1]
FORMULA BridgeAndVehicles-PT-V20P20N10-UpperBounds-15 20 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V20P20N10-UpperBounds-07 20 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V20P20N10-UpperBounds-05 20 TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 10000 steps (56 resets) in 78 ms. (126 steps per ms)
FORMULA BridgeAndVehicles-PT-V20P20N10-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BridgeAndVehicles-PT-V20P20N10-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BridgeAndVehicles-PT-V20P20N10-UpperBounds-11 20 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BridgeAndVehicles-PT-V20P20N10-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BridgeAndVehicles-PT-V20P20N10-UpperBounds-08 20 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BridgeAndVehicles-PT-V20P20N10-UpperBounds-10 20 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BridgeAndVehicles-PT-V20P20N10-UpperBounds-00 20 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 30001 steps (65 resets) in 84 ms. (352 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1, 1, 10] Max Struct:[2, 2, 20]
[2024-05-21 21:30:03] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
[2024-05-21 21:30:03] [INFO ] Invariant cache hit.
[2024-05-21 21:30:04] [INFO ] [Real]Absence check using 7 positive place invariants in 4 ms returned unsat
[2024-05-21 21:30:04] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned unsat
[2024-05-21 21:30:04] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned sat
[2024-05-21 21:30:04] [INFO ] [Real]Absence check using state equation in 65 ms returned sat
[2024-05-21 21:30:04] [INFO ] State equation strengthened by 22 read => feed constraints.
[2024-05-21 21:30:04] [INFO ] [Real]Added 22 Read/Feed constraints in 10 ms returned sat
[2024-05-21 21:30:04] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 21:30:04] [INFO ] [Nat]Absence check using 7 positive place invariants in 10 ms returned sat
[2024-05-21 21:30:04] [INFO ] [Nat]Absence check using state equation in 29 ms returned sat
[2024-05-21 21:30:04] [INFO ] [Nat]Added 22 Read/Feed constraints in 10 ms returned sat
[2024-05-21 21:30:04] [INFO ] Computed and/alt/rep : 50/98/50 causal constraints (skipped 77 transitions) in 36 ms.
[2024-05-21 21:30:04] [INFO ] Deduced a trap composed of 15 places in 102 ms of which 29 ms to minimize.
[2024-05-21 21:30:04] [INFO ] Deduced a trap composed of 5 places in 82 ms of which 3 ms to minimize.
[2024-05-21 21:30:04] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 219 ms
[2024-05-21 21:30:04] [INFO ] Added : 11 causal constraints over 3 iterations in 316 ms. Result :sat
Minimization took 57 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1, 1, 10] Max Struct:[1, 1, 20]
FORMULA BridgeAndVehicles-PT-V20P20N10-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA BridgeAndVehicles-PT-V20P20N10-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA BridgeAndVehicles-PT-V20P20N10-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[10] Max Struct:[20]
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.2 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 74 ms. Remains 65 /68 variables (removed 3) and now considering 547/548 (removed 1) transitions.
Running 544 sub problems to find dead transitions.
[2024-05-21 21:30:05] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
// Phase 1: matrix 129 rows 65 cols
[2024-05-21 21:30:05] [INFO ] Computed 5 invariants in 3 ms
[2024-05-21 21:30:05] [INFO ] State equation strengthened by 22 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/65 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 544 unsolved
[2024-05-21 21:30:07] [INFO ] Deduced a trap composed of 5 places in 77 ms of which 1 ms to minimize.
[2024-05-21 21:30:08] [INFO ] Deduced a trap composed of 15 places in 65 ms of which 1 ms to minimize.
Problem TDEAD287 is UNSAT
Problem TDEAD288 is UNSAT
Problem TDEAD289 is UNSAT
Problem TDEAD290 is UNSAT
Problem TDEAD291 is UNSAT
Problem TDEAD292 is UNSAT
Problem TDEAD293 is UNSAT
Problem TDEAD294 is UNSAT
Problem TDEAD295 is UNSAT
Problem TDEAD296 is UNSAT
Problem TDEAD297 is UNSAT
Problem TDEAD298 is UNSAT
Problem TDEAD299 is UNSAT
Problem TDEAD300 is UNSAT
Problem TDEAD301 is UNSAT
Problem TDEAD302 is UNSAT
Problem TDEAD303 is UNSAT
Problem TDEAD304 is UNSAT
Problem TDEAD305 is UNSAT
Problem TDEAD306 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/65 variables, 2/7 constraints. Problems are: Problem set: 20 solved, 524 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 0/7 constraints. Problems are: Problem set: 20 solved, 524 unsolved
Problem TDEAD20 is UNSAT
Problem TDEAD44 is UNSAT
At refinement iteration 3 (OVERLAPS) 129/194 variables, 65/72 constraints. Problems are: Problem set: 22 solved, 522 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/194 variables, 22/94 constraints. Problems are: Problem set: 22 solved, 522 unsolved
[2024-05-21 21:30:12] [INFO ] Deduced a trap composed of 14 places in 85 ms of which 1 ms to minimize.
Problem TDEAD67 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD100 is UNSAT
Problem TDEAD111 is UNSAT
Problem TDEAD122 is UNSAT
Problem TDEAD133 is UNSAT
Problem TDEAD144 is UNSAT
Problem TDEAD155 is UNSAT
Problem TDEAD166 is UNSAT
Problem TDEAD177 is UNSAT
Problem TDEAD188 is UNSAT
Problem TDEAD199 is UNSAT
Problem TDEAD210 is UNSAT
Problem TDEAD221 is UNSAT
Problem TDEAD232 is UNSAT
Problem TDEAD243 is UNSAT
Problem TDEAD254 is UNSAT
Problem TDEAD265 is UNSAT
Problem TDEAD276 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/194 variables, 1/95 constraints. Problems are: Problem set: 42 solved, 502 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/194 variables, 0/95 constraints. Problems are: Problem set: 42 solved, 502 unsolved
At refinement iteration 7 (OVERLAPS) 0/194 variables, 0/95 constraints. Problems are: Problem set: 42 solved, 502 unsolved
No progress, stopping.
After SMT solving in domain Real declared 194/194 variables, and 95 constraints, problems are : Problem set: 42 solved, 502 unsolved in 13644 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 65/65 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 544/544 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 42 solved, 502 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/65 variables, 5/5 constraints. Problems are: Problem set: 42 solved, 502 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/65 variables, 3/8 constraints. Problems are: Problem set: 42 solved, 502 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 0/8 constraints. Problems are: Problem set: 42 solved, 502 unsolved
At refinement iteration 3 (OVERLAPS) 129/194 variables, 65/73 constraints. Problems are: Problem set: 42 solved, 502 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/194 variables, 22/95 constraints. Problems are: Problem set: 42 solved, 502 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/194 variables, 502/597 constraints. Problems are: Problem set: 42 solved, 502 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/194 variables, 0/597 constraints. Problems are: Problem set: 42 solved, 502 unsolved
At refinement iteration 7 (OVERLAPS) 0/194 variables, 0/597 constraints. Problems are: Problem set: 42 solved, 502 unsolved
No progress, stopping.
After SMT solving in domain Int declared 194/194 variables, and 597 constraints, problems are : Problem set: 42 solved, 502 unsolved in 20021 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 65/65 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 502/544 constraints, Known Traps: 3/3 constraints]
After SMT, in 34894ms problems are : Problem set: 42 solved, 502 unsolved
Search for dead transitions found 42 dead transitions in 34914ms
Found 42 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 42 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 42 transitions.
Starting structural reductions in REACHABILITY mode, iteration 1 : 65/68 places, 505/548 transitions.
Applied a total of 0 rules in 27 ms. Remains 65 /65 variables (removed 0) and now considering 505/505 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35034 ms. Remains : 65/68 places, 505/548 transitions.
[2024-05-21 21:30:39] [INFO ] Flow matrix only has 125 transitions (discarded 380 similar events)
// Phase 1: matrix 125 rows 65 cols
[2024-05-21 21:30:39] [INFO ] Computed 7 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[10] Max Struct:[20]
RANDOM walk for 1000000 steps (6490 resets) in 2212 ms. (451 steps per ms)
BEST_FIRST walk for 1000000 steps (2548 resets) in 857 ms. (1165 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[10] Max Struct:[20]
[2024-05-21 21:30:43] [INFO ] Flow matrix only has 125 transitions (discarded 380 similar events)
[2024-05-21 21:30:43] [INFO ] Invariant cache hit.
[2024-05-21 21:30:43] [INFO ] [Real]Absence check using 6 positive place invariants in 3 ms returned sat
[2024-05-21 21:30:43] [INFO ] [Real]Absence check using 6 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-21 21:30:43] [INFO ] [Real]Absence check using state equation in 35 ms returned sat
[2024-05-21 21:30:43] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 21:30:43] [INFO ] [Nat]Absence check using 6 positive place invariants in 3 ms returned sat
[2024-05-21 21:30:43] [INFO ] [Nat]Absence check using 6 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-21 21:30:43] [INFO ] [Nat]Absence check using state equation in 24 ms returned sat
[2024-05-21 21:30:43] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-05-21 21:30:43] [INFO ] [Nat]Added 20 Read/Feed constraints in 15 ms returned sat
[2024-05-21 21:30:43] [INFO ] Computed and/alt/rep : 48/96/48 causal constraints (skipped 74 transitions) in 20 ms.
[2024-05-21 21:30:43] [INFO ] Deduced a trap composed of 5 places in 76 ms of which 1 ms to minimize.
[2024-05-21 21:30:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 88 ms
[2024-05-21 21:30:43] [INFO ] Added : 11 causal constraints over 3 iterations in 180 ms. Result :sat
Minimization took 60 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[10] Max Struct:[20]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[10] Max Struct:[20]
Support contains 1 out of 65 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 65/65 places, 505/505 transitions.
Applied a total of 0 rules in 22 ms. Remains 65 /65 variables (removed 0) and now considering 505/505 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22 ms. Remains : 65/65 places, 505/505 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 65/65 places, 505/505 transitions.
Applied a total of 0 rules in 19 ms. Remains 65 /65 variables (removed 0) and now considering 505/505 (removed 0) transitions.
[2024-05-21 21:30:43] [INFO ] Flow matrix only has 125 transitions (discarded 380 similar events)
[2024-05-21 21:30:43] [INFO ] Invariant cache hit.
[2024-05-21 21:30:43] [INFO ] Implicit Places using invariants in 128 ms returned [22, 48]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 131 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 63/65 places, 505/505 transitions.
Applied a total of 0 rules in 17 ms. Remains 63 /63 variables (removed 0) and now considering 505/505 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 167 ms. Remains : 63/65 places, 505/505 transitions.
[2024-05-21 21:30:43] [INFO ] Flow matrix only has 125 transitions (discarded 380 similar events)
// Phase 1: matrix 125 rows 63 cols
[2024-05-21 21:30:43] [INFO ] Computed 5 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[10] Max Struct:[20]
RANDOM walk for 1000000 steps (6491 resets) in 2121 ms. (471 steps per ms)
BEST_FIRST walk for 1000001 steps (2550 resets) in 891 ms. (1121 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[10] Max Struct:[20]
[2024-05-21 21:30:46] [INFO ] Flow matrix only has 125 transitions (discarded 380 similar events)
[2024-05-21 21:30:46] [INFO ] Invariant cache hit.
[2024-05-21 21:30:46] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2024-05-21 21:30:46] [INFO ] [Real]Absence check using state equation in 39 ms returned sat
[2024-05-21 21:30:46] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-05-21 21:30:46] [INFO ] [Real]Added 20 Read/Feed constraints in 7 ms returned sat
[2024-05-21 21:30:46] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 21:30:46] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2024-05-21 21:30:46] [INFO ] [Nat]Absence check using state equation in 26 ms returned sat
[2024-05-21 21:30:46] [INFO ] [Nat]Added 20 Read/Feed constraints in 5 ms returned sat
[2024-05-21 21:30:46] [INFO ] Computed and/alt/rep : 48/96/48 causal constraints (skipped 74 transitions) in 18 ms.
[2024-05-21 21:30:47] [INFO ] Added : 11 causal constraints over 3 iterations in 76 ms. Result :sat
Minimization took 66 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[10] Max Struct:[20]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[10] Max Struct:[20]
Support contains 1 out of 63 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 63/63 places, 505/505 transitions.
Applied a total of 0 rules in 18 ms. Remains 63 /63 variables (removed 0) and now considering 505/505 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19 ms. Remains : 63/63 places, 505/505 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 63/63 places, 505/505 transitions.
Applied a total of 0 rules in 16 ms. Remains 63 /63 variables (removed 0) and now considering 505/505 (removed 0) transitions.
[2024-05-21 21:30:47] [INFO ] Flow matrix only has 125 transitions (discarded 380 similar events)
[2024-05-21 21:30:47] [INFO ] Invariant cache hit.
[2024-05-21 21:30:47] [INFO ] Implicit Places using invariants in 131 ms returned []
[2024-05-21 21:30:47] [INFO ] Flow matrix only has 125 transitions (discarded 380 similar events)
[2024-05-21 21:30:47] [INFO ] Invariant cache hit.
[2024-05-21 21:30:47] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-05-21 21:30:47] [INFO ] Implicit Places using invariants and state equation in 225 ms returned []
Implicit Place search using SMT with State Equation took 358 ms to find 0 implicit places.
[2024-05-21 21:30:47] [INFO ] Redundant transitions in 49 ms returned []
Running 502 sub problems to find dead transitions.
[2024-05-21 21:30:47] [INFO ] Flow matrix only has 125 transitions (discarded 380 similar events)
[2024-05-21 21:30:47] [INFO ] Invariant cache hit.
[2024-05-21 21:30:47] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 502 unsolved
[2024-05-21 21:30:49] [INFO ] Deduced a trap composed of 5 places in 71 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/63 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 3 (OVERLAPS) 125/188 variables, 63/69 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/188 variables, 20/89 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/188 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 6 (OVERLAPS) 0/188 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 502 unsolved
No progress, stopping.
After SMT solving in domain Real declared 188/188 variables, and 89 constraints, problems are : Problem set: 0 solved, 502 unsolved in 10082 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 63/63 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 502/502 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 502 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/63 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 3 (OVERLAPS) 125/188 variables, 63/69 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/188 variables, 20/89 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/188 variables, 502/591 constraints. Problems are: Problem set: 0 solved, 502 unsolved
[2024-05-21 21:31:04] [INFO ] Deduced a trap composed of 15 places in 93 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/188 variables, 1/592 constraints. Problems are: Problem set: 0 solved, 502 unsolved
[2024-05-21 21:31:13] [INFO ] Deduced a trap composed of 14 places in 80 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/188 variables, 1/593 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/188 variables, 0/593 constraints. Problems are: Problem set: 0 solved, 502 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 188/188 variables, and 593 constraints, problems are : Problem set: 0 solved, 502 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 63/63 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 502/502 constraints, Known Traps: 3/3 constraints]
After SMT, in 41052ms problems are : Problem set: 0 solved, 502 unsolved
Search for dead transitions found 0 dead transitions in 41060ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41492 ms. Remains : 63/63 places, 505/505 transitions.
RANDOM walk for 40000 steps (256 resets) in 981 ms. (40 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (100 resets) in 279 ms. (142 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (100 resets) in 242 ms. (164 steps per ms) remains 2/2 properties
[2024-05-21 21:31:29] [INFO ] Flatten gal took : 154 ms
[2024-05-21 21:31:29] [INFO ] Flatten gal took : 43 ms
[2024-05-21 21:31:29] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality5186525871530386794.gal : 20 ms
[2024-05-21 21:31:29] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality10005081500836219989.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.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality5186525871530386794.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality10005081500836219989.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.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality10005081500836219989.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 4
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :4 after 14
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :14 after 36
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :36 after 100
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :100 after 233
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :233 after 566
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :566 after 1750
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :4992 after 5154
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :5154 after 5311
Interrupted probabilistic random walk after 611676 steps, run timeout after 3001 ms. (steps per millisecond=203 ) properties seen :0 out of 2
Probabilistic random walk after 611676 steps, saw 152241 distinct states, run finished after 3021 ms. (steps per millisecond=202 ) properties seen :0
[2024-05-21 21:31:32] [INFO ] Flow matrix only has 125 transitions (discarded 380 similar events)
[2024-05-21 21:31:32] [INFO ] Invariant cache hit.
[2024-05-21 21:31:32] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 1/2 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 21/23 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/23 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 65/88 variables, 23/26 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/88 variables, 1/27 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/88 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 4/92 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-21 21:31:32] [INFO ] Deduced a trap composed of 4 places in 66 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/92 variables, 1/29 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/92 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 54/146 variables, 16/45 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/146 variables, 1/46 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/146 variables, 10/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/146 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 15 (OVERLAPS) 41/187 variables, 21/77 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/187 variables, 1/78 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/187 variables, 10/88 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/187 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 1/188 variables, 1/89 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/188 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 0/188 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 188/188 variables, and 89 constraints, problems are : Problem set: 0 solved, 2 unsolved in 234 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 63/63 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 1/2 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 21/23 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/23 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 65/88 variables, 23/26 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/88 variables, 1/27 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/88 variables, 2/29 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/88 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 4/92 variables, 1/30 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/92 variables, 1/31 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/92 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 54/146 variables, 16/47 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/146 variables, 1/48 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/146 variables, 10/58 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/146 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 41/187 variables, 21/79 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/187 variables, 1/80 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/187 variables, 10/90 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/187 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 1/188 variables, 1/91 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/188 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 0/188 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 188/188 variables, and 91 constraints, problems are : Problem set: 0 solved, 2 unsolved in 212 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 63/63 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
After SMT, in 460ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 102 ms.
Support contains 1 out of 63 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 63/63 places, 505/505 transitions.
Applied a total of 0 rules in 14 ms. Remains 63 /63 variables (removed 0) and now considering 505/505 (removed 0) transitions.
Running 502 sub problems to find dead transitions.
[2024-05-21 21:31:32] [INFO ] Flow matrix only has 125 transitions (discarded 380 similar events)
[2024-05-21 21:31:32] [INFO ] Invariant cache hit.
[2024-05-21 21:31:32] [INFO ] State equation strengthened by 20 read => feed constraints.
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :5311 after 5622
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 502 unsolved
[2024-05-21 21:31:35] [INFO ] Deduced a trap composed of 5 places in 90 ms of which 1 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :5622 after 6071
At refinement iteration 1 (INCLUDED_ONLY) 0/63 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 3 (OVERLAPS) 125/188 variables, 63/69 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/188 variables, 20/89 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/188 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 6 (OVERLAPS) 0/188 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 502 unsolved
No progress, stopping.
After SMT solving in domain Real declared 188/188 variables, and 89 constraints, problems are : Problem set: 0 solved, 502 unsolved in 10026 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 63/63 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 502/502 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 502 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/63 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 3 (OVERLAPS) 125/188 variables, 63/69 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/188 variables, 20/89 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/188 variables, 502/591 constraints. Problems are: Problem set: 0 solved, 502 unsolved
[2024-05-21 21:31:49] [INFO ] Deduced a trap composed of 15 places in 90 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/188 variables, 1/592 constraints. Problems are: Problem set: 0 solved, 502 unsolved
[2024-05-21 21:31:57] [INFO ] Deduced a trap composed of 14 places in 82 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/188 variables, 1/593 constraints. Problems are: Problem set: 0 solved, 502 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 188/188 variables, and 593 constraints, problems are : Problem set: 0 solved, 502 unsolved in 20016 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 63/63 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 502/502 constraints, Known Traps: 3/3 constraints]
After SMT, in 31118ms problems are : Problem set: 0 solved, 502 unsolved
Search for dead transitions found 0 dead transitions in 31126ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 31143 ms. Remains : 63/63 places, 505/505 transitions.
RANDOM walk for 40000 steps (256 resets) in 420 ms. (95 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (102 resets) in 142 ms. (279 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (100 resets) in 111 ms. (357 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 691653 steps, run timeout after 3001 ms. (steps per millisecond=230 ) properties seen :0 out of 2
Probabilistic random walk after 691653 steps, saw 170635 distinct states, run finished after 3001 ms. (steps per millisecond=230 ) properties seen :0
[2024-05-21 21:32:07] [INFO ] Flow matrix only has 125 transitions (discarded 380 similar events)
[2024-05-21 21:32:07] [INFO ] Invariant cache hit.
[2024-05-21 21:32:07] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 1/2 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 21/23 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/23 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 65/88 variables, 23/26 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/88 variables, 1/27 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/88 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 4/92 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-21 21:32:07] [INFO ] Deduced a trap composed of 4 places in 43 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/92 variables, 1/29 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/92 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 54/146 variables, 16/45 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/146 variables, 1/46 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/146 variables, 10/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/146 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 15 (OVERLAPS) 41/187 variables, 21/77 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/187 variables, 1/78 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/187 variables, 10/88 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/187 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 1/188 variables, 1/89 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/188 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 0/188 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 188/188 variables, and 89 constraints, problems are : Problem set: 0 solved, 2 unsolved in 151 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 63/63 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 1/2 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 21/23 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/23 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 65/88 variables, 23/26 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/88 variables, 1/27 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/88 variables, 2/29 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/88 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 4/92 variables, 1/30 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/92 variables, 1/31 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/92 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 54/146 variables, 16/47 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/146 variables, 1/48 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/146 variables, 10/58 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/146 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 41/187 variables, 21/79 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/187 variables, 1/80 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/187 variables, 10/90 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/187 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 1/188 variables, 1/91 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/188 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 0/188 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 188/188 variables, and 91 constraints, problems are : Problem set: 0 solved, 2 unsolved in 153 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 63/63 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
After SMT, in 317ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 89 ms.
Support contains 1 out of 63 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 63/63 places, 505/505 transitions.
Applied a total of 0 rules in 11 ms. Remains 63 /63 variables (removed 0) and now considering 505/505 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 63/63 places, 505/505 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 63/63 places, 505/505 transitions.
Applied a total of 0 rules in 12 ms. Remains 63 /63 variables (removed 0) and now considering 505/505 (removed 0) transitions.
[2024-05-21 21:32:07] [INFO ] Flow matrix only has 125 transitions (discarded 380 similar events)
[2024-05-21 21:32:07] [INFO ] Invariant cache hit.
[2024-05-21 21:32:07] [INFO ] Implicit Places using invariants in 125 ms returned []
[2024-05-21 21:32:07] [INFO ] Flow matrix only has 125 transitions (discarded 380 similar events)
[2024-05-21 21:32:07] [INFO ] Invariant cache hit.
[2024-05-21 21:32:07] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-05-21 21:32:07] [INFO ] Implicit Places using invariants and state equation in 157 ms returned []
Implicit Place search using SMT with State Equation took 284 ms to find 0 implicit places.
[2024-05-21 21:32:07] [INFO ] Redundant transitions in 3 ms returned []
Running 502 sub problems to find dead transitions.
[2024-05-21 21:32:07] [INFO ] Flow matrix only has 125 transitions (discarded 380 similar events)
[2024-05-21 21:32:07] [INFO ] Invariant cache hit.
[2024-05-21 21:32:07] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 502 unsolved
[2024-05-21 21:32:09] [INFO ] Deduced a trap composed of 5 places in 72 ms of which 0 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/63 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 502 unsolved
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :42030 after 57236
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 3 (OVERLAPS) 125/188 variables, 63/69 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/188 variables, 20/89 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/188 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 6 (OVERLAPS) 0/188 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 502 unsolved
No progress, stopping.
After SMT solving in domain Real declared 188/188 variables, and 89 constraints, problems are : Problem set: 0 solved, 502 unsolved in 9540 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 63/63 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 502/502 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 502 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/63 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 502 unsolved
Detected timeout of ITS tools.
[2024-05-21 21:32:19] [INFO ] Flatten gal took : 30 ms
[2024-05-21 21:32:19] [INFO ] Applying decomposition
[2024-05-21 21:32:19] [INFO ] Flatten gal took : 27 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph16630626077287745665.txt' '-o' '/tmp/graph16630626077287745665.bin' '-w' '/tmp/graph16630626077287745665.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph16630626077287745665.bin' '-l' '-1' '-v' '-w' '/tmp/graph16630626077287745665.weights' '-q' '0' '-e' '0.001'
[2024-05-21 21:32:19] [INFO ] Decomposing Gal with order
[2024-05-21 21:32:19] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 21:32:19] [INFO ] Removed a total of 1073 redundant transitions.
[2024-05-21 21:32:19] [INFO ] Flatten gal took : 152 ms
[2024-05-21 21:32:19] [INFO ] Fuse similar labels procedure discarded/fused a total of 155 labels/synchronizations in 17 ms.
[2024-05-21 21:32:19] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality9444148494804608487.gal : 2 ms
[2024-05-21 21:32:19] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality5196790471370164325.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.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality9444148494804608487.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality5196790471370164325.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...307
Loading property file /tmp/ReachabilityCardinality5196790471370164325.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 22
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :22 after 27
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :27 after 36
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :36 after 53
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :53 after 782
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :782 after 3630
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :3630 after 13213
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :13213 after 19677
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :56941 after 59029
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 3 (OVERLAPS) 125/188 variables, 63/69 constraints. Problems are: Problem set: 0 solved, 502 unsolved
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :300972 after 411093
At refinement iteration 4 (INCLUDED_ONLY) 0/188 variables, 20/89 constraints. Problems are: Problem set: 0 solved, 502 unsolved
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :2.48504e+06 after 2.49968e+06
At refinement iteration 5 (INCLUDED_ONLY) 0/188 variables, 502/591 constraints. Problems are: Problem set: 0 solved, 502 unsolved
[2024-05-21 21:32:24] [INFO ] Deduced a trap composed of 15 places in 100 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/188 variables, 1/592 constraints. Problems are: Problem set: 0 solved, 502 unsolved
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,4.05339e+06,12.9665,245012,808,3486,103300,157653,124,338098,223,3.29754e+06,0
Total reachable state count : 4053390

Verifying 2 reachability properties.
Reachability property MAX0 does not hold.
No reachable states exhibit your property : MAX0

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MAX0,0,12.9675,245012,1,0,103300,157653,124,338098,224,3.29754e+06,0
Invariant property MIN0 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MIN0,0,12.968,245012,1,0,103300,157653,127,338098,225,3.29754e+06,0
[2024-05-21 21:32:32] [INFO ] Deduced a trap composed of 14 places in 110 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/188 variables, 1/593 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/188 variables, 0/593 constraints. Problems are: Problem set: 0 solved, 502 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 188/188 variables, and 593 constraints, problems are : Problem set: 0 solved, 502 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 63/63 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 502/502 constraints, Known Traps: 3/3 constraints]
After SMT, in 40490ms problems are : Problem set: 0 solved, 502 unsolved
Search for dead transitions found 0 dead transitions in 40495ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 40800 ms. Remains : 63/63 places, 505/505 transitions.
FORMULA BridgeAndVehicles-PT-V20P20N10-UpperBounds-13 10 TECHNIQUES REACHABILITY_MIN
Current structural bounds on expressions (After reachability solving 1 queries.) : Max Seen:[] Max Struct:[]
All properties solved without resorting to model-checking.
Total runtime 165030 ms.

BK_STOP 1716327168509

--------------------
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.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /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-V20P20N10"
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-5568"
echo " Executing tool itstools"
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 r048-tajo-171620399000205"
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 ;