About the Execution of Marcie+red for Sudoku-PT-AN11
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.r490-tall-167912708400245.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 Sudoku-PT-AN11, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r490-tall-167912708400245
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 41M
-rw-r--r-- 1 mcc users 275K Feb 26 09:23 CTLCardinality.txt
-rw-r--r-- 1 mcc users 1.4M Feb 26 09:23 CTLCardinality.xml
-rw-r--r-- 1 mcc users 1.7M Feb 26 09:06 CTLFireability.txt
-rw-r--r-- 1 mcc users 8.1M Feb 26 09:06 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 297K Feb 25 17:16 LTLCardinality.txt
-rw-r--r-- 1 mcc users 1.1M Feb 25 17:16 LTLCardinality.xml
-rw-r--r-- 1 mcc users 510K Feb 25 17:16 LTLFireability.txt
-rw-r--r-- 1 mcc users 1.8M Feb 25 17:16 LTLFireability.xml
-rw-r--r-- 1 mcc users 755K Feb 26 09:46 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 3.5M Feb 26 09:46 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.5M Feb 26 09:27 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 17M Feb 26 09:27 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 65K Feb 25 17:16 UpperBounds.txt
-rw-r--r-- 1 mcc users 161K Feb 25 17:16 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 746K 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 Sudoku-PT-AN11-UpperBounds-00
FORMULA_NAME Sudoku-PT-AN11-UpperBounds-01
FORMULA_NAME Sudoku-PT-AN11-UpperBounds-02
FORMULA_NAME Sudoku-PT-AN11-UpperBounds-03
FORMULA_NAME Sudoku-PT-AN11-UpperBounds-04
FORMULA_NAME Sudoku-PT-AN11-UpperBounds-05
FORMULA_NAME Sudoku-PT-AN11-UpperBounds-06
FORMULA_NAME Sudoku-PT-AN11-UpperBounds-07
FORMULA_NAME Sudoku-PT-AN11-UpperBounds-08
FORMULA_NAME Sudoku-PT-AN11-UpperBounds-09
FORMULA_NAME Sudoku-PT-AN11-UpperBounds-10
FORMULA_NAME Sudoku-PT-AN11-UpperBounds-11
FORMULA_NAME Sudoku-PT-AN11-UpperBounds-12
FORMULA_NAME Sudoku-PT-AN11-UpperBounds-13
FORMULA_NAME Sudoku-PT-AN11-UpperBounds-14
FORMULA_NAME Sudoku-PT-AN11-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1679218455987
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=Sudoku-PT-AN11
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-19 09:34:17] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-19 09:34:17] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-19 09:34:17] [INFO ] Load time of PNML (sax parser for PT used): 113 ms
[2023-03-19 09:34:17] [INFO ] Transformed 1694 places.
[2023-03-19 09:34:17] [INFO ] Transformed 1331 transitions.
[2023-03-19 09:34:17] [INFO ] Parsed PT model containing 1694 places and 1331 transitions and 5324 arcs in 180 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 32 ms.
// Phase 1: matrix 1331 rows 1694 cols
[2023-03-19 09:34:17] [INFO ] Computed 363 place invariants in 34 ms
FORMULA Sudoku-PT-AN11-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN11-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN11-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN11-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN11-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN11-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN11-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN11-UpperBounds-06 121 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN11-UpperBounds-04 121 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN11-UpperBounds-03 121 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN11-UpperBounds-02 121 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN11-UpperBounds-01 121 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 94 resets, run finished after 1553 ms. (steps per millisecond=6 ) properties (out of 4) seen :331
FORMULA Sudoku-PT-AN11-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 297 ms. (steps per millisecond=33 ) properties (out of 3) seen :9
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 301 ms. (steps per millisecond=33 ) properties (out of 3) seen :9
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 304 ms. (steps per millisecond=32 ) properties (out of 3) seen :9
[2023-03-19 09:34:20] [INFO ] Invariant cache hit.
[2023-03-19 09:34:20] [INFO ] [Real]Absence check using 363 positive place invariants in 222 ms returned sat
[2023-03-19 09:34:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 09:34:21] [INFO ] [Real]Absence check using state equation in 638 ms returned sat
[2023-03-19 09:34:21] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 09:34:21] [INFO ] [Nat]Absence check using 363 positive place invariants in 206 ms returned sat
[2023-03-19 09:34:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 09:34:22] [INFO ] [Nat]Absence check using state equation in 612 ms returned sat
[2023-03-19 09:34:22] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 62 ms.
[2023-03-19 09:34:22] [INFO ] Added : 0 causal constraints over 0 iterations in 202 ms. Result :sat
Minimization took 250 ms.
[2023-03-19 09:34:23] [INFO ] [Real]Absence check using 363 positive place invariants in 156 ms returned sat
[2023-03-19 09:34:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 09:34:24] [INFO ] [Real]Absence check using state equation in 559 ms returned sat
[2023-03-19 09:34:24] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 09:34:24] [INFO ] [Nat]Absence check using 363 positive place invariants in 202 ms returned sat
[2023-03-19 09:34:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 09:34:25] [INFO ] [Nat]Absence check using state equation in 685 ms returned sat
[2023-03-19 09:34:25] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 55 ms.
[2023-03-19 09:34:25] [INFO ] Added : 0 causal constraints over 0 iterations in 178 ms. Result :sat
Minimization took 241 ms.
[2023-03-19 09:34:25] [INFO ] [Real]Absence check using 363 positive place invariants in 151 ms returned sat
[2023-03-19 09:34:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 09:34:26] [INFO ] [Real]Absence check using state equation in 593 ms returned sat
[2023-03-19 09:34:26] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 09:34:26] [INFO ] [Nat]Absence check using 363 positive place invariants in 201 ms returned sat
[2023-03-19 09:34:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 09:34:27] [INFO ] [Nat]Absence check using state equation in 648 ms returned sat
[2023-03-19 09:34:27] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 57 ms.
[2023-03-19 09:34:27] [INFO ] Added : 0 causal constraints over 0 iterations in 182 ms. Result :sat
Minimization took 246 ms.
Current structural bounds on expressions (after SMT) : [1331, 1331, 1331] Max seen :[110, 110, 110]
Support contains 1331 out of 1694 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1694/1694 places, 1331/1331 transitions.
Applied a total of 0 rules in 105 ms. Remains 1694 /1694 variables (removed 0) and now considering 1331/1331 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 106 ms. Remains : 1694/1694 places, 1331/1331 transitions.
[2023-03-19 09:34:31] [INFO ] Invariant cache hit.
Finished random walk after 196458 steps, including 1859 resets, run visited all 3 properties in 30001 ms. (steps per millisecond=6 )
Finished Best-First random walk after 170674 steps, including 4 resets, run visited all 3 properties in 5004 ms. (steps per millisecond=34 )
Finished Best-First random walk after 165207 steps, including 3 resets, run visited all 3 properties in 5005 ms. (steps per millisecond=33 )
Finished Best-First random walk after 164458 steps, including 3 resets, run visited all 3 properties in 5008 ms. (steps per millisecond=32 )
[2023-03-19 09:35:16] [INFO ] Invariant cache hit.
[2023-03-19 09:36:01] [INFO ] [Real]Absence check using 363 positive place invariants in 44869 ms returned unknown
[2023-03-19 09:36:46] [INFO ] [Real]Absence check using 363 positive place invariants in 44816 ms returned unknown
[2023-03-19 09:37:31] [INFO ] [Real]Absence check using 363 positive place invariants in 44847 ms returned unknown
Current structural bounds on expressions (after SMT) : [1331, 1331, 1331] Max seen :[121, 121, 121]
Support contains 1331 out of 1694 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1694/1694 places, 1331/1331 transitions.
Applied a total of 0 rules in 71 ms. Remains 1694 /1694 variables (removed 0) and now considering 1331/1331 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 71 ms. Remains : 1694/1694 places, 1331/1331 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1694/1694 places, 1331/1331 transitions.
Applied a total of 0 rules in 59 ms. Remains 1694 /1694 variables (removed 0) and now considering 1331/1331 (removed 0) transitions.
[2023-03-19 09:37:32] [INFO ] Invariant cache hit.
[2023-03-19 09:37:32] [INFO ] Implicit Places using invariants in 807 ms returned []
[2023-03-19 09:37:32] [INFO ] Invariant cache hit.
[2023-03-19 09:37:34] [INFO ] Implicit Places using invariants and state equation in 1820 ms returned []
Implicit Place search using SMT with State Equation took 2644 ms to find 0 implicit places.
[2023-03-19 09:37:34] [INFO ] Redundant transitions in 84 ms returned []
[2023-03-19 09:37:34] [INFO ] Invariant cache hit.
[2023-03-19 09:37:35] [INFO ] Dead Transitions using invariants and state equation in 760 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3570 ms. Remains : 1694/1694 places, 1331/1331 transitions.
Starting property specific reduction for Sudoku-PT-AN11-UpperBounds-00
[2023-03-19 09:37:35] [INFO ] Invariant cache hit.
Incomplete random walk after 10000 steps, including 94 resets, run finished after 1023 ms. (steps per millisecond=9 ) properties (out of 1) seen :111
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 311 ms. (steps per millisecond=32 ) properties (out of 1) seen :3
[2023-03-19 09:37:36] [INFO ] Invariant cache hit.
[2023-03-19 09:37:37] [INFO ] [Real]Absence check using 363 positive place invariants in 177 ms returned sat
[2023-03-19 09:37:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 09:37:37] [INFO ] [Real]Absence check using state equation in 641 ms returned sat
[2023-03-19 09:37:38] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 09:37:38] [INFO ] [Nat]Absence check using 363 positive place invariants in 223 ms returned sat
[2023-03-19 09:37:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 09:37:39] [INFO ] [Nat]Absence check using state equation in 687 ms returned sat
[2023-03-19 09:37:39] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 48 ms.
[2023-03-19 09:37:39] [INFO ] Added : 0 causal constraints over 0 iterations in 174 ms. Result :sat
Minimization took 258 ms.
Current structural bounds on expressions (after SMT) : [1331] Max seen :[111]
Support contains 1331 out of 1694 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1694/1694 places, 1331/1331 transitions.
Applied a total of 0 rules in 66 ms. Remains 1694 /1694 variables (removed 0) and now considering 1331/1331 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 66 ms. Remains : 1694/1694 places, 1331/1331 transitions.
[2023-03-19 09:37:40] [INFO ] Invariant cache hit.
Finished random walk after 294437 steps, including 2786 resets, run visited all 1 properties in 30001 ms. (steps per millisecond=9 )
Finished Best-First random walk after 172418 steps, including 4 resets, run visited all 1 properties in 5014 ms. (steps per millisecond=34 )
[2023-03-19 09:38:15] [INFO ] Invariant cache hit.
[2023-03-19 09:39:00] [INFO ] [Real]Absence check using 363 positive place invariants in 44855 ms returned unknown
Current structural bounds on expressions (after SMT) : [1331] Max seen :[121]
Support contains 1331 out of 1694 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1694/1694 places, 1331/1331 transitions.
Applied a total of 0 rules in 30 ms. Remains 1694 /1694 variables (removed 0) and now considering 1331/1331 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 30 ms. Remains : 1694/1694 places, 1331/1331 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1694/1694 places, 1331/1331 transitions.
Applied a total of 0 rules in 27 ms. Remains 1694 /1694 variables (removed 0) and now considering 1331/1331 (removed 0) transitions.
[2023-03-19 09:39:00] [INFO ] Invariant cache hit.
[2023-03-19 09:39:01] [INFO ] Implicit Places using invariants in 870 ms returned []
[2023-03-19 09:39:01] [INFO ] Invariant cache hit.
[2023-03-19 09:39:03] [INFO ] Implicit Places using invariants and state equation in 1783 ms returned []
Implicit Place search using SMT with State Equation took 2659 ms to find 0 implicit places.
[2023-03-19 09:39:03] [INFO ] Redundant transitions in 29 ms returned []
[2023-03-19 09:39:03] [INFO ] Invariant cache hit.
[2023-03-19 09:39:03] [INFO ] Dead Transitions using invariants and state equation in 734 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3473 ms. Remains : 1694/1694 places, 1331/1331 transitions.
Ending property specific reduction for Sudoku-PT-AN11-UpperBounds-00 in 88191 ms.
Starting property specific reduction for Sudoku-PT-AN11-UpperBounds-05
[2023-03-19 09:39:03] [INFO ] Invariant cache hit.
Incomplete random walk after 10000 steps, including 94 resets, run finished after 1035 ms. (steps per millisecond=9 ) properties (out of 1) seen :112
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 299 ms. (steps per millisecond=33 ) properties (out of 1) seen :3
[2023-03-19 09:39:05] [INFO ] Invariant cache hit.
[2023-03-19 09:39:05] [INFO ] [Real]Absence check using 363 positive place invariants in 186 ms returned sat
[2023-03-19 09:39:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 09:39:06] [INFO ] [Real]Absence check using state equation in 595 ms returned sat
[2023-03-19 09:39:06] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 09:39:06] [INFO ] [Nat]Absence check using 363 positive place invariants in 153 ms returned sat
[2023-03-19 09:39:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 09:39:07] [INFO ] [Nat]Absence check using state equation in 552 ms returned sat
[2023-03-19 09:39:07] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 54 ms.
[2023-03-19 09:39:07] [INFO ] Added : 0 causal constraints over 0 iterations in 168 ms. Result :sat
Minimization took 1785 ms.
Current structural bounds on expressions (after SMT) : [1331] Max seen :[112]
Support contains 1331 out of 1694 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1694/1694 places, 1331/1331 transitions.
Applied a total of 0 rules in 30 ms. Remains 1694 /1694 variables (removed 0) and now considering 1331/1331 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 31 ms. Remains : 1694/1694 places, 1331/1331 transitions.
[2023-03-19 09:39:09] [INFO ] Invariant cache hit.
Finished random walk after 295969 steps, including 2801 resets, run visited all 1 properties in 30001 ms. (steps per millisecond=9 )
Finished Best-First random walk after 175708 steps, including 4 resets, run visited all 1 properties in 5026 ms. (steps per millisecond=34 )
[2023-03-19 09:39:44] [INFO ] Invariant cache hit.
[2023-03-19 09:40:29] [INFO ] [Real]Absence check using 363 positive place invariants in 44869 ms returned unknown
Current structural bounds on expressions (after SMT) : [1331] Max seen :[121]
Support contains 1331 out of 1694 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1694/1694 places, 1331/1331 transitions.
Applied a total of 0 rules in 39 ms. Remains 1694 /1694 variables (removed 0) and now considering 1331/1331 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 48 ms. Remains : 1694/1694 places, 1331/1331 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1694/1694 places, 1331/1331 transitions.
Applied a total of 0 rules in 35 ms. Remains 1694 /1694 variables (removed 0) and now considering 1331/1331 (removed 0) transitions.
[2023-03-19 09:40:29] [INFO ] Invariant cache hit.
[2023-03-19 09:40:30] [INFO ] Implicit Places using invariants in 759 ms returned []
[2023-03-19 09:40:30] [INFO ] Invariant cache hit.
[2023-03-19 09:40:32] [INFO ] Implicit Places using invariants and state equation in 1691 ms returned []
Implicit Place search using SMT with State Equation took 2452 ms to find 0 implicit places.
[2023-03-19 09:40:32] [INFO ] Redundant transitions in 17 ms returned []
[2023-03-19 09:40:32] [INFO ] Invariant cache hit.
[2023-03-19 09:40:33] [INFO ] Dead Transitions using invariants and state equation in 714 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3224 ms. Remains : 1694/1694 places, 1331/1331 transitions.
Ending property specific reduction for Sudoku-PT-AN11-UpperBounds-05 in 89216 ms.
Starting property specific reduction for Sudoku-PT-AN11-UpperBounds-07
[2023-03-19 09:40:33] [INFO ] Invariant cache hit.
Incomplete random walk after 10000 steps, including 94 resets, run finished after 1023 ms. (steps per millisecond=9 ) properties (out of 1) seen :111
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 297 ms. (steps per millisecond=33 ) properties (out of 1) seen :3
[2023-03-19 09:40:34] [INFO ] Invariant cache hit.
[2023-03-19 09:40:34] [INFO ] [Real]Absence check using 363 positive place invariants in 179 ms returned sat
[2023-03-19 09:40:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 09:40:35] [INFO ] [Real]Absence check using state equation in 668 ms returned sat
[2023-03-19 09:40:35] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 09:40:35] [INFO ] [Nat]Absence check using 363 positive place invariants in 241 ms returned sat
[2023-03-19 09:40:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 09:40:36] [INFO ] [Nat]Absence check using state equation in 733 ms returned sat
[2023-03-19 09:40:36] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 54 ms.
[2023-03-19 09:40:36] [INFO ] Added : 0 causal constraints over 0 iterations in 175 ms. Result :sat
Minimization took 268 ms.
Current structural bounds on expressions (after SMT) : [1331] Max seen :[111]
Support contains 1331 out of 1694 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1694/1694 places, 1331/1331 transitions.
Applied a total of 0 rules in 16 ms. Remains 1694 /1694 variables (removed 0) and now considering 1331/1331 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 1694/1694 places, 1331/1331 transitions.
[2023-03-19 09:40:37] [INFO ] Invariant cache hit.
Finished random walk after 296419 steps, including 2805 resets, run visited all 1 properties in 30001 ms. (steps per millisecond=9 )
Finished Best-First random walk after 172674 steps, including 4 resets, run visited all 1 properties in 5014 ms. (steps per millisecond=34 )
[2023-03-19 09:41:12] [INFO ] Invariant cache hit.
[2023-03-19 09:41:57] [INFO ] [Real]Absence check using 363 positive place invariants in 44864 ms returned unknown
Current structural bounds on expressions (after SMT) : [1331] Max seen :[121]
Support contains 1331 out of 1694 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1694/1694 places, 1331/1331 transitions.
Applied a total of 0 rules in 26 ms. Remains 1694 /1694 variables (removed 0) and now considering 1331/1331 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 26 ms. Remains : 1694/1694 places, 1331/1331 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1694/1694 places, 1331/1331 transitions.
Applied a total of 0 rules in 15 ms. Remains 1694 /1694 variables (removed 0) and now considering 1331/1331 (removed 0) transitions.
[2023-03-19 09:41:57] [INFO ] Invariant cache hit.
[2023-03-19 09:41:58] [INFO ] Implicit Places using invariants in 768 ms returned []
[2023-03-19 09:41:58] [INFO ] Invariant cache hit.
[2023-03-19 09:42:00] [INFO ] Implicit Places using invariants and state equation in 1710 ms returned []
Implicit Place search using SMT with State Equation took 2480 ms to find 0 implicit places.
[2023-03-19 09:42:00] [INFO ] Redundant transitions in 15 ms returned []
[2023-03-19 09:42:00] [INFO ] Invariant cache hit.
[2023-03-19 09:42:01] [INFO ] Dead Transitions using invariants and state equation in 718 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3236 ms. Remains : 1694/1694 places, 1331/1331 transitions.
Ending property specific reduction for Sudoku-PT-AN11-UpperBounds-07 in 87996 ms.
[2023-03-19 09:42:01] [INFO ] Flatten gal took : 146 ms
[2023-03-19 09:42:01] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/UpperBounds.sr.xml took 4 ms.
[2023-03-19 09:42:01] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1694 places, 1331 transitions and 5324 arcs took 7 ms.
Total runtime 463990 ms.
There are residual formulas that ITS could not solve within timeout
timeout --kill-after=10s --signal=SIGINT 1m for testing only
Marcie built on Linux at 2019-11-18.
A model checker for Generalized Stochastic Petri nets
authors: Alex Tovchigrechko (IDD package and CTL model checking)
Martin Schwarick (Symbolic numerical analysis and CSL model checking)
Christian Rohr (Simulative and approximative numerical model checking)
marcie@informatik.tu-cottbus.de
called as: /home/mcc/BenchKit/bin//../reducer/bin//../../marcie/bin/marcie --net-file=model.pnml --mcc-file=UpperBounds.xml --memory=6 --mcc-mode
parse successfull
net created successfully
Net: Sudoku_PT_AN11
(NrP: 1694 NrTr: 1331 NrArc: 5324)
parse formulas
formulas created successfully
place and transition orderings generation:0m 0.172sec
net check time: 0m 0.000sec
init dd package: 0m 2.727sec
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 9007428 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16059016 kB
BK_TIME_CONFINEMENT_REACHED
--------------------
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
check for maximal unmarked siphon
ok
check for constant places
ok
check if there are places and transitions
ok
check if there are transitions without pre-places
ok
check if at least one transition is enabled in m0
ok
check if there are transitions that can never fire
ok
initing FirstDep: 0m 0.001sec
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="Sudoku-PT-AN11"
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 Sudoku-PT-AN11, 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 r490-tall-167912708400245"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/Sudoku-PT-AN11.tgz
mv Sudoku-PT-AN11 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 ;