About the Execution of 2023-gold for DoubleExponent-PT-001
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
3791.716 | 3600000.00 | 3664336.00 | 12098.00 | 1 1 1 1 1 1 1 2 1 1 1 1 1 2 1 ? | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2024-input.r153-tall-171631151600326.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool gold2023
Input is DoubleExponent-PT-001, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r153-tall-171631151600326
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 384K
-rw-r--r-- 1 mcc users 5.5K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 53K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 59K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.4K Apr 22 14:41 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 22 14:41 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 22 14:41 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 22 14:41 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.3K Apr 12 03:12 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 72K Apr 12 03:12 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.9K Apr 12 03:11 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 68K Apr 12 03:11 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:41 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:41 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 17K 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 DoubleExponent-PT-001-UpperBounds-00
FORMULA_NAME DoubleExponent-PT-001-UpperBounds-01
FORMULA_NAME DoubleExponent-PT-001-UpperBounds-02
FORMULA_NAME DoubleExponent-PT-001-UpperBounds-03
FORMULA_NAME DoubleExponent-PT-001-UpperBounds-04
FORMULA_NAME DoubleExponent-PT-001-UpperBounds-05
FORMULA_NAME DoubleExponent-PT-001-UpperBounds-06
FORMULA_NAME DoubleExponent-PT-001-UpperBounds-07
FORMULA_NAME DoubleExponent-PT-001-UpperBounds-08
FORMULA_NAME DoubleExponent-PT-001-UpperBounds-09
FORMULA_NAME DoubleExponent-PT-001-UpperBounds-10
FORMULA_NAME DoubleExponent-PT-001-UpperBounds-11
FORMULA_NAME DoubleExponent-PT-001-UpperBounds-12
FORMULA_NAME DoubleExponent-PT-001-UpperBounds-13
FORMULA_NAME DoubleExponent-PT-001-UpperBounds-14
FORMULA_NAME DoubleExponent-PT-001-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1716421741072
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=gold2023
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DoubleExponent-PT-001
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202304061127
[2024-05-22 23:49:02] [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-22 23:49:02] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 23:49:02] [INFO ] Load time of PNML (sax parser for PT used): 27 ms
[2024-05-22 23:49:02] [INFO ] Transformed 57 places.
[2024-05-22 23:49:02] [INFO ] Transformed 48 transitions.
[2024-05-22 23:49:02] [INFO ] Parsed PT model containing 57 places and 48 transitions and 135 arcs in 90 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 6 ms.
// Phase 1: matrix 48 rows 57 cols
[2024-05-22 23:49:02] [INFO ] Computed 9 invariants in 15 ms
Incomplete random walk after 10000 steps, including 334 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 16) seen :20
FORMULA DoubleExponent-PT-001-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DoubleExponent-PT-001-UpperBounds-13 2 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DoubleExponent-PT-001-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DoubleExponent-PT-001-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DoubleExponent-PT-001-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DoubleExponent-PT-001-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DoubleExponent-PT-001-UpperBounds-07 2 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DoubleExponent-PT-001-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DoubleExponent-PT-001-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DoubleExponent-PT-001-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DoubleExponent-PT-001-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DoubleExponent-PT-001-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DoubleExponent-PT-001-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 296 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 3) seen :5
Incomplete Best-First random walk after 10000 steps, including 277 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 3) seen :5
Incomplete Best-First random walk after 10000 steps, including 280 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 3) seen :6
FORMULA DoubleExponent-PT-001-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
[2024-05-22 23:49:03] [INFO ] Invariant cache hit.
[2024-05-22 23:49:03] [INFO ] [Real]Absence check using 4 positive place invariants in 6 ms returned sat
[2024-05-22 23:49:03] [INFO ] [Real]Absence check using 4 positive and 5 generalized place invariants in 2 ms returned unsat
[2024-05-22 23:49:03] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2024-05-22 23:49:03] [INFO ] [Real]Absence check using 4 positive and 5 generalized place invariants in 3 ms returned sat
[2024-05-22 23:49:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-22 23:49:03] [INFO ] [Real]Absence check using state equation in 27 ms returned sat
[2024-05-22 23:49:03] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 23:49:03] [INFO ] [Nat]Absence check using 4 positive place invariants in 7 ms returned sat
[2024-05-22 23:49:03] [INFO ] [Nat]Absence check using 4 positive and 5 generalized place invariants in 1 ms returned sat
[2024-05-22 23:49:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-22 23:49:03] [INFO ] [Nat]Absence check using state equation in 18 ms returned sat
[2024-05-22 23:49:03] [INFO ] Deduced a trap composed of 14 places in 42 ms of which 3 ms to minimize.
[2024-05-22 23:49:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 63 ms
[2024-05-22 23:49:03] [INFO ] Computed and/alt/rep : 47/88/47 causal constraints (skipped 0 transitions) in 11 ms.
[2024-05-22 23:49:03] [INFO ] Deduced a trap composed of 27 places in 85 ms of which 1 ms to minimize.
[2024-05-22 23:49:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 140 ms
[2024-05-22 23:49:03] [INFO ] Added : 45 causal constraints over 9 iterations in 292 ms. Result :sat
Minimization took 26 ms.
Current structural bounds on expressions (after SMT) : [1, -1] Max seen :[1, 4]
FORMULA DoubleExponent-PT-001-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 1 out of 57 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 57/57 places, 48/48 transitions.
Graph (complete) has 87 edges and 57 vertex of which 52 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.1 ms
Discarding 5 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 0 with 14 rules applied. Total rules applied 15 place count 51 transition count 35
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 26 place count 40 transition count 35
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 26 place count 40 transition count 31
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 34 place count 36 transition count 31
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 35 place count 35 transition count 30
Iterating global reduction 2 with 1 rules applied. Total rules applied 36 place count 35 transition count 30
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 60 place count 23 transition count 18
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 62 place count 23 transition count 16
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 64 place count 21 transition count 16
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 3 with 3 rules applied. Total rules applied 67 place count 21 transition count 16
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 68 place count 20 transition count 15
Applied a total of 68 rules in 23 ms. Remains 20 /57 variables (removed 37) and now considering 15/48 (removed 33) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23 ms. Remains : 20/57 places, 15/48 transitions.
// Phase 1: matrix 15 rows 20 cols
[2024-05-22 23:49:03] [INFO ] Computed 5 invariants in 1 ms
Incomplete random walk after 1000000 steps, including 115640 resets, run finished after 695 ms. (steps per millisecond=1438 ) properties (out of 1) seen :4
Incomplete Best-First random walk after 1000000 steps, including 79170 resets, run finished after 445 ms. (steps per millisecond=2247 ) properties (out of 1) seen :4
[2024-05-22 23:49:04] [INFO ] Invariant cache hit.
[2024-05-22 23:49:04] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-05-22 23:49:04] [INFO ] [Real]Absence check using 4 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-22 23:49:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-22 23:49:04] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2024-05-22 23:49:04] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 23:49:05] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-05-22 23:49:05] [INFO ] [Nat]Absence check using 4 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-22 23:49:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-22 23:49:05] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2024-05-22 23:49:05] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-22 23:49:05] [INFO ] [Nat]Added 2 Read/Feed constraints in 1 ms returned sat
[2024-05-22 23:49:05] [INFO ] Deduced a trap composed of 5 places in 20 ms of which 1 ms to minimize.
[2024-05-22 23:49:05] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 2 ms to minimize.
[2024-05-22 23:49:05] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 45 ms
[2024-05-22 23:49:05] [INFO ] Computed and/alt/rep : 14/43/14 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-22 23:49:05] [INFO ] Deduced a trap composed of 10 places in 20 ms of which 1 ms to minimize.
[2024-05-22 23:49:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 25 ms
[2024-05-22 23:49:05] [INFO ] Added : 11 causal constraints over 3 iterations in 37 ms. Result :sat
Minimization took 5 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[4]
Support contains 1 out of 20 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 20/20 places, 15/15 transitions.
Applied a total of 0 rules in 1 ms. Remains 20 /20 variables (removed 0) and now considering 15/15 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 20/20 places, 15/15 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 20/20 places, 15/15 transitions.
Applied a total of 0 rules in 0 ms. Remains 20 /20 variables (removed 0) and now considering 15/15 (removed 0) transitions.
[2024-05-22 23:49:05] [INFO ] Invariant cache hit.
[2024-05-22 23:49:05] [INFO ] Implicit Places using invariants in 38 ms returned [6, 11]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 41 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 18/20 places, 15/15 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 17 transition count 14
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 17 transition count 14
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 17 transition count 13
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 4 place count 16 transition count 13
Applied a total of 4 rules in 3 ms. Remains 16 /18 variables (removed 2) and now considering 13/15 (removed 2) transitions.
// Phase 1: matrix 13 rows 16 cols
[2024-05-22 23:49:05] [INFO ] Computed 4 invariants in 2 ms
[2024-05-22 23:49:05] [INFO ] Implicit Places using invariants in 36 ms returned []
[2024-05-22 23:49:05] [INFO ] Invariant cache hit.
[2024-05-22 23:49:05] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-22 23:49:05] [INFO ] Implicit Places using invariants and state equation in 35 ms returned []
Implicit Place search using SMT with State Equation took 73 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 16/20 places, 13/15 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 120 ms. Remains : 16/20 places, 13/15 transitions.
[2024-05-22 23:49:05] [INFO ] Invariant cache hit.
Incomplete random walk after 1000000 steps, including 126991 resets, run finished after 425 ms. (steps per millisecond=2352 ) properties (out of 1) seen :10
Incomplete Best-First random walk after 1000001 steps, including 84276 resets, run finished after 309 ms. (steps per millisecond=3236 ) properties (out of 1) seen :10
[2024-05-22 23:49:05] [INFO ] Invariant cache hit.
[2024-05-22 23:49:05] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-05-22 23:49:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-22 23:49:06] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2024-05-22 23:49:06] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 23:49:06] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-05-22 23:49:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-22 23:49:06] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2024-05-22 23:49:06] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-22 23:49:06] [INFO ] [Nat]Added 2 Read/Feed constraints in 1 ms returned sat
[2024-05-22 23:49:06] [INFO ] Deduced a trap composed of 8 places in 25 ms of which 1 ms to minimize.
[2024-05-22 23:49:06] [INFO ] Deduced a trap composed of 7 places in 28 ms of which 4 ms to minimize.
[2024-05-22 23:49:06] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 2 ms to minimize.
[2024-05-22 23:49:06] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 107 ms
[2024-05-22 23:49:06] [INFO ] Computed and/alt/rep : 12/30/12 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-22 23:49:06] [INFO ] Deduced a trap composed of 6 places in 22 ms of which 0 ms to minimize.
[2024-05-22 23:49:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 24 ms
[2024-05-22 23:49:06] [INFO ] Added : 11 causal constraints over 3 iterations in 34 ms. Result :sat
Minimization took 5 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[10]
Support contains 1 out of 16 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 16/16 places, 13/13 transitions.
Applied a total of 0 rules in 1 ms. Remains 16 /16 variables (removed 0) and now considering 13/13 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 16/16 places, 13/13 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 16/16 places, 13/13 transitions.
Applied a total of 0 rules in 1 ms. Remains 16 /16 variables (removed 0) and now considering 13/13 (removed 0) transitions.
[2024-05-22 23:49:06] [INFO ] Invariant cache hit.
[2024-05-22 23:49:06] [INFO ] Implicit Places using invariants in 65 ms returned []
[2024-05-22 23:49:06] [INFO ] Invariant cache hit.
[2024-05-22 23:49:06] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-22 23:49:06] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 99 ms to find 0 implicit places.
[2024-05-22 23:49:06] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-22 23:49:06] [INFO ] Invariant cache hit.
[2024-05-22 23:49:06] [INFO ] Dead Transitions using invariants and state equation in 42 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 148 ms. Remains : 16/16 places, 13/13 transitions.
[2024-05-22 23:49:06] [INFO ] Invariant cache hit.
Incomplete random walk after 1000000 steps, including 126875 resets, run finished after 412 ms. (steps per millisecond=2427 ) properties (out of 1) seen :10
Incomplete Best-First random walk after 1000000 steps, including 84288 resets, run finished after 299 ms. (steps per millisecond=3344 ) properties (out of 1) seen :8
[2024-05-22 23:49:07] [INFO ] Invariant cache hit.
[2024-05-22 23:49:07] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-05-22 23:49:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-22 23:49:07] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2024-05-22 23:49:07] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 23:49:07] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-05-22 23:49:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-22 23:49:07] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2024-05-22 23:49:07] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-22 23:49:07] [INFO ] [Nat]Added 2 Read/Feed constraints in 1 ms returned sat
[2024-05-22 23:49:07] [INFO ] Deduced a trap composed of 8 places in 23 ms of which 1 ms to minimize.
[2024-05-22 23:49:07] [INFO ] Deduced a trap composed of 7 places in 26 ms of which 0 ms to minimize.
[2024-05-22 23:49:07] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
[2024-05-22 23:49:07] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 77 ms
[2024-05-22 23:49:07] [INFO ] Computed and/alt/rep : 12/30/12 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-22 23:49:07] [INFO ] Deduced a trap composed of 6 places in 20 ms of which 0 ms to minimize.
[2024-05-22 23:49:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 23 ms
[2024-05-22 23:49:07] [INFO ] Added : 11 causal constraints over 3 iterations in 38 ms. Result :sat
Minimization took 5 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[10]
Support contains 1 out of 16 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 16/16 places, 13/13 transitions.
Applied a total of 0 rules in 1 ms. Remains 16 /16 variables (removed 0) and now considering 13/13 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 16/16 places, 13/13 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 16/16 places, 13/13 transitions.
Applied a total of 0 rules in 1 ms. Remains 16 /16 variables (removed 0) and now considering 13/13 (removed 0) transitions.
[2024-05-22 23:49:07] [INFO ] Invariant cache hit.
[2024-05-22 23:49:07] [INFO ] Implicit Places using invariants in 42 ms returned []
[2024-05-22 23:49:07] [INFO ] Invariant cache hit.
[2024-05-22 23:49:07] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-22 23:49:07] [INFO ] Implicit Places using invariants and state equation in 38 ms returned []
Implicit Place search using SMT with State Equation took 82 ms to find 0 implicit places.
[2024-05-22 23:49:07] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-22 23:49:07] [INFO ] Invariant cache hit.
[2024-05-22 23:49:07] [INFO ] Dead Transitions using invariants and state equation in 24 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 113 ms. Remains : 16/16 places, 13/13 transitions.
Starting property specific reduction for DoubleExponent-PT-001-UpperBounds-15
[2024-05-22 23:49:07] [INFO ] Invariant cache hit.
Incomplete random walk after 10000 steps, including 1275 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :7
Incomplete Best-First random walk after 10000 steps, including 858 resets, run finished after 4 ms. (steps per millisecond=2500 ) properties (out of 1) seen :6
[2024-05-22 23:49:07] [INFO ] Invariant cache hit.
[2024-05-22 23:49:07] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2024-05-22 23:49:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-22 23:49:07] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2024-05-22 23:49:07] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 23:49:07] [INFO ] [Nat]Absence check using 4 positive place invariants in 3 ms returned sat
[2024-05-22 23:49:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-22 23:49:07] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2024-05-22 23:49:07] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-22 23:49:07] [INFO ] [Nat]Added 2 Read/Feed constraints in 1 ms returned sat
[2024-05-22 23:49:07] [INFO ] Deduced a trap composed of 8 places in 20 ms of which 0 ms to minimize.
[2024-05-22 23:49:07] [INFO ] Deduced a trap composed of 7 places in 17 ms of which 0 ms to minimize.
[2024-05-22 23:49:07] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 47 ms
[2024-05-22 23:49:07] [INFO ] Computed and/alt/rep : 12/30/12 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-22 23:49:07] [INFO ] Deduced a trap composed of 6 places in 16 ms of which 0 ms to minimize.
[2024-05-22 23:49:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 20 ms
[2024-05-22 23:49:07] [INFO ] Added : 11 causal constraints over 3 iterations in 32 ms. Result :sat
Minimization took 7 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[7]
Support contains 1 out of 16 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 16/16 places, 13/13 transitions.
Applied a total of 0 rules in 1 ms. Remains 16 /16 variables (removed 0) and now considering 13/13 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 16/16 places, 13/13 transitions.
[2024-05-22 23:49:07] [INFO ] Invariant cache hit.
Incomplete random walk after 1000000 steps, including 126810 resets, run finished after 404 ms. (steps per millisecond=2475 ) properties (out of 1) seen :10
Incomplete Best-First random walk after 1000000 steps, including 84033 resets, run finished after 307 ms. (steps per millisecond=3257 ) properties (out of 1) seen :10
[2024-05-22 23:49:08] [INFO ] Invariant cache hit.
[2024-05-22 23:49:08] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-05-22 23:49:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-22 23:49:08] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2024-05-22 23:49:08] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 23:49:08] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-05-22 23:49:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-22 23:49:08] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2024-05-22 23:49:08] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-22 23:49:08] [INFO ] [Nat]Added 2 Read/Feed constraints in 2 ms returned sat
[2024-05-22 23:49:08] [INFO ] Deduced a trap composed of 8 places in 30 ms of which 0 ms to minimize.
[2024-05-22 23:49:08] [INFO ] Deduced a trap composed of 7 places in 21 ms of which 0 ms to minimize.
[2024-05-22 23:49:08] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 1 ms to minimize.
[2024-05-22 23:49:08] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 88 ms
[2024-05-22 23:49:08] [INFO ] Computed and/alt/rep : 12/30/12 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-22 23:49:08] [INFO ] Deduced a trap composed of 6 places in 27 ms of which 1 ms to minimize.
[2024-05-22 23:49:08] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 33 ms
[2024-05-22 23:49:08] [INFO ] Added : 11 causal constraints over 3 iterations in 50 ms. Result :sat
Minimization took 8 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[10]
Support contains 1 out of 16 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 16/16 places, 13/13 transitions.
Applied a total of 0 rules in 1 ms. Remains 16 /16 variables (removed 0) and now considering 13/13 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 16/16 places, 13/13 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 16/16 places, 13/13 transitions.
Applied a total of 0 rules in 1 ms. Remains 16 /16 variables (removed 0) and now considering 13/13 (removed 0) transitions.
[2024-05-22 23:49:08] [INFO ] Invariant cache hit.
[2024-05-22 23:49:08] [INFO ] Implicit Places using invariants in 30 ms returned []
[2024-05-22 23:49:08] [INFO ] Invariant cache hit.
[2024-05-22 23:49:08] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-22 23:49:08] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 63 ms to find 0 implicit places.
[2024-05-22 23:49:08] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-22 23:49:08] [INFO ] Invariant cache hit.
[2024-05-22 23:49:08] [INFO ] Dead Transitions using invariants and state equation in 24 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 97 ms. Remains : 16/16 places, 13/13 transitions.
[2024-05-22 23:49:08] [INFO ] Invariant cache hit.
Incomplete random walk after 1000000 steps, including 126904 resets, run finished after 389 ms. (steps per millisecond=2570 ) properties (out of 1) seen :10
Incomplete Best-First random walk after 1000000 steps, including 84073 resets, run finished after 293 ms. (steps per millisecond=3412 ) properties (out of 1) seen :10
[2024-05-22 23:49:09] [INFO ] Invariant cache hit.
[2024-05-22 23:49:09] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-05-22 23:49:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-22 23:49:09] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2024-05-22 23:49:09] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 23:49:09] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-05-22 23:49:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-22 23:49:09] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2024-05-22 23:49:09] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-22 23:49:09] [INFO ] [Nat]Added 2 Read/Feed constraints in 1 ms returned sat
[2024-05-22 23:49:09] [INFO ] Deduced a trap composed of 8 places in 26 ms of which 1 ms to minimize.
[2024-05-22 23:49:09] [INFO ] Deduced a trap composed of 7 places in 22 ms of which 1 ms to minimize.
[2024-05-22 23:49:09] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 0 ms to minimize.
[2024-05-22 23:49:09] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 72 ms
[2024-05-22 23:49:09] [INFO ] Computed and/alt/rep : 12/30/12 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-22 23:49:09] [INFO ] Deduced a trap composed of 6 places in 26 ms of which 1 ms to minimize.
[2024-05-22 23:49:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 31 ms
[2024-05-22 23:49:09] [INFO ] Added : 11 causal constraints over 3 iterations in 44 ms. Result :sat
Minimization took 6 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[10]
Support contains 1 out of 16 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 16/16 places, 13/13 transitions.
Applied a total of 0 rules in 1 ms. Remains 16 /16 variables (removed 0) and now considering 13/13 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 16/16 places, 13/13 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 16/16 places, 13/13 transitions.
Applied a total of 0 rules in 1 ms. Remains 16 /16 variables (removed 0) and now considering 13/13 (removed 0) transitions.
[2024-05-22 23:49:09] [INFO ] Invariant cache hit.
[2024-05-22 23:49:09] [INFO ] Implicit Places using invariants in 30 ms returned []
[2024-05-22 23:49:09] [INFO ] Invariant cache hit.
[2024-05-22 23:49:09] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-22 23:49:09] [INFO ] Implicit Places using invariants and state equation in 34 ms returned []
Implicit Place search using SMT with State Equation took 66 ms to find 0 implicit places.
[2024-05-22 23:49:09] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-22 23:49:09] [INFO ] Invariant cache hit.
[2024-05-22 23:49:09] [INFO ] Dead Transitions using invariants and state equation in 26 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 101 ms. Remains : 16/16 places, 13/13 transitions.
Ending property specific reduction for DoubleExponent-PT-001-UpperBounds-15 in 2237 ms.
[2024-05-22 23:49:09] [INFO ] Flatten gal took : 17 ms
[2024-05-22 23:49:09] [INFO ] Applying decomposition
[2024-05-22 23:49:09] [INFO ] Flatten gal took : 4 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph17599213515949899395.txt' '-o' '/tmp/graph17599213515949899395.bin' '-w' '/tmp/graph17599213515949899395.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph17599213515949899395.bin' '-l' '-1' '-v' '-w' '/tmp/graph17599213515949899395.weights' '-q' '0' '-e' '0.001'
[2024-05-22 23:49:09] [INFO ] Decomposing Gal with order
[2024-05-22 23:49:09] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 23:49:09] [INFO ] Removed a total of 1 redundant transitions.
[2024-05-22 23:49:09] [INFO ] Flatten gal took : 25 ms
[2024-05-22 23:49:09] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2024-05-22 23:49:09] [INFO ] Time to serialize gal into /tmp/UpperBounds12683807988003268625.gal : 2 ms
[2024-05-22 23:49:09] [INFO ] Time to serialize properties into /tmp/UpperBounds9518228713336808837.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.202304061127/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds12683807988003268625.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds9518228713336808837.prop' '--nowitness'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...284
Loading property file /tmp/UpperBounds9518228713336808837.prop.
Detected timeout of ITS tools.
[2024-05-23 00:09:12] [INFO ] Flatten gal took : 3 ms
[2024-05-23 00:09:12] [INFO ] Time to serialize gal into /tmp/UpperBounds3395865962816912691.gal : 1 ms
[2024-05-23 00:09:12] [INFO ] Time to serialize properties into /tmp/UpperBounds10446605305153814969.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.202304061127/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds3395865962816912691.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds10446605305153814969.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.202304061127/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...305
Loading property file /tmp/UpperBounds10446605305153814969.prop.
Detected timeout of ITS tools.
[2024-05-23 00:29:14] [INFO ] Flatten gal took : 2 ms
[2024-05-23 00:29:14] [INFO ] Input system was already deterministic with 13 transitions.
[2024-05-23 00:29:14] [INFO ] Transformed 16 places.
[2024-05-23 00:29:14] [INFO ] Transformed 13 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2024-05-23 00:29:14] [INFO ] Time to serialize gal into /tmp/UpperBounds7990739873648346579.gal : 1 ms
[2024-05-23 00:29:14] [INFO ] Time to serialize properties into /tmp/UpperBounds2220409716018724117.prop : 2 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.202304061127/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds7990739873648346579.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds2220409716018724117.prop' '--nowitness' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...349
Successfully loaded order from file /home/mcc/execution/model.ord
Loading property file /tmp/UpperBounds2220409716018724117.prop.
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 13017580 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16105372 kB
BK_TIME_CONFINEMENT_REACHED
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /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="DoubleExponent-PT-001"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2023"
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 gold2023"
echo " Input is DoubleExponent-PT-001, 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 r153-tall-171631151600326"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/DoubleExponent-PT-001.tgz
mv DoubleExponent-PT-001 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 '
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 ;