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

About the Execution of 2023-gold for PolyORBLF-PT-S02J04T06

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
12092.048 1316581.00 1344994.00 254.80 5 2 1 2 1 1 1 1 2 1 1 1 1 1 1 1 normal

Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2024-input.r307-tajo-171654460500136.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 PolyORBLF-PT-S02J04T06, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r307-tajo-171654460500136
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.6M
-rw-r--r-- 1 mcc users 11K Apr 11 16:57 CTLCardinality.txt
-rw-r--r-- 1 mcc users 78K Apr 11 16:57 CTLCardinality.xml
-rw-r--r-- 1 mcc users 24K Apr 11 16:56 CTLFireability.txt
-rw-r--r-- 1 mcc users 133K Apr 11 16:56 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 9.2K Apr 23 07:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 41K Apr 23 07:43 LTLCardinality.xml
-rw-r--r-- 1 mcc users 7.2K Apr 23 07:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 31K Apr 23 07:43 LTLFireability.xml
-rw-r--r-- 1 mcc users 26K Apr 11 17:01 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 159K Apr 11 17:01 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 17K Apr 11 17:00 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 92K Apr 11 17:00 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.6K Apr 23 07:43 UpperBounds.txt
-rw-r--r-- 1 mcc users 5.6K Apr 23 07:43 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 10 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 862K 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 PolyORBLF-PT-S02J04T06-UpperBounds-00
FORMULA_NAME PolyORBLF-PT-S02J04T06-UpperBounds-01
FORMULA_NAME PolyORBLF-PT-S02J04T06-UpperBounds-02
FORMULA_NAME PolyORBLF-PT-S02J04T06-UpperBounds-03
FORMULA_NAME PolyORBLF-PT-S02J04T06-UpperBounds-04
FORMULA_NAME PolyORBLF-PT-S02J04T06-UpperBounds-05
FORMULA_NAME PolyORBLF-PT-S02J04T06-UpperBounds-06
FORMULA_NAME PolyORBLF-PT-S02J04T06-UpperBounds-07
FORMULA_NAME PolyORBLF-PT-S02J04T06-UpperBounds-08
FORMULA_NAME PolyORBLF-PT-S02J04T06-UpperBounds-09
FORMULA_NAME PolyORBLF-PT-S02J04T06-UpperBounds-10
FORMULA_NAME PolyORBLF-PT-S02J04T06-UpperBounds-11
FORMULA_NAME PolyORBLF-PT-S02J04T06-UpperBounds-12
FORMULA_NAME PolyORBLF-PT-S02J04T06-UpperBounds-13
FORMULA_NAME PolyORBLF-PT-S02J04T06-UpperBounds-14
FORMULA_NAME PolyORBLF-PT-S02J04T06-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1717114856683

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=PolyORBLF-PT-S02J04T06
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202304061127
[2024-05-31 00:20:58] [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 00:20:58] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 00:20:58] [INFO ] Load time of PNML (sax parser for PT used): 144 ms
[2024-05-31 00:20:58] [INFO ] Transformed 476 places.
[2024-05-31 00:20:58] [INFO ] Transformed 920 transitions.
[2024-05-31 00:20:58] [INFO ] Parsed PT model containing 476 places and 920 transitions and 4242 arcs in 249 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 5 ms.
Ensure Unique test removed 96 transitions
Reduce redundant transitions removed 96 transitions.
Normalized transition count is 812 out of 824 initially.
// Phase 1: matrix 812 rows 476 cols
[2024-05-31 00:20:58] [INFO ] Computed 46 invariants in 62 ms
FORMULA PolyORBLF-PT-S02J04T06-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 3 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 15) seen :22
FORMULA PolyORBLF-PT-S02J04T06-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBLF-PT-S02J04T06-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBLF-PT-S02J04T06-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 12) seen :19
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 12) seen :19
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 12) seen :19
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 12) seen :19
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 12) seen :19
Incomplete Best-First random walk after 10000 steps, including 3 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 12) seen :19
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 12) seen :19
Incomplete Best-First random walk after 10000 steps, including 3 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 12) seen :19
Incomplete Best-First random walk after 10000 steps, including 4 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 12) seen :19
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 12) seen :19
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 12) seen :19
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 12) seen :19
[2024-05-31 00:20:58] [INFO ] Flow matrix only has 812 transitions (discarded 12 similar events)
// Phase 1: matrix 812 rows 476 cols
[2024-05-31 00:20:58] [INFO ] Computed 46 invariants in 20 ms
[2024-05-31 00:20:59] [INFO ] [Real]Absence check using 11 positive place invariants in 13 ms returned sat
[2024-05-31 00:20:59] [INFO ] [Real]Absence check using 11 positive and 35 generalized place invariants in 25 ms returned sat
[2024-05-31 00:20:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 00:21:00] [INFO ] [Real]Absence check using state equation in 1030 ms returned sat
[2024-05-31 00:21:00] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 00:21:00] [INFO ] [Nat]Absence check using 11 positive place invariants in 7 ms returned sat
[2024-05-31 00:21:00] [INFO ] [Nat]Absence check using 11 positive and 35 generalized place invariants in 21 ms returned sat
[2024-05-31 00:21:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 00:21:02] [INFO ] [Nat]Absence check using state equation in 1708 ms returned sat
[2024-05-31 00:21:02] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-05-31 00:21:02] [INFO ] [Nat]Added 72 Read/Feed constraints in 274 ms returned sat
[2024-05-31 00:21:02] [INFO ] Deduced a trap composed of 125 places in 320 ms of which 5 ms to minimize.
[2024-05-31 00:21:02] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 380 ms
[2024-05-31 00:21:03] [INFO ] [Real]Absence check using 11 positive place invariants in 15 ms returned sat
[2024-05-31 00:21:03] [INFO ] [Real]Absence check using 11 positive and 35 generalized place invariants in 64 ms returned unsat
[2024-05-31 00:21:03] [INFO ] [Real]Absence check using 11 positive place invariants in 5 ms returned sat
[2024-05-31 00:21:03] [INFO ] [Real]Absence check using 11 positive and 35 generalized place invariants in 6 ms returned unsat
[2024-05-31 00:21:03] [INFO ] [Real]Absence check using 11 positive place invariants in 4 ms returned sat
[2024-05-31 00:21:03] [INFO ] [Real]Absence check using 11 positive and 35 generalized place invariants in 35 ms returned unsat
[2024-05-31 00:21:03] [INFO ] [Real]Absence check using 11 positive place invariants in 6 ms returned sat
[2024-05-31 00:21:03] [INFO ] [Real]Absence check using 11 positive and 35 generalized place invariants in 15 ms returned unsat
[2024-05-31 00:21:03] [INFO ] [Real]Absence check using 11 positive place invariants in 4 ms returned sat
[2024-05-31 00:21:03] [INFO ] [Real]Absence check using 11 positive and 35 generalized place invariants in 21 ms returned unsat
[2024-05-31 00:21:03] [INFO ] [Real]Absence check using 11 positive place invariants in 5 ms returned sat
[2024-05-31 00:21:03] [INFO ] [Real]Absence check using 11 positive and 35 generalized place invariants in 14 ms returned unsat
[2024-05-31 00:21:03] [INFO ] [Real]Absence check using 11 positive place invariants in 5 ms returned sat
[2024-05-31 00:21:03] [INFO ] [Real]Absence check using 11 positive and 35 generalized place invariants in 18 ms returned unsat
[2024-05-31 00:21:03] [INFO ] [Real]Absence check using 11 positive place invariants in 6 ms returned sat
[2024-05-31 00:21:03] [INFO ] [Real]Absence check using 11 positive and 35 generalized place invariants in 15 ms returned unsat
[2024-05-31 00:21:03] [INFO ] [Real]Absence check using 11 positive place invariants in 5 ms returned sat
[2024-05-31 00:21:03] [INFO ] [Real]Absence check using 11 positive and 35 generalized place invariants in 14 ms returned unsat
[2024-05-31 00:21:03] [INFO ] [Real]Absence check using 11 positive place invariants in 5 ms returned sat
[2024-05-31 00:21:03] [INFO ] [Real]Absence check using 11 positive and 35 generalized place invariants in 17 ms returned sat
[2024-05-31 00:21:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 00:21:04] [INFO ] [Real]Absence check using state equation in 441 ms returned sat
[2024-05-31 00:21:04] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 00:21:04] [INFO ] [Nat]Absence check using 11 positive place invariants in 5 ms returned sat
[2024-05-31 00:21:04] [INFO ] [Nat]Absence check using 11 positive and 35 generalized place invariants in 14 ms returned sat
[2024-05-31 00:21:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 00:21:05] [INFO ] [Nat]Absence check using state equation in 1582 ms returned sat
[2024-05-31 00:21:06] [INFO ] [Nat]Added 72 Read/Feed constraints in 637 ms returned sat
[2024-05-31 00:21:06] [INFO ] Deduced a trap composed of 66 places in 58 ms of which 1 ms to minimize.
[2024-05-31 00:21:09] [INFO ] Deduced a trap composed of 65 places in 60 ms of which 1 ms to minimize.
[2024-05-31 00:21:09] [INFO ] Trap strengthening (SAT) tested/added 2/2 trap constraints in 2703 ms
[2024-05-31 00:21:09] [INFO ] [Real]Absence check using 11 positive place invariants in 7 ms returned sat
[2024-05-31 00:21:09] [INFO ] [Real]Absence check using 11 positive and 35 generalized place invariants in 15 ms returned unsat
Current structural bounds on expressions (after SMT) : [5, 2, 1, 2, 1, 1, 1, 2, 1, 1, 6, 1] Max seen :[5, 2, 1, 2, 1, 1, 1, 2, 1, 1, 1, 1]
FORMULA PolyORBLF-PT-S02J04T06-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S02J04T06-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S02J04T06-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S02J04T06-UpperBounds-08 2 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S02J04T06-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S02J04T06-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S02J04T06-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S02J04T06-UpperBounds-03 2 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S02J04T06-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S02J04T06-UpperBounds-01 2 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S02J04T06-UpperBounds-00 5 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 1 out of 476 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 476/476 places, 824/824 transitions.
Ensure Unique test removed 2 places
Drop transitions removed 54 transitions
Trivial Post-agglo rules discarded 54 transitions
Performed 54 trivial Post agglomeration. Transition count delta: 54
Iterating post reduction 0 with 56 rules applied. Total rules applied 56 place count 474 transition count 770
Reduce places removed 54 places and 0 transitions.
Iterating post reduction 1 with 54 rules applied. Total rules applied 110 place count 420 transition count 770
Performed 48 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 48 Pre rules applied. Total rules applied 110 place count 420 transition count 722
Deduced a syphon composed of 48 places in 6 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 2 with 96 rules applied. Total rules applied 206 place count 372 transition count 722
Performed 47 Post agglomeration using F-continuation condition.Transition count delta: 47
Deduced a syphon composed of 47 places in 1 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 2 with 94 rules applied. Total rules applied 300 place count 325 transition count 675
Free-agglomeration rule (complex) applied 12 times.
Iterating global reduction 2 with 12 rules applied. Total rules applied 312 place count 325 transition count 663
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 324 place count 313 transition count 663
Applied a total of 324 rules in 158 ms. Remains 313 /476 variables (removed 163) and now considering 663/824 (removed 161) transitions.
[2024-05-31 00:21:09] [INFO ] Flow matrix only has 651 transitions (discarded 12 similar events)
// Phase 1: matrix 651 rows 313 cols
[2024-05-31 00:21:09] [INFO ] Computed 44 invariants in 10 ms
[2024-05-31 00:21:10] [INFO ] Dead Transitions using invariants and state equation in 566 ms found 66 transitions.
Found 66 dead transitions using SMT.
Drop transitions removed 66 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 66 transitions.
Starting structural reductions in REACHABILITY mode, iteration 1 : 313/476 places, 597/824 transitions.
Reduce places removed 2 places and 12 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 311 transition count 585
Reduce places removed 12 places and 12 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 14 place count 299 transition count 573
Applied a total of 14 rules in 19 ms. Remains 299 /313 variables (removed 14) and now considering 573/597 (removed 24) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 747 ms. Remains : 299/476 places, 573/824 transitions.
Normalized transition count is 561 out of 573 initially.
// Phase 1: matrix 561 rows 299 cols
[2024-05-31 00:21:10] [INFO ] Computed 44 invariants in 7 ms
Incomplete random walk after 1000000 steps, including 575 resets, run finished after 3218 ms. (steps per millisecond=310 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 1000001 steps, including 286 resets, run finished after 1502 ms. (steps per millisecond=665 ) properties (out of 1) seen :1
[2024-05-31 00:21:14] [INFO ] Flow matrix only has 561 transitions (discarded 12 similar events)
// Phase 1: matrix 561 rows 299 cols
[2024-05-31 00:21:14] [INFO ] Computed 44 invariants in 6 ms
[2024-05-31 00:21:15] [INFO ] [Real]Absence check using 17 positive place invariants in 11 ms returned sat
[2024-05-31 00:21:15] [INFO ] [Real]Absence check using 17 positive and 27 generalized place invariants in 11 ms returned sat
[2024-05-31 00:21:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 00:21:15] [INFO ] [Real]Absence check using state equation in 325 ms returned sat
[2024-05-31 00:21:15] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 00:21:15] [INFO ] [Nat]Absence check using 17 positive place invariants in 7 ms returned sat
[2024-05-31 00:21:15] [INFO ] [Nat]Absence check using 17 positive and 27 generalized place invariants in 7 ms returned sat
[2024-05-31 00:21:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 00:21:15] [INFO ] [Nat]Absence check using state equation in 463 ms returned sat
[2024-05-31 00:21:15] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-05-31 00:21:16] [INFO ] [Nat]Added 72 Read/Feed constraints in 489 ms returned sat
[2024-05-31 00:21:16] [INFO ] Deduced a trap composed of 36 places in 51 ms of which 2 ms to minimize.
[2024-05-31 00:21:16] [INFO ] Deduced a trap composed of 117 places in 174 ms of which 1 ms to minimize.
[2024-05-31 00:21:16] [INFO ] Deduced a trap composed of 72 places in 111 ms of which 1 ms to minimize.
[2024-05-31 00:21:17] [INFO ] Deduced a trap composed of 151 places in 132 ms of which 1 ms to minimize.
[2024-05-31 00:21:17] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 642 ms
[2024-05-31 00:21:17] [INFO ] Computed and/alt/rep : 337/1493/331 causal constraints (skipped 228 transitions) in 43 ms.
[2024-05-31 00:21:18] [INFO ] Deduced a trap composed of 36 places in 31 ms of which 1 ms to minimize.
[2024-05-31 00:21:18] [INFO ] Deduced a trap composed of 93 places in 115 ms of which 1 ms to minimize.
[2024-05-31 00:21:18] [INFO ] Deduced a trap composed of 28 places in 126 ms of which 1 ms to minimize.
[2024-05-31 00:21:18] [INFO ] Deduced a trap composed of 137 places in 125 ms of which 0 ms to minimize.
[2024-05-31 00:21:19] [INFO ] Deduced a trap composed of 36 places in 30 ms of which 0 ms to minimize.
[2024-05-31 00:21:19] [INFO ] Deduced a trap composed of 93 places in 151 ms of which 0 ms to minimize.
[2024-05-31 00:21:19] [INFO ] Deduced a trap composed of 109 places in 119 ms of which 1 ms to minimize.
[2024-05-31 00:21:19] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1336 ms
[2024-05-31 00:21:19] [INFO ] Added : 116 causal constraints over 24 iterations in 2572 ms. Result :sat
Minimization took 750 ms.
Current structural bounds on expressions (after SMT) : [6] Max seen :[1]
Support contains 1 out of 299 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 299/299 places, 573/573 transitions.
Applied a total of 0 rules in 15 ms. Remains 299 /299 variables (removed 0) and now considering 573/573 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 299/299 places, 573/573 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 299/299 places, 573/573 transitions.
Applied a total of 0 rules in 15 ms. Remains 299 /299 variables (removed 0) and now considering 573/573 (removed 0) transitions.
[2024-05-31 00:21:20] [INFO ] Flow matrix only has 561 transitions (discarded 12 similar events)
[2024-05-31 00:21:20] [INFO ] Invariant cache hit.
[2024-05-31 00:21:21] [INFO ] Implicit Places using invariants in 270 ms returned [74, 149, 169, 171, 264, 273]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 273 ms to find 6 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 293/299 places, 573/573 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 289 transition count 569
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 289 transition count 569
Applied a total of 8 rules in 19 ms. Remains 289 /293 variables (removed 4) and now considering 569/573 (removed 4) transitions.
[2024-05-31 00:21:21] [INFO ] Flow matrix only has 557 transitions (discarded 12 similar events)
// Phase 1: matrix 557 rows 289 cols
[2024-05-31 00:21:21] [INFO ] Computed 38 invariants in 7 ms
[2024-05-31 00:21:21] [INFO ] Implicit Places using invariants in 342 ms returned []
[2024-05-31 00:21:21] [INFO ] Flow matrix only has 557 transitions (discarded 12 similar events)
[2024-05-31 00:21:21] [INFO ] Invariant cache hit.
[2024-05-31 00:21:21] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-05-31 00:21:24] [INFO ] Implicit Places using invariants and state equation in 3202 ms returned []
Implicit Place search using SMT with State Equation took 3547 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 289/299 places, 569/573 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 3855 ms. Remains : 289/299 places, 569/573 transitions.
Normalized transition count is 557 out of 569 initially.
// Phase 1: matrix 557 rows 289 cols
[2024-05-31 00:21:24] [INFO ] Computed 38 invariants in 5 ms
Incomplete random walk after 1000000 steps, including 606 resets, run finished after 2696 ms. (steps per millisecond=370 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 1000001 steps, including 318 resets, run finished after 1387 ms. (steps per millisecond=720 ) properties (out of 1) seen :1
[2024-05-31 00:21:28] [INFO ] Flow matrix only has 557 transitions (discarded 12 similar events)
// Phase 1: matrix 557 rows 289 cols
[2024-05-31 00:21:28] [INFO ] Computed 38 invariants in 7 ms
[2024-05-31 00:21:28] [INFO ] [Real]Absence check using 15 positive place invariants in 5 ms returned sat
[2024-05-31 00:21:28] [INFO ] [Real]Absence check using 15 positive and 23 generalized place invariants in 9 ms returned sat
[2024-05-31 00:21:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 00:21:28] [INFO ] [Real]Absence check using state equation in 178 ms returned sat
[2024-05-31 00:21:28] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 00:21:29] [INFO ] [Nat]Absence check using 15 positive place invariants in 4 ms returned sat
[2024-05-31 00:21:29] [INFO ] [Nat]Absence check using 15 positive and 23 generalized place invariants in 9 ms returned sat
[2024-05-31 00:21:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 00:21:29] [INFO ] [Nat]Absence check using state equation in 311 ms returned sat
[2024-05-31 00:21:29] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-05-31 00:21:29] [INFO ] [Nat]Added 72 Read/Feed constraints in 134 ms returned sat
[2024-05-31 00:21:29] [INFO ] Deduced a trap composed of 36 places in 49 ms of which 1 ms to minimize.
[2024-05-31 00:21:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 100 ms
[2024-05-31 00:21:29] [INFO ] Computed and/alt/rep : 333/1488/327 causal constraints (skipped 228 transitions) in 35 ms.
[2024-05-31 00:21:30] [INFO ] Deduced a trap composed of 117 places in 106 ms of which 0 ms to minimize.
[2024-05-31 00:21:30] [INFO ] Deduced a trap composed of 130 places in 104 ms of which 0 ms to minimize.
[2024-05-31 00:21:30] [INFO ] Deduced a trap composed of 96 places in 93 ms of which 0 ms to minimize.
[2024-05-31 00:21:31] [INFO ] Deduced a trap composed of 101 places in 104 ms of which 0 ms to minimize.
[2024-05-31 00:21:31] [INFO ] Deduced a trap composed of 106 places in 93 ms of which 0 ms to minimize.
[2024-05-31 00:21:31] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 820 ms
[2024-05-31 00:21:31] [INFO ] Added : 116 causal constraints over 24 iterations in 1823 ms. Result :sat
Minimization took 534 ms.
Current structural bounds on expressions (after SMT) : [6] Max seen :[1]
Support contains 1 out of 289 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 289/289 places, 569/569 transitions.
Applied a total of 0 rules in 16 ms. Remains 289 /289 variables (removed 0) and now considering 569/569 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 289/289 places, 569/569 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 289/289 places, 569/569 transitions.
Applied a total of 0 rules in 14 ms. Remains 289 /289 variables (removed 0) and now considering 569/569 (removed 0) transitions.
[2024-05-31 00:21:32] [INFO ] Flow matrix only has 557 transitions (discarded 12 similar events)
[2024-05-31 00:21:32] [INFO ] Invariant cache hit.
[2024-05-31 00:21:32] [INFO ] Implicit Places using invariants in 303 ms returned []
[2024-05-31 00:21:32] [INFO ] Flow matrix only has 557 transitions (discarded 12 similar events)
[2024-05-31 00:21:32] [INFO ] Invariant cache hit.
[2024-05-31 00:21:32] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-05-31 00:21:35] [INFO ] Implicit Places using invariants and state equation in 2920 ms returned []
Implicit Place search using SMT with State Equation took 3237 ms to find 0 implicit places.
[2024-05-31 00:21:35] [INFO ] Redundant transitions in 26 ms returned []
[2024-05-31 00:21:35] [INFO ] Flow matrix only has 557 transitions (discarded 12 similar events)
[2024-05-31 00:21:35] [INFO ] Invariant cache hit.
[2024-05-31 00:21:35] [INFO ] Dead Transitions using invariants and state equation in 304 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3588 ms. Remains : 289/289 places, 569/569 transitions.
Starting property specific reduction for PolyORBLF-PT-S02J04T06-UpperBounds-14
Normalized transition count is 557 out of 569 initially.
// Phase 1: matrix 557 rows 289 cols
[2024-05-31 00:21:35] [INFO ] Computed 38 invariants in 6 ms
Incomplete random walk after 10000 steps, including 7 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 10000 steps, including 3 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :1
[2024-05-31 00:21:35] [INFO ] Flow matrix only has 557 transitions (discarded 12 similar events)
// Phase 1: matrix 557 rows 289 cols
[2024-05-31 00:21:35] [INFO ] Computed 38 invariants in 6 ms
[2024-05-31 00:21:35] [INFO ] [Real]Absence check using 15 positive place invariants in 5 ms returned sat
[2024-05-31 00:21:35] [INFO ] [Real]Absence check using 15 positive and 23 generalized place invariants in 9 ms returned sat
[2024-05-31 00:21:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 00:21:36] [INFO ] [Real]Absence check using state equation in 176 ms returned sat
[2024-05-31 00:21:36] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 00:21:36] [INFO ] [Nat]Absence check using 15 positive place invariants in 4 ms returned sat
[2024-05-31 00:21:36] [INFO ] [Nat]Absence check using 15 positive and 23 generalized place invariants in 8 ms returned sat
[2024-05-31 00:21:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 00:21:36] [INFO ] [Nat]Absence check using state equation in 302 ms returned sat
[2024-05-31 00:21:36] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-05-31 00:21:36] [INFO ] [Nat]Added 72 Read/Feed constraints in 132 ms returned sat
[2024-05-31 00:21:36] [INFO ] Deduced a trap composed of 36 places in 24 ms of which 0 ms to minimize.
[2024-05-31 00:21:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 76 ms
[2024-05-31 00:21:36] [INFO ] Computed and/alt/rep : 333/1488/327 causal constraints (skipped 228 transitions) in 35 ms.
[2024-05-31 00:21:37] [INFO ] Deduced a trap composed of 117 places in 106 ms of which 1 ms to minimize.
[2024-05-31 00:21:37] [INFO ] Deduced a trap composed of 130 places in 102 ms of which 1 ms to minimize.
[2024-05-31 00:21:38] [INFO ] Deduced a trap composed of 96 places in 100 ms of which 0 ms to minimize.
[2024-05-31 00:21:38] [INFO ] Deduced a trap composed of 101 places in 92 ms of which 0 ms to minimize.
[2024-05-31 00:21:38] [INFO ] Deduced a trap composed of 106 places in 93 ms of which 1 ms to minimize.
[2024-05-31 00:21:38] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 841 ms
[2024-05-31 00:21:38] [INFO ] Added : 116 causal constraints over 24 iterations in 1850 ms. Result :sat
Minimization took 532 ms.
Current structural bounds on expressions (after SMT) : [6] Max seen :[1]
Support contains 1 out of 289 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 289/289 places, 569/569 transitions.
Applied a total of 0 rules in 12 ms. Remains 289 /289 variables (removed 0) and now considering 569/569 (removed 0) transitions.
[2024-05-31 00:21:39] [INFO ] Flow matrix only has 557 transitions (discarded 12 similar events)
[2024-05-31 00:21:39] [INFO ] Invariant cache hit.
[2024-05-31 00:21:39] [INFO ] Dead Transitions using invariants and state equation in 426 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 441 ms. Remains : 289/289 places, 569/569 transitions.
Normalized transition count is 557 out of 569 initially.
// Phase 1: matrix 557 rows 289 cols
[2024-05-31 00:21:39] [INFO ] Computed 38 invariants in 5 ms
Incomplete random walk after 1000000 steps, including 547 resets, run finished after 2789 ms. (steps per millisecond=358 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 1000001 steps, including 292 resets, run finished after 1422 ms. (steps per millisecond=703 ) properties (out of 1) seen :1
[2024-05-31 00:21:43] [INFO ] Flow matrix only has 557 transitions (discarded 12 similar events)
// Phase 1: matrix 557 rows 289 cols
[2024-05-31 00:21:43] [INFO ] Computed 38 invariants in 6 ms
[2024-05-31 00:21:43] [INFO ] [Real]Absence check using 15 positive place invariants in 5 ms returned sat
[2024-05-31 00:21:44] [INFO ] [Real]Absence check using 15 positive and 23 generalized place invariants in 9 ms returned sat
[2024-05-31 00:21:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 00:21:44] [INFO ] [Real]Absence check using state equation in 179 ms returned sat
[2024-05-31 00:21:44] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 00:21:44] [INFO ] [Nat]Absence check using 15 positive place invariants in 4 ms returned sat
[2024-05-31 00:21:44] [INFO ] [Nat]Absence check using 15 positive and 23 generalized place invariants in 8 ms returned sat
[2024-05-31 00:21:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 00:21:44] [INFO ] [Nat]Absence check using state equation in 309 ms returned sat
[2024-05-31 00:21:44] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-05-31 00:21:44] [INFO ] [Nat]Added 72 Read/Feed constraints in 136 ms returned sat
[2024-05-31 00:21:44] [INFO ] Deduced a trap composed of 36 places in 27 ms of which 1 ms to minimize.
[2024-05-31 00:21:44] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 78 ms
[2024-05-31 00:21:44] [INFO ] Computed and/alt/rep : 333/1488/327 causal constraints (skipped 228 transitions) in 28 ms.
[2024-05-31 00:21:45] [INFO ] Deduced a trap composed of 117 places in 96 ms of which 1 ms to minimize.
[2024-05-31 00:21:45] [INFO ] Deduced a trap composed of 130 places in 90 ms of which 0 ms to minimize.
[2024-05-31 00:21:46] [INFO ] Deduced a trap composed of 96 places in 93 ms of which 0 ms to minimize.
[2024-05-31 00:21:46] [INFO ] Deduced a trap composed of 101 places in 91 ms of which 0 ms to minimize.
[2024-05-31 00:21:46] [INFO ] Deduced a trap composed of 106 places in 92 ms of which 1 ms to minimize.
[2024-05-31 00:21:46] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 776 ms
[2024-05-31 00:21:46] [INFO ] Added : 116 causal constraints over 24 iterations in 1678 ms. Result :sat
Minimization took 526 ms.
Current structural bounds on expressions (after SMT) : [6] Max seen :[1]
Support contains 1 out of 289 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 289/289 places, 569/569 transitions.
Applied a total of 0 rules in 10 ms. Remains 289 /289 variables (removed 0) and now considering 569/569 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 289/289 places, 569/569 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 289/289 places, 569/569 transitions.
Applied a total of 0 rules in 9 ms. Remains 289 /289 variables (removed 0) and now considering 569/569 (removed 0) transitions.
[2024-05-31 00:21:47] [INFO ] Flow matrix only has 557 transitions (discarded 12 similar events)
[2024-05-31 00:21:47] [INFO ] Invariant cache hit.
[2024-05-31 00:21:47] [INFO ] Implicit Places using invariants in 229 ms returned []
[2024-05-31 00:21:47] [INFO ] Flow matrix only has 557 transitions (discarded 12 similar events)
[2024-05-31 00:21:47] [INFO ] Invariant cache hit.
[2024-05-31 00:21:47] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-05-31 00:21:50] [INFO ] Implicit Places using invariants and state equation in 2619 ms returned []
Implicit Place search using SMT with State Equation took 2851 ms to find 0 implicit places.
[2024-05-31 00:21:50] [INFO ] Redundant transitions in 12 ms returned []
[2024-05-31 00:21:50] [INFO ] Flow matrix only has 557 transitions (discarded 12 similar events)
[2024-05-31 00:21:50] [INFO ] Invariant cache hit.
[2024-05-31 00:21:50] [INFO ] Dead Transitions using invariants and state equation in 285 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3162 ms. Remains : 289/289 places, 569/569 transitions.
Ending property specific reduction for PolyORBLF-PT-S02J04T06-UpperBounds-14 in 14587 ms.
[2024-05-31 00:21:50] [INFO ] Flatten gal took : 95 ms
[2024-05-31 00:21:50] [INFO ] Applying decomposition
[2024-05-31 00:21:50] [INFO ] Flatten gal took : 58 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/graph1320337997641836634.txt' '-o' '/tmp/graph1320337997641836634.bin' '-w' '/tmp/graph1320337997641836634.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph1320337997641836634.bin' '-l' '-1' '-v' '-w' '/tmp/graph1320337997641836634.weights' '-q' '0' '-e' '0.001'
[2024-05-31 00:21:50] [INFO ] Decomposing Gal with order
[2024-05-31 00:21:50] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-31 00:21:51] [INFO ] Removed a total of 520 redundant transitions.
[2024-05-31 00:21:51] [INFO ] Flatten gal took : 134 ms
[2024-05-31 00:21:51] [INFO ] Fuse similar labels procedure discarded/fused a total of 208 labels/synchronizations in 17 ms.
[2024-05-31 00:21:51] [INFO ] Time to serialize gal into /tmp/UpperBounds8138246267558016208.gal : 12 ms
[2024-05-31 00:21:51] [INFO ] Time to serialize properties into /tmp/UpperBounds7563764777744200694.prop : 25 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/UpperBounds8138246267558016208.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds7563764777744200694.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 ...283
Loading property file /tmp/UpperBounds7563764777744200694.prop.
Detected timeout of ITS tools.
[2024-05-31 00:42:08] [INFO ] Flatten gal took : 64 ms
[2024-05-31 00:42:08] [INFO ] Time to serialize gal into /tmp/UpperBounds7888586360614733436.gal : 7 ms
[2024-05-31 00:42:08] [INFO ] Time to serialize properties into /tmp/UpperBounds11762526209171125965.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/UpperBounds7888586360614733436.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds11762526209171125965.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/UpperBounds11762526209171125965.prop.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,5.51947e+06,44.2094,1105480,2,75138,5,1.80481e+06,6,0,1737,2.22295e+06,0
Total reachable state count : 5519472

Verifying 1 reachability properties.
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property PolyORBLF-PT-S02J04T06-UpperBounds-14 :0 <= IdleTasks_2 <= 1
FORMULA PolyORBLF-PT-S02J04T06-UpperBounds-14 1 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
PolyORBLF-PT-S02J04T06-UpperBounds-14,0,44.2157,1105480,1,0,7,1.80481e+06,9,1,2053,2.22295e+06,4
Total runtime 1314922 ms.

BK_STOP 1717116173264

--------------------
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="PolyORBLF-PT-S02J04T06"
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 PolyORBLF-PT-S02J04T06, 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-171654460500136"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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