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.r472-tajo-171620398900149.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 ltsminxred
Input is BridgeAndVehicles-COL-V80P50N20, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r472-tajo-171620398900149
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 428K
-rw-r--r-- 1 mcc users 5.8K Apr 13 00:59 CTLCardinality.txt
-rw-r--r-- 1 mcc users 49K Apr 13 00:59 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Apr 13 00:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K Apr 13 00:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 4.3K Apr 22 14:30 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 22 14:30 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Apr 22 14:30 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 22 14:30 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.3K Apr 13 02:04 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 82K Apr 13 02:04 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.5K Apr 13 01:57 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 66K Apr 13 01:57 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Apr 22 14:30 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Apr 22 14:30 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:42 equiv_pt
-rw-r--r-- 1 mcc users 10 May 18 16:42 instance
-rw-r--r-- 1 mcc users 5 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 45K 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-COL-V80P50N20-UpperBounds-00
FORMULA_NAME BridgeAndVehicles-COL-V80P50N20-UpperBounds-01
FORMULA_NAME BridgeAndVehicles-COL-V80P50N20-UpperBounds-02
FORMULA_NAME BridgeAndVehicles-COL-V80P50N20-UpperBounds-03
FORMULA_NAME BridgeAndVehicles-COL-V80P50N20-UpperBounds-04
FORMULA_NAME BridgeAndVehicles-COL-V80P50N20-UpperBounds-05
FORMULA_NAME BridgeAndVehicles-COL-V80P50N20-UpperBounds-06
FORMULA_NAME BridgeAndVehicles-COL-V80P50N20-UpperBounds-07
FORMULA_NAME BridgeAndVehicles-COL-V80P50N20-UpperBounds-08
FORMULA_NAME BridgeAndVehicles-COL-V80P50N20-UpperBounds-09
FORMULA_NAME BridgeAndVehicles-COL-V80P50N20-UpperBounds-10
FORMULA_NAME BridgeAndVehicles-COL-V80P50N20-UpperBounds-11
FORMULA_NAME BridgeAndVehicles-COL-V80P50N20-UpperBounds-12
FORMULA_NAME BridgeAndVehicles-COL-V80P50N20-UpperBounds-13
FORMULA_NAME BridgeAndVehicles-COL-V80P50N20-UpperBounds-14
FORMULA_NAME BridgeAndVehicles-COL-V80P50N20-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1717219396921

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BridgeAndVehicles-COL-V80P50N20
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 05:23:18] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2024-06-01 05:23:18] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 05:23:18] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2024-06-01 05:23:18] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-06-01 05:23:18] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 517 ms
[2024-06-01 05:23:18] [INFO ] Imported 15 HL places and 11 HL transitions for a total of 198 PT places and 551698.0 transition bindings in 17 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 5 ms.
Reduction of identical properties reduced properties to check from 16 to 10
[2024-06-01 05:23:18] [INFO ] Built PT skeleton of HLPN with 15 places and 11 transitions 56 arcs in 4 ms.
[2024-06-01 05:23:18] [INFO ] Skeletonized 10 HLPN properties in 0 ms.
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce redundant transitions removed 1 transitions.
// Phase 1: matrix 10 rows 12 cols
[2024-06-01 05:23:18] [INFO ] Computed 4 invariants in 6 ms
Current structural bounds on expressions (after Invariants on skeleton) : Max Seen:[0, 1, 0, 80, 50, 0, 80, 0, 0, 0] Max Struct:[50, 1, 80, 80, 50, 80, 80, 50, 1, 80]
FORMULA BridgeAndVehicles-COL-V80P50N20-UpperBounds-07 80 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V80P50N20-UpperBounds-12 50 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V80P50N20-UpperBounds-05 50 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V80P50N20-UpperBounds-04 80 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V80P50N20-UpperBounds-11 80 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V80P50N20-UpperBounds-03 80 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V80P50N20-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V80P50N20-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V80P50N20-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
[2024-06-01 05:23:19] [INFO ] Invariant cache hit.
[2024-06-01 05:23:19] [INFO ] [Real]Absence check using 4 positive place invariants in 3 ms returned sat
[2024-06-01 05:23:19] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2024-06-01 05:23:19] [INFO ] Computed and/alt/rep : 6/9/6 causal constraints (skipped 0 transitions) in 3 ms.
[2024-06-01 05:23:19] [INFO ] Added : 1 causal constraints over 1 iterations in 15 ms. Result :sat
Minimization took 8 ms.
[2024-06-01 05:23:19] [INFO ] [Real]Absence check using 4 positive place invariants in 3 ms returned sat
[2024-06-01 05:23:19] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2024-06-01 05:23:19] [INFO ] Computed and/alt/rep : 6/9/6 causal constraints (skipped 0 transitions) in 2 ms.
[2024-06-01 05:23:19] [INFO ] Added : 2 causal constraints over 1 iterations in 7 ms. Result :sat
Minimization took 3 ms.
[2024-06-01 05:23:19] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2024-06-01 05:23:19] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2024-06-01 05:23:19] [INFO ] Computed and/alt/rep : 6/9/6 causal constraints (skipped 0 transitions) in 2 ms.
[2024-06-01 05:23:19] [INFO ] Added : 2 causal constraints over 1 iterations in 8 ms. Result :sat
Minimization took 2 ms.
[2024-06-01 05:23:19] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2024-06-01 05:23:19] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2024-06-01 05:23:19] [INFO ] Computed and/alt/rep : 6/9/6 causal constraints (skipped 0 transitions) in 3 ms.
[2024-06-01 05:23:19] [INFO ] Added : 1 causal constraints over 1 iterations in 8 ms. Result :sat
Minimization took 2 ms.
[2024-06-01 05:23:19] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-06-01 05:23:19] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2024-06-01 05:23:19] [INFO ] Computed and/alt/rep : 6/9/6 causal constraints (skipped 0 transitions) in 1 ms.
[2024-06-01 05:23:19] [INFO ] Added : 1 causal constraints over 1 iterations in 6 ms. Result :sat
Minimization took 3 ms.
[2024-06-01 05:23:19] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 05:23:19] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-06-01 05:23:19] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2024-06-01 05:23:19] [INFO ] Computed and/alt/rep : 6/9/6 causal constraints (skipped 0 transitions) in 0 ms.
[2024-06-01 05:23:19] [INFO ] Added : 1 causal constraints over 1 iterations in 4 ms. Result :sat
Minimization took 2 ms.
[2024-06-01 05:23:19] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2024-06-01 05:23:19] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2024-06-01 05:23:19] [INFO ] Computed and/alt/rep : 6/9/6 causal constraints (skipped 0 transitions) in 1 ms.
[2024-06-01 05:23:19] [INFO ] Added : 0 causal constraints over 0 iterations in 3 ms. Result :sat
Minimization took 2 ms.
Current structural bounds on expressions (after SMT on skeleton) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[50, 80, 80, 50, 1, 80]
Arc [1:1*[(MOD (ADD $cA 1) 81)]] contains successor/predecessor on variables of sort voitureA
Arc [6:1*[(MOD (ADD (MOD (MINUS $cB 1) 81) 81) 81)]] contains successor/predecessor on variables of sort voitureB
Arc [13:1*[(MOD (ADD $cpt 1) 21)]] contains successor/predecessor on variables of sort compteur
Arc [14:1*[(MOD (ADD $s 1) 2)]] contains successor/predecessor on variables of sort sens
[2024-06-01 05:23:19] [INFO ] Unfolded HLPN to a Petri net with 198 places and 3728 transitions 28830 arcs in 138 ms.
[2024-06-01 05:23:19] [INFO ] Unfolded 6 HLPN properties in 0 ms.
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[50, 80, 80, 50, 1, 80]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[50, 80, 80, 50, 1, 80]
[2024-06-01 05:23:19] [INFO ] Flow matrix only has 410 transitions (discarded 3318 similar events)
// Phase 1: matrix 410 rows 198 cols
[2024-06-01 05:23:19] [INFO ] Computed 7 invariants in 40 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[50, 80, 80, 50, 1, 80]
RANDOM walk for 10000 steps (14 resets) in 409 ms. (24 steps per ms)
FORMULA BridgeAndVehicles-COL-V80P50N20-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BridgeAndVehicles-COL-V80P50N20-UpperBounds-06 80 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BridgeAndVehicles-COL-V80P50N20-UpperBounds-02 80 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BridgeAndVehicles-COL-V80P50N20-UpperBounds-15 80 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 30001 steps (16 resets) in 228 ms. (131 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[20, 20] Max Struct:[50, 50]
[2024-06-01 05:23:20] [INFO ] Flow matrix only has 410 transitions (discarded 3318 similar events)
[2024-06-01 05:23:20] [INFO ] Invariant cache hit.
[2024-06-01 05:23:20] [INFO ] [Real]Absence check using 7 positive place invariants in 9 ms returned sat
[2024-06-01 05:23:20] [INFO ] [Real]Absence check using state equation in 140 ms returned sat
[2024-06-01 05:23:20] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-06-01 05:23:20] [INFO ] [Real]Added 42 Read/Feed constraints in 58 ms returned sat
[2024-06-01 05:23:20] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 05:23:20] [INFO ] [Nat]Absence check using 7 positive place invariants in 3 ms returned sat
[2024-06-01 05:23:20] [INFO ] [Nat]Absence check using state equation in 75 ms returned sat
[2024-06-01 05:23:20] [INFO ] [Nat]Added 42 Read/Feed constraints in 76 ms returned sat
[2024-06-01 05:23:21] [INFO ] Computed and/alt/rep : 180/358/180 causal constraints (skipped 227 transitions) in 209 ms.
[2024-06-01 05:23:22] [INFO ] Deduced a trap composed of 5 places in 491 ms of which 23 ms to minimize.
[2024-06-01 05:23:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 565 ms
[2024-06-01 05:23:22] [INFO ] Added : 3 causal constraints over 3 iterations in 1070 ms. Result :sat
Minimization took 240 ms.
[2024-06-01 05:23:22] [INFO ] [Real]Absence check using 7 positive place invariants in 5 ms returned sat
[2024-06-01 05:23:22] [INFO ] [Real]Absence check using state equation in 123 ms returned sat
[2024-06-01 05:23:22] [INFO ] [Real]Added 42 Read/Feed constraints in 28 ms returned sat
[2024-06-01 05:23:22] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 05:23:22] [INFO ] [Nat]Absence check using 7 positive place invariants in 5 ms returned sat
[2024-06-01 05:23:22] [INFO ] [Nat]Absence check using state equation in 108 ms returned sat
[2024-06-01 05:23:22] [INFO ] [Nat]Added 42 Read/Feed constraints in 49 ms returned sat
[2024-06-01 05:23:23] [INFO ] Computed and/alt/rep : 180/358/180 causal constraints (skipped 227 transitions) in 287 ms.
[2024-06-01 05:23:23] [INFO ] Added : 21 causal constraints over 5 iterations in 633 ms. Result :sat
Minimization took 502 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[20, 20] Max Struct:[50, 50]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[20, 20] Max Struct:[50, 50]
Support contains 2 out of 198 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 198/198 places, 3728/3728 transitions.
Graph (complete) has 1962 edges and 198 vertex of which 196 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.36 ms
Discarding 2 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 914 ms. Remains 196 /198 variables (removed 2) and now considering 3728/3728 (removed 0) transitions.
Running 3725 sub problems to find dead transitions.
[2024-06-01 05:23:25] [INFO ] Flow matrix only has 410 transitions (discarded 3318 similar events)
// Phase 1: matrix 410 rows 196 cols
[2024-06-01 05:23:25] [INFO ] Computed 5 invariants in 11 ms
[2024-06-01 05:23:25] [INFO ] State equation strengthened by 42 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/196 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 3725 unsolved
[2024-06-01 05:24:29] [INFO ] Deduced a trap composed of 5 places in 472 ms of which 1 ms to minimize.
SMT process timed out in 64699ms, After SMT, problems are : Problem set: 0 solved, 3725 unsolved
Search for dead transitions found 0 dead transitions in 64773ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 65728 ms. Remains : 196/198 places, 3728/3728 transitions.
[2024-06-01 05:24:29] [INFO ] Flow matrix only has 410 transitions (discarded 3318 similar events)
[2024-06-01 05:24:29] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[20, 20] Max Struct:[50, 50]
RANDOM walk for 1000000 steps (1455 resets) in 10791 ms. (92 steps per ms)
BEST_FIRST walk for 2000001 steps (1038 resets) in 7753 ms. (257 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[20, 20] Max Struct:[50, 50]
[2024-06-01 05:24:48] [INFO ] Flow matrix only has 410 transitions (discarded 3318 similar events)
[2024-06-01 05:24:48] [INFO ] Invariant cache hit.
[2024-06-01 05:24:48] [INFO ] [Real]Absence check using 5 positive place invariants in 4 ms returned sat
[2024-06-01 05:24:48] [INFO ] [Real]Absence check using state equation in 91 ms returned sat
[2024-06-01 05:24:48] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 05:24:48] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2024-06-01 05:24:48] [INFO ] [Nat]Absence check using state equation in 65 ms returned sat
[2024-06-01 05:24:48] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-06-01 05:24:48] [INFO ] [Nat]Added 42 Read/Feed constraints in 50 ms returned sat
[2024-06-01 05:24:49] [INFO ] Deduced a trap composed of 5 places in 518 ms of which 2 ms to minimize.
[2024-06-01 05:24:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 564 ms
[2024-06-01 05:24:49] [INFO ] Computed and/alt/rep : 180/358/180 causal constraints (skipped 227 transitions) in 147 ms.
[2024-06-01 05:24:49] [INFO ] Added : 8 causal constraints over 6 iterations in 440 ms. Result :sat
Minimization took 445 ms.
[2024-06-01 05:24:50] [INFO ] [Real]Absence check using 5 positive place invariants in 4 ms returned sat
[2024-06-01 05:24:50] [INFO ] [Real]Absence check using state equation in 83 ms returned sat
[2024-06-01 05:24:50] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 05:24:50] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2024-06-01 05:24:50] [INFO ] [Nat]Absence check using state equation in 73 ms returned sat
[2024-06-01 05:24:50] [INFO ] [Nat]Added 42 Read/Feed constraints in 35 ms returned sat
[2024-06-01 05:24:50] [INFO ] Computed and/alt/rep : 180/358/180 causal constraints (skipped 227 transitions) in 118 ms.
[2024-06-01 05:24:50] [INFO ] Added : 21 causal constraints over 5 iterations in 423 ms. Result :sat
Minimization took 303 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[20, 20] Max Struct:[50, 50]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[20, 20] Max Struct:[50, 50]
Support contains 2 out of 196 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 196/196 places, 3728/3728 transitions.
Applied a total of 0 rules in 579 ms. Remains 196 /196 variables (removed 0) and now considering 3728/3728 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 579 ms. Remains : 196/196 places, 3728/3728 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 196/196 places, 3728/3728 transitions.
Applied a total of 0 rules in 474 ms. Remains 196 /196 variables (removed 0) and now considering 3728/3728 (removed 0) transitions.
[2024-06-01 05:24:53] [INFO ] Flow matrix only has 410 transitions (discarded 3318 similar events)
[2024-06-01 05:24:53] [INFO ] Invariant cache hit.
[2024-06-01 05:24:54] [INFO ] Implicit Places using invariants in 697 ms returned []
[2024-06-01 05:24:54] [INFO ] Flow matrix only has 410 transitions (discarded 3318 similar events)
[2024-06-01 05:24:54] [INFO ] Invariant cache hit.
[2024-06-01 05:24:54] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-06-01 05:24:56] [INFO ] Implicit Places using invariants and state equation in 2178 ms returned [83, 167]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 2892 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 194/196 places, 3728/3728 transitions.
Applied a total of 0 rules in 762 ms. Remains 194 /194 variables (removed 0) and now considering 3728/3728 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 4133 ms. Remains : 194/196 places, 3728/3728 transitions.
[2024-06-01 05:24:57] [INFO ] Flow matrix only has 410 transitions (discarded 3318 similar events)
// Phase 1: matrix 410 rows 194 cols
[2024-06-01 05:24:57] [INFO ] Computed 5 invariants in 6 ms
Current structural bounds on expressions (after invariants) : Max Seen:[20, 20] Max Struct:[50, 50]
RANDOM walk for 1000000 steps (1455 resets) in 9664 ms. (103 steps per ms)
BEST_FIRST walk for 2000002 steps (1038 resets) in 7287 ms. (274 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[20, 20] Max Struct:[50, 50]
[2024-06-01 05:25:14] [INFO ] Flow matrix only has 410 transitions (discarded 3318 similar events)
[2024-06-01 05:25:14] [INFO ] Invariant cache hit.
[2024-06-01 05:25:14] [INFO ] [Real]Absence check using 5 positive place invariants in 4 ms returned sat
[2024-06-01 05:25:14] [INFO ] [Real]Absence check using state equation in 86 ms returned sat
[2024-06-01 05:25:14] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-06-01 05:25:14] [INFO ] [Real]Added 42 Read/Feed constraints in 32 ms returned sat
[2024-06-01 05:25:14] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 05:25:14] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2024-06-01 05:25:14] [INFO ] [Nat]Absence check using state equation in 84 ms returned sat
[2024-06-01 05:25:14] [INFO ] [Nat]Added 42 Read/Feed constraints in 60 ms returned sat
[2024-06-01 05:25:14] [INFO ] Computed and/alt/rep : 180/358/180 causal constraints (skipped 227 transitions) in 109 ms.
[2024-06-01 05:25:15] [INFO ] Added : 5 causal constraints over 4 iterations in 536 ms. Result :sat
Minimization took 278 ms.
[2024-06-01 05:25:15] [INFO ] [Real]Absence check using 5 positive place invariants in 4 ms returned sat
[2024-06-01 05:25:15] [INFO ] [Real]Absence check using state equation in 102 ms returned sat
[2024-06-01 05:25:15] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 05:25:15] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2024-06-01 05:25:15] [INFO ] [Nat]Absence check using state equation in 95 ms returned sat
[2024-06-01 05:25:15] [INFO ] [Nat]Added 42 Read/Feed constraints in 57 ms returned sat
[2024-06-01 05:25:16] [INFO ] Computed and/alt/rep : 180/358/180 causal constraints (skipped 227 transitions) in 111 ms.
[2024-06-01 05:25:16] [INFO ] Added : 20 causal constraints over 5 iterations in 347 ms. Result :sat
Minimization took 444 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[20, 20] Max Struct:[50, 50]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[20, 20] Max Struct:[50, 50]
Support contains 2 out of 194 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 194/194 places, 3728/3728 transitions.
Applied a total of 0 rules in 491 ms. Remains 194 /194 variables (removed 0) and now considering 3728/3728 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 493 ms. Remains : 194/194 places, 3728/3728 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 194/194 places, 3728/3728 transitions.
Applied a total of 0 rules in 479 ms. Remains 194 /194 variables (removed 0) and now considering 3728/3728 (removed 0) transitions.
[2024-06-01 05:25:18] [INFO ] Flow matrix only has 410 transitions (discarded 3318 similar events)
[2024-06-01 05:25:18] [INFO ] Invariant cache hit.
[2024-06-01 05:25:19] [INFO ] Implicit Places using invariants in 503 ms returned []
[2024-06-01 05:25:19] [INFO ] Flow matrix only has 410 transitions (discarded 3318 similar events)
[2024-06-01 05:25:19] [INFO ] Invariant cache hit.
[2024-06-01 05:25:19] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-06-01 05:25:21] [INFO ] Implicit Places using invariants and state equation in 2435 ms returned []
Implicit Place search using SMT with State Equation took 2940 ms to find 0 implicit places.
[2024-06-01 05:25:21] [INFO ] Redundant transitions in 293 ms returned []
Running 3725 sub problems to find dead transitions.
[2024-06-01 05:25:22] [INFO ] Flow matrix only has 410 transitions (discarded 3318 similar events)
[2024-06-01 05:25:22] [INFO ] Invariant cache hit.
[2024-06-01 05:25:22] [INFO ] State equation strengthened by 42 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/194 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 3725 unsolved
[2024-06-01 05:26:25] [INFO ] Deduced a trap composed of 5 places in 462 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 194/604 variables, and 6 constraints, problems are : Problem set: 0 solved, 3725 unsolved in 30112 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/194 constraints, ReadFeed: 0/42 constraints, PredecessorRefiner: 3725/3725 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3725 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/194 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 3725 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/194 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 3725 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 194/604 variables, and 6 constraints, problems are : Problem set: 0 solved, 3725 unsolved in 30073 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/194 constraints, ReadFeed: 0/42 constraints, PredecessorRefiner: 0/3725 constraints, Known Traps: 1/1 constraints]
After SMT, in 104150ms problems are : Problem set: 0 solved, 3725 unsolved
Search for dead transitions found 0 dead transitions in 104196ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 107928 ms. Remains : 194/194 places, 3728/3728 transitions.
RANDOM walk for 40000 steps (56 resets) in 1448 ms. (27 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (17 resets) in 384 ms. (103 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40011 steps (18 resets) in 330 ms. (120 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (20 resets) in 246 ms. (161 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (20 resets) in 255 ms. (156 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 154616 steps, run timeout after 3001 ms. (steps per millisecond=51 ) properties seen :0 out of 4
Probabilistic random walk after 154616 steps, saw 42499 distinct states, run finished after 3003 ms. (steps per millisecond=51 ) properties seen :0
[2024-06-01 05:27:10] [INFO ] Flow matrix only has 410 transitions (discarded 3318 similar events)
[2024-06-01 05:27:10] [INFO ] Invariant cache hit.
[2024-06-01 05:27:10] [INFO ] State equation strengthened by 42 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 1/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 162/165 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/165 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 414/579 variables, 166/170 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/579 variables, 2/172 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/579 variables, 42/214 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/579 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 2/581 variables, 1/215 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/581 variables, 2/217 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 05:27:10] [INFO ] Deduced a trap composed of 5 places in 144 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/581 variables, 1/218 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/581 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 23/604 variables, 23/241 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/604 variables, 1/242 constraints. Problems are: Problem set: 0 solved, 4 unsolved
All remaining problems are real, not stopping.
At refinement iteration 15 (INCLUDED_ONLY) 0/604 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (OVERLAPS) 0/604 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 604/604 variables, and 242 constraints, problems are : Problem set: 0 solved, 4 unsolved in 1201 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 194/194 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 1/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 162/165 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/165 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 414/579 variables, 166/170 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/579 variables, 2/172 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/579 variables, 42/214 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/579 variables, 4/218 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/579 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 2/581 variables, 1/219 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/581 variables, 2/221 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/581 variables, 1/222 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/581 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 23/604 variables, 23/245 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/604 variables, 1/246 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/604 variables, 0/246 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (OVERLAPS) 0/604 variables, 0/246 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 604/604 variables, and 246 constraints, problems are : Problem set: 0 solved, 4 unsolved in 3468 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 194/194 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 1/1 constraints]
After SMT, in 4705ms problems are : Problem set: 0 solved, 4 unsolved
Parikh walk visited 0 properties in 1509 ms.
Support contains 2 out of 194 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 194/194 places, 3728/3728 transitions.
Applied a total of 0 rules in 449 ms. Remains 194 /194 variables (removed 0) and now considering 3728/3728 (removed 0) transitions.
Running 3725 sub problems to find dead transitions.
[2024-06-01 05:27:16] [INFO ] Flow matrix only has 410 transitions (discarded 3318 similar events)
[2024-06-01 05:27:16] [INFO ] Invariant cache hit.
[2024-06-01 05:27:16] [INFO ] State equation strengthened by 42 read => feed constraints.
Usage: pnml2lts-sym [-gvqh] [--order=]
[--mu-opt] [--saturation=]
[--sat-granularity=] [--save-sat-levels]
[--guidance=] [-d|--deadlock]
[--action=] [-i|--invariant=STRING] [-n|--no-exit]
[--trace=] [--type=]
[--mu=.mu] [--ctl-star=.ctl]
[--ctl=.ctl] [--ltl=.ltl] [--dot=STRING]
[--save-levels=STRING] [--pg-solve] [--attr=]
[--saturating-attractor] [--write-strategy=.spg]
[--check-strategy] [--interactive-play] [--player]
[--pg-write=.spg] [--no-matrix] [--noack=<1|2>]
[--edge-label=] [--labels] [-m|--matrix]
[--mucalc=.mcf|] [-c|--cache]
[--allow-undefined-edges] [--allow-undefined-values]
[-p|--por= (default: heur)]
[--weak=[valmari] (default: uses stronger left-commutativity)]
[--leap] [-r|--regroup=<(T,)+>] [--sloan-w1=] [--sloan-w2=]
[--cw-max-cols=] [--cw-max-rows=] [--col-ins=<(C.C',)+>]
[--mh-timeout=] [--row-perm=<(R,)+>] [--col-perm=<(C,)+>]
[--graph-metrics] [--regroup-exit] [--regroup-time]
[-g|--pins-guards] [--vset=] [--ldd32-step=]
[--ldd32-cache=] [--ldd-step=] [--ldd-cache=]
[--cache-ratio=] [--max-increase=]
[--min-free-nodes=] [--fdd-bits=]
[--fdd-reorder=]
[--vset-cache-diff=] [--no-soundness-check] [--precise]
[--next-union] [--peak-nodes] [--maxsum=]
[--block-size=] [--cluster-size=] [-v] [-q]
[--debug=] [--stats] [--where] [--when]
[--timeout=INT] [--version] [-h|--help] [--usage]
[OPTIONS] []
Could not compute solution for formula : BridgeAndVehicles-COL-V80P50N20-UpperBounds-00
Could not compute solution for formula : BridgeAndVehicles-COL-V80P50N20-UpperBounds-01
Could not compute solution for formula : BridgeAndVehicles-COL-V80P50N20-UpperBounds-02
Could not compute solution for formula : BridgeAndVehicles-COL-V80P50N20-UpperBounds-03
Could not compute solution for formula : BridgeAndVehicles-COL-V80P50N20-UpperBounds-04
Could not compute solution for formula : BridgeAndVehicles-COL-V80P50N20-UpperBounds-05
Could not compute solution for formula : BridgeAndVehicles-COL-V80P50N20-UpperBounds-06
Could not compute solution for formula : BridgeAndVehicles-COL-V80P50N20-UpperBounds-07
Could not compute solution for formula : BridgeAndVehicles-COL-V80P50N20-UpperBounds-08
Could not compute solution for formula : BridgeAndVehicles-COL-V80P50N20-UpperBounds-09
Could not compute solution for formula : BridgeAndVehicles-COL-V80P50N20-UpperBounds-10
Could not compute solution for formula : BridgeAndVehicles-COL-V80P50N20-UpperBounds-11
Could not compute solution for formula : BridgeAndVehicles-COL-V80P50N20-UpperBounds-12
Could not compute solution for formula : BridgeAndVehicles-COL-V80P50N20-UpperBounds-13
Could not compute solution for formula : BridgeAndVehicles-COL-V80P50N20-UpperBounds-14
Could not compute solution for formula : BridgeAndVehicles-COL-V80P50N20-UpperBounds-15

BK_STOP 1717219660025

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -timeout 360 -rebuildPNML
mcc2024
ub formula name BridgeAndVehicles-COL-V80P50N20-UpperBounds-00
ub formula formula --maxsum=/tmp/645/ub_0_
ub formula name BridgeAndVehicles-COL-V80P50N20-UpperBounds-01
ub formula formula --maxsum=/tmp/645/ub_1_
ub formula name BridgeAndVehicles-COL-V80P50N20-UpperBounds-02
ub formula formula --maxsum=/tmp/645/ub_2_
ub formula name BridgeAndVehicles-COL-V80P50N20-UpperBounds-03
ub formula formula --maxsum=/tmp/645/ub_3_
ub formula name BridgeAndVehicles-COL-V80P50N20-UpperBounds-04
ub formula formula --maxsum=/tmp/645/ub_4_
ub formula name BridgeAndVehicles-COL-V80P50N20-UpperBounds-05
ub formula formula --maxsum=/tmp/645/ub_5_
ub formula name BridgeAndVehicles-COL-V80P50N20-UpperBounds-06
ub formula formula --maxsum=/tmp/645/ub_6_
ub formula name BridgeAndVehicles-COL-V80P50N20-UpperBounds-07
ub formula formula --maxsum=/tmp/645/ub_7_
ub formula name BridgeAndVehicles-COL-V80P50N20-UpperBounds-08
ub formula formula --maxsum=/tmp/645/ub_8_
ub formula name BridgeAndVehicles-COL-V80P50N20-UpperBounds-09
ub formula formula --maxsum=/tmp/645/ub_9_
ub formula name BridgeAndVehicles-COL-V80P50N20-UpperBounds-10
ub formula formula --maxsum=/tmp/645/ub_10_
ub formula name BridgeAndVehicles-COL-V80P50N20-UpperBounds-11
ub formula formula --maxsum=/tmp/645/ub_11_
ub formula name BridgeAndVehicles-COL-V80P50N20-UpperBounds-12
ub formula formula --maxsum=/tmp/645/ub_12_
ub formula name BridgeAndVehicles-COL-V80P50N20-UpperBounds-13
ub formula formula --maxsum=/tmp/645/ub_13_
ub formula name BridgeAndVehicles-COL-V80P50N20-UpperBounds-14
ub formula formula --maxsum=/tmp/645/ub_14_
ub formula name BridgeAndVehicles-COL-V80P50N20-UpperBounds-15
ub formula formula --maxsum=/tmp/645/ub_15_
pnml2lts-sym, ** error **: unknown vector set implementation lddmc

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-COL-V80P50N20"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="ltsminxred"
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 ltsminxred"
echo " Input is BridgeAndVehicles-COL-V80P50N20, 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 r472-tajo-171620398900149"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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