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

About the Execution of LoLa+red for FunctionPointer-PT-b004

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
343.943 15489.00 43249.00 275.80 TFFTTFTFTFTFTTFT 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.r167-tall-167838853400670.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 FunctionPointer-PT-b004, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r167-tall-167838853400670
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 876K
-rw-r--r-- 1 mcc users 5.8K Feb 25 11:55 CTLCardinality.txt
-rw-r--r-- 1 mcc users 58K Feb 25 11:55 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.2K Feb 25 11:55 CTLFireability.txt
-rw-r--r-- 1 mcc users 72K Feb 25 11:55 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:08 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 16:08 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 16:08 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 16:08 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Feb 25 11:57 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 137K Feb 25 11:57 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Feb 25 11:56 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 96K Feb 25 11:56 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:08 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:08 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 391K Mar 5 18:22 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME FunctionPointer-PT-b004-ReachabilityCardinality-00
FORMULA_NAME FunctionPointer-PT-b004-ReachabilityCardinality-01
FORMULA_NAME FunctionPointer-PT-b004-ReachabilityCardinality-02
FORMULA_NAME FunctionPointer-PT-b004-ReachabilityCardinality-03
FORMULA_NAME FunctionPointer-PT-b004-ReachabilityCardinality-04
FORMULA_NAME FunctionPointer-PT-b004-ReachabilityCardinality-05
FORMULA_NAME FunctionPointer-PT-b004-ReachabilityCardinality-06
FORMULA_NAME FunctionPointer-PT-b004-ReachabilityCardinality-07
FORMULA_NAME FunctionPointer-PT-b004-ReachabilityCardinality-08
FORMULA_NAME FunctionPointer-PT-b004-ReachabilityCardinality-09
FORMULA_NAME FunctionPointer-PT-b004-ReachabilityCardinality-10
FORMULA_NAME FunctionPointer-PT-b004-ReachabilityCardinality-11
FORMULA_NAME FunctionPointer-PT-b004-ReachabilityCardinality-12
FORMULA_NAME FunctionPointer-PT-b004-ReachabilityCardinality-13
FORMULA_NAME FunctionPointer-PT-b004-ReachabilityCardinality-14
FORMULA_NAME FunctionPointer-PT-b004-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1678501619047

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=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FunctionPointer-PT-b004
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-11 02:27:00] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-11 02:27:00] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-11 02:27:00] [INFO ] Load time of PNML (sax parser for PT used): 90 ms
[2023-03-11 02:27:00] [INFO ] Transformed 306 places.
[2023-03-11 02:27:00] [INFO ] Transformed 840 transitions.
[2023-03-11 02:27:00] [INFO ] Parsed PT model containing 306 places and 840 transitions and 3392 arcs in 159 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 19 ms.
Working with output stream class java.io.PrintStream
Deduced a syphon composed of 84 places in 5 ms
Reduce places removed 84 places and 192 transitions.
FORMULA FunctionPointer-PT-b004-ReachabilityCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-b004-ReachabilityCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-b004-ReachabilityCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-b004-ReachabilityCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10004 steps, including 16 resets, run finished after 394 ms. (steps per millisecond=25 ) properties (out of 12) seen :4
FORMULA FunctionPointer-PT-b004-ReachabilityCardinality-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FunctionPointer-PT-b004-ReachabilityCardinality-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FunctionPointer-PT-b004-ReachabilityCardinality-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FunctionPointer-PT-b004-ReachabilityCardinality-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 8) seen :1
FORMULA FunctionPointer-PT-b004-ReachabilityCardinality-05 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 7) seen :1
FORMULA FunctionPointer-PT-b004-ReachabilityCardinality-07 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
[2023-03-11 02:27:01] [INFO ] Flow matrix only has 414 transitions (discarded 234 similar events)
// Phase 1: matrix 414 rows 222 cols
[2023-03-11 02:27:01] [INFO ] Computed 4 place invariants in 25 ms
[2023-03-11 02:27:01] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-11 02:27:01] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-11 02:27:01] [INFO ] After 221ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-11 02:27:01] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-11 02:27:01] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-11 02:27:02] [INFO ] After 147ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :4
[2023-03-11 02:27:02] [INFO ] State equation strengthened by 65 read => feed constraints.
[2023-03-11 02:27:02] [INFO ] After 81ms SMT Verify possible using 65 Read/Feed constraints in natural domain returned unsat :2 sat :4
[2023-03-11 02:27:02] [INFO ] After 193ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :4
Attempting to minimize the solution found.
Minimization took 80 ms.
[2023-03-11 02:27:02] [INFO ] After 532ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :4
FORMULA FunctionPointer-PT-b004-ReachabilityCardinality-13 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA FunctionPointer-PT-b004-ReachabilityCardinality-02 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 6 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 12 ms.
Support contains 18 out of 222 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 222/222 places, 648/648 transitions.
Graph (complete) has 932 edges and 222 vertex of which 214 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.2 ms
Discarding 8 places :
Also discarding 0 output transitions
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 27 place count 188 transition count 504
Iterating global reduction 0 with 26 rules applied. Total rules applied 53 place count 188 transition count 504
Ensure Unique test removed 38 transitions
Reduce isomorphic transitions removed 38 transitions.
Iterating post reduction 0 with 38 rules applied. Total rules applied 91 place count 188 transition count 466
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 104 place count 175 transition count 440
Iterating global reduction 1 with 13 rules applied. Total rules applied 117 place count 175 transition count 440
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 125 place count 175 transition count 432
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 130 place count 170 transition count 422
Iterating global reduction 2 with 5 rules applied. Total rules applied 135 place count 170 transition count 422
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 139 place count 166 transition count 406
Iterating global reduction 2 with 4 rules applied. Total rules applied 143 place count 166 transition count 406
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 145 place count 164 transition count 402
Iterating global reduction 2 with 2 rules applied. Total rules applied 147 place count 164 transition count 402
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 148 place count 163 transition count 398
Iterating global reduction 2 with 1 rules applied. Total rules applied 149 place count 163 transition count 398
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 150 place count 162 transition count 394
Iterating global reduction 2 with 1 rules applied. Total rules applied 151 place count 162 transition count 394
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 152 place count 161 transition count 392
Iterating global reduction 2 with 1 rules applied. Total rules applied 153 place count 161 transition count 392
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 154 place count 160 transition count 390
Iterating global reduction 2 with 1 rules applied. Total rules applied 155 place count 160 transition count 390
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 156 place count 159 transition count 388
Iterating global reduction 2 with 1 rules applied. Total rules applied 157 place count 159 transition count 388
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 158 place count 158 transition count 386
Iterating global reduction 2 with 1 rules applied. Total rules applied 159 place count 158 transition count 386
Drop transitions removed 14 transitions
Redundant transition composition rules discarded 14 transitions
Iterating global reduction 2 with 14 rules applied. Total rules applied 173 place count 158 transition count 372
Applied a total of 173 rules in 131 ms. Remains 158 /222 variables (removed 64) and now considering 372/648 (removed 276) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 131 ms. Remains : 158/222 places, 372/648 transitions.
Incomplete random walk after 10000 steps, including 26 resets, run finished after 131 ms. (steps per millisecond=76 ) properties (out of 4) seen :2
FORMULA FunctionPointer-PT-b004-ReachabilityCardinality-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FunctionPointer-PT-b004-ReachabilityCardinality-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-11 02:27:02] [INFO ] Flow matrix only has 259 transitions (discarded 113 similar events)
// Phase 1: matrix 259 rows 158 cols
[2023-03-11 02:27:02] [INFO ] Computed 3 place invariants in 7 ms
[2023-03-11 02:27:02] [INFO ] After 41ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-11 02:27:02] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-11 02:27:02] [INFO ] After 81ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-11 02:27:02] [INFO ] State equation strengthened by 58 read => feed constraints.
[2023-03-11 02:27:02] [INFO ] After 26ms SMT Verify possible using 58 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-11 02:27:02] [INFO ] After 60ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 30 ms.
[2023-03-11 02:27:02] [INFO ] After 224ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 7 ms.
Support contains 14 out of 158 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 158/158 places, 372/372 transitions.
Graph (complete) has 628 edges and 158 vertex of which 142 are kept as prefixes of interest. Removing 16 places using SCC suffix rule.1 ms
Discarding 16 places :
Also discarding 0 output transitions
Drop transitions removed 32 transitions
Reduce isomorphic transitions removed 32 transitions.
Iterating post reduction 0 with 32 rules applied. Total rules applied 33 place count 142 transition count 340
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 35 place count 140 transition count 334
Iterating global reduction 1 with 2 rules applied. Total rules applied 37 place count 140 transition count 334
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 39 place count 138 transition count 328
Iterating global reduction 1 with 2 rules applied. Total rules applied 41 place count 138 transition count 328
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 43 place count 136 transition count 322
Iterating global reduction 1 with 2 rules applied. Total rules applied 45 place count 136 transition count 322
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 47 place count 134 transition count 318
Iterating global reduction 1 with 2 rules applied. Total rules applied 49 place count 134 transition count 318
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 51 place count 132 transition count 314
Iterating global reduction 1 with 2 rules applied. Total rules applied 53 place count 132 transition count 314
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 55 place count 130 transition count 310
Iterating global reduction 1 with 2 rules applied. Total rules applied 57 place count 130 transition count 310
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 59 place count 128 transition count 306
Iterating global reduction 1 with 2 rules applied. Total rules applied 61 place count 128 transition count 306
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 63 place count 126 transition count 302
Iterating global reduction 1 with 2 rules applied. Total rules applied 65 place count 126 transition count 302
Applied a total of 65 rules in 36 ms. Remains 126 /158 variables (removed 32) and now considering 302/372 (removed 70) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36 ms. Remains : 126/158 places, 302/372 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 507407 steps, run timeout after 3001 ms. (steps per millisecond=169 ) properties seen :{}
Probabilistic random walk after 507407 steps, saw 288149 distinct states, run finished after 3002 ms. (steps per millisecond=169 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-11 02:27:06] [INFO ] Flow matrix only has 203 transitions (discarded 99 similar events)
// Phase 1: matrix 203 rows 126 cols
[2023-03-11 02:27:06] [INFO ] Computed 2 place invariants in 3 ms
[2023-03-11 02:27:06] [INFO ] After 49ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-11 02:27:06] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-11 02:27:06] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 9 ms returned sat
[2023-03-11 02:27:06] [INFO ] After 54ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-11 02:27:06] [INFO ] State equation strengthened by 41 read => feed constraints.
[2023-03-11 02:27:06] [INFO ] After 28ms SMT Verify possible using 41 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-11 02:27:06] [INFO ] After 68ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 16 ms.
[2023-03-11 02:27:06] [INFO ] After 212ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 9 ms.
Support contains 14 out of 126 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 126/126 places, 302/302 transitions.
Applied a total of 0 rules in 23 ms. Remains 126 /126 variables (removed 0) and now considering 302/302 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23 ms. Remains : 126/126 places, 302/302 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 126/126 places, 302/302 transitions.
Applied a total of 0 rules in 8 ms. Remains 126 /126 variables (removed 0) and now considering 302/302 (removed 0) transitions.
[2023-03-11 02:27:06] [INFO ] Flow matrix only has 203 transitions (discarded 99 similar events)
[2023-03-11 02:27:06] [INFO ] Invariant cache hit.
[2023-03-11 02:27:06] [INFO ] Implicit Places using invariants in 116 ms returned []
[2023-03-11 02:27:06] [INFO ] Flow matrix only has 203 transitions (discarded 99 similar events)
[2023-03-11 02:27:06] [INFO ] Invariant cache hit.
[2023-03-11 02:27:06] [INFO ] State equation strengthened by 41 read => feed constraints.
[2023-03-11 02:27:06] [INFO ] Implicit Places using invariants and state equation in 222 ms returned []
Implicit Place search using SMT with State Equation took 345 ms to find 0 implicit places.
[2023-03-11 02:27:06] [INFO ] Redundant transitions in 15 ms returned []
[2023-03-11 02:27:06] [INFO ] Flow matrix only has 203 transitions (discarded 99 similar events)
[2023-03-11 02:27:06] [INFO ] Invariant cache hit.
[2023-03-11 02:27:06] [INFO ] Dead Transitions using invariants and state equation in 110 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 499 ms. Remains : 126/126 places, 302/302 transitions.
Ensure Unique test removed 99 transitions
Reduce isomorphic transitions removed 99 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 107 rules applied. Total rules applied 107 place count 126 transition count 195
Reduce places removed 8 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 10 rules applied. Total rules applied 117 place count 118 transition count 193
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 119 place count 116 transition count 193
Performed 26 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 26 Pre rules applied. Total rules applied 119 place count 116 transition count 167
Deduced a syphon composed of 26 places in 0 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 3 with 52 rules applied. Total rules applied 171 place count 90 transition count 167
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Deduced a syphon composed of 19 places in 1 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 3 with 38 rules applied. Total rules applied 209 place count 71 transition count 148
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 216 place count 64 transition count 134
Iterating global reduction 3 with 7 rules applied. Total rules applied 223 place count 64 transition count 134
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 228 place count 59 transition count 124
Iterating global reduction 3 with 5 rules applied. Total rules applied 233 place count 59 transition count 124
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 237 place count 55 transition count 116
Iterating global reduction 3 with 4 rules applied. Total rules applied 241 place count 55 transition count 116
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 245 place count 55 transition count 112
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 255 place count 50 transition count 115
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 4 with 3 rules applied. Total rules applied 258 place count 50 transition count 112
Free-agglomeration rule applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 259 place count 50 transition count 111
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 260 place count 49 transition count 111
Applied a total of 260 rules in 31 ms. Remains 49 /126 variables (removed 77) and now considering 111/302 (removed 191) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 111 rows 49 cols
[2023-03-11 02:27:06] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-11 02:27:06] [INFO ] After 23ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-11 02:27:06] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-11 02:27:06] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-11 02:27:06] [INFO ] After 23ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-11 02:27:06] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-11 02:27:06] [INFO ] After 8ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-11 02:27:06] [INFO ] After 22ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 12 ms.
[2023-03-11 02:27:06] [INFO ] After 84ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
[2023-03-11 02:27:06] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 3 ms.
[2023-03-11 02:27:06] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 126 places, 302 transitions and 1226 arcs took 2 ms.
[2023-03-11 02:27:07] [INFO ] Flatten gal took : 47 ms
Total runtime 6641 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT FunctionPointer-PT-b004
BK_EXAMINATION: ReachabilityCardinality
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/375
ReachabilityCardinality

