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.r307-tajo-171654460900296.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 gold2023
Input is PolyORBNT-PT-S05J80, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r307-tajo-171654460900296
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.9M
-rw-r--r-- 1 mcc users 38K Apr 12 09:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 168K Apr 12 09:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 74K Apr 12 09:55 CTLFireability.txt
-rw-r--r-- 1 mcc users 357K Apr 12 09:55 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 44K Apr 23 07:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 133K Apr 23 07:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 50K Apr 23 07:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 156K Apr 23 07:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 79K Apr 12 10:19 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 324K Apr 12 10:19 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 131K Apr 12 10:14 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 566K Apr 12 10:14 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 6.0K Apr 23 07:44 UpperBounds.txt
-rw-r--r-- 1 mcc users 13K Apr 23 07:44 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 7 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 1.8M May 18 16:43 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 PolyORBNT-PT-S05J80-UpperBounds-00
FORMULA_NAME PolyORBNT-PT-S05J80-UpperBounds-01
FORMULA_NAME PolyORBNT-PT-S05J80-UpperBounds-02
FORMULA_NAME PolyORBNT-PT-S05J80-UpperBounds-03
FORMULA_NAME PolyORBNT-PT-S05J80-UpperBounds-04
FORMULA_NAME PolyORBNT-PT-S05J80-UpperBounds-05
FORMULA_NAME PolyORBNT-PT-S05J80-UpperBounds-06
FORMULA_NAME PolyORBNT-PT-S05J80-UpperBounds-07
FORMULA_NAME PolyORBNT-PT-S05J80-UpperBounds-08
FORMULA_NAME PolyORBNT-PT-S05J80-UpperBounds-09
FORMULA_NAME PolyORBNT-PT-S05J80-UpperBounds-10
FORMULA_NAME PolyORBNT-PT-S05J80-UpperBounds-11
FORMULA_NAME PolyORBNT-PT-S05J80-UpperBounds-12
FORMULA_NAME PolyORBNT-PT-S05J80-UpperBounds-13
FORMULA_NAME PolyORBNT-PT-S05J80-UpperBounds-14
FORMULA_NAME PolyORBNT-PT-S05J80-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1717132482758

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=PolyORBNT-PT-S05J80
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202304061127
[2024-05-31 05:14:44] [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-31 05:14:44] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 05:14:44] [INFO ] Load time of PNML (sax parser for PT used): 212 ms
[2024-05-31 05:14:44] [INFO ] Transformed 1189 places.
[2024-05-31 05:14:44] [INFO ] Transformed 2350 transitions.
[2024-05-31 05:14:44] [INFO ] Parsed PT model containing 1189 places and 2350 transitions and 14464 arcs in 371 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 6 ms.
Ensure Unique test removed 655 transitions
Reduce redundant transitions removed 655 transitions.
Normalized transition count is 1691 out of 1695 initially.
// Phase 1: matrix 1691 rows 1189 cols
[2024-05-31 05:14:45] [INFO ] Computed 182 invariants in 172 ms
FORMULA PolyORBNT-PT-S05J80-UpperBounds-11 3 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 711 resets, run finished after 161 ms. (steps per millisecond=62 ) properties (out of 15) seen :30
FORMULA PolyORBNT-PT-S05J80-UpperBounds-15 2 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBNT-PT-S05J80-UpperBounds-13 3 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBNT-PT-S05J80-UpperBounds-12 2 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBNT-PT-S05J80-UpperBounds-01 3 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 134 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 11) seen :19
Incomplete Best-First random walk after 10000 steps, including 248 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 11) seen :2
Incomplete Best-First random walk after 10001 steps, including 86 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 11) seen :13
Incomplete Best-First random walk after 10001 steps, including 256 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 11) seen :2
Incomplete Best-First random walk after 10001 steps, including 92 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 11) seen :17
Incomplete Best-First random walk after 10001 steps, including 127 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 11) seen :18
Incomplete Best-First random walk after 10000 steps, including 128 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 11) seen :15
Incomplete Best-First random walk after 10001 steps, including 91 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 11) seen :18
FORMULA PolyORBNT-PT-S05J80-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 98 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 10) seen :17
Incomplete Best-First random walk after 10001 steps, including 71 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 10) seen :17
[2024-05-31 05:14:45] [INFO ] Flow matrix only has 1691 transitions (discarded 4 similar events)
// Phase 1: matrix 1691 rows 1189 cols
[2024-05-31 05:14:45] [INFO ] Computed 182 invariants in 60 ms
[2024-05-31 05:14:46] [INFO ] [Real]Absence check using 157 positive place invariants in 88 ms returned sat
[2024-05-31 05:14:46] [INFO ] [Real]Absence check using 157 positive and 25 generalized place invariants in 60 ms returned unsat
[2024-05-31 05:14:46] [INFO ] [Real]Absence check using 157 positive place invariants in 56 ms returned sat
[2024-05-31 05:14:46] [INFO ] [Real]Absence check using 157 positive and 25 generalized place invariants in 53 ms returned unsat
[2024-05-31 05:14:47] [INFO ] [Real]Absence check using 157 positive place invariants in 44 ms returned sat
[2024-05-31 05:14:47] [INFO ] [Real]Absence check using 157 positive and 25 generalized place invariants in 33 ms returned unsat
[2024-05-31 05:14:47] [INFO ] [Real]Absence check using 157 positive place invariants in 41 ms returned sat
[2024-05-31 05:14:47] [INFO ] [Real]Absence check using 157 positive and 25 generalized place invariants in 66 ms returned unsat
[2024-05-31 05:14:47] [INFO ] [Real]Absence check using 157 positive place invariants in 30 ms returned sat
[2024-05-31 05:14:47] [INFO ] [Real]Absence check using 157 positive and 25 generalized place invariants in 33 ms returned sat
[2024-05-31 05:14:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 05:14:48] [INFO ] [Real]Absence check using state equation in 1096 ms returned sat
[2024-05-31 05:14:48] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 05:14:49] [INFO ] [Nat]Absence check using 157 positive place invariants in 40 ms returned sat
[2024-05-31 05:14:49] [INFO ] [Nat]Absence check using 157 positive and 25 generalized place invariants in 49 ms returned sat
[2024-05-31 05:14:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 05:14:52] [INFO ] [Nat]Absence check using state equation in 3211 ms returned sat
[2024-05-31 05:14:52] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 05:14:52] [INFO ] [Nat]Added 1 Read/Feed constraints in 315 ms returned sat
[2024-05-31 05:14:53] [INFO ] Computed and/alt/rep : 949/2209/949 causal constraints (skipped 736 transitions) in 241 ms.
[2024-05-31 05:14:53] [INFO ] Added : 10 causal constraints over 2 iterations in 929 ms. Result :unknown
[2024-05-31 05:14:54] [INFO ] [Real]Absence check using 157 positive place invariants in 73 ms returned sat
[2024-05-31 05:14:54] [INFO ] [Real]Absence check using 157 positive and 25 generalized place invariants in 83 ms returned sat
[2024-05-31 05:14:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 05:14:54] [INFO ] [Real]Absence check using state equation in 617 ms returned sat
[2024-05-31 05:14:54] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 05:14:55] [INFO ] [Nat]Absence check using 157 positive place invariants in 39 ms returned sat
[2024-05-31 05:14:55] [INFO ] [Nat]Absence check using 157 positive and 25 generalized place invariants in 40 ms returned unsat
[2024-05-31 05:14:55] [INFO ] [Real]Absence check using 157 positive place invariants in 43 ms returned sat
[2024-05-31 05:14:55] [INFO ] [Real]Absence check using 157 positive and 25 generalized place invariants in 37 ms returned unsat
[2024-05-31 05:14:55] [INFO ] [Real]Absence check using 157 positive place invariants in 35 ms returned sat
[2024-05-31 05:14:55] [INFO ] [Real]Absence check using 157 positive and 25 generalized place invariants in 33 ms returned sat
[2024-05-31 05:14:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 05:14:56] [INFO ] [Real]Absence check using state equation in 549 ms returned sat
[2024-05-31 05:14:56] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 05:14:56] [INFO ] [Nat]Absence check using 157 positive place invariants in 41 ms returned sat
[2024-05-31 05:14:56] [INFO ] [Nat]Absence check using 157 positive and 25 generalized place invariants in 44 ms returned sat
[2024-05-31 05:14:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 05:14:57] [INFO ] [Nat]Absence check using state equation in 654 ms returned sat
[2024-05-31 05:14:58] [INFO ] [Nat]Added 1 Read/Feed constraints in 1600 ms returned sat
[2024-05-31 05:14:58] [INFO ] Computed and/alt/rep : 949/2209/949 causal constraints (skipped 736 transitions) in 152 ms.
[2024-05-31 05:15:01] [INFO ] Added : 25 causal constraints over 5 iterations in 2420 ms. Result :unknown
[2024-05-31 05:15:01] [INFO ] [Real]Absence check using 157 positive place invariants in 29 ms returned sat
[2024-05-31 05:15:01] [INFO ] [Real]Absence check using 157 positive and 25 generalized place invariants in 34 ms returned unsat
[2024-05-31 05:15:01] [INFO ] [Real]Absence check using 157 positive place invariants in 60 ms returned sat
[2024-05-31 05:15:01] [INFO ] [Real]Absence check using 157 positive and 25 generalized place invariants in 53 ms returned sat
[2024-05-31 05:15:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 05:15:02] [INFO ] [Real]Absence check using state equation in 549 ms returned sat
[2024-05-31 05:15:02] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 05:15:02] [INFO ] [Nat]Absence check using 157 positive place invariants in 43 ms returned sat
[2024-05-31 05:15:02] [INFO ] [Nat]Absence check using 157 positive and 25 generalized place invariants in 46 ms returned sat
[2024-05-31 05:15:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 05:15:07] [INFO ] [Nat]Absence check using state equation in 4735 ms returned unknown
Current structural bounds on expressions (after SMT) : [1, 1, 4, 1, 988, 1, 4, 1, 1, 396] Max seen :[1, 1, 4, 1, 3, 1, 4, 0, 1, 4]
FORMULA PolyORBNT-PT-S05J80-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-PT-S05J80-UpperBounds-07 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-PT-S05J80-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-PT-S05J80-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-PT-S05J80-UpperBounds-03 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-PT-S05J80-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-PT-S05J80-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-PT-S05J80-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 2 out of 1189 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1189/1189 places, 1695/1695 transitions.
Ensure Unique test removed 5 places
Drop transitions removed 85 transitions
Trivial Post-agglo rules discarded 85 transitions
Performed 85 trivial Post agglomeration. Transition count delta: 85
Iterating post reduction 0 with 90 rules applied. Total rules applied 90 place count 1184 transition count 1610
Reduce places removed 85 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 86 rules applied. Total rules applied 176 place count 1099 transition count 1609
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 177 place count 1098 transition count 1609
Performed 84 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 84 Pre rules applied. Total rules applied 177 place count 1098 transition count 1525
Deduced a syphon composed of 84 places in 5 ms
Reduce places removed 84 places and 0 transitions.
Iterating global reduction 3 with 168 rules applied. Total rules applied 345 place count 1014 transition count 1525
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 346 place count 1013 transition count 1524
Iterating global reduction 3 with 1 rules applied. Total rules applied 347 place count 1013 transition count 1524
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 4 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 351 place count 1011 transition count 1522
Applied a total of 351 rules in 653 ms. Remains 1011 /1189 variables (removed 178) and now considering 1522/1695 (removed 173) transitions.
[2024-05-31 05:15:08] [INFO ] Flow matrix only has 1518 transitions (discarded 4 similar events)
// Phase 1: matrix 1518 rows 1011 cols
[2024-05-31 05:15:08] [INFO ] Computed 177 invariants in 51 ms
[2024-05-31 05:15:10] [INFO ] Dead Transitions using invariants and state equation in 1967 ms found 95 transitions.
Found 95 dead transitions using SMT.
Drop transitions removed 95 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 95 transitions.
Starting structural reductions in REACHABILITY mode, iteration 1 : 1011/1189 places, 1427/1695 transitions.
Applied a total of 0 rules in 71 ms. Remains 1011 /1011 variables (removed 0) and now considering 1427/1427 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2708 ms. Remains : 1011/1189 places, 1427/1695 transitions.
Normalized transition count is 1423 out of 1427 initially.
// Phase 1: matrix 1423 rows 1011 cols
[2024-05-31 05:15:10] [INFO ] Computed 177 invariants in 48 ms
Incomplete random walk after 1000000 steps, including 47165 resets, run finished after 7751 ms. (steps per millisecond=129 ) properties (out of 2) seen :7
Incomplete Best-First random walk after 1000001 steps, including 2652 resets, run finished after 1735 ms. (steps per millisecond=576 ) properties (out of 2) seen :7
Incomplete Best-First random walk after 1000001 steps, including 1887 resets, run finished after 1651 ms. (steps per millisecond=605 ) properties (out of 2) seen :7
[2024-05-31 05:15:21] [INFO ] Flow matrix only has 1423 transitions (discarded 4 similar events)
// Phase 1: matrix 1423 rows 1011 cols
[2024-05-31 05:15:21] [INFO ] Computed 177 invariants in 58 ms
[2024-05-31 05:15:21] [INFO ] [Real]Absence check using 156 positive place invariants in 35 ms returned sat
[2024-05-31 05:15:21] [INFO ] [Real]Absence check using 156 positive and 21 generalized place invariants in 41 ms returned sat
[2024-05-31 05:15:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 05:15:22] [INFO ] [Real]Absence check using state equation in 614 ms returned sat
[2024-05-31 05:15:22] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 05:15:22] [INFO ] [Nat]Absence check using 156 positive place invariants in 44 ms returned sat
[2024-05-31 05:15:22] [INFO ] [Nat]Absence check using 156 positive and 21 generalized place invariants in 52 ms returned sat
[2024-05-31 05:15:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 05:15:23] [INFO ] [Nat]Absence check using state equation in 694 ms returned sat
[2024-05-31 05:15:23] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 05:15:25] [INFO ] [Nat]Added 1 Read/Feed constraints in 1611 ms returned sat
[2024-05-31 05:15:25] [INFO ] Deduced a trap composed of 337 places in 457 ms of which 4 ms to minimize.
[2024-05-31 05:15:26] [INFO ] Deduced a trap composed of 329 places in 479 ms of which 1 ms to minimize.
[2024-05-31 05:15:29] [INFO ] Trap strengthening (SAT) tested/added 2/2 trap constraints in 4400 ms
[2024-05-31 05:15:29] [INFO ] [Real]Absence check using 156 positive place invariants in 27 ms returned sat
[2024-05-31 05:15:29] [INFO ] [Real]Absence check using 156 positive and 21 generalized place invariants in 29 ms returned sat
[2024-05-31 05:15:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 05:15:30] [INFO ] [Real]Absence check using state equation in 843 ms returned sat
[2024-05-31 05:15:30] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 05:15:30] [INFO ] [Nat]Absence check using 156 positive place invariants in 41 ms returned sat
[2024-05-31 05:15:30] [INFO ] [Nat]Absence check using 156 positive and 21 generalized place invariants in 47 ms returned sat
[2024-05-31 05:15:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 05:15:37] [INFO ] [Nat]Absence check using state equation in 6531 ms returned unknown
Current structural bounds on expressions (after SMT) : [988, 396] Max seen :[3, 4]
Support contains 2 out of 1011 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1011/1011 places, 1427/1427 transitions.
Applied a total of 0 rules in 87 ms. Remains 1011 /1011 variables (removed 0) and now considering 1427/1427 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 87 ms. Remains : 1011/1011 places, 1427/1427 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1011/1011 places, 1427/1427 transitions.
Applied a total of 0 rules in 65 ms. Remains 1011 /1011 variables (removed 0) and now considering 1427/1427 (removed 0) transitions.
[2024-05-31 05:15:37] [INFO ] Flow matrix only has 1423 transitions (discarded 4 similar events)
[2024-05-31 05:15:37] [INFO ] Invariant cache hit.
[2024-05-31 05:15:39] [INFO ] Implicit Places using invariants in 2076 ms returned []
[2024-05-31 05:15:39] [INFO ] Flow matrix only has 1423 transitions (discarded 4 similar events)
[2024-05-31 05:15:39] [INFO ] Invariant cache hit.
[2024-05-31 05:15:40] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 05:16:04] [INFO ] Implicit Places using invariants and state equation in 24647 ms returned []
Implicit Place search using SMT with State Equation took 26726 ms to find 0 implicit places.
[2024-05-31 05:16:04] [INFO ] Redundant transitions in 103 ms returned []
[2024-05-31 05:16:04] [INFO ] Flow matrix only has 1423 transitions (discarded 4 similar events)
[2024-05-31 05:16:04] [INFO ] Invariant cache hit.
[2024-05-31 05:16:05] [INFO ] Dead Transitions using invariants and state equation in 1577 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 28480 ms. Remains : 1011/1011 places, 1427/1427 transitions.
Starting property specific reduction for PolyORBNT-PT-S05J80-UpperBounds-05
Normalized transition count is 1423 out of 1427 initially.
// Phase 1: matrix 1423 rows 1011 cols
[2024-05-31 05:16:06] [INFO ] Computed 177 invariants in 54 ms
Incomplete random walk after 10000 steps, including 501 resets, run finished after 104 ms. (steps per millisecond=96 ) properties (out of 1) seen :3
Incomplete Best-First random walk after 10001 steps, including 31 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :3
[2024-05-31 05:16:06] [INFO ] Flow matrix only has 1423 transitions (discarded 4 similar events)
// Phase 1: matrix 1423 rows 1011 cols
[2024-05-31 05:16:06] [INFO ] Computed 177 invariants in 29 ms
[2024-05-31 05:16:06] [INFO ] [Real]Absence check using 156 positive place invariants in 30 ms returned sat
[2024-05-31 05:16:06] [INFO ] [Real]Absence check using 156 positive and 21 generalized place invariants in 28 ms returned sat
[2024-05-31 05:16:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 05:16:07] [INFO ] [Real]Absence check using state equation in 713 ms returned sat
[2024-05-31 05:16:07] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 05:16:07] [INFO ] [Nat]Absence check using 156 positive place invariants in 27 ms returned sat
[2024-05-31 05:16:07] [INFO ] [Nat]Absence check using 156 positive and 21 generalized place invariants in 30 ms returned sat
[2024-05-31 05:16:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 05:16:07] [INFO ] [Nat]Absence check using state equation in 635 ms returned sat
[2024-05-31 05:16:07] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 05:16:09] [INFO ] [Nat]Added 1 Read/Feed constraints in 1560 ms returned sat
[2024-05-31 05:16:09] [INFO ] Deduced a trap composed of 337 places in 439 ms of which 2 ms to minimize.
[2024-05-31 05:16:10] [INFO ] Deduced a trap composed of 329 places in 545 ms of which 15 ms to minimize.
[2024-05-31 05:16:12] [INFO ] Trap strengthening (SAT) tested/added 2/2 trap constraints in 2646 ms
Current structural bounds on expressions (after SMT) : [-1] Max seen :[3]
Support contains 1 out of 1011 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1011/1011 places, 1427/1427 transitions.
Applied a total of 0 rules in 65 ms. Remains 1011 /1011 variables (removed 0) and now considering 1427/1427 (removed 0) transitions.
[2024-05-31 05:16:12] [INFO ] Flow matrix only has 1423 transitions (discarded 4 similar events)
[2024-05-31 05:16:12] [INFO ] Invariant cache hit.
[2024-05-31 05:16:13] [INFO ] Dead Transitions using invariants and state equation in 1724 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1804 ms. Remains : 1011/1011 places, 1427/1427 transitions.
Normalized transition count is 1423 out of 1427 initially.
// Phase 1: matrix 1423 rows 1011 cols
[2024-05-31 05:16:13] [INFO ] Computed 177 invariants in 22 ms
Incomplete random walk after 1000000 steps, including 47238 resets, run finished after 7452 ms. (steps per millisecond=134 ) properties (out of 1) seen :3
Incomplete Best-First random walk after 1000001 steps, including 2675 resets, run finished after 1562 ms. (steps per millisecond=640 ) properties (out of 1) seen :3
[2024-05-31 05:16:23] [INFO ] Flow matrix only has 1423 transitions (discarded 4 similar events)
// Phase 1: matrix 1423 rows 1011 cols
[2024-05-31 05:16:23] [INFO ] Computed 177 invariants in 57 ms
[2024-05-31 05:16:23] [INFO ] [Real]Absence check using 156 positive place invariants in 38 ms returned sat
[2024-05-31 05:16:23] [INFO ] [Real]Absence check using 156 positive and 21 generalized place invariants in 44 ms returned sat
[2024-05-31 05:16:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 05:16:24] [INFO ] [Real]Absence check using state equation in 818 ms returned sat
[2024-05-31 05:16:24] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 05:16:24] [INFO ] [Nat]Absence check using 156 positive place invariants in 30 ms returned sat
[2024-05-31 05:16:24] [INFO ] [Nat]Absence check using 156 positive and 21 generalized place invariants in 34 ms returned sat
[2024-05-31 05:16:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 05:16:25] [INFO ] [Nat]Absence check using state equation in 806 ms returned sat
[2024-05-31 05:16:25] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 05:16:26] [INFO ] [Nat]Added 1 Read/Feed constraints in 1572 ms returned sat
[2024-05-31 05:16:27] [INFO ] Deduced a trap composed of 337 places in 506 ms of which 1 ms to minimize.
[2024-05-31 05:16:28] [INFO ] Deduced a trap composed of 329 places in 580 ms of which 1 ms to minimize.
[2024-05-31 05:16:31] [INFO ] Trap strengthening (SAT) tested/added 2/2 trap constraints in 4518 ms
Current structural bounds on expressions (after SMT) : [-1] Max seen :[3]
Support contains 1 out of 1011 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1011/1011 places, 1427/1427 transitions.
Applied a total of 0 rules in 79 ms. Remains 1011 /1011 variables (removed 0) and now considering 1427/1427 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 79 ms. Remains : 1011/1011 places, 1427/1427 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1011/1011 places, 1427/1427 transitions.
Applied a total of 0 rules in 61 ms. Remains 1011 /1011 variables (removed 0) and now considering 1427/1427 (removed 0) transitions.
[2024-05-31 05:16:31] [INFO ] Flow matrix only has 1423 transitions (discarded 4 similar events)
[2024-05-31 05:16:31] [INFO ] Invariant cache hit.
[2024-05-31 05:16:33] [INFO ] Implicit Places using invariants in 2159 ms returned []
[2024-05-31 05:16:33] [INFO ] Flow matrix only has 1423 transitions (discarded 4 similar events)
[2024-05-31 05:16:33] [INFO ] Invariant cache hit.
[2024-05-31 05:16:34] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 05:17:02] [INFO ] Implicit Places using invariants and state equation in 28444 ms returned []
Implicit Place search using SMT with State Equation took 30618 ms to find 0 implicit places.
[2024-05-31 05:17:02] [INFO ] Redundant transitions in 28 ms returned []
[2024-05-31 05:17:02] [INFO ] Flow matrix only has 1423 transitions (discarded 4 similar events)
[2024-05-31 05:17:02] [INFO ] Invariant cache hit.
[2024-05-31 05:17:03] [INFO ] Dead Transitions using invariants and state equation in 1569 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 32304 ms. Remains : 1011/1011 places, 1427/1427 transitions.
Ending property specific reduction for PolyORBNT-PT-S05J80-UpperBounds-05 in 57729 ms.
Starting property specific reduction for PolyORBNT-PT-S05J80-UpperBounds-14
Normalized transition count is 1423 out of 1427 initially.
// Phase 1: matrix 1423 rows 1011 cols
[2024-05-31 05:17:03] [INFO ] Computed 177 invariants in 24 ms
Incomplete random walk after 10000 steps, including 460 resets, run finished after 73 ms. (steps per millisecond=136 ) properties (out of 1) seen :4
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :4
[2024-05-31 05:17:03] [INFO ] Flow matrix only has 1423 transitions (discarded 4 similar events)
// Phase 1: matrix 1423 rows 1011 cols
[2024-05-31 05:17:03] [INFO ] Computed 177 invariants in 57 ms
[2024-05-31 05:17:04] [INFO ] [Real]Absence check using 156 positive place invariants in 28 ms returned sat
[2024-05-31 05:17:04] [INFO ] [Real]Absence check using 156 positive and 21 generalized place invariants in 28 ms returned sat
[2024-05-31 05:17:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 05:17:04] [INFO ] [Real]Absence check using state equation in 703 ms returned sat
[2024-05-31 05:17:04] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 05:17:05] [INFO ] [Nat]Absence check using 156 positive place invariants in 40 ms returned sat
[2024-05-31 05:17:05] [INFO ] [Nat]Absence check using 156 positive and 21 generalized place invariants in 47 ms returned sat
[2024-05-31 05:17:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 05:17:09] [INFO ] [Nat]Absence check using state equation in 4775 ms returned unknown
Current structural bounds on expressions (after SMT) : [396] Max seen :[4]
Support contains 1 out of 1011 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1011/1011 places, 1427/1427 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 1011 transition count 1426
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1010 transition count 1426
Applied a total of 2 rules in 49 ms. Remains 1010 /1011 variables (removed 1) and now considering 1426/1427 (removed 1) transitions.
[2024-05-31 05:17:09] [INFO ] Flow matrix only has 1422 transitions (discarded 4 similar events)
// Phase 1: matrix 1422 rows 1010 cols
[2024-05-31 05:17:09] [INFO ] Computed 177 invariants in 34 ms
[2024-05-31 05:17:11] [INFO ] Dead Transitions using invariants and state equation in 1713 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1775 ms. Remains : 1010/1011 places, 1426/1427 transitions.
Normalized transition count is 1422 out of 1426 initially.
// Phase 1: matrix 1422 rows 1010 cols
[2024-05-31 05:17:11] [INFO ] Computed 177 invariants in 39 ms
Incomplete random walk after 1000000 steps, including 52164 resets, run finished after 8459 ms. (steps per millisecond=118 ) properties (out of 1) seen :4
Incomplete Best-First random walk after 1000001 steps, including 1895 resets, run finished after 1799 ms. (steps per millisecond=555 ) properties (out of 1) seen :4
[2024-05-31 05:17:21] [INFO ] Flow matrix only has 1422 transitions (discarded 4 similar events)
// Phase 1: matrix 1422 rows 1010 cols
[2024-05-31 05:17:21] [INFO ] Computed 177 invariants in 29 ms
[2024-05-31 05:17:22] [INFO ] [Real]Absence check using 155 positive place invariants in 34 ms returned sat
[2024-05-31 05:17:22] [INFO ] [Real]Absence check using 155 positive and 22 generalized place invariants in 38 ms returned sat
[2024-05-31 05:17:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 05:17:22] [INFO ] [Real]Absence check using state equation in 425 ms returned sat
[2024-05-31 05:17:22] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 05:17:22] [INFO ] [Nat]Absence check using 155 positive place invariants in 48 ms returned sat
[2024-05-31 05:17:22] [INFO ] [Nat]Absence check using 155 positive and 22 generalized place invariants in 48 ms returned sat
[2024-05-31 05:17:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 05:17:28] [INFO ] [Nat]Absence check using state equation in 5582 ms returned unsat
Current structural bounds on expressions (after SMT) : [4] Max seen :[4]
FORMULA PolyORBNT-PT-S05J80-UpperBounds-14 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Ending property specific reduction for PolyORBNT-PT-S05J80-UpperBounds-14 in 24746 ms.
[2024-05-31 05:17:28] [INFO ] Flatten gal took : 173 ms
[2024-05-31 05:17:28] [INFO ] Applying decomposition
[2024-05-31 05:17:29] [INFO ] Flatten gal took : 131 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/graph1829264496345183715.txt' '-o' '/tmp/graph1829264496345183715.bin' '-w' '/tmp/graph1829264496345183715.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph1829264496345183715.bin' '-l' '-1' '-v' '-w' '/tmp/graph1829264496345183715.weights' '-q' '0' '-e' '0.001'
[2024-05-31 05:17:29] [INFO ] Decomposing Gal with order
[2024-05-31 05:17:29] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-31 05:17:29] [INFO ] Removed a total of 1694 redundant transitions.
[2024-05-31 05:17:30] [INFO ] Flatten gal took : 403 ms
[2024-05-31 05:17:30] [INFO ] Fuse similar labels procedure discarded/fused a total of 241 labels/synchronizations in 38 ms.
[2024-05-31 05:17:30] [INFO ] Time to serialize gal into /tmp/UpperBounds16807394603492117367.gal : 31 ms
[2024-05-31 05:17:30] [INFO ] Time to serialize properties into /tmp/UpperBounds7299183217662565753.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.202304061127/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds16807394603492117367.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds7299183217662565753.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/UpperBounds7299183217662565753.prop.
Detected timeout of ITS tools.
[2024-05-31 05:38:29] [INFO ] Flatten gal took : 709 ms
[2024-05-31 05:38:30] [INFO ] Time to serialize gal into /tmp/UpperBounds7696497200166746604.gal : 113 ms
[2024-05-31 05:38:30] [INFO ] Time to serialize properties into /tmp/UpperBounds494025674569995561.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/UpperBounds7696497200166746604.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds494025674569995561.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 ...303
Loading property file /tmp/UpperBounds494025674569995561.prop.
Detected timeout of ITS tools.
[2024-05-31 05:59:28] [INFO ] Flatten gal took : 1059 ms
[2024-05-31 05:59:30] [INFO ] Input system was already deterministic with 1427 transitions.
[2024-05-31 05:59:30] [INFO ] Transformed 1011 places.
[2024-05-31 05:59:30] [INFO ] Transformed 1427 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
P-invariant computation with GreatSPN timed out. Skipping.
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-31 06:00:00] [INFO ] Time to serialize gal into /tmp/UpperBounds2270534729392635207.gal : 18 ms
[2024-05-31 06:00:00] [INFO ] Time to serialize properties into /tmp/UpperBounds18368723077514930684.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.202304061127/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds2270534729392635207.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds18368723077514930684.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 ...350
Successfully loaded order from file /home/mcc/execution/model.ord
Loading property file /tmp/UpperBounds18368723077514930684.prop.
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393340 kB
MemFree: 165952 kB
After kill :
MemTotal: 16393340 kB
MemFree: 16269684 kB

BK_TIME_CONFINEMENT_REACHED

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ 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="PolyORBNT-PT-S05J80"
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 PolyORBNT-PT-S05J80, 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 r307-tajo-171654460900296"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/PolyORBNT-PT-S05J80.tgz
mv PolyORBNT-PT-S05J80 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 ;