About the Execution of ITS-Tools 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 '/mnt/tpsp/fkordon/mcc2022-input.r186-tajo-165281572300453.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2022-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
.....................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
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 r186-tajo-165281572300453
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 12M
-rw-r--r-- 1 mcc users 884K Apr 29 16:36 CTLCardinality.txt
-rw-r--r-- 1 mcc users 3.9M Apr 29 16:36 CTLCardinality.xml
-rw-r--r-- 1 mcc users 350K Apr 29 15:18 CTLFireability.txt
-rw-r--r-- 1 mcc users 2.5M Apr 29 15:18 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 347K May 9 08:36 LTLCardinality.txt
-rw-r--r-- 1 mcc users 1.2M May 9 08:36 LTLCardinality.xml
-rw-r--r-- 1 mcc users 233K May 9 08:36 LTLFireability.txt
-rw-r--r-- 1 mcc users 1.2M May 9 08:36 LTLFireability.xml
-rw-r--r-- 1 mcc users 99K May 9 08:36 UpperBounds.txt
-rw-r--r-- 1 mcc users 244K May 9 08:36 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 5 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 1.2M 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 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 1653084152877
Running Version 202205111006
[2022-05-20 22:02:34] [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-20 22:02:34] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-20 22:02:35] [INFO ] Load time of PNML (sax parser for PT used): 372 ms
[2022-05-20 22:02:35] [INFO ] Transformed 3001 places.
[2022-05-20 22:02:35] [INFO ] Transformed 2001 transitions.
[2022-05-20 22:02:35] [INFO ] Found NUPN structural information;
[2022-05-20 22:02:35] [INFO ] Parsed PT model containing 3001 places and 2001 transitions in 558 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 84 ms.
FORMULA Referendum-PT-1000-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Referendum-PT-1000-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Referendum-PT-1000-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Referendum-PT-1000-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
// Phase 1: matrix 2001 rows 3001 cols
[2022-05-20 22:02:35] [INFO ] Computed 1000 place invariants in 53 ms
Incomplete random walk after 10000 steps, including 9 resets, run finished after 4139 ms. (steps per millisecond=2 ) properties (out of 12) seen :5098
FORMULA Referendum-PT-1000-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Referendum-PT-1000-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Referendum-PT-1000-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Referendum-PT-1000-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Referendum-PT-1000-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Referendum-PT-1000-UpperBounds-07 1000 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Referendum-PT-1000-UpperBounds-06 1000 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Referendum-PT-1000-UpperBounds-03 1000 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 365 ms. (steps per millisecond=27 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 325 ms. (steps per millisecond=30 ) properties (out of 4) seen :6
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 300 ms. (steps per millisecond=33 ) properties (out of 4) seen :6
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 309 ms. (steps per millisecond=32 ) properties (out of 4) seen :6
// Phase 1: matrix 2001 rows 3001 cols
[2022-05-20 22:02:40] [INFO ] Computed 1000 place invariants in 22 ms
[2022-05-20 22:02:41] [INFO ] [Real]Absence check using 1000 positive place invariants in 212 ms returned sat
[2022-05-20 22:02:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 22:02:43] [INFO ] [Real]Absence check using state equation in 1258 ms returned sat
[2022-05-20 22:02:43] [INFO ] Solution in real domain found non-integer solution.
[2022-05-20 22:02:48] [INFO ] [Real]Absence check using 1000 positive place invariants in 303 ms returned sat
[2022-05-20 22:02:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 22:02:49] [INFO ] [Real]Absence check using state equation in 1086 ms returned sat
[2022-05-20 22:02:49] [INFO ] Solution in real domain found non-integer solution.
[2022-05-20 22:02:53] [INFO ] [Real]Absence check using 1000 positive place invariants in 509 ms returned sat
[2022-05-20 22:02:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 22:02:55] [INFO ] [Real]Absence check using state equation in 1475 ms returned sat
[2022-05-20 22:02:55] [INFO ] Solution in real domain found non-integer solution.
[2022-05-20 22:02:59] [INFO ] [Real]Absence check using 1000 positive place invariants in 268 ms returned sat
[2022-05-20 22:02:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 22:03:01] [INFO ] [Real]Absence check using state equation in 1586 ms returned sat
[2022-05-20 22:03:01] [INFO ] Solution in real domain found non-integer solution.
Current structural bounds on expressions (after SMT) : [1000, 1000, 1000, 1000] Max seen :[524, 523, 523, 523]
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 497 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
[2022-05-20 22:03:05] [INFO ] Computed 1000 place invariants in 8 ms
Finished random walk after 125075 steps, including 124 resets, run visited all 4 properties in 30001 ms. (steps per millisecond=4 )
Interrupted Best-First random walk after 168432 steps, including 0 resets, run timeout after 5026 ms. (steps per millisecond=33 ) properties seen 87
Interrupted Best-First random walk after 156602 steps, including 0 resets, run timeout after 5004 ms. (steps per millisecond=31 ) properties seen 243
Interrupted Best-First random walk after 150072 steps, including 0 resets, run timeout after 5018 ms. (steps per millisecond=29 ) properties seen 231
Interrupted Best-First random walk after 152918 steps, including 0 resets, run timeout after 5030 ms. (steps per millisecond=30 ) properties seen 237
// Phase 1: matrix 2000 rows 3000 cols
[2022-05-20 22:03:55] [INFO ] Computed 1000 place invariants in 17 ms
[2022-05-20 22:03:56] [INFO ] [Real]Absence check using 1000 positive place invariants in 307 ms returned sat
[2022-05-20 22:03:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 22:03:58] [INFO ] [Real]Absence check using state equation in 1394 ms returned sat
[2022-05-20 22:03:58] [INFO ] Solution in real domain found non-integer solution.
[2022-05-20 22:04:02] [INFO ] [Real]Absence check using 1000 positive place invariants in 284 ms returned sat
[2022-05-20 22:04:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 22:04:03] [INFO ] [Real]Absence check using state equation in 1168 ms returned sat
[2022-05-20 22:04:03] [INFO ] Solution in real domain found non-integer solution.
[2022-05-20 22:04:08] [INFO ] [Real]Absence check using 1000 positive place invariants in 345 ms returned sat
[2022-05-20 22:04:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 22:04:09] [INFO ] [Real]Absence check using state equation in 1165 ms returned sat
[2022-05-20 22:04:09] [INFO ] Solution in real domain found non-integer solution.
[2022-05-20 22:04:13] [INFO ] [Real]Absence check using 1000 positive place invariants in 262 ms returned sat
[2022-05-20 22:04:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 22:04:15] [INFO ] [Real]Absence check using state equation in 1140 ms returned sat
[2022-05-20 22:04:15] [INFO ] Solution in real domain found non-integer solution.
Current structural bounds on expressions (after SMT) : [1000, 1000, 1000, 1000] Max seen :[535, 535, 535, 535]
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 68 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 81 ms. Remains 3000 /3000 variables (removed 0) and now considering 2000/2000 (removed 0) transitions.
// Phase 1: matrix 2000 rows 3000 cols
[2022-05-20 22:04:18] [INFO ] Computed 1000 place invariants in 15 ms
[2022-05-20 22:04:19] [INFO ] Implicit Places using invariants in 590 ms returned []
// Phase 1: matrix 2000 rows 3000 cols
[2022-05-20 22:04:19] [INFO ] Computed 1000 place invariants in 9 ms
[2022-05-20 22:04:19] [INFO ] Implicit Places using invariants and state equation in 579 ms returned []
Implicit Place search using SMT with State Equation took 1188 ms to find 0 implicit places.
[2022-05-20 22:04:20] [INFO ] Redundant transitions in 154 ms returned []
// Phase 1: matrix 2000 rows 3000 cols
[2022-05-20 22:04:20] [INFO ] Computed 1000 place invariants in 11 ms
[2022-05-20 22:04:20] [INFO ] Dead Transitions using invariants and state equation in 698 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 3000/3000 places, 2000/2000 transitions.
// Phase 1: matrix 2000 rows 3000 cols
[2022-05-20 22:04:20] [INFO ] Computed 1000 place invariants in 10 ms
Finished random walk after 118426 steps, including 118 resets, run visited all 4 properties in 30001 ms. (steps per millisecond=3 )
Interrupted Best-First random walk after 154761 steps, including 0 resets, run timeout after 5003 ms. (steps per millisecond=30 ) properties seen 80
Interrupted Best-First random walk after 145526 steps, including 0 resets, run timeout after 5020 ms. (steps per millisecond=28 ) properties seen 225
Interrupted Best-First random walk after 145526 steps, including 0 resets, run timeout after 5006 ms. (steps per millisecond=29 ) properties seen 225
Interrupted Best-First random walk after 148225 steps, including 0 resets, run timeout after 5006 ms. (steps per millisecond=29 ) properties seen 228
// Phase 1: matrix 2000 rows 3000 cols
[2022-05-20 22:05:10] [INFO ] Computed 1000 place invariants in 9 ms
[2022-05-20 22:05:11] [INFO ] [Real]Absence check using 1000 positive place invariants in 318 ms returned sat
[2022-05-20 22:05:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 22:05:12] [INFO ] [Real]Absence check using state equation in 1056 ms returned sat
[2022-05-20 22:05:13] [INFO ] Solution in real domain found non-integer solution.
[2022-05-20 22:05:17] [INFO ] [Real]Absence check using 1000 positive place invariants in 277 ms returned sat
[2022-05-20 22:05:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 22:05:18] [INFO ] [Real]Absence check using state equation in 1062 ms returned sat
[2022-05-20 22:05:18] [INFO ] Solution in real domain found non-integer solution.
[2022-05-20 22:05:23] [INFO ] [Real]Absence check using 1000 positive place invariants in 282 ms returned sat
[2022-05-20 22:05:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 22:05:24] [INFO ] [Real]Absence check using state equation in 1101 ms returned sat
[2022-05-20 22:05:24] [INFO ] Solution in real domain found non-integer solution.
[2022-05-20 22:05:28] [INFO ] [Real]Absence check using 1000 positive place invariants in 282 ms returned sat
[2022-05-20 22:05:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 22:05:29] [INFO ] [Real]Absence check using state equation in 1106 ms returned sat
[2022-05-20 22:05:29] [INFO ] Solution in real domain found non-integer solution.
Current structural bounds on expressions (after SMT) : [1000, 1000, 1000, 1000] Max seen :[535, 548, 548, 548]
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 59 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 51 ms. Remains 3000 /3000 variables (removed 0) and now considering 2000/2000 (removed 0) transitions.
// Phase 1: matrix 2000 rows 3000 cols
[2022-05-20 22:05:33] [INFO ] Computed 1000 place invariants in 10 ms
[2022-05-20 22:05:33] [INFO ] Implicit Places using invariants in 586 ms returned []
// Phase 1: matrix 2000 rows 3000 cols
[2022-05-20 22:05:33] [INFO ] Computed 1000 place invariants in 10 ms
[2022-05-20 22:05:34] [INFO ] Implicit Places using invariants and state equation in 627 ms returned []
Implicit Place search using SMT with State Equation took 1220 ms to find 0 implicit places.
[2022-05-20 22:05:34] [INFO ] Redundant transitions in 63 ms returned []
// Phase 1: matrix 2000 rows 3000 cols
[2022-05-20 22:05:34] [INFO ] Computed 1000 place invariants in 9 ms
[2022-05-20 22:05:36] [INFO ] Dead Transitions using invariants and state equation in 1473 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 3000/3000 places, 2000/2000 transitions.
// Phase 1: matrix 2000 rows 3000 cols
[2022-05-20 22:05:36] [INFO ] Computed 1000 place invariants in 3 ms
Finished random walk after 119574 steps, including 119 resets, run visited all 4 properties in 30001 ms. (steps per millisecond=3 )
Interrupted Best-First random walk after 146376 steps, including 0 resets, run timeout after 5008 ms. (steps per millisecond=29 ) properties seen 75
Interrupted Best-First random walk after 146376 steps, including 0 resets, run timeout after 5015 ms. (steps per millisecond=29 ) properties seen 225
Interrupted Best-First random walk after 146376 steps, including 0 resets, run timeout after 5002 ms. (steps per millisecond=29 ) properties seen 225
Interrupted Best-First random walk after 151073 steps, including 0 resets, run timeout after 5033 ms. (steps per millisecond=30 ) properties seen 234
// Phase 1: matrix 2000 rows 3000 cols
[2022-05-20 22:06:26] [INFO ] Computed 1000 place invariants in 7 ms
[2022-05-20 22:06:27] [INFO ] [Real]Absence check using 1000 positive place invariants in 285 ms returned sat
[2022-05-20 22:06:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 22:06:28] [INFO ] [Real]Absence check using state equation in 1124 ms returned sat
[2022-05-20 22:06:28] [INFO ] Solution in real domain found non-integer solution.
[2022-05-20 22:06:32] [INFO ] [Real]Absence check using 1000 positive place invariants in 270 ms returned sat
[2022-05-20 22:06:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 22:06:33] [INFO ] [Real]Absence check using state equation in 1132 ms returned sat
[2022-05-20 22:06:34] [INFO ] Solution in real domain found non-integer solution.
[2022-05-20 22:06:38] [INFO ] [Real]Absence check using 1000 positive place invariants in 247 ms returned sat
[2022-05-20 22:06:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 22:06:39] [INFO ] [Real]Absence check using state equation in 1076 ms returned sat
[2022-05-20 22:06:39] [INFO ] Solution in real domain found non-integer solution.
[2022-05-20 22:06:44] [INFO ] [Real]Absence check using 1000 positive place invariants in 304 ms returned sat
[2022-05-20 22:06:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 22:06:45] [INFO ] [Real]Absence check using state equation in 1313 ms returned sat
[2022-05-20 22:06:45] [INFO ] Solution in real domain found non-integer solution.
Current structural bounds on expressions (after SMT) : [1000, 1000, 1000, 1000] Max seen :[535, 548, 548, 548]
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 95 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 69 ms. Remains 3000 /3000 variables (removed 0) and now considering 2000/2000 (removed 0) transitions.
// Phase 1: matrix 2000 rows 3000 cols
[2022-05-20 22:06:49] [INFO ] Computed 1000 place invariants in 3 ms
[2022-05-20 22:06:49] [INFO ] Implicit Places using invariants in 794 ms returned []
// Phase 1: matrix 2000 rows 3000 cols
[2022-05-20 22:06:49] [INFO ] Computed 1000 place invariants in 4 ms
[2022-05-20 22:06:50] [INFO ] Implicit Places using invariants and state equation in 477 ms returned []
Implicit Place search using SMT with State Equation took 1274 ms to find 0 implicit places.
[2022-05-20 22:06:50] [INFO ] Redundant transitions in 78 ms returned []
// Phase 1: matrix 2000 rows 3000 cols
[2022-05-20 22:06:50] [INFO ] Computed 1000 place invariants in 6 ms
[2022-05-20 22:07:02] [INFO ] Dead Transitions using invariants and state equation in 12067 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-00
// Phase 1: matrix 2000 rows 3000 cols
[2022-05-20 22:07:02] [INFO ] Computed 1000 place invariants in 5 ms
Incomplete random walk after 10000 steps, including 9 resets, run finished after 1283 ms. (steps per millisecond=7 ) properties (out of 1) seen :535
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 310 ms. (steps per millisecond=32 ) properties (out of 1) seen :2
// Phase 1: matrix 2000 rows 3000 cols
[2022-05-20 22:07:04] [INFO ] Computed 1000 place invariants in 7 ms
[2022-05-20 22:07:05] [INFO ] [Real]Absence check using 1000 positive place invariants in 248 ms returned sat
[2022-05-20 22:07:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 22:07:06] [INFO ] [Real]Absence check using state equation in 1113 ms returned sat
[2022-05-20 22:07:06] [INFO ] Solution in real domain found non-integer solution.
Current structural bounds on expressions (after SMT) : [1000] Max seen :[535]
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.8 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 168 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
[2022-05-20 22:07:09] [INFO ] Computed 1000 place invariants in 2 ms
Finished random walk after 304660 steps, including 304 resets, run visited all 1 properties in 30001 ms. (steps per millisecond=10 )
FORMULA Referendum-PT-1000-UpperBounds-00 1000 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Ending property specific reduction for Referendum-PT-1000-UpperBounds-00 in 37320 ms.
Starting property specific reduction for Referendum-PT-1000-UpperBounds-01
// Phase 1: matrix 2000 rows 3000 cols
[2022-05-20 22:07:39] [INFO ] Computed 1000 place invariants in 7 ms
Incomplete random walk after 10000 steps, including 9 resets, run finished after 1205 ms. (steps per millisecond=8 ) properties (out of 1) seen :512
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 306 ms. (steps per millisecond=32 ) properties (out of 1) seen :2
// Phase 1: matrix 2000 rows 3000 cols
[2022-05-20 22:07:41] [INFO ] Computed 1000 place invariants in 6 ms
[2022-05-20 22:07:42] [INFO ] [Real]Absence check using 1000 positive place invariants in 328 ms returned sat
[2022-05-20 22:07:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 22:07:43] [INFO ] [Real]Absence check using state equation in 1135 ms returned sat
[2022-05-20 22:07:43] [INFO ] Solution in real domain found non-integer solution.
Current structural bounds on expressions (after SMT) : [1000] Max seen :[512]
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.4 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 52 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
[2022-05-20 22:07:48] [INFO ] Computed 1000 place invariants in 5 ms
Finished random walk after 303965 steps, including 303 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 38083 ms.
Starting property specific reduction for Referendum-PT-1000-UpperBounds-04
// Phase 1: matrix 2000 rows 3000 cols
[2022-05-20 22:08:18] [INFO ] Computed 1000 place invariants in 7 ms
Incomplete random walk after 10000 steps, including 9 resets, run finished after 1185 ms. (steps per millisecond=8 ) properties (out of 1) seen :533
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 300 ms. (steps per millisecond=33 ) properties (out of 1) seen :2
// Phase 1: matrix 2000 rows 3000 cols
[2022-05-20 22:08:19] [INFO ] Computed 1000 place invariants in 7 ms
[2022-05-20 22:08:20] [INFO ] [Real]Absence check using 1000 positive place invariants in 279 ms returned sat
[2022-05-20 22:08:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 22:08:21] [INFO ] [Real]Absence check using state equation in 1102 ms returned sat
[2022-05-20 22:08:21] [INFO ] Solution in real domain found non-integer solution.
Current structural bounds on expressions (after SMT) : [1000] Max seen :[533]
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.4 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 67 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
[2022-05-20 22:08:25] [INFO ] Computed 1000 place invariants in 4 ms
Finished random walk after 309692 steps, including 309 resets, run visited all 1 properties in 30001 ms. (steps per millisecond=10 )
FORMULA Referendum-PT-1000-UpperBounds-04 1000 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Ending property specific reduction for Referendum-PT-1000-UpperBounds-04 in 37190 ms.
Starting property specific reduction for Referendum-PT-1000-UpperBounds-05
// Phase 1: matrix 2000 rows 3000 cols
[2022-05-20 22:08:55] [INFO ] Computed 1000 place invariants in 6 ms
Incomplete random walk after 10000 steps, including 9 resets, run finished after 1223 ms. (steps per millisecond=8 ) properties (out of 1) seen :524
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 295 ms. (steps per millisecond=33 ) properties (out of 1) seen :2
// Phase 1: matrix 2000 rows 3000 cols
[2022-05-20 22:08:56] [INFO ] Computed 1000 place invariants in 7 ms
[2022-05-20 22:08:57] [INFO ] [Real]Absence check using 1000 positive place invariants in 263 ms returned sat
[2022-05-20 22:08:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 22:08:58] [INFO ] [Real]Absence check using state equation in 1056 ms returned sat
[2022-05-20 22:08:58] [INFO ] Solution in real domain found non-integer solution.
Current structural bounds on expressions (after SMT) : [1000] Max seen :[524]
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.5 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 73 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
[2022-05-20 22:09:02] [INFO ] Computed 1000 place invariants in 5 ms
Finished random walk after 309482 steps, including 309 resets, run visited all 1 properties in 30001 ms. (steps per millisecond=10 )
FORMULA Referendum-PT-1000-UpperBounds-05 1000 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Ending property specific reduction for Referendum-PT-1000-UpperBounds-05 in 37111 ms.
[2022-05-20 22:09:32] [INFO ] Flatten gal took : 365 ms
[2022-05-20 22:09:32] [INFO ] Applying decomposition
[2022-05-20 22:09:32] [INFO ] Flatten gal took : 104 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/graph9436558209851276374.txt' '-o' '/tmp/graph9436558209851276374.bin' '-w' '/tmp/graph9436558209851276374.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph9436558209851276374.bin' '-l' '-1' '-v' '-w' '/tmp/graph9436558209851276374.weights' '-q' '0' '-e' '0.001'
[2022-05-20 22:09:33] [INFO ] Decomposing Gal with order
[2022-05-20 22:09:33] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-20 22:09:33] [INFO ] Flatten gal took : 82 ms
[2022-05-20 22:09:33] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2022-05-20 22:09:33] [INFO ] Time to serialize gal into /tmp/UpperBounds6683023617789145879.gal : 23 ms
[2022-05-20 22:09:33] [INFO ] Time to serialize properties into /tmp/UpperBounds5347024539529849578.prop : 1 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/UpperBounds6683023617789145879.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds5347024539529849578.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...274
Loading property file /tmp/UpperBounds5347024539529849578.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.12209,37400,1002,6,3004,19,2008,0,10,11,0
Total reachable state count : 1.322070819480806635042229428124998147867e+477
Total runtime 422385 ms.
BK_STOP 1653084577104
--------------------
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
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ 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="itstools"
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 itstools"
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 r186-tajo-165281572300453"
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 ;