Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r197-tall-171640624800060.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool gold2023
Input is FlexibleBarrier-PT-14b, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r197-tall-171640624800060
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.1M
-rw-r--r-- 1 mcc users 7.5K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 80K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.6K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 64K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K May 19 07:09 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 19 15:53 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 19 07:18 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 18:21 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.4K Apr 13 08:01 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 68K Apr 13 08:01 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.1K Apr 13 08:01 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 45K Apr 13 08:01 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:45 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:45 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 726K May 18 16:42 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-14b-ReachabilityFireability-2024-00
FORMULA_NAME FlexibleBarrier-PT-14b-ReachabilityFireability-2024-01
FORMULA_NAME FlexibleBarrier-PT-14b-ReachabilityFireability-2024-02
FORMULA_NAME FlexibleBarrier-PT-14b-ReachabilityFireability-2024-03
FORMULA_NAME FlexibleBarrier-PT-14b-ReachabilityFireability-2024-04
FORMULA_NAME FlexibleBarrier-PT-14b-ReachabilityFireability-2024-05
FORMULA_NAME FlexibleBarrier-PT-14b-ReachabilityFireability-2024-06
FORMULA_NAME FlexibleBarrier-PT-14b-ReachabilityFireability-2024-07
FORMULA_NAME FlexibleBarrier-PT-14b-ReachabilityFireability-2024-08
FORMULA_NAME FlexibleBarrier-PT-14b-ReachabilityFireability-2024-09
FORMULA_NAME FlexibleBarrier-PT-14b-ReachabilityFireability-2024-10
FORMULA_NAME FlexibleBarrier-PT-14b-ReachabilityFireability-2024-11
FORMULA_NAME FlexibleBarrier-PT-14b-ReachabilityFireability-2024-12
FORMULA_NAME FlexibleBarrier-PT-14b-ReachabilityFireability-2024-13
FORMULA_NAME FlexibleBarrier-PT-14b-ReachabilityFireability-2024-14
FORMULA_NAME FlexibleBarrier-PT-14b-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1716496105884

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=gold2023
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FlexibleBarrier-PT-14b
Applying reductions before tool lola
Invoking reducer
Running Version 202304061127
[2024-05-23 20:28:27] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-05-23 20:28:27] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-23 20:28:27] [INFO ] Load time of PNML (sax parser for PT used): 159 ms
[2024-05-23 20:28:27] [INFO ] Transformed 2678 places.
[2024-05-23 20:28:27] [INFO ] Transformed 3085 transitions.
[2024-05-23 20:28:27] [INFO ] Found NUPN structural information;
[2024-05-23 20:28:27] [INFO ] Parsed PT model containing 2678 places and 3085 transitions and 7733 arcs in 246 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 102 resets, run finished after 429 ms. (steps per millisecond=23 ) properties (out of 16) seen :3
FORMULA FlexibleBarrier-PT-14b-ReachabilityFireability-2024-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-14b-ReachabilityFireability-2024-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-14b-ReachabilityFireability-2024-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 10 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 13) seen :0
Running SMT prover for 13 properties.
// Phase 1: matrix 3085 rows 2678 cols
[2024-05-23 20:28:28] [INFO ] Computed 16 invariants in 80 ms
[2024-05-23 20:28:30] [INFO ] After 1281ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:13
[2024-05-23 20:28:31] [INFO ] [Nat]Absence check using 16 positive place invariants in 25 ms returned sat
[2024-05-23 20:28:36] [INFO ] After 4883ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :12
[2024-05-23 20:28:36] [INFO ] Deduced a trap composed of 138 places in 301 ms of which 5 ms to minimize.
[2024-05-23 20:28:37] [INFO ] Deduced a trap composed of 137 places in 258 ms of which 1 ms to minimize.
[2024-05-23 20:28:37] [INFO ] Deduced a trap composed of 26 places in 278 ms of which 1 ms to minimize.
[2024-05-23 20:28:37] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1190 ms
[2024-05-23 20:28:40] [INFO ] Deduced a trap composed of 128 places in 122 ms of which 1 ms to minimize.
[2024-05-23 20:28:40] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 317 ms
[2024-05-23 20:28:41] [INFO ] Deduced a trap composed of 881 places in 859 ms of which 2 ms to minimize.
[2024-05-23 20:28:41] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1080 ms
[2024-05-23 20:28:43] [INFO ] Deduced a trap composed of 933 places in 1018 ms of which 2 ms to minimize.
[2024-05-23 20:28:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1201 ms
[2024-05-23 20:28:44] [INFO ] After 13279ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :12
Attempting to minimize the solution found.
Minimization took 3572 ms.
[2024-05-23 20:28:48] [INFO ] After 18194ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :12
FORMULA FlexibleBarrier-PT-14b-ReachabilityFireability-2024-06 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 13 Parikh solutions to 12 different solutions.
FORMULA FlexibleBarrier-PT-14b-ReachabilityFireability-2024-04 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 1 properties in 466 ms.
Support contains 110 out of 2678 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2678/2678 places, 3085/3085 transitions.
Graph (trivial) has 1968 edges and 2678 vertex of which 44 / 2678 are part of one of the 7 SCC in 32 ms
Free SCC test removed 37 places
Drop transitions removed 45 transitions
Reduce isomorphic transitions removed 45 transitions.
Drop transitions removed 455 transitions
Trivial Post-agglo rules discarded 455 transitions
Performed 455 trivial Post agglomeration. Transition count delta: 455
Iterating post reduction 0 with 455 rules applied. Total rules applied 456 place count 2641 transition count 2585
Reduce places removed 455 places and 0 transitions.
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Iterating post reduction 1 with 470 rules applied. Total rules applied 926 place count 2186 transition count 2570
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 2 with 15 rules applied. Total rules applied 941 place count 2171 transition count 2570
Performed 320 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 320 Pre rules applied. Total rules applied 941 place count 2171 transition count 2250
Deduced a syphon composed of 320 places in 2 ms
Reduce places removed 320 places and 0 transitions.
Iterating global reduction 3 with 640 rules applied. Total rules applied 1581 place count 1851 transition count 2250
Discarding 987 places :
Symmetric choice reduction at 3 with 987 rule applications. Total rules 2568 place count 864 transition count 1263
Iterating global reduction 3 with 987 rules applied. Total rules applied 3555 place count 864 transition count 1263
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 3555 place count 864 transition count 1257
Deduced a syphon composed of 6 places in 3 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 3567 place count 858 transition count 1257
Discarding 139 places :
Symmetric choice reduction at 3 with 139 rule applications. Total rules 3706 place count 719 transition count 1118
Iterating global reduction 3 with 139 rules applied. Total rules applied 3845 place count 719 transition count 1118
Ensure Unique test removed 124 transitions
Reduce isomorphic transitions removed 124 transitions.
Iterating post reduction 3 with 124 rules applied. Total rules applied 3969 place count 719 transition count 994
Performed 88 Post agglomeration using F-continuation condition.Transition count delta: 88
Deduced a syphon composed of 88 places in 1 ms
Reduce places removed 88 places and 0 transitions.
Iterating global reduction 4 with 176 rules applied. Total rules applied 4145 place count 631 transition count 906
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 4157 place count 625 transition count 906
Free-agglomeration rule applied 120 times.
Iterating global reduction 4 with 120 rules applied. Total rules applied 4277 place count 625 transition count 786
Reduce places removed 120 places and 0 transitions.
Iterating post reduction 4 with 120 rules applied. Total rules applied 4397 place count 505 transition count 786
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 4398 place count 504 transition count 785
Iterating global reduction 5 with 1 rules applied. Total rules applied 4399 place count 504 transition count 785
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 4400 place count 504 transition count 784
Drop transitions removed 11 transitions
Redundant transition composition rules discarded 11 transitions
Iterating global reduction 6 with 11 rules applied. Total rules applied 4411 place count 504 transition count 773
Partial Free-agglomeration rule applied 9 times.
Drop transitions removed 9 transitions
Iterating global reduction 6 with 9 rules applied. Total rules applied 4420 place count 504 transition count 773
Partial Post-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 6 with 2 rules applied. Total rules applied 4422 place count 504 transition count 773
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 4423 place count 503 transition count 772
Applied a total of 4423 rules in 623 ms. Remains 503 /2678 variables (removed 2175) and now considering 772/3085 (removed 2313) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 624 ms. Remains : 503/2678 places, 772/3085 transitions.
Incomplete random walk after 10000 steps, including 277 resets, run finished after 289 ms. (steps per millisecond=34 ) properties (out of 11) seen :2
FORMULA FlexibleBarrier-PT-14b-ReachabilityFireability-2024-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-14b-ReachabilityFireability-2024-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 9) seen :0
Running SMT prover for 9 properties.
[2024-05-23 20:28:49] [INFO ] Flow matrix only has 757 transitions (discarded 15 similar events)
// Phase 1: matrix 757 rows 503 cols
[2024-05-23 20:28:49] [INFO ] Computed 16 invariants in 7 ms
[2024-05-23 20:28:50] [INFO ] [Real]Absence check using 16 positive place invariants in 5 ms returned sat
[2024-05-23 20:28:50] [INFO ] After 151ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2024-05-23 20:28:50] [INFO ] [Nat]Absence check using 16 positive place invariants in 6 ms returned sat
[2024-05-23 20:28:50] [INFO ] After 563ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :9
[2024-05-23 20:28:50] [INFO ] State equation strengthened by 12 read => feed constraints.
[2024-05-23 20:28:51] [INFO ] After 428ms SMT Verify possible using 12 Read/Feed constraints in natural domain returned unsat :0 sat :9
[2024-05-23 20:28:51] [INFO ] Deduced a trap composed of 209 places in 138 ms of which 1 ms to minimize.
[2024-05-23 20:28:51] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 188 ms
[2024-05-23 20:28:51] [INFO ] Deduced a trap composed of 213 places in 138 ms of which 1 ms to minimize.
[2024-05-23 20:28:51] [INFO ] Deduced a trap composed of 221 places in 131 ms of which 1 ms to minimize.
[2024-05-23 20:28:51] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 352 ms
[2024-05-23 20:28:52] [INFO ] After 1489ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :9
Attempting to minimize the solution found.
Minimization took 440 ms.
[2024-05-23 20:28:52] [INFO ] After 2681ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :9
Parikh walk visited 0 properties in 88 ms.
Support contains 109 out of 503 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 503/503 places, 772/772 transitions.
Graph (trivial) has 18 edges and 503 vertex of which 2 / 503 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.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 501 transition count 769
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 501 transition count 768
Free-agglomeration rule applied 15 times.
Iterating global reduction 0 with 15 rules applied. Total rules applied 19 place count 501 transition count 753
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 0 with 15 rules applied. Total rules applied 34 place count 486 transition count 753
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 36 place count 486 transition count 751
Applied a total of 36 rules in 91 ms. Remains 486 /503 variables (removed 17) and now considering 751/772 (removed 21) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 91 ms. Remains : 486/503 places, 751/772 transitions.
Incomplete random walk after 10000 steps, including 250 resets, run finished after 159 ms. (steps per millisecond=62 ) properties (out of 9) seen :3
FORMULA FlexibleBarrier-PT-14b-ReachabilityFireability-2024-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-14b-ReachabilityFireability-2024-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-14b-ReachabilityFireability-2024-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 14 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
[2024-05-23 20:28:53] [INFO ] Flow matrix only has 735 transitions (discarded 16 similar events)
// Phase 1: matrix 735 rows 486 cols
[2024-05-23 20:28:53] [INFO ] Computed 16 invariants in 7 ms
[2024-05-23 20:28:53] [INFO ] [Real]Absence check using 16 positive place invariants in 4 ms returned sat
[2024-05-23 20:28:53] [INFO ] After 112ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2024-05-23 20:28:53] [INFO ] [Nat]Absence check using 16 positive place invariants in 5 ms returned sat
[2024-05-23 20:28:54] [INFO ] After 513ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2024-05-23 20:28:54] [INFO ] State equation strengthened by 12 read => feed constraints.
[2024-05-23 20:28:54] [INFO ] After 363ms SMT Verify possible using 12 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2024-05-23 20:28:54] [INFO ] Deduced a trap composed of 228 places in 122 ms of which 0 ms to minimize.
[2024-05-23 20:28:54] [INFO ] Deduced a trap composed of 228 places in 136 ms of which 1 ms to minimize.
[2024-05-23 20:28:54] [INFO ] Deduced a trap composed of 231 places in 121 ms of which 0 ms to minimize.
[2024-05-23 20:28:55] [INFO ] Deduced a trap composed of 209 places in 120 ms of which 1 ms to minimize.
[2024-05-23 20:28:55] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 624 ms
[2024-05-23 20:28:55] [INFO ] After 1418ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 360 ms.
[2024-05-23 20:28:55] [INFO ] After 2439ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Parikh walk visited 0 properties in 41 ms.
Support contains 106 out of 486 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 486/486 places, 751/751 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 486 transition count 749
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 484 transition count 749
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 6 place count 482 transition count 747
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 482 transition count 747
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 10 place count 481 transition count 746
Applied a total of 10 rules in 52 ms. Remains 481 /486 variables (removed 5) and now considering 746/751 (removed 5) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 53 ms. Remains : 481/486 places, 746/751 transitions.
Incomplete random walk after 10000 steps, including 252 resets, run finished after 172 ms. (steps per millisecond=58 ) properties (out of 6) seen :1
FORMULA FlexibleBarrier-PT-14b-ReachabilityFireability-2024-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 5) seen :2
FORMULA FlexibleBarrier-PT-14b-ReachabilityFireability-2024-10 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FlexibleBarrier-PT-14b-ReachabilityFireability-2024-01 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2024-05-23 20:28:56] [INFO ] Flow matrix only has 730 transitions (discarded 16 similar events)
// Phase 1: matrix 730 rows 481 cols
[2024-05-23 20:28:56] [INFO ] Computed 16 invariants in 8 ms
[2024-05-23 20:28:56] [INFO ] [Real]Absence check using 16 positive place invariants in 5 ms returned sat
[2024-05-23 20:28:56] [INFO ] After 85ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-23 20:28:56] [INFO ] [Nat]Absence check using 16 positive place invariants in 5 ms returned sat
[2024-05-23 20:28:56] [INFO ] After 278ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-23 20:28:56] [INFO ] State equation strengthened by 12 read => feed constraints.
[2024-05-23 20:28:56] [INFO ] After 150ms SMT Verify possible using 12 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2024-05-23 20:28:56] [INFO ] Deduced a trap composed of 204 places in 123 ms of which 1 ms to minimize.
[2024-05-23 20:28:57] [INFO ] Deduced a trap composed of 219 places in 105 ms of which 0 ms to minimize.
[2024-05-23 20:28:57] [INFO ] Deduced a trap composed of 221 places in 108 ms of which 1 ms to minimize.
[2024-05-23 20:28:57] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 425 ms
[2024-05-23 20:28:57] [INFO ] Deduced a trap composed of 208 places in 108 ms of which 0 ms to minimize.
[2024-05-23 20:28:57] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 161 ms
[2024-05-23 20:28:57] [INFO ] After 872ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 135 ms.
[2024-05-23 20:28:57] [INFO ] After 1384ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 4 ms.
Support contains 36 out of 481 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 481/481 places, 746/746 transitions.
Graph (trivial) has 91 edges and 481 vertex of which 4 / 481 are part of one of the 1 SCC in 1 ms
Free SCC test removed 3 places
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 0 with 14 rules applied. Total rules applied 15 place count 478 transition count 728
Reduce places removed 14 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 15 rules applied. Total rules applied 30 place count 464 transition count 727
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 31 place count 463 transition count 727
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 31 place count 463 transition count 724
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 37 place count 460 transition count 724
Discarding 27 places :
Symmetric choice reduction at 3 with 27 rule applications. Total rules 64 place count 433 transition count 697
Iterating global reduction 3 with 27 rules applied. Total rules applied 91 place count 433 transition count 697
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 92 place count 433 transition count 696
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 94 place count 431 transition count 694
Iterating global reduction 4 with 2 rules applied. Total rules applied 96 place count 431 transition count 694
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 98 place count 431 transition count 692
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 1 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 5 with 32 rules applied. Total rules applied 130 place count 415 transition count 676
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 134 place count 415 transition count 672
Discarding 8 places :
Symmetric choice reduction at 6 with 8 rule applications. Total rules 142 place count 407 transition count 664
Iterating global reduction 6 with 8 rules applied. Total rules applied 150 place count 407 transition count 664
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 6 with 8 rules applied. Total rules applied 158 place count 407 transition count 656
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 160 place count 406 transition count 655
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 161 place count 406 transition count 654
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 8 with 2 rules applied. Total rules applied 163 place count 406 transition count 652
Free-agglomeration rule applied 24 times.
Iterating global reduction 8 with 24 rules applied. Total rules applied 187 place count 406 transition count 628
Reduce places removed 24 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 8 with 29 rules applied. Total rules applied 216 place count 382 transition count 623
Discarding 18 places :
Symmetric choice reduction at 9 with 18 rule applications. Total rules 234 place count 364 transition count 605
Iterating global reduction 9 with 18 rules applied. Total rules applied 252 place count 364 transition count 605
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 9 with 18 rules applied. Total rules applied 270 place count 364 transition count 587
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 10 with 2 rules applied. Total rules applied 272 place count 364 transition count 585
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 10 with 1 rules applied. Total rules applied 273 place count 363 transition count 584
Applied a total of 273 rules in 133 ms. Remains 363 /481 variables (removed 118) and now considering 584/746 (removed 162) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 134 ms. Remains : 363/481 places, 584/746 transitions.
Incomplete random walk after 10000 steps, including 86 resets, run finished after 95 ms. (steps per millisecond=105 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 9 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 600505 steps, run timeout after 3001 ms. (steps per millisecond=200 ) properties seen :{}
Probabilistic random walk after 600505 steps, saw 171675 distinct states, run finished after 3003 ms. (steps per millisecond=199 ) properties seen :0
Running SMT prover for 3 properties.
[2024-05-23 20:29:00] [INFO ] Flow matrix only has 564 transitions (discarded 20 similar events)
// Phase 1: matrix 564 rows 363 cols
[2024-05-23 20:29:00] [INFO ] Computed 16 invariants in 6 ms
[2024-05-23 20:29:01] [INFO ] [Real]Absence check using 16 positive place invariants in 5 ms returned sat
[2024-05-23 20:29:01] [INFO ] After 73ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-23 20:29:01] [INFO ] [Nat]Absence check using 16 positive place invariants in 4 ms returned sat
[2024-05-23 20:29:01] [INFO ] After 232ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-23 20:29:01] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-23 20:29:01] [INFO ] After 111ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2024-05-23 20:29:01] [INFO ] Deduced a trap composed of 171 places in 93 ms of which 1 ms to minimize.
[2024-05-23 20:29:01] [INFO ] Deduced a trap composed of 183 places in 84 ms of which 0 ms to minimize.
[2024-05-23 20:29:01] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 234 ms
[2024-05-23 20:29:01] [INFO ] Deduced a trap composed of 172 places in 79 ms of which 0 ms to minimize.
[2024-05-23 20:29:01] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 129 ms
[2024-05-23 20:29:01] [INFO ] After 588ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 109 ms.
[2024-05-23 20:29:02] [INFO ] After 1011ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 10 ms.
Support contains 36 out of 363 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 363/363 places, 584/584 transitions.
Applied a total of 0 rules in 18 ms. Remains 363 /363 variables (removed 0) and now considering 584/584 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 363/363 places, 584/584 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 363/363 places, 584/584 transitions.
Applied a total of 0 rules in 9 ms. Remains 363 /363 variables (removed 0) and now considering 584/584 (removed 0) transitions.
[2024-05-23 20:29:02] [INFO ] Flow matrix only has 564 transitions (discarded 20 similar events)
[2024-05-23 20:29:02] [INFO ] Invariant cache hit.
[2024-05-23 20:29:02] [INFO ] Implicit Places using invariants in 139 ms returned []
[2024-05-23 20:29:02] [INFO ] Flow matrix only has 564 transitions (discarded 20 similar events)
[2024-05-23 20:29:02] [INFO ] Invariant cache hit.
[2024-05-23 20:29:02] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-23 20:29:02] [INFO ] Implicit Places using invariants and state equation in 270 ms returned []
Implicit Place search using SMT with State Equation took 409 ms to find 0 implicit places.
[2024-05-23 20:29:02] [INFO ] Redundant transitions in 34 ms returned []
[2024-05-23 20:29:02] [INFO ] Flow matrix only has 564 transitions (discarded 20 similar events)
[2024-05-23 20:29:02] [INFO ] Invariant cache hit.
[2024-05-23 20:29:02] [INFO ] Dead Transitions using invariants and state equation in 200 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 659 ms. Remains : 363/363 places, 584/584 transitions.
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Performed 37 Post agglomeration using F-continuation condition.Transition count delta: 37
Iterating post reduction 0 with 57 rules applied. Total rules applied 57 place count 363 transition count 527
Reduce places removed 37 places and 0 transitions.
Ensure Unique test removed 35 transitions
Reduce isomorphic transitions removed 35 transitions.
Iterating post reduction 1 with 72 rules applied. Total rules applied 129 place count 326 transition count 492
Discarding 49 places :
Symmetric choice reduction at 2 with 49 rule applications. Total rules 178 place count 277 transition count 443
Iterating global reduction 2 with 49 rules applied. Total rules applied 227 place count 277 transition count 443
Ensure Unique test removed 38 transitions
Reduce isomorphic transitions removed 38 transitions.
Iterating post reduction 2 with 38 rules applied. Total rules applied 265 place count 277 transition count 405
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 267 place count 276 transition count 404
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 268 place count 275 transition count 403
Iterating global reduction 3 with 1 rules applied. Total rules applied 269 place count 275 transition count 403
Applied a total of 269 rules in 21 ms. Remains 275 /363 variables (removed 88) and now considering 403/584 (removed 181) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 403 rows 275 cols
[2024-05-23 20:29:02] [INFO ] Computed 16 invariants in 5 ms
[2024-05-23 20:29:02] [INFO ] [Real]Absence check using 16 positive place invariants in 4 ms returned sat
[2024-05-23 20:29:02] [INFO ] After 59ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-23 20:29:02] [INFO ] [Nat]Absence check using 16 positive place invariants in 3 ms returned sat
[2024-05-23 20:29:03] [INFO ] After 170ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-23 20:29:03] [INFO ] After 287ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 80 ms.
[2024-05-23 20:29:03] [INFO ] After 424ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
[2024-05-23 20:29:03] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 5 ms.
[2024-05-23 20:29:03] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 363 places, 584 transitions and 2080 arcs took 4 ms.
[2024-05-23 20:29:03] [INFO ] Flatten gal took : 62 ms
Total runtime 36221 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT FlexibleBarrier-PT-14b
BK_EXAMINATION: ReachabilityFireability
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/373
ReachabilityFireability

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

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