FORMULA FunctionPointer-PT-b004-ReachabilityCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA FunctionPointer-PT-b004-ReachabilityCardinality-04 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

BK_STOP 1678501634536

--------------------
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 ReachabilityCardinality -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/375/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/375/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/375/ReachabilityCardinality.xml
lola: Created skeleton in 0.000000 secs.
lola: Rule S: 0 transitions removed,0 places removed
lola: Created skeleton in 0.000000 secs.
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: LAUNCH task # 10 (type EXCL) for 0 FunctionPointer-PT-b004-ReachabilityCardinality-04
lola: time limit : 1800 sec
lola: memory limit: 32 pages
lola: LAUNCH task # 6 (type FNDP) for 0 FunctionPointer-PT-b004-ReachabilityCardinality-04
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 7 (type EQUN) for 0 FunctionPointer-PT-b004-ReachabilityCardinality-04
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: LAUNCH task # 9 (type SRCH) for 0 FunctionPointer-PT-b004-ReachabilityCardinality-04
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
sara: try reading problem file /home/mcc/execution/375/ReachabilityCardinality-7.sara.
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
sara: place or transition ordering is non-deterministic
sara: warning, failure of lp_solve (at job 291)
terminate called after throwing an instance of 'std::length_error'
what(): vector::reserve
lola: FINISHED task # 7 (type EQUN) for FunctionPointer-PT-b004-ReachabilityCardinality-04
lola: result : unknown
lola: LAUNCH task # 13 (type FNDP) for 3 FunctionPointer-PT-b004-ReachabilityCardinality-14
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: FINISHED task # 13 (type FNDP) for FunctionPointer-PT-b004-ReachabilityCardinality-14
lola: result : true
lola: fired transitions : 19
lola: tried executions : 1
lola: time used : 0.000000
lola: memory pages used : 0
lola: LAUNCH task # 11 (type SRCH) for 0 FunctionPointer-PT-b004-ReachabilityCardinality-04
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
FunctionPointer-PT-b004-ReachabilityCardinality-14: AG false findpath

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
FunctionPointer-PT-b004-ReachabilityCardinality-04: EF 0 0 4 0 2 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
6 EF FNDP 5/3600 0/5 FunctionPointer-PT-b004-ReachabilityCardinality-04 785393 t fired, 1 attempts, .
9 EF SRCH 5/3600 4/5 FunctionPointer-PT-b004-ReachabilityCardinality-04 691841 m, 138368 m/sec, 926591 t fired, .
10 EF EXCL 5/3600 6/32 FunctionPointer-PT-b004-ReachabilityCardinality-04 1016590 m, 203318 m/sec, 1297022 t fired, .
11 EF SRCH 2/3597 2/5 FunctionPointer-PT-b004-ReachabilityCardinality-04 313685 m, 62737 m/sec, 425938 t fired, .

