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.r327-tall-167889199700517.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 lolaxred
Input is Referendum-PT-0500, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r327-tall-167889199700517
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 19M
-rw-r--r-- 1 mcc users 496K Feb 26 19:27 CTLCardinality.txt
-rw-r--r-- 1 mcc users 2.3M Feb 26 19:27 CTLCardinality.xml
-rw-r--r-- 1 mcc users 255K Feb 26 18:40 CTLFireability.txt
-rw-r--r-- 1 mcc users 1.8M Feb 26 18:40 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 257K Feb 25 16:42 LTLCardinality.txt
-rw-r--r-- 1 mcc users 881K Feb 25 16:42 LTLCardinality.xml
-rw-r--r-- 1 mcc users 80K Feb 25 16:42 LTLFireability.txt
-rw-r--r-- 1 mcc users 404K Feb 25 16:42 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.4M Feb 26 21:17 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 6.1M Feb 26 21:17 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 511K Feb 26 20:25 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 3.5M Feb 26 20:25 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 40K Feb 25 16:42 UpperBounds.txt
-rw-r--r-- 1 mcc users 93K 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 571K 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-0500-UpperBounds-00
FORMULA_NAME Referendum-PT-0500-UpperBounds-01
FORMULA_NAME Referendum-PT-0500-UpperBounds-02
FORMULA_NAME Referendum-PT-0500-UpperBounds-03
FORMULA_NAME Referendum-PT-0500-UpperBounds-04
FORMULA_NAME Referendum-PT-0500-UpperBounds-05
FORMULA_NAME Referendum-PT-0500-UpperBounds-06
FORMULA_NAME Referendum-PT-0500-UpperBounds-07
FORMULA_NAME Referendum-PT-0500-UpperBounds-08
FORMULA_NAME Referendum-PT-0500-UpperBounds-09
FORMULA_NAME Referendum-PT-0500-UpperBounds-10
FORMULA_NAME Referendum-PT-0500-UpperBounds-11
FORMULA_NAME Referendum-PT-0500-UpperBounds-12
FORMULA_NAME Referendum-PT-0500-UpperBounds-13
FORMULA_NAME Referendum-PT-0500-UpperBounds-14
FORMULA_NAME Referendum-PT-0500-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1679050897060

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=lolaxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Referendum-PT-0500
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-17 11:01:38] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-17 11:01:38] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-17 11:01:38] [INFO ] Load time of PNML (sax parser for PT used): 94 ms
[2023-03-17 11:01:38] [INFO ] Transformed 1501 places.
[2023-03-17 11:01:38] [INFO ] Transformed 1001 transitions.
[2023-03-17 11:01:38] [INFO ] Found NUPN structural information;
[2023-03-17 11:01:38] [INFO ] Parsed PT model containing 1501 places and 1001 transitions and 2501 arcs in 170 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 19 ms.
FORMULA Referendum-PT-0500-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Referendum-PT-0500-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Referendum-PT-0500-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Referendum-PT-0500-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Referendum-PT-0500-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
// Phase 1: matrix 1001 rows 1501 cols
[2023-03-17 11:01:39] [INFO ] Computed 500 place invariants in 32 ms
Incomplete random walk after 10000 steps, including 19 resets, run finished after 1354 ms. (steps per millisecond=7 ) properties (out of 11) seen :1373
FORMULA Referendum-PT-0500-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Referendum-PT-0500-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Referendum-PT-0500-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Referendum-PT-0500-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Referendum-PT-0500-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Referendum-PT-0500-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 179 ms. (steps per millisecond=55 ) properties (out of 5) seen :12
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 169 ms. (steps per millisecond=59 ) properties (out of 5) seen :12
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 159 ms. (steps per millisecond=62 ) properties (out of 5) seen :8
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 163 ms. (steps per millisecond=61 ) properties (out of 5) seen :12
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 163 ms. (steps per millisecond=61 ) properties (out of 5) seen :8
[2023-03-17 11:01:41] [INFO ] Invariant cache hit.
[2023-03-17 11:01:41] [INFO ] [Real]Absence check using 500 positive place invariants in 103 ms returned sat
[2023-03-17 11:01:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-17 11:01:42] [INFO ] [Real]Absence check using state equation in 427 ms returned sat
[2023-03-17 11:01:42] [INFO ] Solution in real domain found non-integer solution.
[2023-03-17 11:01:47] [INFO ] [Real]Absence check using 500 positive place invariants in 101 ms returned sat
[2023-03-17 11:01:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-17 11:01:47] [INFO ] [Real]Absence check using state equation in 427 ms returned sat
[2023-03-17 11:01:47] [INFO ] Solution in real domain found non-integer solution.
[2023-03-17 11:01:53] [INFO ] [Real]Absence check using 500 positive place invariants in 98 ms returned sat
[2023-03-17 11:01:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-17 11:01:53] [INFO ] [Real]Absence check using state equation in 436 ms returned sat
[2023-03-17 11:01:53] [INFO ] Solution in real domain found non-integer solution.
[2023-03-17 11:01:58] [INFO ] [Real]Absence check using 500 positive place invariants in 92 ms returned sat
[2023-03-17 11:01:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-17 11:01:59] [INFO ] [Real]Absence check using state equation in 412 ms returned sat
[2023-03-17 11:01:59] [INFO ] Solution in real domain found non-integer solution.
[2023-03-17 11:02:04] [INFO ] [Real]Absence check using 500 positive place invariants in 95 ms returned sat
[2023-03-17 11:02:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-17 11:02:04] [INFO ] [Real]Absence check using state equation in 446 ms returned sat
[2023-03-17 11:02:04] [INFO ] Solution in real domain found non-integer solution.
Current structural bounds on expressions (after SMT) : [500, 500, 500, 500, 500] Max seen :[275, 275, 271, 275, 271]
Support contains 1000 out of 1501 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1501/1501 places, 1001/1001 transitions.
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 1500 transition count 1000
Applied a total of 1 rules in 157 ms. Remains 1500 /1501 variables (removed 1) and now considering 1000/1001 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 157 ms. Remains : 1500/1501 places, 1000/1001 transitions.
// Phase 1: matrix 1000 rows 1500 cols
[2023-03-17 11:02:10] [INFO ] Computed 500 place invariants in 5 ms
Finished random walk after 228210 steps, including 455 resets, run visited all 5 properties in 30001 ms. (steps per millisecond=7 )
Interrupted Best-First random walk after 214520 steps, including 0 resets, run timeout after 5008 ms. (steps per millisecond=42 ) properties seen 927
Interrupted Best-First random walk after 209792 steps, including 0 resets, run timeout after 5001 ms. (steps per millisecond=41 ) properties seen 891
Interrupted Best-First random walk after 213752 steps, including 0 resets, run timeout after 5005 ms. (steps per millisecond=42 ) properties seen 614
Interrupted Best-First random walk after 211797 steps, including 0 resets, run timeout after 5010 ms. (steps per millisecond=42 ) properties seen 906
Interrupted Best-First random walk after 212585 steps, including 0 resets, run timeout after 5003 ms. (steps per millisecond=42 ) properties seen 608
[2023-03-17 11:03:05] [INFO ] Invariant cache hit.
[2023-03-17 11:03:05] [INFO ] [Real]Absence check using 500 positive place invariants in 99 ms returned sat
[2023-03-17 11:03:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-17 11:03:05] [INFO ] [Real]Absence check using state equation in 444 ms returned sat
[2023-03-17 11:03:05] [INFO ] Solution in real domain found non-integer solution.
[2023-03-17 11:03:11] [INFO ] [Real]Absence check using 500 positive place invariants in 92 ms returned sat
[2023-03-17 11:03:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-17 11:03:12] [INFO ] [Real]Absence check using state equation in 430 ms returned sat
[2023-03-17 11:03:12] [INFO ] Solution in real domain found non-integer solution.
[2023-03-17 11:03:17] [INFO ] [Real]Absence check using 500 positive place invariants in 95 ms returned sat
[2023-03-17 11:03:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-17 11:03:17] [INFO ] [Real]Absence check using state equation in 442 ms returned sat
[2023-03-17 11:03:18] [INFO ] Solution in real domain found non-integer solution.
[2023-03-17 11:03:23] [INFO ] [Real]Absence check using 500 positive place invariants in 98 ms returned sat
[2023-03-17 11:03:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-17 11:03:24] [INFO ] [Real]Absence check using state equation in 428 ms returned sat
[2023-03-17 11:03:24] [INFO ] Solution in real domain found non-integer solution.
[2023-03-17 11:03:29] [INFO ] [Real]Absence check using 500 positive place invariants in 95 ms returned sat
[2023-03-17 11:03:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-17 11:03:30] [INFO ] [Real]Absence check using state equation in 432 ms returned sat
[2023-03-17 11:03:30] [INFO ] Solution in real domain found non-integer solution.
Current structural bounds on expressions (after SMT) : [500, 500, 500, 500, 500] Max seen :[309, 309, 307, 309, 307]
Support contains 1000 out of 1500 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1500/1500 places, 1000/1000 transitions.
Applied a total of 0 rules in 27 ms. Remains 1500 /1500 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 27 ms. Remains : 1500/1500 places, 1000/1000 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1500/1500 places, 1000/1000 transitions.
Applied a total of 0 rules in 19 ms. Remains 1500 /1500 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
[2023-03-17 11:03:35] [INFO ] Invariant cache hit.
[2023-03-17 11:03:35] [INFO ] Implicit Places using invariants in 323 ms returned []
[2023-03-17 11:03:35] [INFO ] Invariant cache hit.
[2023-03-17 11:03:36] [INFO ] Implicit Places using invariants and state equation in 744 ms returned []
Implicit Place search using SMT with State Equation took 1071 ms to find 0 implicit places.
[2023-03-17 11:03:36] [INFO ] Redundant transitions in 57 ms returned []
[2023-03-17 11:03:36] [INFO ] Invariant cache hit.
[2023-03-17 11:03:37] [INFO ] Dead Transitions using invariants and state equation in 653 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1810 ms. Remains : 1500/1500 places, 1000/1000 transitions.
[2023-03-17 11:03:37] [INFO ] Invariant cache hit.
Finished random walk after 230075 steps, including 459 resets, run visited all 5 properties in 30001 ms. (steps per millisecond=7 )
Interrupted Best-First random walk after 211400 steps, including 0 resets, run timeout after 5012 ms. (steps per millisecond=42 ) properties seen 903
Interrupted Best-First random walk after 210600 steps, including 0 resets, run timeout after 5009 ms. (steps per millisecond=42 ) properties seen 897
Interrupted Best-First random walk after 210600 steps, including 0 resets, run timeout after 5011 ms. (steps per millisecond=42 ) properties seen 598
Interrupted Best-First random walk after 209385 steps, including 0 resets, run timeout after 5005 ms. (steps per millisecond=41 ) properties seen 888
Interrupted Best-First random walk after 213752 steps, including 0 resets, run timeout after 5008 ms. (steps per millisecond=42 ) properties seen 614
[2023-03-17 11:04:32] [INFO ] Invariant cache hit.
[2023-03-17 11:04:32] [INFO ] [Real]Absence check using 500 positive place invariants in 95 ms returned sat
[2023-03-17 11:04:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-17 11:04:33] [INFO ] [Real]Absence check using state equation in 418 ms returned sat
[2023-03-17 11:04:33] [INFO ] Solution in real domain found non-integer solution.
[2023-03-17 11:04:38] [INFO ] [Real]Absence check using 500 positive place invariants in 93 ms returned sat
[2023-03-17 11:04:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-17 11:04:39] [INFO ] [Real]Absence check using state equation in 412 ms returned sat
[2023-03-17 11:04:39] [INFO ] Solution in real domain found non-integer solution.
[2023-03-17 11:04:44] [INFO ] [Real]Absence check using 500 positive place invariants in 99 ms returned sat
[2023-03-17 11:04:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-17 11:04:45] [INFO ] [Real]Absence check using state equation in 410 ms returned sat
[2023-03-17 11:04:45] [INFO ] Solution in real domain found non-integer solution.
[2023-03-17 11:04:50] [INFO ] [Real]Absence check using 500 positive place invariants in 96 ms returned sat
[2023-03-17 11:04:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-17 11:04:51] [INFO ] [Real]Absence check using state equation in 432 ms returned sat
[2023-03-17 11:04:51] [INFO ] Solution in real domain found non-integer solution.
[2023-03-17 11:04:56] [INFO ] [Real]Absence check using 500 positive place invariants in 94 ms returned sat
[2023-03-17 11:04:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-17 11:04:57] [INFO ] [Real]Absence check using state equation in 425 ms returned sat
[2023-03-17 11:04:57] [INFO ] Solution in real domain found non-integer solution.
Current structural bounds on expressions (after SMT) : [500, 500, 500, 500, 500] Max seen :[309, 309, 307, 309, 307]
Support contains 1000 out of 1500 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1500/1500 places, 1000/1000 transitions.
Applied a total of 0 rules in 21 ms. Remains 1500 /1500 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21 ms. Remains : 1500/1500 places, 1000/1000 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1500/1500 places, 1000/1000 transitions.
Applied a total of 0 rules in 19 ms. Remains 1500 /1500 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
[2023-03-17 11:05:02] [INFO ] Invariant cache hit.
[2023-03-17 11:05:02] [INFO ] Implicit Places using invariants in 316 ms returned []
[2023-03-17 11:05:02] [INFO ] Invariant cache hit.
[2023-03-17 11:05:03] [INFO ] Implicit Places using invariants and state equation in 728 ms returned []
Implicit Place search using SMT with State Equation took 1046 ms to find 0 implicit places.
[2023-03-17 11:05:03] [INFO ] Redundant transitions in 13 ms returned []
[2023-03-17 11:05:03] [INFO ] Invariant cache hit.
[2023-03-17 11:05:04] [INFO ] Dead Transitions using invariants and state equation in 607 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1691 ms. Remains : 1500/1500 places, 1000/1000 transitions.
Starting property specific reduction for Referendum-PT-0500-UpperBounds-01
[2023-03-17 11:05:04] [INFO ] Invariant cache hit.
Incomplete random walk after 10000 steps, including 19 resets, run finished after 567 ms. (steps per millisecond=17 ) properties (out of 1) seen :272
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 163 ms. (steps per millisecond=61 ) properties (out of 1) seen :4
[2023-03-17 11:05:05] [INFO ] Invariant cache hit.
[2023-03-17 11:05:05] [INFO ] [Real]Absence check using 500 positive place invariants in 92 ms returned sat
[2023-03-17 11:05:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-17 11:05:05] [INFO ] [Real]Absence check using state equation in 434 ms returned sat
[2023-03-17 11:05:05] [INFO ] Solution in real domain found non-integer solution.
Current structural bounds on expressions (after SMT) : [500] Max seen :[272]
Support contains 500 out of 1500 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1500/1500 places, 1000/1000 transitions.
Graph (complete) has 1000 edges and 1500 vertex of which 1000 are kept as prefixes of interest. Removing 500 places using SCC suffix rule.3 ms
Discarding 500 places :
Also discarding 0 output transitions
Drop transitions removed 500 transitions
Reduce isomorphic transitions removed 500 transitions.
Iterating post reduction 0 with 500 rules applied. Total rules applied 501 place count 1000 transition count 500
Applied a total of 501 rules in 43 ms. Remains 1000 /1500 variables (removed 500) and now considering 500/1000 (removed 500) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 43 ms. Remains : 1000/1500 places, 500/1000 transitions.
// Phase 1: matrix 500 rows 1000 cols
[2023-03-17 11:05:10] [INFO ] Computed 500 place invariants in 2 ms
Finished random walk after 687002 steps, including 1371 resets, run visited all 1 properties in 30001 ms. (steps per millisecond=22 )
FORMULA Referendum-PT-0500-UpperBounds-01 500 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Ending property specific reduction for Referendum-PT-0500-UpperBounds-01 in 36616 ms.
Starting property specific reduction for Referendum-PT-0500-UpperBounds-03
// Phase 1: matrix 1000 rows 1500 cols
[2023-03-17 11:05:40] [INFO ] Computed 500 place invariants in 13 ms
Incomplete random walk after 10000 steps, including 19 resets, run finished after 579 ms. (steps per millisecond=17 ) properties (out of 1) seen :279
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 175 ms. (steps per millisecond=57 ) properties (out of 1) seen :4
[2023-03-17 11:05:41] [INFO ] Invariant cache hit.
[2023-03-17 11:05:42] [INFO ] [Real]Absence check using 500 positive place invariants in 90 ms returned sat
[2023-03-17 11:05:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-17 11:05:42] [INFO ] [Real]Absence check using state equation in 410 ms returned sat
[2023-03-17 11:05:42] [INFO ] Solution in real domain found non-integer solution.
Current structural bounds on expressions (after SMT) : [500] Max seen :[279]
Support contains 500 out of 1500 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1500/1500 places, 1000/1000 transitions.
Graph (complete) has 1000 edges and 1500 vertex of which 1000 are kept as prefixes of interest. Removing 500 places using SCC suffix rule.3 ms
Discarding 500 places :
Also discarding 0 output transitions
Drop transitions removed 500 transitions
Reduce isomorphic transitions removed 500 transitions.
Iterating post reduction 0 with 500 rules applied. Total rules applied 501 place count 1000 transition count 500
Applied a total of 501 rules in 41 ms. Remains 1000 /1500 variables (removed 500) and now considering 500/1000 (removed 500) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 42 ms. Remains : 1000/1500 places, 500/1000 transitions.
// Phase 1: matrix 500 rows 1000 cols
[2023-03-17 11:05:47] [INFO ] Computed 500 place invariants in 6 ms
Finished random walk after 682880 steps, including 1363 resets, run visited all 1 properties in 30001 ms. (steps per millisecond=22 )
FORMULA Referendum-PT-0500-UpperBounds-03 500 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Ending property specific reduction for Referendum-PT-0500-UpperBounds-03 in 36627 ms.
Starting property specific reduction for Referendum-PT-0500-UpperBounds-04
// Phase 1: matrix 1000 rows 1500 cols
[2023-03-17 11:06:17] [INFO ] Computed 500 place invariants in 9 ms
Incomplete random walk after 10000 steps, including 19 resets, run finished after 568 ms. (steps per millisecond=17 ) properties (out of 1) seen :267
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 173 ms. (steps per millisecond=57 ) properties (out of 1) seen :4
[2023-03-17 11:06:18] [INFO ] Invariant cache hit.
[2023-03-17 11:06:18] [INFO ] [Real]Absence check using 500 positive place invariants in 95 ms returned sat
[2023-03-17 11:06:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-17 11:06:19] [INFO ] [Real]Absence check using state equation in 443 ms returned sat
[2023-03-17 11:06:19] [INFO ] Solution in real domain found non-integer solution.
Current structural bounds on expressions (after SMT) : [500] Max seen :[267]
Support contains 500 out of 1500 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1500/1500 places, 1000/1000 transitions.
Graph (complete) has 1000 edges and 1500 vertex of which 1000 are kept as prefixes of interest. Removing 500 places using SCC suffix rule.1 ms
Discarding 500 places :
Also discarding 0 output transitions
Drop transitions removed 500 transitions
Reduce isomorphic transitions removed 500 transitions.
Iterating post reduction 0 with 500 rules applied. Total rules applied 501 place count 1000 transition count 500
Applied a total of 501 rules in 15 ms. Remains 1000 /1500 variables (removed 500) and now considering 500/1000 (removed 500) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 1000/1500 places, 500/1000 transitions.
// Phase 1: matrix 500 rows 1000 cols
[2023-03-17 11:06:24] [INFO ] Computed 500 place invariants in 2 ms
Finished random walk after 684503 steps, including 1366 resets, run visited all 1 properties in 30001 ms. (steps per millisecond=22 )
FORMULA Referendum-PT-0500-UpperBounds-04 500 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Ending property specific reduction for Referendum-PT-0500-UpperBounds-04 in 36425 ms.
Starting property specific reduction for Referendum-PT-0500-UpperBounds-06
// Phase 1: matrix 1000 rows 1500 cols
[2023-03-17 11:06:54] [INFO ] Computed 500 place invariants in 4 ms
Incomplete random walk after 10000 steps, including 19 resets, run finished after 574 ms. (steps per millisecond=17 ) properties (out of 1) seen :267
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 173 ms. (steps per millisecond=57 ) properties (out of 1) seen :4
[2023-03-17 11:06:54] [INFO ] Invariant cache hit.
[2023-03-17 11:06:55] [INFO ] [Real]Absence check using 500 positive place invariants in 90 ms returned sat
[2023-03-17 11:06:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-17 11:06:55] [INFO ] [Real]Absence check using state equation in 391 ms returned sat
[2023-03-17 11:06:55] [INFO ] Solution in real domain found non-integer solution.
Current structural bounds on expressions (after SMT) : [500] Max seen :[267]
Support contains 500 out of 1500 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1500/1500 places, 1000/1000 transitions.
Graph (complete) has 1000 edges and 1500 vertex of which 1000 are kept as prefixes of interest. Removing 500 places using SCC suffix rule.3 ms
Discarding 500 places :
Also discarding 0 output transitions
Drop transitions removed 500 transitions
Reduce isomorphic transitions removed 500 transitions.
Iterating post reduction 0 with 500 rules applied. Total rules applied 501 place count 1000 transition count 500
Applied a total of 501 rules in 28 ms. Remains 1000 /1500 variables (removed 500) and now considering 500/1000 (removed 500) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 28 ms. Remains : 1000/1500 places, 500/1000 transitions.
// Phase 1: matrix 500 rows 1000 cols
[2023-03-17 11:07:00] [INFO ] Computed 500 place invariants in 3 ms
Finished random walk after 685559 steps, including 1368 resets, run visited all 1 properties in 30001 ms. (steps per millisecond=22 )
FORMULA Referendum-PT-0500-UpperBounds-06 500 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Ending property specific reduction for Referendum-PT-0500-UpperBounds-06 in 36540 ms.
Starting property specific reduction for Referendum-PT-0500-UpperBounds-07
// Phase 1: matrix 1000 rows 1500 cols
[2023-03-17 11:07:30] [INFO ] Computed 500 place invariants in 7 ms
Incomplete random walk after 10000 steps, including 19 resets, run finished after 565 ms. (steps per millisecond=17 ) properties (out of 1) seen :270
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 174 ms. (steps per millisecond=57 ) properties (out of 1) seen :4
[2023-03-17 11:07:31] [INFO ] Invariant cache hit.
[2023-03-17 11:07:31] [INFO ] [Real]Absence check using 500 positive place invariants in 89 ms returned sat
[2023-03-17 11:07:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-17 11:07:31] [INFO ] [Real]Absence check using state equation in 403 ms returned sat
[2023-03-17 11:07:32] [INFO ] Solution in real domain found non-integer solution.
Current structural bounds on expressions (after SMT) : [500] Max seen :[270]
Support contains 500 out of 1500 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1500/1500 places, 1000/1000 transitions.
Graph (complete) has 1000 edges and 1500 vertex of which 1000 are kept as prefixes of interest. Removing 500 places using SCC suffix rule.3 ms
Discarding 500 places :
Also discarding 0 output transitions
Drop transitions removed 500 transitions
Reduce isomorphic transitions removed 500 transitions.
Iterating post reduction 0 with 500 rules applied. Total rules applied 501 place count 1000 transition count 500
Applied a total of 501 rules in 26 ms. Remains 1000 /1500 variables (removed 500) and now considering 500/1000 (removed 500) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 27 ms. Remains : 1000/1500 places, 500/1000 transitions.
// Phase 1: matrix 500 rows 1000 cols
[2023-03-17 11:07:36] [INFO ] Computed 500 place invariants in 3 ms
Finished random walk after 684256 steps, including 1365 resets, run visited all 1 properties in 30001 ms. (steps per millisecond=22 )
FORMULA Referendum-PT-0500-UpperBounds-07 500 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Ending property specific reduction for Referendum-PT-0500-UpperBounds-07 in 36205 ms.
[2023-03-17 11:08:07] [INFO ] Flatten gal took : 262 ms
Total runtime 388581 ms.
ITS solved all properties within timeout

BK_STOP 1679051288136

--------------------
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-0500"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="lolaxred"
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 lolaxred"
echo " Input is Referendum-PT-0500, 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 r327-tall-167889199700517"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/Referendum-PT-0500.tgz
mv Referendum-PT-0500 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 '' UpperBounds.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
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 ;