About the Execution of Marcie+red 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.r330-tall-167889203400525.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 marciexred
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 r330-tall-167889203400525
=====================================================================
--------------------
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 1679169667128
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=marciexred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Referendum-PT-1000
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-18 20:01:08] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-18 20:01:08] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-18 20:01:08] [INFO ] Load time of PNML (sax parser for PT used): 130 ms
[2023-03-18 20:01:08] [INFO ] Transformed 3001 places.
[2023-03-18 20:01:08] [INFO ] Transformed 2001 transitions.
[2023-03-18 20:01:08] [INFO ] Found NUPN structural information;
[2023-03-18 20:01:08] [INFO ] Parsed PT model containing 3001 places and 2001 transitions and 5001 arcs in 214 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 51 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 20:01:09] [INFO ] Computed 1000 place invariants in 33 ms
Incomplete random walk after 10000 steps, including 9 resets, run finished after 2728 ms. (steps per millisecond=3 ) properties (out of 11) seen :3562
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 335 ms. (steps per millisecond=29 ) properties (out of 3) seen :4
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 348 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 341 ms. (steps per millisecond=29 ) properties (out of 3) seen :4
[2023-03-18 20:01:12] [INFO ] Invariant cache hit.
[2023-03-18 20:01:14] [INFO ] [Real]Absence check using 1000 positive place invariants in 270 ms returned sat
[2023-03-18 20:01:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 20:01:15] [INFO ] [Real]Absence check using state equation in 1119 ms returned sat
[2023-03-18 20:01:15] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 20:01:20] [INFO ] [Real]Absence check using 1000 positive place invariants in 237 ms returned sat
[2023-03-18 20:01:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 20:01:21] [INFO ] [Real]Absence check using state equation in 1141 ms returned sat
[2023-03-18 20:01:21] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 20:01:26] [INFO ] [Real]Absence check using 1000 positive place invariants in 241 ms returned sat
[2023-03-18 20:01:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 20:01:27] [INFO ] [Real]Absence check using state equation in 1210 ms returned sat
[2023-03-18 20:01:27] [INFO ] Solution in real domain found non-integer solution.
Current structural bounds on expressions (after SMT) : [1000, 1000, 1000] Max seen :[518, 520, 518]
Support contains 2000 out of 3001 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY 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 351 ms. Remains 3000 /3001 variables (removed 1) and now considering 2000/2001 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 353 ms. Remains : 3000/3001 places, 2000/2001 transitions.
// Phase 1: matrix 2000 rows 3000 cols
[2023-03-18 20:01:32] [INFO ] Computed 1000 place invariants in 9 ms
Finished random walk after 162249 steps, including 162 resets, run visited all 3 properties in 30001 ms. (steps per millisecond=5 )
Interrupted Best-First random walk after 149226 steps, including 0 resets, run timeout after 5016 ms. (steps per millisecond=29 ) properties seen 154
Interrupted Best-First random walk after 147377 steps, including 0 resets, run timeout after 5033 ms. (steps per millisecond=29 ) properties seen 76
Interrupted Best-First random walk after 147377 steps, including 0 resets, run timeout after 5031 ms. (steps per millisecond=29 ) properties seen 152
[2023-03-18 20:02:17] [INFO ] Invariant cache hit.
[2023-03-18 20:02:18] [INFO ] [Real]Absence check using 1000 positive place invariants in 247 ms returned sat
[2023-03-18 20:02:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 20:02:19] [INFO ] [Real]Absence check using state equation in 1182 ms returned sat
[2023-03-18 20:02:19] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 20:02:24] [INFO ] [Real]Absence check using 1000 positive place invariants in 234 ms returned sat
[2023-03-18 20:02:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 20:02:25] [INFO ] [Real]Absence check using state equation in 1160 ms returned sat
[2023-03-18 20:02:25] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 20:02:30] [INFO ] [Real]Absence check using 1000 positive place invariants in 226 ms returned sat
[2023-03-18 20:02:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 20:02:31] [INFO ] [Real]Absence check using state equation in 1120 ms returned sat
[2023-03-18 20:02:31] [INFO ] Solution in real domain found non-integer solution.
Current structural bounds on expressions (after SMT) : [1000, 1000, 1000] Max seen :[552, 552, 552]
Support contains 2000 out of 3000 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY 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 REACHABILITY mode , in 1 iterations and 62 ms. Remains : 3000/3000 places, 2000/2000 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3000/3000 places, 2000/2000 transitions.
Applied a total of 0 rules in 53 ms. Remains 3000 /3000 variables (removed 0) and now considering 2000/2000 (removed 0) transitions.
[2023-03-18 20:02:36] [INFO ] Invariant cache hit.
[2023-03-18 20:02:36] [INFO ] Implicit Places using invariants in 469 ms returned []
[2023-03-18 20:02:36] [INFO ] Invariant cache hit.
[2023-03-18 20:02:37] [INFO ] Implicit Places using invariants and state equation in 481 ms returned []
Implicit Place search using SMT with State Equation took 953 ms to find 0 implicit places.
[2023-03-18 20:02:37] [INFO ] Redundant transitions in 111 ms returned []
[2023-03-18 20:02:37] [INFO ] Invariant cache hit.
[2023-03-18 20:02:38] [INFO ] Dead Transitions using invariants and state equation in 1279 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2405 ms. Remains : 3000/3000 places, 2000/2000 transitions.
[2023-03-18 20:02:38] [INFO ] Invariant cache hit.
Finished random walk after 162750 steps, including 162 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 5015 ms. (steps per millisecond=29 ) properties seen 150
Interrupted Best-First random walk after 143673 steps, including 0 resets, run timeout after 5004 ms. (steps per millisecond=28 ) properties seen 74
Interrupted Best-First random walk after 148225 steps, including 0 resets, run timeout after 5004 ms. (steps per millisecond=29 ) properties seen 152
[2023-03-18 20:03:23] [INFO ] Invariant cache hit.
[2023-03-18 20:03:24] [INFO ] [Real]Absence check using 1000 positive place invariants in 236 ms returned sat
[2023-03-18 20:03:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 20:03:25] [INFO ] [Real]Absence check using state equation in 1159 ms returned sat
[2023-03-18 20:03:25] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 20:03:30] [INFO ] [Real]Absence check using 1000 positive place invariants in 233 ms returned sat
[2023-03-18 20:03:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 20:03:31] [INFO ] [Real]Absence check using state equation in 1160 ms returned sat
[2023-03-18 20:03:31] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 20:03:36] [INFO ] [Real]Absence check using 1000 positive place invariants in 233 ms returned sat
[2023-03-18 20:03:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 20:03:37] [INFO ] [Real]Absence check using state equation in 1155 ms returned sat
[2023-03-18 20:03:37] [INFO ] Solution in real domain found non-integer solution.
Current structural bounds on expressions (after SMT) : [1000, 1000, 1000] Max seen :[552, 552, 552]
Support contains 2000 out of 3000 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3000/3000 places, 2000/2000 transitions.
Applied a total of 0 rules in 52 ms. Remains 3000 /3000 variables (removed 0) and now considering 2000/2000 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 52 ms. Remains : 3000/3000 places, 2000/2000 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3000/3000 places, 2000/2000 transitions.
Applied a total of 0 rules in 43 ms. Remains 3000 /3000 variables (removed 0) and now considering 2000/2000 (removed 0) transitions.
[2023-03-18 20:03:41] [INFO ] Invariant cache hit.
[2023-03-18 20:03:42] [INFO ] Implicit Places using invariants in 463 ms returned []
[2023-03-18 20:03:42] [INFO ] Invariant cache hit.
[2023-03-18 20:03:42] [INFO ] Implicit Places using invariants and state equation in 420 ms returned []
Implicit Place search using SMT with State Equation took 886 ms to find 0 implicit places.
[2023-03-18 20:03:42] [INFO ] Redundant transitions in 124 ms returned []
[2023-03-18 20:03:42] [INFO ] Invariant cache hit.
[2023-03-18 20:03:44] [INFO ] Dead Transitions using invariants and state equation in 1280 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2344 ms. Remains : 3000/3000 places, 2000/2000 transitions.
Starting property specific reduction for Referendum-PT-1000-UpperBounds-01
[2023-03-18 20:03:44] [INFO ] Invariant cache hit.
Incomplete random walk after 10000 steps, including 9 resets, run finished after 1119 ms. (steps per millisecond=8 ) properties (out of 1) seen :511
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 356 ms. (steps per millisecond=28 ) properties (out of 1) seen :2
[2023-03-18 20:03:45] [INFO ] Invariant cache hit.
[2023-03-18 20:03:46] [INFO ] [Real]Absence check using 1000 positive place invariants in 244 ms returned sat
[2023-03-18 20:03:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 20:03:47] [INFO ] [Real]Absence check using state equation in 1191 ms returned sat
[2023-03-18 20:03:47] [INFO ] Solution in real domain found non-integer solution.
Current structural bounds on expressions (after SMT) : [1000] Max seen :[511]
Support contains 1000 out of 3000 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY 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 52 ms. Remains 2000 /3000 variables (removed 1000) and now considering 1000/2000 (removed 1000) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 52 ms. Remains : 2000/3000 places, 1000/2000 transitions.
// Phase 1: matrix 1000 rows 2000 cols
[2023-03-18 20:03:51] [INFO ] Computed 1000 place invariants in 8 ms
Finished random walk after 342714 steps, including 342 resets, run visited all 1 properties in 30001 ms. (steps per millisecond=11 )
FORMULA Referendum-PT-1000-UpperBounds-01 1000 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Ending property specific reduction for Referendum-PT-1000-UpperBounds-01 in 37719 ms.
Starting property specific reduction for Referendum-PT-1000-UpperBounds-02
// Phase 1: matrix 2000 rows 3000 cols
[2023-03-18 20:04:21] [INFO ] Computed 1000 place invariants in 12 ms
Incomplete random walk after 10000 steps, including 9 resets, run finished after 1184 ms. (steps per millisecond=8 ) properties (out of 1) seen :535
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 356 ms. (steps per millisecond=28 ) properties (out of 1) seen :2
[2023-03-18 20:04:23] [INFO ] Invariant cache hit.
[2023-03-18 20:04:24] [INFO ] [Real]Absence check using 1000 positive place invariants in 231 ms returned sat
[2023-03-18 20:04:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 20:04:25] [INFO ] [Real]Absence check using state equation in 1151 ms returned sat
[2023-03-18 20:04:25] [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 REACHABILITY 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 103 ms. Remains 2000 /3000 variables (removed 1000) and now considering 1000/2000 (removed 1000) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 103 ms. Remains : 2000/3000 places, 1000/2000 transitions.
// Phase 1: matrix 1000 rows 2000 cols
[2023-03-18 20:04:29] [INFO ] Computed 1000 place invariants in 3 ms
Finished random walk after 339119 steps, including 338 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 37763 ms.
Starting property specific reduction for Referendum-PT-1000-UpperBounds-07
// Phase 1: matrix 2000 rows 3000 cols
[2023-03-18 20:04:59] [INFO ] Computed 1000 place invariants in 13 ms
Incomplete random walk after 10000 steps, including 9 resets, run finished after 1140 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 354 ms. (steps per millisecond=28 ) properties (out of 1) seen :2
[2023-03-18 20:05:01] [INFO ] Invariant cache hit.
[2023-03-18 20:05:01] [INFO ] [Real]Absence check using 1000 positive place invariants in 233 ms returned sat
[2023-03-18 20:05:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 20:05:03] [INFO ] [Real]Absence check using state equation in 1151 ms returned sat
[2023-03-18 20:05:03] [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 REACHABILITY 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 49 ms. Remains 2000 /3000 variables (removed 1000) and now considering 1000/2000 (removed 1000) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 49 ms. Remains : 2000/3000 places, 1000/2000 transitions.
// Phase 1: matrix 1000 rows 2000 cols
[2023-03-18 20:05:07] [INFO ] Computed 1000 place invariants in 3 ms
Finished random walk after 340887 steps, including 340 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 37632 ms.
[2023-03-18 20:05:37] [INFO ] Flatten gal took : 234 ms
Total runtime 269089 ms.
ITS solved all properties within timeout
BK_STOP 1679169938548
--------------------
content from stderr:
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -timeout 360 -rebuildPNML
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="marciexred"
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 marciexred"
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 r330-tall-167889203400525"
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 ;