Time elapsed: 5 secs. Pages in use: 12
# running tasks: 4 of 4 Visible: 2
lola: FINISHED task # 6 (type FNDP) for FunctionPointer-PT-b004-ReachabilityCardinality-04
lola: result : true
lola: fired transitions : 1000311
lola: tried executions : 2
lola: time used : 6.000000
lola: memory pages used : 0
lola: CANCELED task # 9 (type SRCH) for FunctionPointer-PT-b004-ReachabilityCardinality-04 (obsolete)
lola: CANCELED task # 10 (type EXCL) for FunctionPointer-PT-b004-ReachabilityCardinality-04 (obsolete)
lola: CANCELED task # 11 (type SRCH) for FunctionPointer-PT-b004-ReachabilityCardinality-04 (obsolete)
lola: Portfolio finished: no open formulas

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
FunctionPointer-PT-b004-ReachabilityCardinality-04: EF true findpath
FunctionPointer-PT-b004-ReachabilityCardinality-14: AG false findpath


Time elapsed: 6 secs. Pages in use: 15

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="FunctionPointer-PT-b004"
export BK_EXAMINATION="ReachabilityCardinality"
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 FunctionPointer-PT-b004, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r167-tall-167838853400670"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/FunctionPointer-PT-b004.tgz
mv FunctionPointer-PT-b004 execution
cd execution
if [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "UpperBounds" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] || [ "ReachabilityCardinality" = "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 [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "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 "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.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 '' ReachabilityCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityCardinality"
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 ;