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

About the Execution of LoLa+red for FlexibleBarrier-PT-08b

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
389.796 21440.00 41509.00 360.40 TFTFTTFTTTFTTFTT 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-167838853200487.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 FlexibleBarrier-PT-08b, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r167-tall-167838853200487
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 676K
-rw-r--r-- 1 mcc users 6.5K Feb 25 12:29 CTLCardinality.txt
-rw-r--r-- 1 mcc users 68K Feb 25 12:29 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.9K Feb 25 12:28 CTLFireability.txt
-rw-r--r-- 1 mcc users 41K Feb 25 12:28 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.9K Feb 25 16:07 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Feb 25 16:07 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 16:07 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:07 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 25 12:29 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 127K Feb 25 12:29 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.5K Feb 25 12:29 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 61K Feb 25 12:29 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:07 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:07 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 241K 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 FlexibleBarrier-PT-08b-ReachabilityFireability-00
FORMULA_NAME FlexibleBarrier-PT-08b-ReachabilityFireability-01
FORMULA_NAME FlexibleBarrier-PT-08b-ReachabilityFireability-02
FORMULA_NAME FlexibleBarrier-PT-08b-ReachabilityFireability-03
FORMULA_NAME FlexibleBarrier-PT-08b-ReachabilityFireability-04
FORMULA_NAME FlexibleBarrier-PT-08b-ReachabilityFireability-05
FORMULA_NAME FlexibleBarrier-PT-08b-ReachabilityFireability-06
FORMULA_NAME FlexibleBarrier-PT-08b-ReachabilityFireability-07
FORMULA_NAME FlexibleBarrier-PT-08b-ReachabilityFireability-08
FORMULA_NAME FlexibleBarrier-PT-08b-ReachabilityFireability-09
FORMULA_NAME FlexibleBarrier-PT-08b-ReachabilityFireability-10
FORMULA_NAME FlexibleBarrier-PT-08b-ReachabilityFireability-11
FORMULA_NAME FlexibleBarrier-PT-08b-ReachabilityFireability-12
FORMULA_NAME FlexibleBarrier-PT-08b-ReachabilityFireability-13
FORMULA_NAME FlexibleBarrier-PT-08b-ReachabilityFireability-14
FORMULA_NAME FlexibleBarrier-PT-08b-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1678485858062

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=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FlexibleBarrier-PT-08b
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-10 22:04:19] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-03-10 22:04:19] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-10 22:04:19] [INFO ] Load time of PNML (sax parser for PT used): 77 ms
[2023-03-10 22:04:19] [INFO ] Transformed 920 places.
[2023-03-10 22:04:19] [INFO ] Transformed 1057 transitions.
[2023-03-10 22:04:19] [INFO ] Found NUPN structural information;
[2023-03-10 22:04:19] [INFO ] Parsed PT model containing 920 places and 1057 transitions and 2627 arcs in 148 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 157 resets, run finished after 707 ms. (steps per millisecond=14 ) properties (out of 16) seen :7
FORMULA FlexibleBarrier-PT-08b-ReachabilityFireability-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-08b-ReachabilityFireability-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-08b-ReachabilityFireability-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-08b-ReachabilityFireability-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-08b-ReachabilityFireability-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-08b-ReachabilityFireability-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-08b-ReachabilityFireability-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 9) seen :1
FORMULA FlexibleBarrier-PT-08b-ReachabilityFireability-00 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10000 steps, including 19 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 21 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 8) seen :1
FORMULA FlexibleBarrier-PT-08b-ReachabilityFireability-04 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 19 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 10 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
// Phase 1: matrix 1057 rows 920 cols
[2023-03-10 22:04:20] [INFO ] Computed 10 place invariants in 21 ms
[2023-03-10 22:04:21] [INFO ] [Real]Absence check using 10 positive place invariants in 17 ms returned sat
[2023-03-10 22:04:21] [INFO ] After 502ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-10 22:04:21] [INFO ] [Nat]Absence check using 10 positive place invariants in 9 ms returned sat
[2023-03-10 22:04:22] [INFO ] After 904ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :6
[2023-03-10 22:04:23] [INFO ] Deduced a trap composed of 279 places in 245 ms of which 12 ms to minimize.
[2023-03-10 22:04:23] [INFO ] Deduced a trap composed of 343 places in 222 ms of which 1 ms to minimize.
[2023-03-10 22:04:23] [INFO ] Deduced a trap composed of 315 places in 184 ms of which 1 ms to minimize.
[2023-03-10 22:04:23] [INFO ] Deduced a trap composed of 289 places in 174 ms of which 5 ms to minimize.
[2023-03-10 22:04:24] [INFO ] Deduced a trap composed of 283 places in 202 ms of which 1 ms to minimize.
[2023-03-10 22:04:24] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1263 ms
[2023-03-10 22:04:24] [INFO ] Deduced a trap composed of 234 places in 215 ms of which 0 ms to minimize.
[2023-03-10 22:04:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 302 ms
[2023-03-10 22:04:24] [INFO ] Deduced a trap composed of 302 places in 197 ms of which 0 ms to minimize.
[2023-03-10 22:04:25] [INFO ] Deduced a trap composed of 312 places in 200 ms of which 1 ms to minimize.
[2023-03-10 22:04:25] [INFO ] Deduced a trap composed of 277 places in 179 ms of which 0 ms to minimize.
[2023-03-10 22:04:25] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 760 ms
[2023-03-10 22:04:25] [INFO ] Deduced a trap composed of 82 places in 89 ms of which 0 ms to minimize.
[2023-03-10 22:04:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 172 ms
[2023-03-10 22:04:26] [INFO ] Deduced a trap composed of 314 places in 217 ms of which 0 ms to minimize.
[2023-03-10 22:04:26] [INFO ] Deduced a trap composed of 309 places in 192 ms of which 1 ms to minimize.
[2023-03-10 22:04:26] [INFO ] Deduced a trap composed of 309 places in 169 ms of which 1 ms to minimize.
[2023-03-10 22:04:26] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 796 ms
[2023-03-10 22:04:26] [INFO ] After 4776ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :6
Attempting to minimize the solution found.
Minimization took 618 ms.
[2023-03-10 22:04:27] [INFO ] After 5791ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :6
FORMULA FlexibleBarrier-PT-08b-ReachabilityFireability-13 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 7 Parikh solutions to 6 different solutions.
FORMULA FlexibleBarrier-PT-08b-ReachabilityFireability-05 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 1 properties in 81 ms.
Support contains 120 out of 920 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 920/920 places, 1057/1057 transitions.
Graph (trivial) has 532 edges and 920 vertex of which 6 / 920 are part of one of the 1 SCC in 5 ms
Free SCC test removed 5 places
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions removed 136 transitions
Trivial Post-agglo rules discarded 136 transitions
Performed 136 trivial Post agglomeration. Transition count delta: 136
Iterating post reduction 0 with 136 rules applied. Total rules applied 137 place count 915 transition count 915
Reduce places removed 136 places and 0 transitions.
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Iterating post reduction 1 with 156 rules applied. Total rules applied 293 place count 779 transition count 895
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 2 with 20 rules applied. Total rules applied 313 place count 759 transition count 895
Performed 89 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 89 Pre rules applied. Total rules applied 313 place count 759 transition count 806
Deduced a syphon composed of 89 places in 1 ms
Reduce places removed 89 places and 0 transitions.
Iterating global reduction 3 with 178 rules applied. Total rules applied 491 place count 670 transition count 806
Discarding 259 places :
Symmetric choice reduction at 3 with 259 rule applications. Total rules 750 place count 411 transition count 547
Iterating global reduction 3 with 259 rules applied. Total rules applied 1009 place count 411 transition count 547
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 1009 place count 411 transition count 546
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 1011 place count 410 transition count 546
Discarding 20 places :
Symmetric choice reduction at 3 with 20 rule applications. Total rules 1031 place count 390 transition count 526
Iterating global reduction 3 with 20 rules applied. Total rules applied 1051 place count 390 transition count 526
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 3 with 14 rules applied. Total rules applied 1065 place count 390 transition count 512
Performed 54 Post agglomeration using F-continuation condition.Transition count delta: 54
Deduced a syphon composed of 54 places in 0 ms
Reduce places removed 54 places and 0 transitions.
Iterating global reduction 4 with 108 rules applied. Total rules applied 1173 place count 336 transition count 458
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 1187 place count 329 transition count 458
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 1188 place count 329 transition count 457
Free-agglomeration rule applied 10 times.
Iterating global reduction 4 with 10 rules applied. Total rules applied 1198 place count 329 transition count 447
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 4 with 10 rules applied. Total rules applied 1208 place count 319 transition count 447
Partial Free-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 5 with 4 rules applied. Total rules applied 1212 place count 319 transition count 447
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 1213 place count 318 transition count 446
Applied a total of 1213 rules in 197 ms. Remains 318 /920 variables (removed 602) and now considering 446/1057 (removed 611) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 197 ms. Remains : 318/920 places, 446/1057 transitions.
Incomplete random walk after 10000 steps, including 319 resets, run finished after 226 ms. (steps per millisecond=44 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 31 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 31 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 5) seen :1
FORMULA FlexibleBarrier-PT-08b-ReachabilityFireability-10 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 33 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2023-03-10 22:04:27] [INFO ] Flow matrix only has 441 transitions (discarded 5 similar events)
// Phase 1: matrix 441 rows 318 cols
[2023-03-10 22:04:27] [INFO ] Computed 10 place invariants in 3 ms
[2023-03-10 22:04:28] [INFO ] After 72ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-10 22:04:28] [INFO ] [Nat]Absence check using 10 positive place invariants in 3 ms returned sat
[2023-03-10 22:04:28] [INFO ] After 296ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-10 22:04:28] [INFO ] State equation strengthened by 20 read => feed constraints.
[2023-03-10 22:04:28] [INFO ] After 197ms SMT Verify possible using 20 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-10 22:04:28] [INFO ] Deduced a trap composed of 107 places in 84 ms of which 0 ms to minimize.
[2023-03-10 22:04:28] [INFO ] Deduced a trap composed of 99 places in 95 ms of which 1 ms to minimize.
[2023-03-10 22:04:28] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 243 ms
[2023-03-10 22:04:29] [INFO ] After 664ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 201 ms.
[2023-03-10 22:04:29] [INFO ] After 1242ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 30 ms.
Support contains 94 out of 318 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 318/318 places, 446/446 transitions.
Graph (trivial) has 37 edges and 318 vertex of which 2 / 318 are part of one of the 1 SCC in 1 ms
Free SCC test removed 1 places
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 317 transition count 442
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 5 place count 315 transition count 442
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 5 place count 315 transition count 440
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 9 place count 313 transition count 440
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 15 place count 307 transition count 434
Iterating global reduction 2 with 6 rules applied. Total rules applied 21 place count 307 transition count 434
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 22 place count 307 transition count 433
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 23 place count 306 transition count 432
Iterating global reduction 3 with 1 rules applied. Total rules applied 24 place count 306 transition count 432
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 25 place count 306 transition count 431
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 4 with 22 rules applied. Total rules applied 47 place count 295 transition count 420
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 48 place count 294 transition count 419
Iterating global reduction 4 with 1 rules applied. Total rules applied 49 place count 294 transition count 419
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 50 place count 294 transition count 418
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 51 place count 294 transition count 417
Free-agglomeration rule applied 12 times.
Iterating global reduction 5 with 12 rules applied. Total rules applied 63 place count 294 transition count 405
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 5 with 12 rules applied. Total rules applied 75 place count 282 transition count 405
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 6 with 2 rules applied. Total rules applied 77 place count 282 transition count 403
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 78 place count 282 transition count 403
Applied a total of 78 rules in 137 ms. Remains 282 /318 variables (removed 36) and now considering 403/446 (removed 43) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 152 ms. Remains : 282/318 places, 403/446 transitions.
Incomplete random walk after 10000 steps, including 299 resets, run finished after 218 ms. (steps per millisecond=45 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 31 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 29 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 30 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 289894 steps, run timeout after 3001 ms. (steps per millisecond=96 ) properties seen :{}
Probabilistic random walk after 289894 steps, saw 80613 distinct states, run finished after 3017 ms. (steps per millisecond=96 ) properties seen :0
Running SMT prover for 4 properties.
[2023-03-10 22:04:32] [INFO ] Flow matrix only has 397 transitions (discarded 6 similar events)
// Phase 1: matrix 397 rows 282 cols
[2023-03-10 22:04:32] [INFO ] Computed 10 place invariants in 3 ms
[2023-03-10 22:04:33] [INFO ] After 146ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-10 22:04:33] [INFO ] [Nat]Absence check using 10 positive place invariants in 4 ms returned sat
[2023-03-10 22:04:33] [INFO ] After 280ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-10 22:04:33] [INFO ] State equation strengthened by 23 read => feed constraints.
[2023-03-10 22:04:33] [INFO ] After 199ms SMT Verify possible using 23 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-10 22:04:33] [INFO ] Deduced a trap composed of 93 places in 74 ms of which 0 ms to minimize.
[2023-03-10 22:04:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 112 ms
[2023-03-10 22:04:33] [INFO ] Deduced a trap composed of 25 places in 53 ms of which 1 ms to minimize.
[2023-03-10 22:04:33] [INFO ] Deduced a trap composed of 21 places in 56 ms of which 0 ms to minimize.
[2023-03-10 22:04:34] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 177 ms
[2023-03-10 22:04:34] [INFO ] After 707ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 212 ms.
[2023-03-10 22:04:34] [INFO ] After 1317ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 9 ms.
Support contains 94 out of 282 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 282/282 places, 403/403 transitions.
Applied a total of 0 rules in 9 ms. Remains 282 /282 variables (removed 0) and now considering 403/403 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 282/282 places, 403/403 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 282/282 places, 403/403 transitions.
Applied a total of 0 rules in 8 ms. Remains 282 /282 variables (removed 0) and now considering 403/403 (removed 0) transitions.
[2023-03-10 22:04:34] [INFO ] Flow matrix only has 397 transitions (discarded 6 similar events)
[2023-03-10 22:04:34] [INFO ] Invariant cache hit.
[2023-03-10 22:04:34] [INFO ] Implicit Places using invariants in 89 ms returned []
[2023-03-10 22:04:34] [INFO ] Flow matrix only has 397 transitions (discarded 6 similar events)
[2023-03-10 22:04:34] [INFO ] Invariant cache hit.
[2023-03-10 22:04:34] [INFO ] State equation strengthened by 23 read => feed constraints.
[2023-03-10 22:04:34] [INFO ] Implicit Places using invariants and state equation in 223 ms returned []
Implicit Place search using SMT with State Equation took 314 ms to find 0 implicit places.
[2023-03-10 22:04:34] [INFO ] Redundant transitions in 29 ms returned []
[2023-03-10 22:04:34] [INFO ] Flow matrix only has 397 transitions (discarded 6 similar events)
[2023-03-10 22:04:34] [INFO ] Invariant cache hit.
[2023-03-10 22:04:34] [INFO ] Dead Transitions using invariants and state equation in 161 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 523 ms. Remains : 282/282 places, 403/403 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 282 transition count 396
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 9 place count 281 transition count 395
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 15 place count 275 transition count 389
Iterating global reduction 2 with 6 rules applied. Total rules applied 21 place count 275 transition count 389
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 22 place count 275 transition count 388
Applied a total of 22 rules in 15 ms. Remains 275 /282 variables (removed 7) and now considering 388/403 (removed 15) transitions.
Running SMT prover for 4 properties.
// Phase 1: matrix 388 rows 275 cols
[2023-03-10 22:04:34] [INFO ] Computed 10 place invariants in 3 ms
[2023-03-10 22:04:34] [INFO ] After 60ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-10 22:04:35] [INFO ] [Nat]Absence check using 10 positive place invariants in 7 ms returned sat
[2023-03-10 22:04:35] [INFO ] After 284ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-10 22:04:35] [INFO ] Deduced a trap composed of 90 places in 73 ms of which 1 ms to minimize.
[2023-03-10 22:04:35] [INFO ] Deduced a trap composed of 91 places in 71 ms of which 1 ms to minimize.
[2023-03-10 22:04:35] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 182 ms
[2023-03-10 22:04:35] [INFO ] Deduced a trap composed of 89 places in 81 ms of which 1 ms to minimize.
[2023-03-10 22:04:35] [INFO ] Deduced a trap composed of 90 places in 73 ms of which 0 ms to minimize.
[2023-03-10 22:04:35] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 215 ms
[2023-03-10 22:04:36] [INFO ] Deduced a trap composed of 89 places in 84 ms of which 0 ms to minimize.
[2023-03-10 22:04:36] [INFO ] Deduced a trap composed of 87 places in 71 ms of which 1 ms to minimize.
[2023-03-10 22:04:36] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 210 ms
[2023-03-10 22:04:36] [INFO ] After 1079ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 184 ms.
[2023-03-10 22:04:36] [INFO ] After 1346ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
[2023-03-10 22:04:36] [INFO ] Export to MCC of 4 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 5 ms.
[2023-03-10 22:04:36] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 282 places, 403 transitions and 1288 arcs took 3 ms.
[2023-03-10 22:04:36] [INFO ] Flatten gal took : 55 ms
Total runtime 17007 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT FlexibleBarrier-PT-08b
BK_EXAMINATION: ReachabilityFireability
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/374
ReachabilityFireability