FORMULA FlexibleBarrier-PT-14b-ReachabilityFireability-2024-05 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

BK_STOP 1716496147683

--------------------
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.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /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/373/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/373/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/373/ReachabilityFireability.xml
lola: Rule S: 0 transitions removed,0 places removed
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
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 # 13 (type EXCL) for 0 FlexibleBarrier-PT-14b-ReachabilityFireability-2024-00
lola: time limit : 1199 sec
lola: memory limit: 32 pages
lola: LAUNCH task # 9 (type FNDP) for 0 FlexibleBarrier-PT-14b-ReachabilityFireability-2024-00
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 10 (type EQUN) for 0 FlexibleBarrier-PT-14b-ReachabilityFireability-2024-00
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 12 (type SRCH) for 0 FlexibleBarrier-PT-14b-ReachabilityFireability-2024-00
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: FINISHED task # 9 (type FNDP) for FlexibleBarrier-PT-14b-ReachabilityFireability-2024-00
lola: result : true
lola: fired transitions : 11
lola: tried executions : 1
lola: time used : 0.000000
lola: memory pages used : 0
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: CANCELED task # 10 (type EQUN) for FlexibleBarrier-PT-14b-ReachabilityFireability-2024-00 (obsolete)
lola: CANCELED task # 12 (type SRCH) for FlexibleBarrier-PT-14b-ReachabilityFireability-2024-00 (obsolete)
lola: CANCELED task # 13 (type EXCL) for FlexibleBarrier-PT-14b-ReachabilityFireability-2024-00 (obsolete)
lola: LAUNCH task # 19 (type EXCL) for 6 FlexibleBarrier-PT-14b-ReachabilityFireability-2024-14
lola: time limit : 1799 sec
lola: memory limit: 32 pages
lola: LAUNCH task # 15 (type FNDP) for 6 FlexibleBarrier-PT-14b-ReachabilityFireability-2024-14
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 16 (type EQUN) for 6 FlexibleBarrier-PT-14b-ReachabilityFireability-2024-14
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: LAUNCH task # 18 (type SRCH) for 6 FlexibleBarrier-PT-14b-ReachabilityFireability-2024-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: FINISHED task # 18 (type SRCH) for FlexibleBarrier-PT-14b-ReachabilityFireability-2024-14
lola: result : true
lola: markings : 4
lola: fired transitions : 3
lola: time used : 0.000000
lola: memory pages used : 1
lola: CANCELED task # 15 (type FNDP) for FlexibleBarrier-PT-14b-ReachabilityFireability-2024-14 (obsolete)
lola: CANCELED task # 16 (type EQUN) for FlexibleBarrier-PT-14b-ReachabilityFireability-2024-14 (obsolete)
lola: CANCELED task # 19 (type EXCL) for FlexibleBarrier-PT-14b-ReachabilityFireability-2024-14 (obsolete)
lola: LAUNCH task # 26 (type EXCL) for 3 FlexibleBarrier-PT-14b-ReachabilityFireability-2024-05
lola: time limit : 3599 sec
lola: memory limit: 32 pages
lola: LAUNCH task # 22 (type FNDP) for 3 FlexibleBarrier-PT-14b-ReachabilityFireability-2024-05
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 23 (type EQUN) for 3 FlexibleBarrier-PT-14b-ReachabilityFireability-2024-05
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: LAUNCH task # 25 (type SRCH) for 3 FlexibleBarrier-PT-14b-ReachabilityFireability-2024-05
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: FINISHED task # 15 (type FNDP) for FlexibleBarrier-PT-14b-ReachabilityFireability-2024-14
lola: result : true
lola: fired transitions : 2
lola: tried executions : 1
lola: time used : 0.000000
lola: memory pages used : 0
sara: try reading problem file /home/mcc/execution/373/ReachabilityFireability-10.sara.
sara: try reading problem file /home/mcc/execution/373/ReachabilityFireability-16.sara.
sara: place or transition ordering is non-deterministic

