About the Execution of 2021-gold for Philosophers-PT-010000
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-165277026800136.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-010000, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r179-tall-165277026800136
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 170M
-rw-r--r-- 1 mcc users 8.4M Apr 30 01:09 CTLCardinality.txt
-rw-r--r-- 1 mcc users 42M Apr 30 01:08 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.1M Apr 29 16:34 CTLFireability.txt
-rw-r--r-- 1 mcc users 48M Apr 29 16:33 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 4.7M May 9 08:26 LTLCardinality.txt
-rw-r--r-- 1 mcc users 17M May 9 08:26 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.5M May 9 08:26 LTLFireability.txt
-rw-r--r-- 1 mcc users 15M May 9 08:26 LTLFireability.xml
-rw-r--r-- 1 mcc users 970K May 9 08:26 UpperBounds.txt
-rw-r--r-- 1 mcc users 2.6M 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 22M 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-010000-UpperBounds-00
FORMULA_NAME Philosophers-PT-010000-UpperBounds-01
FORMULA_NAME Philosophers-PT-010000-UpperBounds-02
FORMULA_NAME Philosophers-PT-010000-UpperBounds-03
FORMULA_NAME Philosophers-PT-010000-UpperBounds-04
FORMULA_NAME Philosophers-PT-010000-UpperBounds-05
FORMULA_NAME Philosophers-PT-010000-UpperBounds-06
FORMULA_NAME Philosophers-PT-010000-UpperBounds-07
FORMULA_NAME Philosophers-PT-010000-UpperBounds-08
FORMULA_NAME Philosophers-PT-010000-UpperBounds-09
FORMULA_NAME Philosophers-PT-010000-UpperBounds-10
FORMULA_NAME Philosophers-PT-010000-UpperBounds-11
FORMULA_NAME Philosophers-PT-010000-UpperBounds-12
FORMULA_NAME Philosophers-PT-010000-UpperBounds-13
FORMULA_NAME Philosophers-PT-010000-UpperBounds-14
FORMULA_NAME Philosophers-PT-010000-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1652830402716
Running Version 0
[2022-05-17 23:33:24] [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 23:33:24] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-17 23:33:25] [INFO ] Load time of PNML (sax parser for PT used): 1168 ms
[2022-05-17 23:33:25] [INFO ] Transformed 50000 places.
[2022-05-17 23:33:25] [INFO ] Transformed 50000 transitions.
[2022-05-17 23:33:25] [INFO ] Parsed PT model containing 50000 places and 50000 transitions in 1458 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 14369 ms.
// Phase 1: matrix 50000 rows 50000 cols
[2022-05-17 23:33:40] [INFO ] Computed 20000 place invariants in 300 ms
FORMULA Philosophers-PT-010000-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Philosophers-PT-010000-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Philosophers-PT-010000-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Philosophers-PT-010000-UpperBounds-06 10000 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Philosophers-PT-010000-UpperBounds-04 10000 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Philosophers-PT-010000-UpperBounds-02 10000 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Philosophers-PT-010000-UpperBounds-00 10000 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Interrupted random walk after 6145 steps, including 1 resets, run timeout after 30004 ms. (steps per millisecond=0 ) properties seen :{0=1375, 1=262, 2=1386, 3=262, 5=1}
FORMULA Philosophers-PT-010000-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Interrupted Best-First random walk after 9001 steps, including 0 resets, run timeout after 5142 ms. (steps per millisecond=1 ) properties seen :{}
Interrupted Best-First random walk after 9001 steps, including 0 resets, run timeout after 5267 ms. (steps per millisecond=1 ) properties seen :{}
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 5491 ms. (steps per millisecond=1 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 5389 ms. (steps per millisecond=1 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 2573 ms. (steps per millisecond=3 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 2375 ms. (steps per millisecond=4 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 2496 ms. (steps per millisecond=4 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 2476 ms. (steps per millisecond=4 ) properties (out of 8) seen :0
// Phase 1: matrix 50000 rows 50000 cols
[2022-05-17 23:34:42] [INFO ] Computed 20000 place invariants in 214 ms
Current structural bounds on expressions (after SMT) : [10000, 10000, 10000, 10000, 1, 1, 1, 1] Max seen :[1375, 262, 1386, 262, 0, 0, 0, 0]
Support contains 30000 out of 50000 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 50000/50000 places, 50000/50000 transitions.
Applied a total of 0 rules in 523 ms. Remains 50000 /50000 variables (removed 0) and now considering 50000/50000 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 50000/50000 places, 50000/50000 transitions.
// Phase 1: matrix 50000 rows 50000 cols
[2022-05-17 23:35:23] [INFO ] Computed 20000 place invariants in 171 ms
Interrupted random walk after 5727 steps, including 0 resets, run timeout after 30003 ms. (steps per millisecond=0 ) properties seen :{0=2067, 1=653, 2=2012, 3=653, 7=1}
FORMULA Philosophers-PT-010000-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Interrupted Best-First random walk after 10001 steps, including 0 resets, run timeout after 5442 ms. (steps per millisecond=1 ) properties seen :{}
Interrupted Best-First random walk after 10001 steps, including 0 resets, run timeout after 5515 ms. (steps per millisecond=1 ) properties seen :{}
Interrupted Best-First random walk after 10001 steps, including 0 resets, run timeout after 5233 ms. (steps per millisecond=1 ) properties seen :{}
Interrupted Best-First random walk after 10001 steps, including 0 resets, run timeout after 5430 ms. (steps per millisecond=1 ) properties seen :{}
Interrupted Best-First random walk after 21002 steps, including 0 resets, run timeout after 5084 ms. (steps per millisecond=4 ) properties seen :{2=1}
Interrupted Best-First random walk after 21002 steps, including 0 resets, run timeout after 5192 ms. (steps per millisecond=4 ) properties seen :{2=1}
Interrupted Best-First random walk after 20001 steps, including 0 resets, run timeout after 5089 ms. (steps per millisecond=3 ) properties seen :{}
// Phase 1: matrix 50000 rows 50000 cols
[2022-05-17 23:36:30] [INFO ] Computed 20000 place invariants in 122 ms
Current structural bounds on expressions (after SMT) : [10000, 10000, 10000, 10000, 1, 1, 1] Max seen :[2067, 653, 2012, 653, 0, 0, 0]
Support contains 30000 out of 50000 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 50000/50000 places, 50000/50000 transitions.
Applied a total of 0 rules in 323 ms. Remains 50000 /50000 variables (removed 0) and now considering 50000/50000 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 50000/50000 places, 50000/50000 transitions.
// Phase 1: matrix 50000 rows 50000 cols
[2022-05-17 23:37:30] [INFO ] Computed 20000 place invariants in 135 ms
Interrupted random walk after 6135 steps, including 0 resets, run timeout after 30005 ms. (steps per millisecond=0 ) properties seen :{0=2073, 1=763, 2=2070, 3=763}
Interrupted Best-First random walk after 10001 steps, including 0 resets, run timeout after 5583 ms. (steps per millisecond=1 ) properties seen :{}
Interrupted Best-First random walk after 10001 steps, including 0 resets, run timeout after 5513 ms. (steps per millisecond=1 ) properties seen :{}
Interrupted Best-First random walk after 10001 steps, including 0 resets, run timeout after 5495 ms. (steps per millisecond=1 ) properties seen :{}
Interrupted Best-First random walk after 12001 steps, including 0 resets, run timeout after 5200 ms. (steps per millisecond=2 ) properties seen :{}
Interrupted Best-First random walk after 20001 steps, including 0 resets, run timeout after 5012 ms. (steps per millisecond=3 ) properties seen :{}
Interrupted Best-First random walk after 21002 steps, including 0 resets, run timeout after 5166 ms. (steps per millisecond=4 ) properties seen :{2=1}
Interrupted Best-First random walk after 21002 steps, including 0 resets, run timeout after 5092 ms. (steps per millisecond=4 ) properties seen :{2=1}
// Phase 1: matrix 50000 rows 50000 cols
[2022-05-17 23:38:38] [INFO ] Computed 20000 place invariants in 192 ms
Current structural bounds on expressions (after SMT) : [10000, 10000, 10000, 10000, 1, 1, 1] Max seen :[2073, 763, 2070, 763, 0, 0, 0]
Support contains 30000 out of 50000 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 50000/50000 places, 50000/50000 transitions.
Applied a total of 0 rules in 303 ms. Remains 50000 /50000 variables (removed 0) and now considering 50000/50000 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 50000/50000 places, 50000/50000 transitions.
Starting structural reductions, iteration 0 : 50000/50000 places, 50000/50000 transitions.
Applied a total of 0 rules in 282 ms. Remains 50000 /50000 variables (removed 0) and now considering 50000/50000 (removed 0) transitions.
// Phase 1: matrix 50000 rows 50000 cols
[2022-05-17 23:39:38] [INFO ] Computed 20000 place invariants in 200 ms
[2022-05-17 23:39:42] [INFO ] Implicit Places using invariants in 3773 ms returned []
Implicit Place search using SMT only with invariants took 3783 ms to find 0 implicit places.
// Phase 1: matrix 50000 rows 50000 cols
[2022-05-17 23:39:42] [INFO ] Computed 20000 place invariants in 170 ms
[2022-05-17 23:39:46] [INFO ] Dead Transitions using invariants and state equation in 4193 ms returned []
Finished structural reductions, in 1 iterations. Remains : 50000/50000 places, 50000/50000 transitions.
// Phase 1: matrix 50000 rows 50000 cols
[2022-05-17 23:39:46] [INFO ] Computed 20000 place invariants in 169 ms
Interrupted random walk after 5440 steps, including 0 resets, run timeout after 30005 ms. (steps per millisecond=0 ) properties seen :{0=1916, 1=597, 2=1990, 3=597}
Interrupted Best-First random walk after 12001 steps, including 0 resets, run timeout after 5370 ms. (steps per millisecond=2 ) properties seen :{}
Interrupted Best-First random walk after 12001 steps, including 0 resets, run timeout after 5269 ms. (steps per millisecond=2 ) properties seen :{}
Interrupted Best-First random walk after 12001 steps, including 0 resets, run timeout after 5289 ms. (steps per millisecond=2 ) properties seen :{}
Interrupted Best-First random walk after 12001 steps, including 0 resets, run timeout after 5252 ms. (steps per millisecond=2 ) properties seen :{}
Interrupted Best-First random walk after 21002 steps, including 0 resets, run timeout after 5107 ms. (steps per millisecond=4 ) properties seen :{2=1}
Interrupted Best-First random walk after 21002 steps, including 0 resets, run timeout after 5114 ms. (steps per millisecond=4 ) properties seen :{2=1}
Interrupted Best-First random walk after 21002 steps, including 0 resets, run timeout after 5126 ms. (steps per millisecond=4 ) properties seen :{0=1}
// Phase 1: matrix 50000 rows 50000 cols
[2022-05-17 23:40:53] [INFO ] Computed 20000 place invariants in 139 ms
Current structural bounds on expressions (after SMT) : [10000, 10000, 10000, 10000, 1, 1, 1] Max seen :[2073, 763, 2070, 763, 0, 0, 0]
Support contains 30000 out of 50000 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 50000/50000 places, 50000/50000 transitions.
Applied a total of 0 rules in 268 ms. Remains 50000 /50000 variables (removed 0) and now considering 50000/50000 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 50000/50000 places, 50000/50000 transitions.
Starting structural reductions, iteration 0 : 50000/50000 places, 50000/50000 transitions.
Applied a total of 0 rules in 242 ms. Remains 50000 /50000 variables (removed 0) and now considering 50000/50000 (removed 0) transitions.
// Phase 1: matrix 50000 rows 50000 cols
[2022-05-17 23:41:52] [INFO ] Computed 20000 place invariants in 162 ms
[2022-05-17 23:41:56] [INFO ] Implicit Places using invariants in 4055 ms returned []
Implicit Place search using SMT only with invariants took 4056 ms to find 0 implicit places.
// Phase 1: matrix 50000 rows 50000 cols
[2022-05-17 23:41:56] [INFO ] Computed 20000 place invariants in 167 ms
[2022-05-17 23:42:00] [INFO ] Dead Transitions using invariants and state equation in 4109 ms returned []
Finished structural reductions, in 1 iterations. Remains : 50000/50000 places, 50000/50000 transitions.
Starting property specific reduction for Philosophers-PT-010000-UpperBounds-01
// Phase 1: matrix 50000 rows 50000 cols
[2022-05-17 23:42:00] [INFO ] Computed 20000 place invariants in 174 ms
Interrupted random walk after 7476 steps, including 2 resets, run timeout after 30004 ms. (steps per millisecond=0 ) properties seen :{0=1392}
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 5438 ms. (steps per millisecond=1 ) properties (out of 1) seen :0
// Phase 1: matrix 50000 rows 50000 cols
[2022-05-17 23:42:36] [INFO ] Computed 20000 place invariants in 167 ms
Current structural bounds on expressions (after SMT) : [10000] Max seen :[1392]
Support contains 10000 out of 50000 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 50000/50000 places, 50000/50000 transitions.
Performed 10000 Post agglomeration using F-continuation condition.Transition count delta: 10000
Deduced a syphon composed of 10000 places in 10 ms
Reduce places removed 10000 places and 0 transitions.
Iterating global reduction 0 with 20000 rules applied. Total rules applied 20000 place count 40000 transition count 40000
Free-agglomeration rule (complex) applied 10000 times.
Iterating global reduction 0 with 10000 rules applied. Total rules applied 30000 place count 40000 transition count 30000
Reduce places removed 10000 places and 0 transitions.
Drop transitions removed 10000 transitions
Reduce isomorphic transitions removed 10000 transitions.
Iterating post reduction 0 with 20000 rules applied. Total rules applied 50000 place count 30000 transition count 20000
Applied a total of 50000 rules in 18797 ms. Remains 30000 /50000 variables (removed 20000) and now considering 20000/50000 (removed 30000) transitions.
Finished structural reductions, in 1 iterations. Remains : 30000/50000 places, 20000/50000 transitions.
// Phase 1: matrix 20000 rows 30000 cols
[2022-05-17 23:43:00] [INFO ] Computed 20000 place invariants in 37 ms
Interrupted random walk after 12705 steps, including 0 resets, run timeout after 30002 ms. (steps per millisecond=0 ) properties seen :{0=6456}
Interrupted Best-First random walk after 10001 steps, including 0 resets, run timeout after 5388 ms. (steps per millisecond=1 ) properties seen :{}
// Phase 1: matrix 20000 rows 30000 cols
[2022-05-17 23:43:35] [INFO ] Computed 20000 place invariants in 40 ms
[2022-05-17 23:44:20] [INFO ] [Real]Absence check using 20000 positive place invariants in 41112 ms returned unknown
Current structural bounds on expressions (after SMT) : [10000] Max seen :[6456]
Support contains 10000 out of 30000 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 30000/30000 places, 20000/20000 transitions.
Applied a total of 0 rules in 273 ms. Remains 30000 /30000 variables (removed 0) and now considering 20000/20000 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 30000/30000 places, 20000/20000 transitions.
Starting structural reductions, iteration 0 : 30000/30000 places, 20000/20000 transitions.
Applied a total of 0 rules in 186 ms. Remains 30000 /30000 variables (removed 0) and now considering 20000/20000 (removed 0) transitions.
// Phase 1: matrix 20000 rows 30000 cols
[2022-05-17 23:44:21] [INFO ] Computed 20000 place invariants in 58 ms
[2022-05-17 23:44:23] [INFO ] Implicit Places using invariants in 2339 ms returned []
Implicit Place search using SMT only with invariants took 2341 ms to find 0 implicit places.
// Phase 1: matrix 20000 rows 30000 cols
[2022-05-17 23:44:23] [INFO ] Computed 20000 place invariants in 44 ms
[2022-05-17 23:44:25] [INFO ] Dead Transitions using invariants and state equation in 2159 ms returned []
Finished structural reductions, in 1 iterations. Remains : 30000/30000 places, 20000/20000 transitions.
// Phase 1: matrix 20000 rows 30000 cols
[2022-05-17 23:44:25] [INFO ] Computed 20000 place invariants in 43 ms
Interrupted random walk after 12802 steps, including 0 resets, run timeout after 30001 ms. (steps per millisecond=0 ) properties seen :{0=6569}
Interrupted Best-First random walk after 10001 steps, including 0 resets, run timeout after 5418 ms. (steps per millisecond=1 ) properties seen :{}
// Phase 1: matrix 20000 rows 30000 cols
[2022-05-17 23:45:01] [INFO ] Computed 20000 place invariants in 48 ms
[2022-05-17 23:45:46] [INFO ] [Real]Absence check using 20000 positive place invariants in 41193 ms returned unknown
Current structural bounds on expressions (after SMT) : [10000] Max seen :[6569]
Support contains 10000 out of 30000 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 30000/30000 places, 20000/20000 transitions.
Applied a total of 0 rules in 197 ms. Remains 30000 /30000 variables (removed 0) and now considering 20000/20000 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 30000/30000 places, 20000/20000 transitions.
Starting structural reductions, iteration 0 : 30000/30000 places, 20000/20000 transitions.
Applied a total of 0 rules in 151 ms. Remains 30000 /30000 variables (removed 0) and now considering 20000/20000 (removed 0) transitions.
// Phase 1: matrix 20000 rows 30000 cols
[2022-05-17 23:45:46] [INFO ] Computed 20000 place invariants in 44 ms
[2022-05-17 23:45:49] [INFO ] Implicit Places using invariants in 2448 ms returned []
Implicit Place search using SMT only with invariants took 2449 ms to find 0 implicit places.
// Phase 1: matrix 20000 rows 30000 cols
[2022-05-17 23:45:49] [INFO ] Computed 20000 place invariants in 46 ms
[2022-05-17 23:45:51] [INFO ] Dead Transitions using invariants and state equation in 2457 ms returned []
Finished structural reductions, in 1 iterations. Remains : 30000/30000 places, 20000/20000 transitions.
// Phase 1: matrix 20000 rows 30000 cols
[2022-05-17 23:45:51] [INFO ] Computed 20000 place invariants in 49 ms
Interrupted random walk after 12662 steps, including 0 resets, run timeout after 30002 ms. (steps per millisecond=0 ) properties seen :{0=6443}
Interrupted Best-First random walk after 12002 steps, including 0 resets, run timeout after 5189 ms. (steps per millisecond=2 ) properties seen :{0=1}
// Phase 1: matrix 20000 rows 30000 cols
[2022-05-17 23:46:27] [INFO ] Computed 20000 place invariants in 45 ms
[2022-05-17 23:47:12] [INFO ] [Real]Absence check using 20000 positive place invariants in 41481 ms returned unknown
Current structural bounds on expressions (after SMT) : [10000] Max seen :[6569]
Support contains 10000 out of 30000 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 30000/30000 places, 20000/20000 transitions.
Applied a total of 0 rules in 130 ms. Remains 30000 /30000 variables (removed 0) and now considering 20000/20000 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 30000/30000 places, 20000/20000 transitions.
Starting structural reductions, iteration 0 : 30000/30000 places, 20000/20000 transitions.
Applied a total of 0 rules in 131 ms. Remains 30000 /30000 variables (removed 0) and now considering 20000/20000 (removed 0) transitions.
// Phase 1: matrix 20000 rows 30000 cols
[2022-05-17 23:47:12] [INFO ] Computed 20000 place invariants in 43 ms
[2022-05-17 23:47:15] [INFO ] Implicit Places using invariants in 2440 ms returned []
Implicit Place search using SMT only with invariants took 2444 ms to find 0 implicit places.
// Phase 1: matrix 20000 rows 30000 cols
[2022-05-17 23:47:15] [INFO ] Computed 20000 place invariants in 55 ms
[2022-05-17 23:47:17] [INFO ] Dead Transitions using invariants and state equation in 2516 ms returned []
Finished structural reductions, in 1 iterations. Remains : 30000/30000 places, 20000/20000 transitions.
Ending property specific reduction for Philosophers-PT-010000-UpperBounds-01 in 317159 ms.
Starting property specific reduction for Philosophers-PT-010000-UpperBounds-03
// Phase 1: matrix 50000 rows 50000 cols
[2022-05-17 23:47:17] [INFO ] Computed 20000 place invariants in 158 ms
Interrupted random walk after 8626 steps, including 2 resets, run timeout after 30002 ms. (steps per millisecond=0 ) properties seen :{0=294}
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 4372 ms. (steps per millisecond=2 ) properties (out of 1) seen :0
// Phase 1: matrix 50000 rows 50000 cols
[2022-05-17 23:47:52] [INFO ] Computed 20000 place invariants in 158 ms
Current structural bounds on expressions (after SMT) : [10000] Max seen :[294]
Support contains 10000 out of 50000 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 50000/50000 places, 50000/50000 transitions.
Free-agglomeration rule (complex) applied 20000 times.
Iterating global reduction 0 with 20000 rules applied. Total rules applied 20000 place count 50000 transition count 30000
Reduce places removed 20000 places and 0 transitions.
Ensure Unique test removed 10000 transitions
Reduce isomorphic transitions removed 10000 transitions.
Iterating post reduction 0 with 30000 rules applied. Total rules applied 50000 place count 30000 transition count 20000
Applied a total of 50000 rules in 27427 ms. Remains 30000 /50000 variables (removed 20000) and now considering 20000/50000 (removed 30000) transitions.
Finished structural reductions, in 1 iterations. Remains : 30000/50000 places, 20000/50000 transitions.
// Phase 1: matrix 20000 rows 30000 cols
[2022-05-17 23:48:24] [INFO ] Computed 20000 place invariants in 56 ms
Interrupted random walk after 15415 steps, including 0 resets, run timeout after 30002 ms. (steps per millisecond=0 ) properties seen :{0=2776}
Interrupted Best-First random walk after 12002 steps, including 0 resets, run timeout after 5212 ms. (steps per millisecond=2 ) properties seen :{0=1}
// Phase 1: matrix 20000 rows 30000 cols
[2022-05-17 23:49:00] [INFO ] Computed 20000 place invariants in 49 ms
[2022-05-17 23:49:40] [INFO ] [Real]Absence check using 20000 positive place invariants in 36806 ms returned sat
[2022-05-17 23:49:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 23:49:45] [INFO ] [Real]Absence check using state equation in 4668 ms returned unknown
Current structural bounds on expressions (after SMT) : [10000] Max seen :[2776]
Support contains 10000 out of 30000 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 30000/30000 places, 20000/20000 transitions.
Applied a total of 0 rules in 138 ms. Remains 30000 /30000 variables (removed 0) and now considering 20000/20000 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 30000/30000 places, 20000/20000 transitions.
Starting structural reductions, iteration 0 : 30000/30000 places, 20000/20000 transitions.
Applied a total of 0 rules in 161 ms. Remains 30000 /30000 variables (removed 0) and now considering 20000/20000 (removed 0) transitions.
// Phase 1: matrix 20000 rows 30000 cols
[2022-05-17 23:49:45] [INFO ] Computed 20000 place invariants in 43 ms
[2022-05-17 23:49:48] [INFO ] Implicit Places using invariants in 2488 ms returned []
Implicit Place search using SMT only with invariants took 2493 ms to find 0 implicit places.
// Phase 1: matrix 20000 rows 30000 cols
[2022-05-17 23:49:48] [INFO ] Computed 20000 place invariants in 62 ms
[2022-05-17 23:49:50] [INFO ] Dead Transitions using invariants and state equation in 2196 ms returned []
Finished structural reductions, in 1 iterations. Remains : 30000/30000 places, 20000/20000 transitions.
// Phase 1: matrix 20000 rows 30000 cols
[2022-05-17 23:49:50] [INFO ] Computed 20000 place invariants in 43 ms
Interrupted random walk after 15315 steps, including 0 resets, run timeout after 30001 ms. (steps per millisecond=0 ) properties seen :{0=2841}
Interrupted Best-First random walk after 12002 steps, including 0 resets, run timeout after 5175 ms. (steps per millisecond=2 ) properties seen :{0=1}
// Phase 1: matrix 20000 rows 30000 cols
[2022-05-17 23:50:25] [INFO ] Computed 20000 place invariants in 42 ms
[2022-05-17 23:51:07] [INFO ] [Real]Absence check using 20000 positive place invariants in 38364 ms returned sat
[2022-05-17 23:51:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 23:51:10] [INFO ] [Real]Absence check using state equation in 3041 ms returned unknown
Current structural bounds on expressions (after SMT) : [10000] Max seen :[2841]
Support contains 10000 out of 30000 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 30000/30000 places, 20000/20000 transitions.
Applied a total of 0 rules in 132 ms. Remains 30000 /30000 variables (removed 0) and now considering 20000/20000 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 30000/30000 places, 20000/20000 transitions.
Starting structural reductions, iteration 0 : 30000/30000 places, 20000/20000 transitions.
Applied a total of 0 rules in 149 ms. Remains 30000 /30000 variables (removed 0) and now considering 20000/20000 (removed 0) transitions.
// Phase 1: matrix 20000 rows 30000 cols
[2022-05-17 23:51:11] [INFO ] Computed 20000 place invariants in 59 ms
[2022-05-17 23:51:13] [INFO ] Implicit Places using invariants in 2354 ms returned []
Implicit Place search using SMT only with invariants took 2364 ms to find 0 implicit places.
// Phase 1: matrix 20000 rows 30000 cols
[2022-05-17 23:51:13] [INFO ] Computed 20000 place invariants in 78 ms
[2022-05-17 23:51:15] [INFO ] Dead Transitions using invariants and state equation in 2498 ms returned []
Finished structural reductions, in 1 iterations. Remains : 30000/30000 places, 20000/20000 transitions.
// Phase 1: matrix 20000 rows 30000 cols
[2022-05-17 23:51:16] [INFO ] Computed 20000 place invariants in 51 ms
Interrupted random walk after 15300 steps, including 0 resets, run timeout after 30001 ms. (steps per millisecond=0 ) properties seen :{0=2811}
Interrupted Best-First random walk after 12002 steps, including 0 resets, run timeout after 5314 ms. (steps per millisecond=2 ) properties seen :{0=1}
// Phase 1: matrix 20000 rows 30000 cols
[2022-05-17 23:51:51] [INFO ] Computed 20000 place invariants in 51 ms
[2022-05-17 23:52:35] [INFO ] [Real]Absence check using 20000 positive place invariants in 39955 ms returned sat
[2022-05-17 23:52:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 23:52:36] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:571)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2242)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:446)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
Current structural bounds on expressions (after SMT) : [10000] Max seen :[2841]
Support contains 10000 out of 30000 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 30000/30000 places, 20000/20000 transitions.
Applied a total of 0 rules in 172 ms. Remains 30000 /30000 variables (removed 0) and now considering 20000/20000 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 30000/30000 places, 20000/20000 transitions.
Starting structural reductions, iteration 0 : 30000/30000 places, 20000/20000 transitions.
Applied a total of 0 rules in 159 ms. Remains 30000 /30000 variables (removed 0) and now considering 20000/20000 (removed 0) transitions.
// Phase 1: matrix 20000 rows 30000 cols
[2022-05-17 23:52:37] [INFO ] Computed 20000 place invariants in 62 ms
[2022-05-17 23:52:39] [INFO ] Implicit Places using invariants in 2203 ms returned []
Implicit Place search using SMT only with invariants took 2215 ms to find 0 implicit places.
// Phase 1: matrix 20000 rows 30000 cols
[2022-05-17 23:52:39] [INFO ] Computed 20000 place invariants in 63 ms
[2022-05-17 23:52:41] [INFO ] Dead Transitions using invariants and state equation in 2180 ms returned []
Finished structural reductions, in 1 iterations. Remains : 30000/30000 places, 20000/20000 transitions.
Ending property specific reduction for Philosophers-PT-010000-UpperBounds-03 in 323829 ms.
Starting property specific reduction for Philosophers-PT-010000-UpperBounds-05
// Phase 1: matrix 50000 rows 50000 cols
[2022-05-17 23:52:41] [INFO ] Computed 20000 place invariants in 130 ms
Interrupted random walk after 8354 steps, including 2 resets, run timeout after 30001 ms. (steps per millisecond=0 ) properties seen :{0=1357}
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 4489 ms. (steps per millisecond=2 ) properties (out of 1) seen :0
// Phase 1: matrix 50000 rows 50000 cols
[2022-05-17 23:53:16] [INFO ] Computed 20000 place invariants in 129 ms
Current structural bounds on expressions (after SMT) : [10000] Max seen :[1357]
Support contains 10000 out of 50000 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 50000/50000 places, 50000/50000 transitions.
Performed 10000 Post agglomeration using F-continuation condition.Transition count delta: 10000
Deduced a syphon composed of 10000 places in 10 ms
Reduce places removed 10000 places and 0 transitions.
Iterating global reduction 0 with 20000 rules applied. Total rules applied 20000 place count 40000 transition count 40000
Free-agglomeration rule (complex) applied 10000 times.
Iterating global reduction 0 with 10000 rules applied. Total rules applied 30000 place count 40000 transition count 30000
Reduce places removed 10000 places and 0 transitions.
Drop transitions removed 10000 transitions
Reduce isomorphic transitions removed 10000 transitions.
Iterating post reduction 0 with 20000 rules applied. Total rules applied 50000 place count 30000 transition count 20000
Applied a total of 50000 rules in 22926 ms. Remains 30000 /50000 variables (removed 20000) and now considering 20000/50000 (removed 30000) transitions.
Finished structural reductions, in 1 iterations. Remains : 30000/50000 places, 20000/50000 transitions.
// Phase 1: matrix 20000 rows 30000 cols
[2022-05-17 23:53:44] [INFO ] Computed 20000 place invariants in 46 ms
Interrupted random walk after 12734 steps, including 0 resets, run timeout after 30003 ms. (steps per millisecond=0 ) properties seen :{0=6374}
Interrupted Best-First random walk after 12002 steps, including 0 resets, run timeout after 5264 ms. (steps per millisecond=2 ) properties seen :{0=1}
// Phase 1: matrix 20000 rows 30000 cols
[2022-05-17 23:54:19] [INFO ] Computed 20000 place invariants in 43 ms
[2022-05-17 23:55:04] [INFO ] [Real]Absence check using 20000 positive place invariants in 41533 ms returned unknown
Current structural bounds on expressions (after SMT) : [10000] Max seen :[6374]
Support contains 10000 out of 30000 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 30000/30000 places, 20000/20000 transitions.
Applied a total of 0 rules in 155 ms. Remains 30000 /30000 variables (removed 0) and now considering 20000/20000 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 30000/30000 places, 20000/20000 transitions.
Starting structural reductions, iteration 0 : 30000/30000 places, 20000/20000 transitions.
Applied a total of 0 rules in 139 ms. Remains 30000 /30000 variables (removed 0) and now considering 20000/20000 (removed 0) transitions.
// Phase 1: matrix 20000 rows 30000 cols
[2022-05-17 23:55:05] [INFO ] Computed 20000 place invariants in 51 ms
[2022-05-17 23:55:07] [INFO ] Implicit Places using invariants in 2230 ms returned []
Implicit Place search using SMT only with invariants took 2244 ms to find 0 implicit places.
// Phase 1: matrix 20000 rows 30000 cols
[2022-05-17 23:55:07] [INFO ] Computed 20000 place invariants in 36 ms
[2022-05-17 23:55:09] [INFO ] Dead Transitions using invariants and state equation in 2175 ms returned []
Finished structural reductions, in 1 iterations. Remains : 30000/30000 places, 20000/20000 transitions.
// Phase 1: matrix 20000 rows 30000 cols
[2022-05-17 23:55:09] [INFO ] Computed 20000 place invariants in 43 ms
Interrupted random walk after 12567 steps, including 0 resets, run timeout after 30014 ms. (steps per millisecond=0 ) properties seen :{0=6520}
Interrupted Best-First random walk after 12002 steps, including 0 resets, run timeout after 5263 ms. (steps per millisecond=2 ) properties seen :{0=1}
// Phase 1: matrix 20000 rows 30000 cols
[2022-05-17 23:55:44] [INFO ] Computed 20000 place invariants in 43 ms
[2022-05-17 23:56:30] [INFO ] [Real]Absence check using 20000 positive place invariants in 41412 ms returned unknown
Current structural bounds on expressions (after SMT) : [10000] Max seen :[6520]
Support contains 10000 out of 30000 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 30000/30000 places, 20000/20000 transitions.
Applied a total of 0 rules in 142 ms. Remains 30000 /30000 variables (removed 0) and now considering 20000/20000 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 30000/30000 places, 20000/20000 transitions.
Starting structural reductions, iteration 0 : 30000/30000 places, 20000/20000 transitions.
Applied a total of 0 rules in 146 ms. Remains 30000 /30000 variables (removed 0) and now considering 20000/20000 (removed 0) transitions.
// Phase 1: matrix 20000 rows 30000 cols
[2022-05-17 23:56:30] [INFO ] Computed 20000 place invariants in 43 ms
[2022-05-17 23:56:32] [INFO ] Implicit Places using invariants in 2220 ms returned []
Implicit Place search using SMT only with invariants took 2223 ms to find 0 implicit places.
// Phase 1: matrix 20000 rows 30000 cols
[2022-05-17 23:56:32] [INFO ] Computed 20000 place invariants in 36 ms
[2022-05-17 23:56:34] [INFO ] Dead Transitions using invariants and state equation in 2205 ms returned []
Finished structural reductions, in 1 iterations. Remains : 30000/30000 places, 20000/20000 transitions.
// Phase 1: matrix 20000 rows 30000 cols
[2022-05-17 23:56:34] [INFO ] Computed 20000 place invariants in 42 ms
Interrupted random walk after 12756 steps, including 0 resets, run timeout after 30002 ms. (steps per millisecond=0 ) properties seen :{0=6505}
Interrupted Best-First random walk after 12002 steps, including 0 resets, run timeout after 5197 ms. (steps per millisecond=2 ) properties seen :{0=1}
// Phase 1: matrix 20000 rows 30000 cols
[2022-05-17 23:57:10] [INFO ] Computed 20000 place invariants in 41 ms
[2022-05-17 23:57:55] [INFO ] [Real]Absence check using 20000 positive place invariants in 41100 ms returned unknown
Current structural bounds on expressions (after SMT) : [10000] Max seen :[6520]
Support contains 10000 out of 30000 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 30000/30000 places, 20000/20000 transitions.
Applied a total of 0 rules in 136 ms. Remains 30000 /30000 variables (removed 0) and now considering 20000/20000 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 30000/30000 places, 20000/20000 transitions.
Starting structural reductions, iteration 0 : 30000/30000 places, 20000/20000 transitions.
Applied a total of 0 rules in 131 ms. Remains 30000 /30000 variables (removed 0) and now considering 20000/20000 (removed 0) transitions.
// Phase 1: matrix 20000 rows 30000 cols
[2022-05-17 23:57:55] [INFO ] Computed 20000 place invariants in 37 ms
[2022-05-17 23:57:57] [INFO ] Implicit Places using invariants in 2214 ms returned []
Implicit Place search using SMT only with invariants took 2235 ms to find 0 implicit places.
// Phase 1: matrix 20000 rows 30000 cols
[2022-05-17 23:57:57] [INFO ] Computed 20000 place invariants in 51 ms
[2022-05-17 23:58:00] [INFO ] Dead Transitions using invariants and state equation in 2319 ms returned []
Finished structural reductions, in 1 iterations. Remains : 30000/30000 places, 20000/20000 transitions.
Ending property specific reduction for Philosophers-PT-010000-UpperBounds-05 in 318763 ms.
Starting property specific reduction for Philosophers-PT-010000-UpperBounds-07
// Phase 1: matrix 50000 rows 50000 cols
[2022-05-17 23:58:00] [INFO ] Computed 20000 place invariants in 174 ms
Interrupted random walk after 8305 steps, including 2 resets, run timeout after 30001 ms. (steps per millisecond=0 ) properties seen :{0=273}
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 4304 ms. (steps per millisecond=2 ) properties (out of 1) seen :0
// Phase 1: matrix 50000 rows 50000 cols
[2022-05-17 23:58:34] [INFO ] Computed 20000 place invariants in 136 ms
Current structural bounds on expressions (after SMT) : [10000] Max seen :[273]
Support contains 10000 out of 50000 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 50000/50000 places, 50000/50000 transitions.
Free-agglomeration rule (complex) applied 20000 times.
Iterating global reduction 0 with 20000 rules applied. Total rules applied 20000 place count 50000 transition count 30000
Reduce places removed 20000 places and 0 transitions.
Ensure Unique test removed 10000 transitions
Reduce isomorphic transitions removed 10000 transitions.
Iterating post reduction 0 with 30000 rules applied. Total rules applied 50000 place count 30000 transition count 20000
Applied a total of 50000 rules in 33621 ms. Remains 30000 /50000 variables (removed 20000) and now considering 20000/50000 (removed 30000) transitions.
Finished structural reductions, in 1 iterations. Remains : 30000/50000 places, 20000/50000 transitions.
// Phase 1: matrix 20000 rows 30000 cols
[2022-05-17 23:59:13] [INFO ] Computed 20000 place invariants in 47 ms
Interrupted random walk after 15364 steps, including 0 resets, run timeout after 30002 ms. (steps per millisecond=0 ) properties seen :{0=2822}
Interrupted Best-First random walk after 12002 steps, including 0 resets, run timeout after 5342 ms. (steps per millisecond=2 ) properties seen :{0=1}
// Phase 1: matrix 20000 rows 30000 cols
[2022-05-17 23:59:49] [INFO ] Computed 20000 place invariants in 46 ms
[2022-05-18 00:00:32] [INFO ] [Real]Absence check using 20000 positive place invariants in 39544 ms returned sat
[2022-05-18 00:00:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 00:00:34] [INFO ] [Real]Absence check using state equation in 1879 ms returned unknown
Current structural bounds on expressions (after SMT) : [10000] Max seen :[2822]
Support contains 10000 out of 30000 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 30000/30000 places, 20000/20000 transitions.
Applied a total of 0 rules in 147 ms. Remains 30000 /30000 variables (removed 0) and now considering 20000/20000 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 30000/30000 places, 20000/20000 transitions.
Starting structural reductions, iteration 0 : 30000/30000 places, 20000/20000 transitions.
Applied a total of 0 rules in 164 ms. Remains 30000 /30000 variables (removed 0) and now considering 20000/20000 (removed 0) transitions.
// Phase 1: matrix 20000 rows 30000 cols
[2022-05-18 00:00:34] [INFO ] Computed 20000 place invariants in 50 ms
[2022-05-18 00:00:36] [INFO ] Implicit Places using invariants in 2206 ms returned []
Implicit Place search using SMT only with invariants took 2219 ms to find 0 implicit places.
// Phase 1: matrix 20000 rows 30000 cols
[2022-05-18 00:00:36] [INFO ] Computed 20000 place invariants in 48 ms
[2022-05-18 00:00:38] [INFO ] Dead Transitions using invariants and state equation in 2210 ms returned []
Finished structural reductions, in 1 iterations. Remains : 30000/30000 places, 20000/20000 transitions.
// Phase 1: matrix 20000 rows 30000 cols
[2022-05-18 00:00:39] [INFO ] Computed 20000 place invariants in 49 ms
Interrupted random walk after 15370 steps, including 0 resets, run timeout after 30002 ms. (steps per millisecond=0 ) properties seen :{0=2789}
Interrupted Best-First random walk after 12002 steps, including 0 resets, run timeout after 5408 ms. (steps per millisecond=2 ) properties seen :{0=1}
// Phase 1: matrix 20000 rows 30000 cols
[2022-05-18 00:01:14] [INFO ] Computed 20000 place invariants in 47 ms
[2022-05-18 00:01:57] [INFO ] [Real]Absence check using 20000 positive place invariants in 39078 ms returned sat
[2022-05-18 00:01:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 00:01:59] [INFO ] [Real]Absence check using state equation in 2330 ms returned unknown
Current structural bounds on expressions (after SMT) : [10000] Max seen :[2822]
Support contains 10000 out of 30000 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 30000/30000 places, 20000/20000 transitions.
Applied a total of 0 rules in 152 ms. Remains 30000 /30000 variables (removed 0) and now considering 20000/20000 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 30000/30000 places, 20000/20000 transitions.
Starting structural reductions, iteration 0 : 30000/30000 places, 20000/20000 transitions.
Applied a total of 0 rules in 159 ms. Remains 30000 /30000 variables (removed 0) and now considering 20000/20000 (removed 0) transitions.
// Phase 1: matrix 20000 rows 30000 cols
[2022-05-18 00:02:00] [INFO ] Computed 20000 place invariants in 48 ms
[2022-05-18 00:02:02] [INFO ] Implicit Places using invariants in 2171 ms returned []
Implicit Place search using SMT only with invariants took 2192 ms to find 0 implicit places.
// Phase 1: matrix 20000 rows 30000 cols
[2022-05-18 00:02:02] [INFO ] Computed 20000 place invariants in 57 ms
[2022-05-18 00:02:04] [INFO ] Dead Transitions using invariants and state equation in 2260 ms returned []
Finished structural reductions, in 1 iterations. Remains : 30000/30000 places, 20000/20000 transitions.
Ending property specific reduction for Philosophers-PT-010000-UpperBounds-07 in 244329 ms.
Starting property specific reduction for Philosophers-PT-010000-UpperBounds-09
// Phase 1: matrix 50000 rows 50000 cols
[2022-05-18 00:02:04] [INFO ] Computed 20000 place invariants in 120 ms
Interrupted random walk after 8795 steps, including 2 resets, run timeout after 30004 ms. (steps per millisecond=0 ) properties seen :{}
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 2522 ms. (steps per millisecond=3 ) properties (out of 1) seen :0
// Phase 1: matrix 50000 rows 50000 cols
[2022-05-18 00:02:37] [INFO ] Computed 20000 place invariants in 142 ms
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 50000 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 50000/50000 places, 50000/50000 transitions.
Performed 9999 Post agglomeration using F-continuation condition.Transition count delta: 9999
Deduced a syphon composed of 9999 places in 14 ms
Reduce places removed 9999 places and 0 transitions.
Iterating global reduction 0 with 19998 rules applied. Total rules applied 19998 place count 40001 transition count 40001
Free-agglomeration rule (complex) applied 20000 times.
Iterating global reduction 0 with 20000 rules applied. Total rules applied 39998 place count 40001 transition count 20001
Reduce places removed 39997 places and 0 transitions.
Drop transitions removed 19998 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 19999 transitions.
Iterating post reduction 0 with 59996 rules applied. Total rules applied 99994 place count 4 transition count 2
Ensure Unique test removed 2 places
Iterating post reduction 1 with 2 rules applied. Total rules applied 99996 place count 2 transition count 2
Applied a total of 99996 rules in 46056 ms. Remains 2 /50000 variables (removed 49998) and now considering 2/50000 (removed 49998) transitions.
Finished structural reductions, in 1 iterations. Remains : 2/50000 places, 2/50000 transitions.
// Phase 1: matrix 2 rows 2 cols
[2022-05-18 00:03:28] [INFO ] Computed 1 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 242 ms. (steps per millisecond=4132 ) properties (out of 1) seen :1
FORMULA Philosophers-PT-010000-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Ending property specific reduction for Philosophers-PT-010000-UpperBounds-09 in 84184 ms.
Starting property specific reduction for Philosophers-PT-010000-UpperBounds-12
// Phase 1: matrix 50000 rows 50000 cols
[2022-05-18 00:03:28] [INFO ] Computed 20000 place invariants in 142 ms
Interrupted random walk after 9542 steps, including 2 resets, run timeout after 30001 ms. (steps per millisecond=0 ) properties seen :{}
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 2601 ms. (steps per millisecond=3 ) properties (out of 1) seen :0
// Phase 1: matrix 50000 rows 50000 cols
[2022-05-18 00:04:01] [INFO ] Computed 20000 place invariants in 133 ms
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 50000 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 50000/50000 places, 50000/50000 transitions.
Performed 9999 Post agglomeration using F-continuation condition.Transition count delta: 9999
Deduced a syphon composed of 9999 places in 10 ms
Reduce places removed 9999 places and 0 transitions.
Iterating global reduction 0 with 19998 rules applied. Total rules applied 19998 place count 40001 transition count 40001
Free-agglomeration rule (complex) applied 20000 times.
Iterating global reduction 0 with 20000 rules applied. Total rules applied 39998 place count 40001 transition count 20001
Reduce places removed 39997 places and 0 transitions.
Drop transitions removed 19998 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 19999 transitions.
Iterating post reduction 0 with 59996 rules applied. Total rules applied 99994 place count 4 transition count 2
Ensure Unique test removed 2 places
Iterating post reduction 1 with 2 rules applied. Total rules applied 99996 place count 2 transition count 2
Applied a total of 99996 rules in 33446 ms. Remains 2 /50000 variables (removed 49998) and now considering 2/50000 (removed 49998) transitions.
Finished structural reductions, in 1 iterations. Remains : 2/50000 places, 2/50000 transitions.
// Phase 1: matrix 2 rows 2 cols
[2022-05-18 00:04:40] [INFO ] Computed 1 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 249 ms. (steps per millisecond=4016 ) properties (out of 1) seen :1
FORMULA Philosophers-PT-010000-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Ending property specific reduction for Philosophers-PT-010000-UpperBounds-12 in 71666 ms.
Starting property specific reduction for Philosophers-PT-010000-UpperBounds-13
// Phase 1: matrix 50000 rows 50000 cols
[2022-05-18 00:04:40] [INFO ] Computed 20000 place invariants in 189 ms
Interrupted random walk after 9517 steps, including 2 resets, run timeout after 30003 ms. (steps per millisecond=0 ) properties seen :{}
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 2422 ms. (steps per millisecond=4 ) properties (out of 1) seen :0
// Phase 1: matrix 50000 rows 50000 cols
[2022-05-18 00:05:13] [INFO ] Computed 20000 place invariants in 126 ms
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 50000 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 50000/50000 places, 50000/50000 transitions.
Performed 9999 Post agglomeration using F-continuation condition.Transition count delta: 9999
Deduced a syphon composed of 9999 places in 10 ms
Reduce places removed 9999 places and 0 transitions.
Iterating global reduction 0 with 19998 rules applied. Total rules applied 19998 place count 40001 transition count 40001
Free-agglomeration rule (complex) applied 20000 times.
Iterating global reduction 0 with 20000 rules applied. Total rules applied 39998 place count 40001 transition count 20001
Reduce places removed 39997 places and 0 transitions.
Drop transitions removed 19998 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 19999 transitions.
Iterating post reduction 0 with 59996 rules applied. Total rules applied 99994 place count 4 transition count 2
Ensure Unique test removed 2 places
Iterating post reduction 1 with 2 rules applied. Total rules applied 99996 place count 2 transition count 2
Applied a total of 99996 rules in 36154 ms. Remains 2 /50000 variables (removed 49998) and now considering 2/50000 (removed 49998) transitions.
Finished structural reductions, in 1 iterations. Remains : 2/50000 places, 2/50000 transitions.
// Phase 1: matrix 2 rows 2 cols
[2022-05-18 00:05:54] [INFO ] Computed 1 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 292 ms. (steps per millisecond=3424 ) properties (out of 1) seen :1
FORMULA Philosophers-PT-010000-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Ending property specific reduction for Philosophers-PT-010000-UpperBounds-13 in 74291 ms.
[2022-05-18 00:05:57] [INFO ] Flatten gal took : 2436 ms
[2022-05-18 00:05:59] [INFO ] Applying decomposition
[2022-05-18 00:06:01] [INFO ] Flatten gal took : 1779 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph7068978228136557343.txt, -o, /tmp/graph7068978228136557343.bin, -w, /tmp/graph7068978228136557343.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph7068978228136557343.bin, -l, -1, -v, -w, /tmp/graph7068978228136557343.weights, -q, 0, -e, 0.001], workingDir=null]
[2022-05-18 00:06:07] [INFO ] Decomposing Gal with order
[2022-05-18 00:06:23] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-18 00:21:10] [INFO ] Removed a total of 9901 redundant transitions.
[2022-05-18 00:21:11] [INFO ] Flatten gal took : 3465 ms
[2022-05-18 00:28:51] [INFO ] Fuse similar labels procedure discarded/fused a total of 33416 labels/synchronizations in 969 ms.
[2022-05-18 00:29:24] [INFO ] Time to serialize gal into /tmp/UpperBounds7949918182217355405.gal : 597 ms
[2022-05-18 00:29:24] [INFO ] Time to serialize properties into /tmp/UpperBounds3791736074215254173.prop : 42 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/UpperBounds7949918182217355405.gal, -t, CGAL, -reachable-file, /tmp/UpperBounds3791736074215254173.prop, --nowitness, --gen-order, FOLLOW], workingDir=/home/mcc/execution]
its-reach command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp/UpperBounds7949918182217355405.gal -t CGAL -reachable-file /tmp/UpperBounds3791736074215254173.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/UpperBounds3791736074215254173.prop.
BK_TIME_CONFINEMENT_REACHED
--------------------
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-010000"
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-010000, 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-165277026800136"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/Philosophers-PT-010000.tgz
mv Philosophers-PT-010000 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 ;