About the Execution of 2021-gold for Philosophers-PT-000200
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2022-input.r179-tall-165277026800121.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool gold2021
Input is Philosophers-PT-000200, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r179-tall-165277026800121
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.5M
-rw-r--r-- 1 mcc users 115K Apr 29 11:41 CTLCardinality.txt
-rw-r--r-- 1 mcc users 632K Apr 29 11:41 CTLCardinality.xml
-rw-r--r-- 1 mcc users 178K Apr 29 11:35 CTLFireability.txt
-rw-r--r-- 1 mcc users 1.2M Apr 29 11:35 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 97K May 9 08:26 LTLCardinality.txt
-rw-r--r-- 1 mcc users 366K May 9 08:26 LTLCardinality.xml
-rw-r--r-- 1 mcc users 69K May 9 08:26 LTLFireability.txt
-rw-r--r-- 1 mcc users 344K May 9 08:26 LTLFireability.xml
-rw-r--r-- 1 mcc users 20K May 9 08:26 UpperBounds.txt
-rw-r--r-- 1 mcc users 54K May 9 08:26 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 7 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 445K May 10 09:34 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 Philosophers-PT-000200-UpperBounds-00
FORMULA_NAME Philosophers-PT-000200-UpperBounds-01
FORMULA_NAME Philosophers-PT-000200-UpperBounds-02
FORMULA_NAME Philosophers-PT-000200-UpperBounds-03
FORMULA_NAME Philosophers-PT-000200-UpperBounds-04
FORMULA_NAME Philosophers-PT-000200-UpperBounds-05
FORMULA_NAME Philosophers-PT-000200-UpperBounds-06
FORMULA_NAME Philosophers-PT-000200-UpperBounds-07
FORMULA_NAME Philosophers-PT-000200-UpperBounds-08
FORMULA_NAME Philosophers-PT-000200-UpperBounds-09
FORMULA_NAME Philosophers-PT-000200-UpperBounds-10
FORMULA_NAME Philosophers-PT-000200-UpperBounds-11
FORMULA_NAME Philosophers-PT-000200-UpperBounds-12
FORMULA_NAME Philosophers-PT-000200-UpperBounds-13
FORMULA_NAME Philosophers-PT-000200-UpperBounds-14
FORMULA_NAME Philosophers-PT-000200-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1652828089871
Running Version 0
[2022-05-17 22:54:51] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-17 22:54:51] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-17 22:54:51] [INFO ] Load time of PNML (sax parser for PT used): 101 ms
[2022-05-17 22:54:51] [INFO ] Transformed 1000 places.
[2022-05-17 22:54:51] [INFO ] Transformed 1000 transitions.
[2022-05-17 22:54:51] [INFO ] Parsed PT model containing 1000 places and 1000 transitions in 154 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 19 ms.
// Phase 1: matrix 1000 rows 1000 cols
[2022-05-17 22:54:51] [INFO ] Computed 400 place invariants in 23 ms
FORMULA Philosophers-PT-000200-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Philosophers-PT-000200-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Philosophers-PT-000200-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Philosophers-PT-000200-UpperBounds-01 200 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 2 resets, run finished after 557 ms. (steps per millisecond=17 ) properties (out of 12) seen :550
FORMULA Philosophers-PT-000200-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Philosophers-PT-000200-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Philosophers-PT-000200-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Philosophers-PT-000200-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Philosophers-PT-000200-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 104 ms. (steps per millisecond=96 ) properties (out of 7) seen :27
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 111 ms. (steps per millisecond=90 ) properties (out of 7) seen :16
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 109 ms. (steps per millisecond=91 ) properties (out of 7) seen :16
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 111 ms. (steps per millisecond=90 ) properties (out of 7) seen :16
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 108 ms. (steps per millisecond=92 ) properties (out of 7) seen :9
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 121 ms. (steps per millisecond=82 ) properties (out of 7) seen :27
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 112 ms. (steps per millisecond=89 ) properties (out of 7) seen :27
// Phase 1: matrix 1000 rows 1000 cols
[2022-05-17 22:54:53] [INFO ] Computed 400 place invariants in 15 ms
[2022-05-17 22:54:53] [INFO ] [Real]Absence check using 400 positive place invariants in 87 ms returned sat
[2022-05-17 22:54:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 22:54:53] [INFO ] [Real]Absence check using state equation in 311 ms returned sat
[2022-05-17 22:54:53] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 22:54:54] [INFO ] [Nat]Absence check using 400 positive place invariants in 76 ms returned sat
[2022-05-17 22:54:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 22:54:54] [INFO ] [Nat]Absence check using state equation in 288 ms returned sat
[2022-05-17 22:54:54] [INFO ] Computed and/alt/rep : 600/800/600 causal constraints (skipped 0 transitions) in 55 ms.
[2022-05-17 22:54:54] [INFO ] Added : 19 causal constraints over 4 iterations in 422 ms. Result :sat
Minimization took 118 ms.
[2022-05-17 22:54:55] [INFO ] [Real]Absence check using 400 positive place invariants in 72 ms returned sat
[2022-05-17 22:54:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 22:54:55] [INFO ] [Real]Absence check using state equation in 274 ms returned sat
[2022-05-17 22:54:55] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 22:54:55] [INFO ] [Nat]Absence check using 400 positive place invariants in 62 ms returned sat
[2022-05-17 22:54:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 22:54:55] [INFO ] [Nat]Absence check using state equation in 282 ms returned sat
[2022-05-17 22:54:56] [INFO ] Computed and/alt/rep : 600/800/600 causal constraints (skipped 0 transitions) in 43 ms.
[2022-05-17 22:54:56] [INFO ] Added : 35 causal constraints over 7 iterations in 481 ms. Result :sat
Minimization took 136 ms.
[2022-05-17 22:54:56] [INFO ] [Real]Absence check using 400 positive place invariants in 63 ms returned sat
[2022-05-17 22:54:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 22:54:57] [INFO ] [Real]Absence check using state equation in 273 ms returned sat
[2022-05-17 22:54:57] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 22:54:57] [INFO ] [Nat]Absence check using 400 positive place invariants in 63 ms returned sat
[2022-05-17 22:54:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 22:54:57] [INFO ] [Nat]Absence check using state equation in 278 ms returned sat
[2022-05-17 22:54:57] [INFO ] Computed and/alt/rep : 600/800/600 causal constraints (skipped 0 transitions) in 43 ms.
[2022-05-17 22:54:58] [INFO ] Added : 35 causal constraints over 7 iterations in 465 ms. Result :sat
Minimization took 142 ms.
[2022-05-17 22:54:58] [INFO ] [Real]Absence check using 400 positive place invariants in 60 ms returned sat
[2022-05-17 22:54:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 22:54:58] [INFO ] [Real]Absence check using state equation in 282 ms returned sat
[2022-05-17 22:54:58] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 22:54:58] [INFO ] [Nat]Absence check using 400 positive place invariants in 79 ms returned sat
[2022-05-17 22:54:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 22:54:59] [INFO ] [Nat]Absence check using state equation in 267 ms returned sat
[2022-05-17 22:54:59] [INFO ] Computed and/alt/rep : 600/800/600 causal constraints (skipped 0 transitions) in 48 ms.
[2022-05-17 22:54:59] [INFO ] Added : 35 causal constraints over 7 iterations in 480 ms. Result :sat
Minimization took 138 ms.
[2022-05-17 22:55:00] [INFO ] [Real]Absence check using 400 positive place invariants in 64 ms returned sat
[2022-05-17 22:55:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 22:55:00] [INFO ] [Real]Absence check using state equation in 261 ms returned sat
[2022-05-17 22:55:00] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 22:55:00] [INFO ] [Nat]Absence check using 400 positive place invariants in 72 ms returned sat
[2022-05-17 22:55:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 22:55:00] [INFO ] [Nat]Absence check using state equation in 283 ms returned sat
[2022-05-17 22:55:00] [INFO ] Computed and/alt/rep : 600/800/600 causal constraints (skipped 0 transitions) in 38 ms.
[2022-05-17 22:55:01] [INFO ] Added : 28 causal constraints over 6 iterations in 387 ms. Result :sat
Minimization took 108 ms.
[2022-05-17 22:55:01] [INFO ] [Real]Absence check using 400 positive place invariants in 73 ms returned sat
[2022-05-17 22:55:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 22:55:01] [INFO ] [Real]Absence check using state equation in 286 ms returned sat
[2022-05-17 22:55:01] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 22:55:01] [INFO ] [Nat]Absence check using 400 positive place invariants in 71 ms returned sat
[2022-05-17 22:55:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 22:55:02] [INFO ] [Nat]Absence check using state equation in 300 ms returned sat
[2022-05-17 22:55:02] [INFO ] Computed and/alt/rep : 600/800/600 causal constraints (skipped 0 transitions) in 40 ms.
[2022-05-17 22:55:02] [INFO ] Added : 19 causal constraints over 4 iterations in 305 ms. Result :sat
Minimization took 124 ms.
[2022-05-17 22:55:02] [INFO ] [Real]Absence check using 400 positive place invariants in 89 ms returned sat
[2022-05-17 22:55:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 22:55:03] [INFO ] [Real]Absence check using state equation in 272 ms returned sat
[2022-05-17 22:55:03] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 22:55:03] [INFO ] [Nat]Absence check using 400 positive place invariants in 72 ms returned sat
[2022-05-17 22:55:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 22:55:03] [INFO ] [Nat]Absence check using state equation in 281 ms returned sat
[2022-05-17 22:55:03] [INFO ] Computed and/alt/rep : 600/800/600 causal constraints (skipped 0 transitions) in 49 ms.
[2022-05-17 22:55:04] [INFO ] Added : 19 causal constraints over 4 iterations in 311 ms. Result :sat
Minimization took 116 ms.
Current structural bounds on expressions (after SMT) : [200, 200, 200, 200, 200, 200, 200] Max seen :[118, 34, 34, 34, 89, 118, 118]
Incomplete Parikh walk after 25700 steps, including 112 resets, run finished after 1348 ms. (steps per millisecond=19 ) properties (out of 7) seen :635 could not realise parikh vector
FORMULA Philosophers-PT-000200-UpperBounds-07 200 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA Philosophers-PT-000200-UpperBounds-06 200 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA Philosophers-PT-000200-UpperBounds-00 200 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 25700 steps, including 112 resets, run finished after 923 ms. (steps per millisecond=27 ) properties (out of 4) seen :39 could not realise parikh vector
Incomplete Parikh walk after 28400 steps, including 122 resets, run finished after 1135 ms. (steps per millisecond=25 ) properties (out of 4) seen :233 could not realise parikh vector
FORMULA Philosophers-PT-000200-UpperBounds-05 200 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 26300 steps, including 119 resets, run finished after 755 ms. (steps per millisecond=34 ) properties (out of 3) seen :294 could not realise parikh vector
Incomplete Parikh walk after 26300 steps, including 119 resets, run finished after 752 ms. (steps per millisecond=34 ) properties (out of 3) seen :291 could not realise parikh vector
Incomplete Parikh walk after 26300 steps, including 119 resets, run finished after 753 ms. (steps per millisecond=34 ) properties (out of 3) seen :294 could not realise parikh vector
Incomplete Parikh walk after 25700 steps, including 112 resets, run finished after 848 ms. (steps per millisecond=30 ) properties (out of 3) seen :36 could not realise parikh vector
Support contains 200 out of 1000 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1000/1000 places, 1000/1000 transitions.
Free-agglomeration rule (complex) applied 400 times.
Iterating global reduction 0 with 400 rules applied. Total rules applied 400 place count 1000 transition count 600
Reduce places removed 400 places and 0 transitions.
Ensure Unique test removed 200 transitions
Reduce isomorphic transitions removed 200 transitions.
Iterating post reduction 0 with 600 rules applied. Total rules applied 1000 place count 600 transition count 400
Applied a total of 1000 rules in 241 ms. Remains 600 /1000 variables (removed 400) and now considering 400/1000 (removed 600) transitions.
Finished structural reductions, in 1 iterations. Remains : 600/1000 places, 400/1000 transitions.
// Phase 1: matrix 400 rows 600 cols
[2022-05-17 22:55:10] [INFO ] Computed 400 place invariants in 13 ms
Interrupted random walk after 980954 steps, including 2 resets, run timeout after 30001 ms. (steps per millisecond=32 ) properties seen :{0=73, 1=73, 2=73}
Interrupted Best-First random walk after 657701 steps, including 1 resets, run timeout after 5001 ms. (steps per millisecond=131 ) properties seen :{0=97, 1=97, 2=97}
Interrupted Best-First random walk after 694478 steps, including 2 resets, run timeout after 5001 ms. (steps per millisecond=138 ) properties seen :{0=98, 1=98, 2=98}
Interrupted Best-First random walk after 692289 steps, including 2 resets, run timeout after 5001 ms. (steps per millisecond=138 ) properties seen :{0=98, 1=98, 2=98}
// Phase 1: matrix 400 rows 600 cols
[2022-05-17 22:55:56] [INFO ] Computed 400 place invariants in 5 ms
[2022-05-17 22:55:56] [INFO ] [Real]Absence check using 400 positive place invariants in 73 ms returned sat
[2022-05-17 22:55:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 22:55:56] [INFO ] [Real]Absence check using state equation in 156 ms returned sat
[2022-05-17 22:55:56] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 22:55:56] [INFO ] [Nat]Absence check using 400 positive place invariants in 76 ms returned sat
[2022-05-17 22:55:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 22:55:56] [INFO ] [Nat]Absence check using state equation in 141 ms returned sat
[2022-05-17 22:55:56] [INFO ] Computed and/alt/rep : 200/200/200 causal constraints (skipped 0 transitions) in 17 ms.
[2022-05-17 22:55:56] [INFO ] Added : 0 causal constraints over 0 iterations in 54 ms. Result :sat
Minimization took 62 ms.
[2022-05-17 22:55:56] [INFO ] [Real]Absence check using 400 positive place invariants in 74 ms returned sat
[2022-05-17 22:55:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 22:55:57] [INFO ] [Real]Absence check using state equation in 144 ms returned sat
[2022-05-17 22:55:57] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 22:55:57] [INFO ] [Nat]Absence check using 400 positive place invariants in 75 ms returned sat
[2022-05-17 22:55:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 22:55:57] [INFO ] [Nat]Absence check using state equation in 133 ms returned sat
[2022-05-17 22:55:57] [INFO ] Computed and/alt/rep : 200/200/200 causal constraints (skipped 0 transitions) in 17 ms.
[2022-05-17 22:55:57] [INFO ] Added : 0 causal constraints over 0 iterations in 51 ms. Result :sat
Minimization took 67 ms.
[2022-05-17 22:55:57] [INFO ] [Real]Absence check using 400 positive place invariants in 75 ms returned sat
[2022-05-17 22:55:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 22:55:57] [INFO ] [Real]Absence check using state equation in 145 ms returned sat
[2022-05-17 22:55:57] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 22:55:57] [INFO ] [Nat]Absence check using 400 positive place invariants in 74 ms returned sat
[2022-05-17 22:55:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 22:55:58] [INFO ] [Nat]Absence check using state equation in 142 ms returned sat
[2022-05-17 22:55:58] [INFO ] Computed and/alt/rep : 200/200/200 causal constraints (skipped 0 transitions) in 18 ms.
[2022-05-17 22:55:58] [INFO ] Added : 0 causal constraints over 0 iterations in 53 ms. Result :sat
Minimization took 65 ms.
Current structural bounds on expressions (after SMT) : [200, 200, 200] Max seen :[98, 98, 98]
Incomplete Parikh walk after 10000 steps, including 97 resets, run finished after 275 ms. (steps per millisecond=36 ) properties (out of 3) seen :300 could not realise parikh vector
Incomplete Parikh walk after 10000 steps, including 97 resets, run finished after 272 ms. (steps per millisecond=36 ) properties (out of 3) seen :300 could not realise parikh vector
Incomplete Parikh walk after 10000 steps, including 97 resets, run finished after 275 ms. (steps per millisecond=36 ) properties (out of 3) seen :300 could not realise parikh vector
Support contains 200 out of 600 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 600/600 places, 400/400 transitions.
Applied a total of 0 rules in 16 ms. Remains 600 /600 variables (removed 0) and now considering 400/400 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 600/600 places, 400/400 transitions.
Starting structural reductions, iteration 0 : 600/600 places, 400/400 transitions.
Applied a total of 0 rules in 15 ms. Remains 600 /600 variables (removed 0) and now considering 400/400 (removed 0) transitions.
// Phase 1: matrix 400 rows 600 cols
[2022-05-17 22:55:59] [INFO ] Computed 400 place invariants in 5 ms
[2022-05-17 22:55:59] [INFO ] Implicit Places using invariants in 356 ms returned [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 82, 83, 84, 85, 86, 87, 88, 89, 90, 91, 92, 93, 94, 95, 96, 97, 98, 99, 100, 101, 102, 103, 104, 105, 106, 107, 108, 109, 110, 111, 112, 113, 114, 115, 116, 117, 118, 119, 120, 121, 122, 123, 124, 125, 126, 127, 128, 129, 130, 131, 132, 133, 134, 135, 136, 137, 138, 139, 140, 141, 142, 143, 144, 145, 146, 147, 148, 149, 150, 151, 152, 153, 154, 155, 156, 157, 158, 159, 160, 161, 162, 163, 164, 165, 166, 167, 168, 169, 170, 171, 172, 173, 174, 175, 176, 177, 178, 179, 180, 181, 182, 183, 184, 185, 186, 187, 188, 193, 194, 196, 197, 198, 199, 200, 201, 202, 203, 204]
Discarding 200 places :
Implicit Place search using SMT only with invariants took 358 ms to find 200 implicit places.
[2022-05-17 22:55:59] [INFO ] Redundant transitions in 24 ms returned []
// Phase 1: matrix 400 rows 400 cols
[2022-05-17 22:55:59] [INFO ] Computed 200 place invariants in 3 ms
[2022-05-17 22:55:59] [INFO ] Dead Transitions using invariants and state equation in 177 ms returned []
Starting structural reductions, iteration 1 : 400/600 places, 400/400 transitions.
Applied a total of 0 rules in 8 ms. Remains 400 /400 variables (removed 0) and now considering 400/400 (removed 0) transitions.
[2022-05-17 22:55:59] [INFO ] Redundant transitions in 6 ms returned []
// Phase 1: matrix 400 rows 400 cols
[2022-05-17 22:55:59] [INFO ] Computed 200 place invariants in 1 ms
[2022-05-17 22:55:59] [INFO ] Dead Transitions using invariants and state equation in 180 ms returned []
Finished structural reductions, in 2 iterations. Remains : 400/600 places, 400/400 transitions.
// Phase 1: matrix 400 rows 400 cols
[2022-05-17 22:55:59] [INFO ] Computed 200 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 23849 ms. (steps per millisecond=41 ) properties (out of 3) seen :222
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 4984 ms. (steps per millisecond=200 ) properties (out of 3) seen :294
Interrupted Best-First random walk after 999214 steps, including 2 resets, run timeout after 5001 ms. (steps per millisecond=199 ) properties seen :{0=98, 1=98, 2=98}
Interrupted Best-First random walk after 995192 steps, including 2 resets, run timeout after 5001 ms. (steps per millisecond=198 ) properties seen :{0=98, 1=98, 2=98}
// Phase 1: matrix 400 rows 400 cols
[2022-05-17 22:56:38] [INFO ] Computed 200 place invariants in 9 ms
[2022-05-17 22:56:38] [INFO ] [Real]Absence check using 200 positive place invariants in 37 ms returned unsat
[2022-05-17 22:56:38] [INFO ] [Real]Absence check using 200 positive place invariants in 37 ms returned unsat
[2022-05-17 22:56:38] [INFO ] [Real]Absence check using 200 positive place invariants in 42 ms returned unsat
Current structural bounds on expressions (after SMT) : [100, 100, 100] Max seen :[100, 100, 100]
FORMULA Philosophers-PT-000200-UpperBounds-04 100 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA Philosophers-PT-000200-UpperBounds-03 100 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA Philosophers-PT-000200-UpperBounds-02 100 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
All properties solved without resorting to model-checking.
BK_STOP 1652828199962
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ cut -d . -f 9
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
+ VERSION=0
+ echo 'Running Version 0'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination UpperBounds -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m
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="Philosophers-PT-000200"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2021"
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-4028"
echo " Executing tool gold2021"
echo " Input is Philosophers-PT-000200, 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 r179-tall-165277026800121"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/Philosophers-PT-000200.tgz
mv Philosophers-PT-000200 execution
cd execution
if [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "UpperBounds" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] || [ "UpperBounds" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "UpperBounds" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "UpperBounds" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "UpperBounds.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property UpperBounds.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "UpperBounds.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] ; then
echo "FORMULA_NAME UpperBounds"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;