lola: FINISHED task # 16 (type EQUN) for FlexibleBarrier-PT-14b-ReachabilityFireability-2024-14
lola: result : true
sara: place or transition ordering is non-deterministic

lola: FINISHED task # 10 (type EQUN) for FlexibleBarrier-PT-14b-ReachabilityFireability-2024-00
lola: result : true
lola: FINISHED task # 22 (type FNDP) for FlexibleBarrier-PT-14b-ReachabilityFireability-2024-05
lola: result : true
lola: fired transitions : 231130
lola: tried executions : 6298
lola: time used : 2.000000
lola: memory pages used : 0
lola: CANCELED task # 23 (type EQUN) for FlexibleBarrier-PT-14b-ReachabilityFireability-2024-05 (obsolete)
lola: CANCELED task # 25 (type SRCH) for FlexibleBarrier-PT-14b-ReachabilityFireability-2024-05 (obsolete)
lola: CANCELED task # 26 (type EXCL) for FlexibleBarrier-PT-14b-ReachabilityFireability-2024-05 (obsolete)
lola: Portfolio finished: no open formulas

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
FlexibleBarrier-PT-14b-ReachabilityFireability-2024-00: EF true findpath
FlexibleBarrier-PT-14b-ReachabilityFireability-2024-05: AG false findpath
FlexibleBarrier-PT-14b-ReachabilityFireability-2024-14: EF true tandem / insertion


Time elapsed: 3 secs. Pages in use: 4

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-14b"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="gold2023"
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-5568"
echo " Executing tool gold2023"
echo " Input is FlexibleBarrier-PT-14b, 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 r197-tall-171640624800060"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/FlexibleBarrier-PT-14b.tgz
mv FlexibleBarrier-PT-14b 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 ;