fond
Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r487-tall-167912702800245
Last Updated
May 14, 2023

About the Execution of LoLa+red for Sudoku-PT-AN11

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
357.312 477080.00 527878.00 1609.00 121 121 121 121 121 121 121 121 1 1 1 1 1 1 1 1 normal

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.r487-tall-167912702800245.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 Sudoku-PT-AN11, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r487-tall-167912702800245
=====================================================================

--------------------
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 1679178277789

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=Sudoku-PT-AN11
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-18 22:24:39] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-18 22:24:39] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-18 22:24:39] [INFO ] Load time of PNML (sax parser for PT used): 126 ms
[2023-03-18 22:24:39] [INFO ] Transformed 1694 places.
[2023-03-18 22:24:39] [INFO ] Transformed 1331 transitions.
[2023-03-18 22:24:39] [INFO ] Parsed PT model containing 1694 places and 1331 transitions and 5324 arcs in 214 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 32 ms.
// Phase 1: matrix 1331 rows 1694 cols
[2023-03-18 22:24:39] [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 1545 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 311 ms. (steps per millisecond=32 ) properties (out of 3) seen :9
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 313 ms. (steps per millisecond=31 ) properties (out of 3) seen :9
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 305 ms. (steps per millisecond=32 ) properties (out of 3) seen :9
[2023-03-18 22:24:42] [INFO ] Invariant cache hit.
[2023-03-18 22:24:42] [INFO ] [Real]Absence check using 363 positive place invariants in 165 ms returned sat
[2023-03-18 22:24:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 22:24:43] [INFO ] [Real]Absence check using state equation in 617 ms returned sat
[2023-03-18 22:24:43] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 22:24:43] [INFO ] [Nat]Absence check using 363 positive place invariants in 200 ms returned sat
[2023-03-18 22:24:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-18 22:24:44] [INFO ] [Nat]Absence check using state equation in 636 ms returned sat
[2023-03-18 22:24:44] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 41 ms.
[2023-03-18 22:24:44] [INFO ] Added : 0 causal constraints over 0 iterations in 187 ms. Result :sat
Minimization took 249 ms.
[2023-03-18 22:24:45] [INFO ] [Real]Absence check using 363 positive place invariants in 148 ms returned sat
[2023-03-18 22:24:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 22:24:46] [INFO ] [Real]Absence check using state equation in 598 ms returned sat
[2023-03-18 22:24:46] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 22:24:46] [INFO ] [Nat]Absence check using 363 positive place invariants in 197 ms returned sat
[2023-03-18 22:24:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-18 22:24:47] [INFO ] [Nat]Absence check using state equation in 652 ms returned sat
[2023-03-18 22:24:47] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 51 ms.
[2023-03-18 22:24:47] [INFO ] Added : 0 causal constraints over 0 iterations in 166 ms. Result :sat
Minimization took 241 ms.
[2023-03-18 22:24:47] [INFO ] [Real]Absence check using 363 positive place invariants in 149 ms returned sat
[2023-03-18 22:24:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 22:24:48] [INFO ] [Real]Absence check using state equation in 599 ms returned sat
[2023-03-18 22:24:48] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 22:24:49] [INFO ] [Nat]Absence check using 363 positive place invariants in 210 ms returned sat
[2023-03-18 22:24:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-18 22:24:49] [INFO ] [Nat]Absence check using state equation in 686 ms returned sat
[2023-03-18 22:24:49] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 59 ms.
[2023-03-18 22:24:49] [INFO ] Added : 0 causal constraints over 0 iterations in 183 ms. Result :sat
Minimization took 251 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 94 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 96 ms. Remains : 1694/1694 places, 1331/1331 transitions.
[2023-03-18 22:24:53] [INFO ] Invariant cache hit.
Finished random walk after 202077 steps, including 1912 resets, run visited all 3 properties in 30001 ms. (steps per millisecond=6 )
Finished Best-First random walk after 166296 steps, including 3 resets, run visited all 3 properties in 5004 ms. (steps per millisecond=33 )
Finished Best-First random walk after 165839 steps, including 3 resets, run visited all 3 properties in 5006 ms. (steps per millisecond=33 )
Finished Best-First random walk after 166280 steps, including 3 resets, run visited all 3 properties in 5004 ms. (steps per millisecond=33 )
[2023-03-18 22:25:38] [INFO ] Invariant cache hit.
[2023-03-18 22:26:23] [INFO ] [Real]Absence check using 363 positive place invariants in 44847 ms returned unknown
[2023-03-18 22:27:08] [INFO ] [Real]Absence check using 363 positive place invariants in 44827 ms returned unknown
[2023-03-18 22:27:53] [INFO ] [Real]Absence check using 363 positive place invariants in 44859 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 65 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.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1694/1694 places, 1331/1331 transitions.
Applied a total of 0 rules in 50 ms. Remains 1694 /1694 variables (removed 0) and now considering 1331/1331 (removed 0) transitions.
[2023-03-18 22:27:54] [INFO ] Invariant cache hit.
[2023-03-18 22:27:54] [INFO ] Implicit Places using invariants in 770 ms returned []
[2023-03-18 22:27:54] [INFO ] Invariant cache hit.
[2023-03-18 22:27:56] [INFO ] Implicit Places using invariants and state equation in 1621 ms returned []
Implicit Place search using SMT with State Equation took 2396 ms to find 0 implicit places.
[2023-03-18 22:27:56] [INFO ] Redundant transitions in 89 ms returned []
[2023-03-18 22:27:56] [INFO ] Invariant cache hit.
[2023-03-18 22:27:57] [INFO ] Dead Transitions using invariants and state equation in 665 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3223 ms. Remains : 1694/1694 places, 1331/1331 transitions.
Starting property specific reduction for Sudoku-PT-AN11-UpperBounds-00
[2023-03-18 22:27:57] [INFO ] Invariant cache hit.
Incomplete random walk after 10000 steps, including 94 resets, run finished after 1020 ms. (steps per millisecond=9 ) properties (out of 1) seen :110
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 305 ms. (steps per millisecond=32 ) properties (out of 1) seen :3
[2023-03-18 22:27:58] [INFO ] Invariant cache hit.
[2023-03-18 22:27:58] [INFO ] [Real]Absence check using 363 positive place invariants in 141 ms returned sat
[2023-03-18 22:27:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 22:27:59] [INFO ] [Real]Absence check using state equation in 580 ms returned sat
[2023-03-18 22:27:59] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 22:27:59] [INFO ] [Nat]Absence check using 363 positive place invariants in 194 ms returned sat
[2023-03-18 22:27:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-18 22:28:00] [INFO ] [Nat]Absence check using state equation in 641 ms returned sat
[2023-03-18 22:28:00] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 47 ms.
[2023-03-18 22:28:00] [INFO ] Added : 0 causal constraints over 0 iterations in 155 ms. Result :sat
Minimization took 245 ms.
Current structural bounds on expressions (after SMT) : [1331] Max seen :[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 25 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.
[2023-03-18 22:28:01] [INFO ] Invariant cache hit.
Finished random walk after 292174 steps, including 2764 resets, run visited all 1 properties in 30001 ms. (steps per millisecond=9 )
Finished Best-First random walk after 168702 steps, including 3 resets, run visited all 1 properties in 5001 ms. (steps per millisecond=33 )
[2023-03-18 22:28:36] [INFO ] Invariant cache hit.
[2023-03-18 22:29:21] [INFO ] [Real]Absence check using 363 positive place invariants in 44857 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 25 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 25 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 34 ms. Remains 1694 /1694 variables (removed 0) and now considering 1331/1331 (removed 0) transitions.
[2023-03-18 22:29:21] [INFO ] Invariant cache hit.
[2023-03-18 22:29:22] [INFO ] Implicit Places using invariants in 767 ms returned []
[2023-03-18 22:29:22] [INFO ] Invariant cache hit.
[2023-03-18 22:29:24] [INFO ] Implicit Places using invariants and state equation in 1674 ms returned []
Implicit Place search using SMT with State Equation took 2449 ms to find 0 implicit places.
[2023-03-18 22:29:24] [INFO ] Redundant transitions in 30 ms returned []
[2023-03-18 22:29:24] [INFO ] Invariant cache hit.
[2023-03-18 22:29:24] [INFO ] Dead Transitions using invariants and state equation in 716 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3243 ms. Remains : 1694/1694 places, 1331/1331 transitions.
Ending property specific reduction for Sudoku-PT-AN11-UpperBounds-00 in 87692 ms.
Starting property specific reduction for Sudoku-PT-AN11-UpperBounds-05
[2023-03-18 22:29:24] [INFO ] Invariant cache hit.
Incomplete random walk after 10000 steps, including 94 resets, run finished after 1039 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 308 ms. (steps per millisecond=32 ) properties (out of 1) seen :3
[2023-03-18 22:29:26] [INFO ] Invariant cache hit.
[2023-03-18 22:29:26] [INFO ] [Real]Absence check using 363 positive place invariants in 168 ms returned sat
[2023-03-18 22:29:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 22:29:27] [INFO ] [Real]Absence check using state equation in 620 ms returned sat
[2023-03-18 22:29:27] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 22:29:27] [INFO ] [Nat]Absence check using 363 positive place invariants in 228 ms returned sat
[2023-03-18 22:29:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-18 22:29:28] [INFO ] [Nat]Absence check using state equation in 664 ms returned sat
[2023-03-18 22:29:28] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 48 ms.
[2023-03-18 22:29:28] [INFO ] Added : 0 causal constraints over 0 iterations in 153 ms. Result :sat
Minimization took 252 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 20 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 20 ms. Remains : 1694/1694 places, 1331/1331 transitions.
[2023-03-18 22:29:29] [INFO ] Invariant cache hit.
Finished random walk after 290061 steps, including 2746 resets, run visited all 1 properties in 30001 ms. (steps per millisecond=9 )
Finished Best-First random walk after 170101 steps, including 4 resets, run visited all 1 properties in 5017 ms. (steps per millisecond=33 )
[2023-03-18 22:30:04] [INFO ] Invariant cache hit.
[2023-03-18 22:30:49] [INFO ] [Real]Absence check using 363 positive place invariants in 44839 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 22 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 22 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 18 ms. Remains 1694 /1694 variables (removed 0) and now considering 1331/1331 (removed 0) transitions.
[2023-03-18 22:30:49] [INFO ] Invariant cache hit.
[2023-03-18 22:30:50] [INFO ] Implicit Places using invariants in 745 ms returned []
[2023-03-18 22:30:50] [INFO ] Invariant cache hit.
[2023-03-18 22:30:51] [INFO ] Implicit Places using invariants and state equation in 1644 ms returned []
Implicit Place search using SMT with State Equation took 2398 ms to find 0 implicit places.
[2023-03-18 22:30:51] [INFO ] Redundant transitions in 17 ms returned []
[2023-03-18 22:30:51] [INFO ] Invariant cache hit.
[2023-03-18 22:30:52] [INFO ] Dead Transitions using invariants and state equation in 764 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3213 ms. Remains : 1694/1694 places, 1331/1331 transitions.
Ending property specific reduction for Sudoku-PT-AN11-UpperBounds-05 in 87804 ms.
Starting property specific reduction for Sudoku-PT-AN11-UpperBounds-07
[2023-03-18 22:30:52] [INFO ] Invariant cache hit.
Incomplete random walk after 10000 steps, including 94 resets, run finished after 1020 ms. (steps per millisecond=9 ) properties (out of 1) seen :110
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-18 22:30:54] [INFO ] Invariant cache hit.
[2023-03-18 22:30:54] [INFO ] [Real]Absence check using 363 positive place invariants in 155 ms returned sat
[2023-03-18 22:30:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 22:30:55] [INFO ] [Real]Absence check using state equation in 589 ms returned sat
[2023-03-18 22:30:55] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 22:30:55] [INFO ] [Nat]Absence check using 363 positive place invariants in 202 ms returned sat
[2023-03-18 22:30:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-18 22:30:56] [INFO ] [Nat]Absence check using state equation in 664 ms returned sat
[2023-03-18 22:30:56] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 53 ms.
[2023-03-18 22:30:56] [INFO ] Added : 0 causal constraints over 0 iterations in 162 ms. Result :sat
Minimization took 248 ms.
Current structural bounds on expressions (after SMT) : [1331] Max seen :[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 18 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 18 ms. Remains : 1694/1694 places, 1331/1331 transitions.
[2023-03-18 22:30:57] [INFO ] Invariant cache hit.
Finished random walk after 296700 steps, including 2808 resets, run visited all 1 properties in 30001 ms. (steps per millisecond=9 )
Finished Best-First random walk after 169482 steps, including 3 resets, run visited all 1 properties in 5001 ms. (steps per millisecond=33 )
[2023-03-18 22:31:32] [INFO ] Invariant cache hit.
[2023-03-18 22:32:17] [INFO ] [Real]Absence check using 363 positive place invariants in 44867 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 16 ms. Remains 1694 /1694 variables (removed 0) and now considering 1331/1331 (removed 0) transitions.
[2023-03-18 22:32:17] [INFO ] Invariant cache hit.
[2023-03-18 22:32:18] [INFO ] Implicit Places using invariants in 755 ms returned []
[2023-03-18 22:32:18] [INFO ] Invariant cache hit.
[2023-03-18 22:32:19] [INFO ] Implicit Places using invariants and state equation in 1751 ms returned []
Implicit Place search using SMT with State Equation took 2510 ms to find 0 implicit places.
[2023-03-18 22:32:19] [INFO ] Redundant transitions in 21 ms returned []
[2023-03-18 22:32:19] [INFO ] Invariant cache hit.
[2023-03-18 22:32:20] [INFO ] Dead Transitions using invariants and state equation in 703 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3261 ms. Remains : 1694/1694 places, 1331/1331 transitions.
Ending property specific reduction for Sudoku-PT-AN11-UpperBounds-07 in 87739 ms.
[2023-03-18 22:32:20] [INFO ] Flatten gal took : 145 ms
[2023-03-18 22:32:20] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/UpperBounds.sr.xml took 5 ms.
[2023-03-18 22:32:20] [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 461412 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT Sudoku-PT-AN11
BK_EXAMINATION: UpperBounds
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/378
Upper Bounds

FORMULA Sudoku-PT-AN11-UpperBounds-05 121 TECHNIQUES SEQUENTIAL_PROCESSING TOPOLOGICAL EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Sudoku-PT-AN11-UpperBounds-07 121 TECHNIQUES SEQUENTIAL_PROCESSING TOPOLOGICAL EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Sudoku-PT-AN11-UpperBounds-00 121 TECHNIQUES SEQUENTIAL_PROCESSING TOPOLOGICAL EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

BK_STOP 1679178754869

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
++ perl -pe 's/.*\.//g'
+ 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
lola: MEM LIMIT 32
lola: MEM LIMIT 5
lola: NET
lola: input: PNML file (--pnmlnet)
lola: reading net from /home/mcc/execution/378/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/378/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/378/UpperBounds.xml
lola: Rule S: 0 transitions removed,0 places removed
lola: LAUNCH task # 11 (type EXCL) for 3 Sudoku-PT-AN11-UpperBounds-05
lola: time limit : 1199 sec
lola: memory limit: 32 pages
lola: LAUNCH task # 9 (type FNDP) for 3 Sudoku-PT-AN11-UpperBounds-05
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 10 (type EQUN) for 3 Sudoku-PT-AN11-UpperBounds-05
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 12 (type FNDP) for 0 Sudoku-PT-AN11-UpperBounds-00
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: Structural Bound: 121
sara: try reading problem file /home/mcc/execution/378/UpperBounds-10.sara.
sara: place or transition ordering is non-deterministic
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-PT-AN11-UpperBounds-00: BOUND 0 2 1 0 1 0 0 0
Sudoku-PT-AN11-UpperBounds-05: BOUND 0 0 3 0 1 0 0 0
Sudoku-PT-AN11-UpperBounds-07: BOUND 0 3 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
9 BOUND FNDP 2/1798 0/5 Sudoku-PT-AN11-UpperBounds-05 63984 t fired, 591 attempts, .
10 BOUND STEQ 2/1798 0/5 Sudoku-PT-AN11-UpperBounds-05 --
11 BOUND EXCL 2/1199 1/32 Sudoku-PT-AN11-UpperBounds-05 39844 m, 7968 m/sec, 218733 t fired, result in [107,121] .
12 BOUND FNDP 2/1798 0/5 Sudoku-PT-AN11-UpperBounds-00 63870 t fired, 589 attempts, .

Time elapsed: 5 secs. Pages in use: 1
# running tasks: 4 of 4 Visible: 3

lola: REPORT NUM
lola: FINISHED task # 10 (type EQUN) for Sudoku-PT-AN11-UpperBounds-05
lola: time used : 3.000000
lola: CANCELED task # 9 (type FNDP) for Sudoku-PT-AN11-UpperBounds-05 (obsolete)
lola: CANCELED task # 11 (type EXCL) for Sudoku-PT-AN11-UpperBounds-05 (obsolete)
lola: LAUNCH task # 17 (type EXCL) for 6 Sudoku-PT-AN11-UpperBounds-07
lola: time limit : 1797 sec
lola: memory limit: 32 pages
lola: LAUNCH task # 15 (type FNDP) for 6 Sudoku-PT-AN11-UpperBounds-07
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 16 (type EQUN) for 6 Sudoku-PT-AN11-UpperBounds-07
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: Structural Bound: 121
sara: try reading problem file /home/mcc/execution/378/UpperBounds-16.sara.
sara: place or transition ordering is non-deterministic

lola: REPORT NUM
lola: FINISHED task # 16 (type EQUN) for Sudoku-PT-AN11-UpperBounds-07
lola: time used : 4.000000
lola: CANCELED task # 15 (type FNDP) for Sudoku-PT-AN11-UpperBounds-07 (obsolete)
lola: CANCELED task # 17 (type EXCL) for Sudoku-PT-AN11-UpperBounds-07 (obsolete)
lola: LAUNCH task # 14 (type EXCL) for 0 Sudoku-PT-AN11-UpperBounds-00
lola: time limit : 3590 sec
lola: memory limit: 32 pages
lola: LAUNCH task # 13 (type EQUN) for 0 Sudoku-PT-AN11-UpperBounds-00
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: Structural Bound: 121
sara: try reading problem file /home/mcc/execution/378/UpperBounds-13.sara.
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Sudoku-PT-AN11-UpperBounds-05: BOUND 121 state equation
Sudoku-PT-AN11-UpperBounds-07: BOUND 121 state equation

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-PT-AN11-UpperBounds-00: BOUND 0 0 3 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
12 BOUND FNDP 7/3597 0/5 Sudoku-PT-AN11-UpperBounds-00 179932 t fired, 1658 attempts, .
13 BOUND STEQ 0/3590 0/5 Sudoku-PT-AN11-UpperBounds-00 --
14 BOUND EXCL 0/3590 1/32 Sudoku-PT-AN11-UpperBounds-00 6792 m, 1358 m/sec, 29863 t fired, result in [107,121] .

Time elapsed: 10 secs. Pages in use: 2
# running tasks: 3 of 4 Visible: 3
sara: place or transition ordering is non-deterministic

lola: REPORT NUM
lola: FINISHED task # 13 (type EQUN) for Sudoku-PT-AN11-UpperBounds-00
lola: time used : 3.000000
lola: CANCELED task # 12 (type FNDP) for Sudoku-PT-AN11-UpperBounds-00 (obsolete)
lola: CANCELED task # 14 (type EXCL) for Sudoku-PT-AN11-UpperBounds-00 (obsolete)
lola: Portfolio finished: no open formulas

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Sudoku-PT-AN11-UpperBounds-00: BOUND 121 state equation
Sudoku-PT-AN11-UpperBounds-05: BOUND 121 state equation
Sudoku-PT-AN11-UpperBounds-07: BOUND 121 state equation


Time elapsed: 13 secs. Pages in use: 2

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="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 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 r487-tall-167912702800245"
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 '' 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 ;