About the Execution of 2022-gold for Referendum-PT-1000
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2023-input.r351-tall-167889220900066.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool gold2022
Input is Referendum-PT-1000, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r351-tall-167889220900066
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 34M
-rw-r--r-- 1 mcc users 589K Feb 26 19:14 CTLCardinality.txt
-rw-r--r-- 1 mcc users 2.6M Feb 26 19:14 CTLCardinality.xml
-rw-r--r-- 1 mcc users 574K Feb 26 18:05 CTLFireability.txt
-rw-r--r-- 1 mcc users 4.0M Feb 26 18:05 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 556K Feb 25 16:42 LTLCardinality.txt
-rw-r--r-- 1 mcc users 1.8M Feb 25 16:42 LTLCardinality.xml
-rw-r--r-- 1 mcc users 258K Feb 25 16:42 LTLFireability.txt
-rw-r--r-- 1 mcc users 1.3M Feb 25 16:42 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.7M Feb 26 20:37 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 7.6M Feb 26 20:37 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 1.5M Feb 26 19:40 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 11M Feb 26 19:40 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 72K Feb 25 16:42 UpperBounds.txt
-rw-r--r-- 1 mcc users 176K Feb 25 16:42 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 1.2M Mar 5 18:23 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 Referendum-PT-1000-UpperBounds-00
FORMULA_NAME Referendum-PT-1000-UpperBounds-01
FORMULA_NAME Referendum-PT-1000-UpperBounds-02
FORMULA_NAME Referendum-PT-1000-UpperBounds-03
FORMULA_NAME Referendum-PT-1000-UpperBounds-04
FORMULA_NAME Referendum-PT-1000-UpperBounds-05
FORMULA_NAME Referendum-PT-1000-UpperBounds-06
FORMULA_NAME Referendum-PT-1000-UpperBounds-07
FORMULA_NAME Referendum-PT-1000-UpperBounds-08
FORMULA_NAME Referendum-PT-1000-UpperBounds-09
FORMULA_NAME Referendum-PT-1000-UpperBounds-10
FORMULA_NAME Referendum-PT-1000-UpperBounds-11
FORMULA_NAME Referendum-PT-1000-UpperBounds-12
FORMULA_NAME Referendum-PT-1000-UpperBounds-13
FORMULA_NAME Referendum-PT-1000-UpperBounds-14
FORMULA_NAME Referendum-PT-1000-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1679137348811
Running Version 202205111006
[2023-03-18 11:02:30] [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]
[2023-03-18 11:02:30] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-18 11:02:30] [INFO ] Load time of PNML (sax parser for PT used): 213 ms
[2023-03-18 11:02:30] [INFO ] Transformed 3001 places.
[2023-03-18 11:02:30] [INFO ] Transformed 2001 transitions.
[2023-03-18 11:02:30] [INFO ] Found NUPN structural information;
[2023-03-18 11:02:30] [INFO ] Parsed PT model containing 3001 places and 2001 transitions in 337 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 62 ms.
FORMULA Referendum-PT-1000-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Referendum-PT-1000-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Referendum-PT-1000-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Referendum-PT-1000-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Referendum-PT-1000-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
// Phase 1: matrix 2001 rows 3001 cols
[2023-03-18 11:02:30] [INFO ] Computed 1000 place invariants in 39 ms
Incomplete random walk after 10000 steps, including 9 resets, run finished after 2932 ms. (steps per millisecond=3 ) properties (out of 11) seen :3554
FORMULA Referendum-PT-1000-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Referendum-PT-1000-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Referendum-PT-1000-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Referendum-PT-1000-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Referendum-PT-1000-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Referendum-PT-1000-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Referendum-PT-1000-UpperBounds-06 1000 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Referendum-PT-1000-UpperBounds-04 1000 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 349 ms. (steps per millisecond=28 ) properties (out of 3) seen :4
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 346 ms. (steps per millisecond=28 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 328 ms. (steps per millisecond=30 ) properties (out of 3) seen :4
// Phase 1: matrix 2001 rows 3001 cols
[2023-03-18 11:02:34] [INFO ] Computed 1000 place invariants in 15 ms
[2023-03-18 11:02:35] [INFO ] [Real]Absence check using 1000 positive place invariants in 296 ms returned sat
[2023-03-18 11:02:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 11:02:36] [INFO ] [Real]Absence check using state equation in 1187 ms returned sat
[2023-03-18 11:02:36] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 11:02:42] [INFO ] [Real]Absence check using 1000 positive place invariants in 242 ms returned sat
[2023-03-18 11:02:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 11:02:43] [INFO ] [Real]Absence check using state equation in 1258 ms returned sat
[2023-03-18 11:02:43] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 11:02:47] [INFO ] [Real]Absence check using 1000 positive place invariants in 253 ms returned sat
[2023-03-18 11:02:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 11:02:48] [INFO ] [Real]Absence check using state equation in 1230 ms returned sat
[2023-03-18 11:02:48] [INFO ] Solution in real domain found non-integer solution.
Current structural bounds on expressions (after SMT) : [1000, 1000, 1000] Max seen :[514, 520, 514]
Support contains 2000 out of 3001 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 3001/3001 places, 2001/2001 transitions.
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 3000 transition count 2000
Applied a total of 1 rules in 439 ms. Remains 3000 /3001 variables (removed 1) and now considering 2000/2001 (removed 1) transitions.
Finished structural reductions, in 1 iterations. Remains : 3000/3001 places, 2000/2001 transitions.
// Phase 1: matrix 2000 rows 3000 cols
[2023-03-18 11:02:52] [INFO ] Computed 1000 place invariants in 33 ms
Finished random walk after 153658 steps, including 153 resets, run visited all 3 properties in 30001 ms. (steps per millisecond=5 )
Interrupted Best-First random walk after 145526 steps, including 0 resets, run timeout after 5036 ms. (steps per millisecond=28 ) properties seen 150
Interrupted Best-First random walk after 145526 steps, including 0 resets, run timeout after 5026 ms. (steps per millisecond=28 ) properties seen 75
Interrupted Best-First random walk after 144525 steps, including 0 resets, run timeout after 5001 ms. (steps per millisecond=28 ) properties seen 148
// Phase 1: matrix 2000 rows 3000 cols
[2023-03-18 11:03:37] [INFO ] Computed 1000 place invariants in 13 ms
[2023-03-18 11:03:38] [INFO ] [Real]Absence check using 1000 positive place invariants in 239 ms returned sat
[2023-03-18 11:03:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 11:03:39] [INFO ] [Real]Absence check using state equation in 1159 ms returned sat
[2023-03-18 11:03:39] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 11:03:43] [INFO ] [Real]Absence check using 1000 positive place invariants in 239 ms returned sat
[2023-03-18 11:03:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 11:03:45] [INFO ] [Real]Absence check using state equation in 1287 ms returned sat
[2023-03-18 11:03:45] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 11:03:49] [INFO ] [Real]Absence check using 1000 positive place invariants in 244 ms returned sat
[2023-03-18 11:03:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 11:03:50] [INFO ] [Real]Absence check using state equation in 1344 ms returned sat
[2023-03-18 11:03:50] [INFO ] Solution in real domain found non-integer solution.
Current structural bounds on expressions (after SMT) : [1000, 1000, 1000] Max seen :[542, 542, 542]
Support contains 2000 out of 3000 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 3000/3000 places, 2000/2000 transitions.
Applied a total of 0 rules in 62 ms. Remains 3000 /3000 variables (removed 0) and now considering 2000/2000 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 3000/3000 places, 2000/2000 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 3000/3000 places, 2000/2000 transitions.
Applied a total of 0 rules in 57 ms. Remains 3000 /3000 variables (removed 0) and now considering 2000/2000 (removed 0) transitions.
// Phase 1: matrix 2000 rows 3000 cols
[2023-03-18 11:03:54] [INFO ] Computed 1000 place invariants in 7 ms
[2023-03-18 11:03:54] [INFO ] Implicit Places using invariants in 500 ms returned []
// Phase 1: matrix 2000 rows 3000 cols
[2023-03-18 11:03:54] [INFO ] Computed 1000 place invariants in 5 ms
[2023-03-18 11:03:55] [INFO ] Implicit Places using invariants and state equation in 473 ms returned []
Implicit Place search using SMT with State Equation took 985 ms to find 0 implicit places.
[2023-03-18 11:03:55] [INFO ] Redundant transitions in 120 ms returned []
// Phase 1: matrix 2000 rows 3000 cols
[2023-03-18 11:03:55] [INFO ] Computed 1000 place invariants in 5 ms
[2023-03-18 11:03:56] [INFO ] Dead Transitions using invariants and state equation in 1256 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 3000/3000 places, 2000/2000 transitions.
// Phase 1: matrix 2000 rows 3000 cols
[2023-03-18 11:03:56] [INFO ] Computed 1000 place invariants in 4 ms
Finished random walk after 155353 steps, including 155 resets, run visited all 3 properties in 30001 ms. (steps per millisecond=5 )
Interrupted Best-First random walk after 147377 steps, including 0 resets, run timeout after 5021 ms. (steps per millisecond=29 ) properties seen 152
Interrupted Best-First random walk after 147377 steps, including 0 resets, run timeout after 5026 ms. (steps per millisecond=29 ) properties seen 76
Interrupted Best-First random walk after 147377 steps, including 0 resets, run timeout after 5018 ms. (steps per millisecond=29 ) properties seen 152
// Phase 1: matrix 2000 rows 3000 cols
[2023-03-18 11:04:41] [INFO ] Computed 1000 place invariants in 10 ms
[2023-03-18 11:04:42] [INFO ] [Real]Absence check using 1000 positive place invariants in 250 ms returned sat
[2023-03-18 11:04:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 11:04:43] [INFO ] [Real]Absence check using state equation in 1353 ms returned sat
[2023-03-18 11:04:43] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 11:04:47] [INFO ] [Real]Absence check using 1000 positive place invariants in 239 ms returned sat
[2023-03-18 11:04:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 11:04:49] [INFO ] [Real]Absence check using state equation in 1236 ms returned sat
[2023-03-18 11:04:49] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 11:04:53] [INFO ] [Real]Absence check using 1000 positive place invariants in 242 ms returned sat
[2023-03-18 11:04:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 11:04:54] [INFO ] [Real]Absence check using state equation in 1217 ms returned sat
[2023-03-18 11:04:54] [INFO ] Solution in real domain found non-integer solution.
Current structural bounds on expressions (after SMT) : [1000, 1000, 1000] Max seen :[542, 548, 542]
Support contains 2000 out of 3000 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 3000/3000 places, 2000/2000 transitions.
Applied a total of 0 rules in 49 ms. Remains 3000 /3000 variables (removed 0) and now considering 2000/2000 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 3000/3000 places, 2000/2000 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 3000/3000 places, 2000/2000 transitions.
Applied a total of 0 rules in 38 ms. Remains 3000 /3000 variables (removed 0) and now considering 2000/2000 (removed 0) transitions.
// Phase 1: matrix 2000 rows 3000 cols
[2023-03-18 11:04:58] [INFO ] Computed 1000 place invariants in 8 ms
[2023-03-18 11:04:58] [INFO ] Implicit Places using invariants in 490 ms returned []
// Phase 1: matrix 2000 rows 3000 cols
[2023-03-18 11:04:58] [INFO ] Computed 1000 place invariants in 4 ms
[2023-03-18 11:04:59] [INFO ] Implicit Places using invariants and state equation in 491 ms returned []
Implicit Place search using SMT with State Equation took 984 ms to find 0 implicit places.
[2023-03-18 11:04:59] [INFO ] Redundant transitions in 120 ms returned []
// Phase 1: matrix 2000 rows 3000 cols
[2023-03-18 11:04:59] [INFO ] Computed 1000 place invariants in 9 ms
[2023-03-18 11:05:00] [INFO ] Dead Transitions using invariants and state equation in 1324 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 3000/3000 places, 2000/2000 transitions.
// Phase 1: matrix 2000 rows 3000 cols
[2023-03-18 11:05:00] [INFO ] Computed 1000 place invariants in 5 ms
Finished random walk after 155174 steps, including 155 resets, run visited all 3 properties in 30001 ms. (steps per millisecond=5 )
Interrupted Best-First random walk after 145526 steps, including 0 resets, run timeout after 5016 ms. (steps per millisecond=29 ) properties seen 150
Interrupted Best-First random walk after 146376 steps, including 0 resets, run timeout after 5019 ms. (steps per millisecond=29 ) properties seen 75
Interrupted Best-First random walk after 146376 steps, including 0 resets, run timeout after 5018 ms. (steps per millisecond=29 ) properties seen 150
// Phase 1: matrix 2000 rows 3000 cols
[2023-03-18 11:05:45] [INFO ] Computed 1000 place invariants in 9 ms
[2023-03-18 11:05:46] [INFO ] [Real]Absence check using 1000 positive place invariants in 250 ms returned sat
[2023-03-18 11:05:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 11:05:47] [INFO ] [Real]Absence check using state equation in 1349 ms returned sat
[2023-03-18 11:05:47] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 11:05:51] [INFO ] [Real]Absence check using 1000 positive place invariants in 236 ms returned sat
[2023-03-18 11:05:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 11:05:52] [INFO ] [Real]Absence check using state equation in 1168 ms returned sat
[2023-03-18 11:05:52] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 11:05:56] [INFO ] [Real]Absence check using 1000 positive place invariants in 236 ms returned sat
[2023-03-18 11:05:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 11:05:58] [INFO ] [Real]Absence check using state equation in 1179 ms returned sat
[2023-03-18 11:05:58] [INFO ] Solution in real domain found non-integer solution.
Current structural bounds on expressions (after SMT) : [1000, 1000, 1000] Max seen :[542, 548, 542]
Support contains 2000 out of 3000 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 3000/3000 places, 2000/2000 transitions.
Applied a total of 0 rules in 42 ms. Remains 3000 /3000 variables (removed 0) and now considering 2000/2000 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 3000/3000 places, 2000/2000 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 3000/3000 places, 2000/2000 transitions.
Applied a total of 0 rules in 37 ms. Remains 3000 /3000 variables (removed 0) and now considering 2000/2000 (removed 0) transitions.
// Phase 1: matrix 2000 rows 3000 cols
[2023-03-18 11:06:01] [INFO ] Computed 1000 place invariants in 7 ms
[2023-03-18 11:06:02] [INFO ] Implicit Places using invariants in 455 ms returned []
// Phase 1: matrix 2000 rows 3000 cols
[2023-03-18 11:06:02] [INFO ] Computed 1000 place invariants in 5 ms
[2023-03-18 11:06:02] [INFO ] Implicit Places using invariants and state equation in 456 ms returned []
Implicit Place search using SMT with State Equation took 914 ms to find 0 implicit places.
[2023-03-18 11:06:02] [INFO ] Redundant transitions in 39 ms returned []
// Phase 1: matrix 2000 rows 3000 cols
[2023-03-18 11:06:02] [INFO ] Computed 1000 place invariants in 5 ms
[2023-03-18 11:06:03] [INFO ] Dead Transitions using invariants and state equation in 1266 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 3000/3000 places, 2000/2000 transitions.
Starting property specific reduction for Referendum-PT-1000-UpperBounds-01
// Phase 1: matrix 2000 rows 3000 cols
[2023-03-18 11:06:03] [INFO ] Computed 1000 place invariants in 5 ms
Incomplete random walk after 10000 steps, including 9 resets, run finished after 1213 ms. (steps per millisecond=8 ) properties (out of 1) seen :520
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 330 ms. (steps per millisecond=30 ) properties (out of 1) seen :2
// Phase 1: matrix 2000 rows 3000 cols
[2023-03-18 11:06:05] [INFO ] Computed 1000 place invariants in 8 ms
[2023-03-18 11:06:06] [INFO ] [Real]Absence check using 1000 positive place invariants in 250 ms returned sat
[2023-03-18 11:06:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 11:06:07] [INFO ] [Real]Absence check using state equation in 1292 ms returned sat
[2023-03-18 11:06:07] [INFO ] Solution in real domain found non-integer solution.
Current structural bounds on expressions (after SMT) : [1000] Max seen :[520]
Support contains 1000 out of 3000 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 3000/3000 places, 2000/2000 transitions.
Graph (complete) has 2000 edges and 3000 vertex of which 2000 are kept as prefixes of interest. Removing 1000 places using SCC suffix rule.6 ms
Discarding 1000 places :
Also discarding 0 output transitions
Drop transitions removed 1000 transitions
Reduce isomorphic transitions removed 1000 transitions.
Iterating post reduction 0 with 1000 rules applied. Total rules applied 1001 place count 2000 transition count 1000
Applied a total of 1001 rules in 51 ms. Remains 2000 /3000 variables (removed 1000) and now considering 1000/2000 (removed 1000) transitions.
Finished structural reductions, in 1 iterations. Remains : 2000/3000 places, 1000/2000 transitions.
// Phase 1: matrix 1000 rows 2000 cols
[2023-03-18 11:06:10] [INFO ] Computed 1000 place invariants in 2 ms
Finished random walk after 327634 steps, including 327 resets, run visited all 1 properties in 30001 ms. (steps per millisecond=10 )
FORMULA Referendum-PT-1000-UpperBounds-01 1000 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Ending property specific reduction for Referendum-PT-1000-UpperBounds-01 in 37071 ms.
Starting property specific reduction for Referendum-PT-1000-UpperBounds-02
// Phase 1: matrix 2000 rows 3000 cols
[2023-03-18 11:06:40] [INFO ] Computed 1000 place invariants in 8 ms
Incomplete random walk after 10000 steps, including 9 resets, run finished after 1217 ms. (steps per millisecond=8 ) properties (out of 1) seen :529
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 326 ms. (steps per millisecond=30 ) properties (out of 1) seen :2
// Phase 1: matrix 2000 rows 3000 cols
[2023-03-18 11:06:42] [INFO ] Computed 1000 place invariants in 12 ms
[2023-03-18 11:06:43] [INFO ] [Real]Absence check using 1000 positive place invariants in 232 ms returned sat
[2023-03-18 11:06:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 11:06:44] [INFO ] [Real]Absence check using state equation in 1163 ms returned sat
[2023-03-18 11:06:44] [INFO ] Solution in real domain found non-integer solution.
Current structural bounds on expressions (after SMT) : [1000] Max seen :[529]
Support contains 1000 out of 3000 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 3000/3000 places, 2000/2000 transitions.
Graph (complete) has 2000 edges and 3000 vertex of which 2000 are kept as prefixes of interest. Removing 1000 places using SCC suffix rule.6 ms
Discarding 1000 places :
Also discarding 0 output transitions
Drop transitions removed 1000 transitions
Reduce isomorphic transitions removed 1000 transitions.
Iterating post reduction 0 with 1000 rules applied. Total rules applied 1001 place count 2000 transition count 1000
Applied a total of 1001 rules in 89 ms. Remains 2000 /3000 variables (removed 1000) and now considering 1000/2000 (removed 1000) transitions.
Finished structural reductions, in 1 iterations. Remains : 2000/3000 places, 1000/2000 transitions.
// Phase 1: matrix 1000 rows 2000 cols
[2023-03-18 11:06:47] [INFO ] Computed 1000 place invariants in 1 ms
Finished random walk after 330830 steps, including 330 resets, run visited all 1 properties in 30001 ms. (steps per millisecond=11 )
FORMULA Referendum-PT-1000-UpperBounds-02 1000 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Ending property specific reduction for Referendum-PT-1000-UpperBounds-02 in 36934 ms.
Starting property specific reduction for Referendum-PT-1000-UpperBounds-07
// Phase 1: matrix 2000 rows 3000 cols
[2023-03-18 11:07:17] [INFO ] Computed 1000 place invariants in 7 ms
Incomplete random walk after 10000 steps, including 9 resets, run finished after 1203 ms. (steps per millisecond=8 ) properties (out of 1) seen :539
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 321 ms. (steps per millisecond=31 ) properties (out of 1) seen :2
// Phase 1: matrix 2000 rows 3000 cols
[2023-03-18 11:07:19] [INFO ] Computed 1000 place invariants in 7 ms
[2023-03-18 11:07:20] [INFO ] [Real]Absence check using 1000 positive place invariants in 233 ms returned sat
[2023-03-18 11:07:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 11:07:21] [INFO ] [Real]Absence check using state equation in 1163 ms returned sat
[2023-03-18 11:07:21] [INFO ] Solution in real domain found non-integer solution.
Current structural bounds on expressions (after SMT) : [1000] Max seen :[539]
Support contains 1000 out of 3000 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 3000/3000 places, 2000/2000 transitions.
Graph (complete) has 2000 edges and 3000 vertex of which 2000 are kept as prefixes of interest. Removing 1000 places using SCC suffix rule.2 ms
Discarding 1000 places :
Also discarding 0 output transitions
Drop transitions removed 1000 transitions
Reduce isomorphic transitions removed 1000 transitions.
Iterating post reduction 0 with 1000 rules applied. Total rules applied 1001 place count 2000 transition count 1000
Applied a total of 1001 rules in 31 ms. Remains 2000 /3000 variables (removed 1000) and now considering 1000/2000 (removed 1000) transitions.
Finished structural reductions, in 1 iterations. Remains : 2000/3000 places, 1000/2000 transitions.
// Phase 1: matrix 1000 rows 2000 cols
[2023-03-18 11:07:24] [INFO ] Computed 1000 place invariants in 1 ms
Finished random walk after 330368 steps, including 330 resets, run visited all 1 properties in 30001 ms. (steps per millisecond=11 )
FORMULA Referendum-PT-1000-UpperBounds-07 1000 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Ending property specific reduction for Referendum-PT-1000-UpperBounds-07 in 36823 ms.
[2023-03-18 11:07:55] [INFO ] Flatten gal took : 296 ms
[2023-03-18 11:07:55] [INFO ] Applying decomposition
[2023-03-18 11:07:55] [INFO ] Flatten gal took : 98 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph16992844835887696267.txt' '-o' '/tmp/graph16992844835887696267.bin' '-w' '/tmp/graph16992844835887696267.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph16992844835887696267.bin' '-l' '-1' '-v' '-w' '/tmp/graph16992844835887696267.weights' '-q' '0' '-e' '0.001'
[2023-03-18 11:07:55] [INFO ] Decomposing Gal with order
[2023-03-18 11:07:55] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-18 11:07:56] [INFO ] Flatten gal took : 101 ms
[2023-03-18 11:07:56] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2023-03-18 11:07:56] [INFO ] Time to serialize gal into /tmp/UpperBounds9630488387298099951.gal : 21 ms
[2023-03-18 11:07:56] [INFO ] Time to serialize properties into /tmp/UpperBounds12369893023737304262.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds9630488387298099951.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds12369893023737304262.prop' '--nowitness'
its-reach command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...275
Loading property file /tmp/UpperBounds12369893023737304262.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\_mod\_flat,1.32207e+477,3.43257,37472,1002,6,3004,19,2008,0,10,11,0
Total reachable state count : 1.322070819480806635042229428124998147867e+477
Total runtime 329462 ms.
BK_STOP 1679137679653
--------------------
content from stderr:
+ export LANG=C
+ LANG=C
+ 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
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -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=@none -Xss128m -Xms40m -Xmx8192m
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="Referendum-PT-1000"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2022"
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-5348"
echo " Executing tool gold2022"
echo " Input is Referendum-PT-1000, 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 r351-tall-167889220900066"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/Referendum-PT-1000.tgz
mv Referendum-PT-1000 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 ;