About the Execution of Smart+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.r331-tall-167889204600525.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 smartxred
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 r331-tall-167889204600525
=====================================================================
--------------------
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 1679151218467
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=smartxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Referendum-PT-1000
Applying reductions before tool smart
Invoking reducer
Running Version 202303021504
[2023-03-18 14:53:40] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-18 14:53:40] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-18 14:53:40] [INFO ] Load time of PNML (sax parser for PT used): 152 ms
[2023-03-18 14:53:40] [INFO ] Transformed 3001 places.
[2023-03-18 14:53:40] [INFO ] Transformed 2001 transitions.
[2023-03-18 14:53:40] [INFO ] Found NUPN structural information;
[2023-03-18 14:53:40] [INFO ] Parsed PT model containing 3001 places and 2001 transitions and 5001 arcs in 245 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 53 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 14:53:41] [INFO ] Computed 1000 place invariants in 44 ms
Incomplete random walk after 10000 steps, including 9 resets, run finished after 3069 ms. (steps per millisecond=3 ) properties (out of 11) seen :3565
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 380 ms. (steps per millisecond=26 ) properties (out of 3) seen :4
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 400 ms. (steps per millisecond=25 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 384 ms. (steps per millisecond=26 ) properties (out of 3) seen :4
[2023-03-18 14:53:45] [INFO ] Invariant cache hit.
[2023-03-18 14:53:46] [INFO ] [Real]Absence check using 1000 positive place invariants in 341 ms returned sat
[2023-03-18 14:53:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 14:53:47] [INFO ] [Real]Absence check using state equation in 1419 ms returned sat
[2023-03-18 14:53:47] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 14:53:52] [INFO ] [Real]Absence check using 1000 positive place invariants in 266 ms returned sat
[2023-03-18 14:53:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 14:53:54] [INFO ] [Real]Absence check using state equation in 1271 ms returned sat
[2023-03-18 14:53:54] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 14:53:59] [INFO ] [Real]Absence check using 1000 positive place invariants in 286 ms returned sat
[2023-03-18 14:53:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 14:54:00] [INFO ] [Real]Absence check using state equation in 1358 ms returned sat
[2023-03-18 14:54:00] [INFO ] Solution in real domain found non-integer solution.
Current structural bounds on expressions (after SMT) : [1000, 1000, 1000] Max seen :[520, 519, 520]
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 390 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 391 ms. Remains : 3000/3001 places, 2000/2001 transitions.
// Phase 1: matrix 2000 rows 3000 cols
[2023-03-18 14:54:05] [INFO ] Computed 1000 place invariants in 12 ms
Finished random walk after 144002 steps, including 143 resets, run visited all 3 properties in 30001 ms. (steps per millisecond=4 )
Interrupted Best-First random walk after 119402 steps, including 0 resets, run timeout after 5032 ms. (steps per millisecond=23 ) properties seen 122
Interrupted Best-First random walk after 117521 steps, including 0 resets, run timeout after 5013 ms. (steps per millisecond=23 ) properties seen 60
Interrupted Best-First random walk after 118401 steps, including 0 resets, run timeout after 5019 ms. (steps per millisecond=23 ) properties seen 120
[2023-03-18 14:54:50] [INFO ] Invariant cache hit.
[2023-03-18 14:54:51] [INFO ] [Real]Absence check using 1000 positive place invariants in 249 ms returned sat
[2023-03-18 14:54:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 14:54:52] [INFO ] [Real]Absence check using state equation in 1225 ms returned sat
[2023-03-18 14:54:52] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 14:54:57] [INFO ] [Real]Absence check using 1000 positive place invariants in 248 ms returned sat
[2023-03-18 14:54:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 14:54:59] [INFO ] [Real]Absence check using state equation in 1178 ms returned sat
[2023-03-18 14:54:59] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 14:55:04] [INFO ] [Real]Absence check using 1000 positive place invariants in 245 ms returned sat
[2023-03-18 14:55:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 14:55:05] [INFO ] [Real]Absence check using state equation in 1264 ms returned sat
[2023-03-18 14:55:05] [INFO ] Solution in real domain found non-integer solution.
Current structural bounds on expressions (after SMT) : [1000, 1000, 1000] Max seen :[548, 532, 548]
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 63 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 64 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 56 ms. Remains 3000 /3000 variables (removed 0) and now considering 2000/2000 (removed 0) transitions.
[2023-03-18 14:55:10] [INFO ] Invariant cache hit.
[2023-03-18 14:55:10] [INFO ] Implicit Places using invariants in 655 ms returned []
[2023-03-18 14:55:10] [INFO ] Invariant cache hit.
[2023-03-18 14:55:11] [INFO ] Implicit Places using invariants and state equation in 592 ms returned []
Implicit Place search using SMT with State Equation took 1251 ms to find 0 implicit places.
[2023-03-18 14:55:11] [INFO ] Redundant transitions in 108 ms returned []
[2023-03-18 14:55:11] [INFO ] Invariant cache hit.
[2023-03-18 14:55:12] [INFO ] Dead Transitions using invariants and state equation in 1613 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3037 ms. Remains : 3000/3000 places, 2000/2000 transitions.
[2023-03-18 14:55:13] [INFO ] Invariant cache hit.
Finished random walk after 145015 steps, including 144 resets, run visited all 3 properties in 30001 ms. (steps per millisecond=4 )
Interrupted Best-First random walk after 119402 steps, including 0 resets, run timeout after 5020 ms. (steps per millisecond=23 ) properties seen 122
Interrupted Best-First random walk after 120280 steps, including 0 resets, run timeout after 5021 ms. (steps per millisecond=23 ) properties seen 61
Interrupted Best-First random walk after 119402 steps, including 0 resets, run timeout after 5007 ms. (steps per millisecond=23 ) properties seen 122
[2023-03-18 14:55:58] [INFO ] Invariant cache hit.
[2023-03-18 14:55:58] [INFO ] [Real]Absence check using 1000 positive place invariants in 250 ms returned sat
[2023-03-18 14:55:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 14:56:00] [INFO ] [Real]Absence check using state equation in 1259 ms returned sat
[2023-03-18 14:56:00] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 14:56:05] [INFO ] [Real]Absence check using 1000 positive place invariants in 266 ms returned sat
[2023-03-18 14:56:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 14:56:06] [INFO ] [Real]Absence check using state equation in 1324 ms returned sat
[2023-03-18 14:56:06] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 14:56:11] [INFO ] [Real]Absence check using 1000 positive place invariants in 240 ms returned sat
[2023-03-18 14:56:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 14:56:13] [INFO ] [Real]Absence check using state equation in 1248 ms returned sat
[2023-03-18 14:56:13] [INFO ] Solution in real domain found non-integer solution.
Current structural bounds on expressions (after SMT) : [1000, 1000, 1000] Max seen :[548, 533, 548]
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 48 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 48 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 48 ms. Remains 3000 /3000 variables (removed 0) and now considering 2000/2000 (removed 0) transitions.
[2023-03-18 14:56:17] [INFO ] Invariant cache hit.
[2023-03-18 14:56:18] [INFO ] Implicit Places using invariants in 543 ms returned []
[2023-03-18 14:56:18] [INFO ] Invariant cache hit.
[2023-03-18 14:56:19] [INFO ] Implicit Places using invariants and state equation in 1960 ms returned []
Implicit Place search using SMT with State Equation took 2516 ms to find 0 implicit places.
[2023-03-18 14:56:20] [INFO ] Redundant transitions in 124 ms returned []
[2023-03-18 14:56:20] [INFO ] Invariant cache hit.
[2023-03-18 14:56:21] [INFO ] Dead Transitions using invariants and state equation in 1640 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4337 ms. Remains : 3000/3000 places, 2000/2000 transitions.
[2023-03-18 14:56:21] [INFO ] Invariant cache hit.
Finished random walk after 145689 steps, including 145 resets, run visited all 3 properties in 30001 ms. (steps per millisecond=4 )
Interrupted Best-First random walk after 120280 steps, including 0 resets, run timeout after 5021 ms. (steps per millisecond=23 ) properties seen 122
Interrupted Best-First random walk after 120280 steps, including 0 resets, run timeout after 5032 ms. (steps per millisecond=23 ) properties seen 61
Interrupted Best-First random walk after 120280 steps, including 0 resets, run timeout after 5019 ms. (steps per millisecond=23 ) properties seen 122
[2023-03-18 14:57:06] [INFO ] Invariant cache hit.
[2023-03-18 14:57:07] [INFO ] [Real]Absence check using 1000 positive place invariants in 269 ms returned sat
[2023-03-18 14:57:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 14:57:09] [INFO ] [Real]Absence check using state equation in 1324 ms returned sat
[2023-03-18 14:57:09] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 14:57:14] [INFO ] [Real]Absence check using 1000 positive place invariants in 250 ms returned sat
[2023-03-18 14:57:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 14:57:15] [INFO ] [Real]Absence check using state equation in 1267 ms returned sat
[2023-03-18 14:57:15] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 14:57:20] [INFO ] [Real]Absence check using 1000 positive place invariants in 258 ms returned sat
[2023-03-18 14:57:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 14:57:21] [INFO ] [Real]Absence check using state equation in 1265 ms returned sat
[2023-03-18 14:57:21] [INFO ] Solution in real domain found non-integer solution.
Current structural bounds on expressions (after SMT) : [1000, 1000, 1000] Max seen :[549, 543, 549]
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 42 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 42 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 37 ms. Remains 3000 /3000 variables (removed 0) and now considering 2000/2000 (removed 0) transitions.
[2023-03-18 14:57:26] [INFO ] Invariant cache hit.
[2023-03-18 14:57:26] [INFO ] Implicit Places using invariants in 563 ms returned []
[2023-03-18 14:57:26] [INFO ] Invariant cache hit.
[2023-03-18 14:57:27] [INFO ] Implicit Places using invariants and state equation in 541 ms returned []
Implicit Place search using SMT with State Equation took 1108 ms to find 0 implicit places.
[2023-03-18 14:57:27] [INFO ] Redundant transitions in 29 ms returned []
[2023-03-18 14:57:27] [INFO ] Invariant cache hit.
[2023-03-18 14:57:29] [INFO ] Dead Transitions using invariants and state equation in 1564 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2747 ms. Remains : 3000/3000 places, 2000/2000 transitions.
[2023-03-18 14:57:29] [INFO ] Invariant cache hit.
Finished random walk after 143351 steps, including 143 resets, run visited all 3 properties in 30001 ms. (steps per millisecond=4 )
Interrupted Best-First random walk after 117521 steps, including 0 resets, run timeout after 5030 ms. (steps per millisecond=23 ) properties seen 120
Interrupted Best-First random walk after 115638 steps, including 0 resets, run timeout after 5028 ms. (steps per millisecond=22 ) properties seen 59
Interrupted Best-First random walk after 118401 steps, including 0 resets, run timeout after 5018 ms. (steps per millisecond=23 ) properties seen 120
[2023-03-18 14:58:14] [INFO ] Invariant cache hit.
[2023-03-18 14:58:15] [INFO ] [Real]Absence check using 1000 positive place invariants in 263 ms returned sat
[2023-03-18 14:58:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 14:58:16] [INFO ] [Real]Absence check using state equation in 1350 ms returned sat
[2023-03-18 14:58:16] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 14:58:21] [INFO ] [Real]Absence check using 1000 positive place invariants in 253 ms returned sat
[2023-03-18 14:58:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 14:58:22] [INFO ] [Real]Absence check using state equation in 1191 ms returned sat
[2023-03-18 14:58:22] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 14:58:27] [INFO ] [Real]Absence check using 1000 positive place invariants in 247 ms returned sat
[2023-03-18 14:58:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 14:58:29] [INFO ] [Real]Absence check using state equation in 1227 ms returned sat
[2023-03-18 14:58:29] [INFO ] Solution in real domain found non-integer solution.
Current structural bounds on expressions (after SMT) : [1000, 1000, 1000] Max seen :[549, 543, 549]
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 39 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 41 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 33 ms. Remains 3000 /3000 variables (removed 0) and now considering 2000/2000 (removed 0) transitions.
[2023-03-18 14:58:33] [INFO ] Invariant cache hit.
[2023-03-18 14:58:34] [INFO ] Implicit Places using invariants in 383 ms returned []
[2023-03-18 14:58:34] [INFO ] Invariant cache hit.
[2023-03-18 14:58:34] [INFO ] Implicit Places using invariants and state equation in 554 ms returned []
Implicit Place search using SMT with State Equation took 939 ms to find 0 implicit places.
[2023-03-18 14:58:34] [INFO ] Redundant transitions in 29 ms returned []
[2023-03-18 14:58:34] [INFO ] Invariant cache hit.
[2023-03-18 14:58:36] [INFO ] Dead Transitions using invariants and state equation in 1436 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2444 ms. Remains : 3000/3000 places, 2000/2000 transitions.
Starting property specific reduction for Referendum-PT-1000-UpperBounds-01
[2023-03-18 14:58:36] [INFO ] Invariant cache hit.
Incomplete random walk after 10000 steps, including 9 resets, run finished after 1241 ms. (steps per millisecond=8 ) properties (out of 1) seen :521
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 405 ms. (steps per millisecond=24 ) properties (out of 1) seen :2
[2023-03-18 14:58:37] [INFO ] Invariant cache hit.
[2023-03-18 14:58:38] [INFO ] [Real]Absence check using 1000 positive place invariants in 224 ms returned sat
[2023-03-18 14:58:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 14:58:39] [INFO ] [Real]Absence check using state equation in 1287 ms returned sat
[2023-03-18 14:58:40] [INFO ] Solution in real domain found non-integer solution.
Current structural bounds on expressions (after SMT) : [1000] Max seen :[521]
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.2 ms
Discarding 1000 places :
Also discarding 0 output transitions
Drop transitions removed 1000 transitions
Reduce isomorphic transitions removed 1000 transitions.
Iterating post reduction 0 with 1000 rules applied. Total rules applied 1001 place count 2000 transition count 1000
Applied a total of 1001 rules in 54 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 54 ms. Remains : 2000/3000 places, 1000/2000 transitions.
// Phase 1: matrix 1000 rows 2000 cols
[2023-03-18 14:58:44] [INFO ] Computed 1000 place invariants in 4 ms
Finished random walk after 306142 steps, including 305 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 38304 ms.
Starting property specific reduction for Referendum-PT-1000-UpperBounds-02
// Phase 1: matrix 2000 rows 3000 cols
[2023-03-18 14:59:14] [INFO ] Computed 1000 place invariants in 11 ms
Incomplete random walk after 10000 steps, including 9 resets, run finished after 1257 ms. (steps per millisecond=7 ) properties (out of 1) seen :526
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 430 ms. (steps per millisecond=23 ) properties (out of 1) seen :2
[2023-03-18 14:59:16] [INFO ] Invariant cache hit.
[2023-03-18 14:59:17] [INFO ] [Real]Absence check using 1000 positive place invariants in 256 ms returned sat
[2023-03-18 14:59:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 14:59:18] [INFO ] [Real]Absence check using state equation in 1276 ms returned sat
[2023-03-18 14:59:18] [INFO ] Solution in real domain found non-integer solution.
Current structural bounds on expressions (after SMT) : [1000] Max seen :[526]
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 65 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 66 ms. Remains : 2000/3000 places, 1000/2000 transitions.
// Phase 1: matrix 1000 rows 2000 cols
[2023-03-18 14:59:22] [INFO ] Computed 1000 place invariants in 11 ms
Finished random walk after 302204 steps, including 301 resets, run visited all 1 properties in 30001 ms. (steps per millisecond=10 )
FORMULA Referendum-PT-1000-UpperBounds-02 1000 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Ending property specific reduction for Referendum-PT-1000-UpperBounds-02 in 38390 ms.
Starting property specific reduction for Referendum-PT-1000-UpperBounds-07
// Phase 1: matrix 2000 rows 3000 cols
[2023-03-18 14:59:52] [INFO ] Computed 1000 place invariants in 19 ms
Incomplete random walk after 10000 steps, including 9 resets, run finished after 1260 ms. (steps per millisecond=7 ) properties (out of 1) seen :528
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 416 ms. (steps per millisecond=24 ) properties (out of 1) seen :2
[2023-03-18 14:59:54] [INFO ] Invariant cache hit.
[2023-03-18 14:59:55] [INFO ] [Real]Absence check using 1000 positive place invariants in 242 ms returned sat
[2023-03-18 14:59:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 14:59:56] [INFO ] [Real]Absence check using state equation in 1186 ms returned sat
[2023-03-18 14:59:56] [INFO ] Solution in real domain found non-integer solution.
Current structural bounds on expressions (after SMT) : [1000] Max seen :[528]
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.3 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 38 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 39 ms. Remains : 2000/3000 places, 1000/2000 transitions.
// Phase 1: matrix 1000 rows 2000 cols
[2023-03-18 15:00:01] [INFO ] Computed 1000 place invariants in 3 ms
Finished random walk after 304416 steps, including 304 resets, run visited all 1 properties in 30001 ms. (steps per millisecond=10 )
FORMULA Referendum-PT-1000-UpperBounds-07 1000 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Ending property specific reduction for Referendum-PT-1000-UpperBounds-07 in 38108 ms.
[2023-03-18 15:00:31] [INFO ] Flatten gal took : 256 ms
Total runtime 410756 ms.
ITS solved all properties within timeout
BK_STOP 1679151632505
--------------------
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="smartxred"
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 smartxred"
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 r331-tall-167889204600525"
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 ;