FORMULA FlexibleBarrier-PT-08b-ReachabilityFireability-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA FlexibleBarrier-PT-08b-ReachabilityFireability-09 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA FlexibleBarrier-PT-08b-ReachabilityFireability-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA FlexibleBarrier-PT-08b-ReachabilityFireability-06 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

BK_STOP 1678485879502

--------------------
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 ReachabilityFireability -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/374/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/374/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/374/ReachabilityFireability.xml
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
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 # 16 (type EXCL) for 6 FlexibleBarrier-PT-08b-ReachabilityFireability-14
lola: time limit : 900 sec
lola: memory limit: 32 pages
lola: LAUNCH task # 12 (type FNDP) for 6 FlexibleBarrier-PT-08b-ReachabilityFireability-14
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 13 (type EQUN) for 6 FlexibleBarrier-PT-08b-ReachabilityFireability-14
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 15 (type SRCH) for 6 FlexibleBarrier-PT-08b-ReachabilityFireability-14
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
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
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: rewrite Frontend/Parser/formula_rewrite.k:711
lola: FINISHED task # 15 (type SRCH) for FlexibleBarrier-PT-08b-ReachabilityFireability-14
lola: result : true
lola: markings : 4
lola: fired transitions : 3
lola: time used : 0.000000
lola: memory pages used : 1
lola: CANCELED task # 12 (type FNDP) for FlexibleBarrier-PT-08b-ReachabilityFireability-14 (obsolete)
lola: CANCELED task # 13 (type EQUN) for FlexibleBarrier-PT-08b-ReachabilityFireability-14 (obsolete)
lola: CANCELED task # 16 (type EXCL) for FlexibleBarrier-PT-08b-ReachabilityFireability-14 (obsolete)
lola: LAUNCH task # 23 (type EXCL) for 0 FlexibleBarrier-PT-08b-ReachabilityFireability-06
lola: time limit : 1200 sec
lola: memory limit: 32 pages
lola: LAUNCH task # 25 (type FNDP) for 3 FlexibleBarrier-PT-08b-ReachabilityFireability-09
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 26 (type EQUN) for 3 FlexibleBarrier-PT-08b-ReachabilityFireability-09
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 28 (type SRCH) for 3 FlexibleBarrier-PT-08b-ReachabilityFireability-09
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
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: rewrite Frontend/Parser/formula_rewrite.k:711
lola: FINISHED task # 12 (type FNDP) for FlexibleBarrier-PT-08b-ReachabilityFireability-14
lola: result : true
lola: fired transitions : 2
lola: tried executions : 1
lola: time used : 0.000000
lola: memory pages used : 0
lola: FINISHED task # 28 (type SRCH) for FlexibleBarrier-PT-08b-ReachabilityFireability-09
lola: result : true
lola: markings : 11
lola: fired transitions : 10
lola: time used : 0.000000
lola: memory pages used : 1
lola: CANCELED task # 25 (type FNDP) for FlexibleBarrier-PT-08b-ReachabilityFireability-09 (obsolete)
lola: CANCELED task # 26 (type EQUN) for FlexibleBarrier-PT-08b-ReachabilityFireability-09 (obsolete)
lola: LAUNCH task # 31 (type FNDP) for 9 FlexibleBarrier-PT-08b-ReachabilityFireability-15
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 32 (type EQUN) for 9 FlexibleBarrier-PT-08b-ReachabilityFireability-15
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: LAUNCH task # 34 (type SRCH) for 9 FlexibleBarrier-PT-08b-ReachabilityFireability-15
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: FINISHED task # 25 (type FNDP) for FlexibleBarrier-PT-08b-ReachabilityFireability-09
lola: result : true
lola: fired transitions : 9
lola: tried executions : 1
lola: time used : 0.000000
lola: memory pages used : 0
sara: try reading problem file /home/mcc/execution/374/ReachabilityFireability-13.sara.
sara: place or transition ordering is non-deterministic

lola: FINISHED task # 13 (type EQUN) for FlexibleBarrier-PT-08b-ReachabilityFireability-14
lola: result : true
sara: try reading problem file /home/mcc/execution/374/ReachabilityFireability-26.sara.
sara: place or transition ordering is non-deterministic
sara: try reading problem file /home/mcc/execution/374/ReachabilityFireability-32.sara.
sara: place or transition ordering is non-deterministic
lola: FINISHED task # 31 (type FNDP) for FlexibleBarrier-PT-08b-ReachabilityFireability-15
lola: result : true
lola: fired transitions : 80219
lola: tried executions : 3000
lola: time used : 1.000000
lola: memory pages used : 0
lola: CANCELED task # 32 (type EQUN) for FlexibleBarrier-PT-08b-ReachabilityFireability-15 (obsolete)
lola: CANCELED task # 34 (type SRCH) for FlexibleBarrier-PT-08b-ReachabilityFireability-15 (obsolete)
lola: LAUNCH task # 19 (type FNDP) for 0 FlexibleBarrier-PT-08b-ReachabilityFireability-06
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 20 (type EQUN) for 0 FlexibleBarrier-PT-08b-ReachabilityFireability-06
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 22 (type SRCH) for 0 FlexibleBarrier-PT-08b-ReachabilityFireability-06
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: FINISHED task # 32 (type EQUN) for FlexibleBarrier-PT-08b-ReachabilityFireability-15
lola: result : unknown
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
sara: try reading problem file /home/mcc/execution/374/ReachabilityFireability-20.sara.
sara: place or transition ordering is non-deterministic

lola: FINISHED task # 20 (type EQUN) for FlexibleBarrier-PT-08b-ReachabilityFireability-06
lola: result : true
lola: CANCELED task # 19 (type FNDP) for FlexibleBarrier-PT-08b-ReachabilityFireability-06 (obsolete)
lola: CANCELED task # 22 (type SRCH) for FlexibleBarrier-PT-08b-ReachabilityFireability-06 (obsolete)
lola: CANCELED task # 23 (type EXCL) for FlexibleBarrier-PT-08b-ReachabilityFireability-06 (obsolete)
lola: Portfolio finished: no open formulas

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
FlexibleBarrier-PT-08b-ReachabilityFireability-06: AG false state equation
FlexibleBarrier-PT-08b-ReachabilityFireability-09: EF true tandem / insertion
FlexibleBarrier-PT-08b-ReachabilityFireability-14: EF true tandem / insertion
FlexibleBarrier-PT-08b-ReachabilityFireability-15: EF true findpath


Time elapsed: 2 secs. Pages in use: 3

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="FlexibleBarrier-PT-08b"
export BK_EXAMINATION="ReachabilityFireability"
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 FlexibleBarrier-PT-08b, examination is ReachabilityFireability"
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-167838853200487"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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