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.r455-smll-167912647600614.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 StigmergyElection-PT-05b, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r455-smll-167912647600614
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 888K
-rw-r--r-- 1 mcc users 6.6K Feb 26 16:30 CTLCardinality.txt
-rw-r--r-- 1 mcc users 68K Feb 26 16:30 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.3K Feb 26 16:29 CTLFireability.txt
-rw-r--r-- 1 mcc users 60K Feb 26 16:29 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Feb 25 17:14 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 17:14 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 17:14 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 17:14 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Feb 26 16:30 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 149K Feb 26 16:30 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.4K Feb 26 16:30 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 61K Feb 26 16:30 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 17:14 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 17:14 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 428K Mar 5 18:23 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1679318036228

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=lolaxred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=StigmergyElection-PT-05b
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-20 13:13:59] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-20 13:13:59] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-20 13:13:59] [INFO ] Load time of PNML (sax parser for PT used): 191 ms
[2023-03-20 13:13:59] [INFO ] Transformed 699 places.
[2023-03-20 13:13:59] [INFO ] Transformed 1266 transitions.
[2023-03-20 13:13:59] [INFO ] Found NUPN structural information;
[2023-03-20 13:13:59] [INFO ] Parsed PT model containing 699 places and 1266 transitions and 6741 arcs in 320 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 25 ms.
Working with output stream class java.io.PrintStream
FORMULA StigmergyElection-PT-05b-ReachabilityCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyElection-PT-05b-ReachabilityCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyElection-PT-05b-ReachabilityCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyElection-PT-05b-ReachabilityCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyElection-PT-05b-ReachabilityCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 113 resets, run finished after 789 ms. (steps per millisecond=12 ) properties (out of 11) seen :5
FORMULA StigmergyElection-PT-05b-ReachabilityCardinality-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyElection-PT-05b-ReachabilityCardinality-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyElection-PT-05b-ReachabilityCardinality-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyElection-PT-05b-ReachabilityCardinality-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyElection-PT-05b-ReachabilityCardinality-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 124 ms. (steps per millisecond=80 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 21 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 93 ms. (steps per millisecond=107 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 103 ms. (steps per millisecond=97 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 1266 rows 699 cols
[2023-03-20 13:14:01] [INFO ] Computed 6 place invariants in 34 ms
[2023-03-20 13:14:02] [INFO ] After 718ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-20 13:14:02] [INFO ] [Nat]Absence check using 6 positive place invariants in 23 ms returned sat
[2023-03-20 13:14:04] [INFO ] After 1232ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :5
[2023-03-20 13:14:04] [INFO ] Deduced a trap composed of 110 places in 555 ms of which 13 ms to minimize.
[2023-03-20 13:14:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 757 ms
[2023-03-20 13:14:06] [INFO ] Deduced a trap composed of 190 places in 884 ms of which 3 ms to minimize.
[2023-03-20 13:14:06] [INFO ] Deduced a trap composed of 190 places in 494 ms of which 1 ms to minimize.
[2023-03-20 13:14:07] [INFO ] Deduced a trap composed of 192 places in 449 ms of which 1 ms to minimize.
[2023-03-20 13:14:07] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 2181 ms
[2023-03-20 13:14:08] [INFO ] Deduced a trap composed of 190 places in 586 ms of which 2 ms to minimize.
[2023-03-20 13:14:08] [INFO ] Deduced a trap composed of 189 places in 439 ms of which 2 ms to minimize.
[2023-03-20 13:14:08] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1234 ms
[2023-03-20 13:14:09] [INFO ] Deduced a trap composed of 189 places in 697 ms of which 1 ms to minimize.
[2023-03-20 13:14:10] [INFO ] Deduced a trap composed of 189 places in 611 ms of which 2 ms to minimize.
[2023-03-20 13:14:10] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1621 ms
[2023-03-20 13:14:10] [INFO ] After 7957ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :5
Attempting to minimize the solution found.
Minimization took 856 ms.
[2023-03-20 13:14:11] [INFO ] After 9314ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :5
FORMULA StigmergyElection-PT-05b-ReachabilityCardinality-02 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 6 Parikh solutions to 5 different solutions.
Parikh walk visited 0 properties in 152 ms.
Support contains 126 out of 699 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 699/699 places, 1266/1266 transitions.
Graph (trivial) has 476 edges and 699 vertex of which 53 / 699 are part of one of the 9 SCC in 9 ms
Free SCC test removed 44 places
Drop transitions removed 55 transitions
Reduce isomorphic transitions removed 55 transitions.
Graph (complete) has 1231 edges and 655 vertex of which 649 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.16 ms
Discarding 6 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 240 transitions
Trivial Post-agglo rules discarded 240 transitions
Performed 240 trivial Post agglomeration. Transition count delta: 240
Iterating post reduction 0 with 242 rules applied. Total rules applied 244 place count 649 transition count 966
Reduce places removed 240 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 247 rules applied. Total rules applied 491 place count 409 transition count 959
Reduce places removed 3 places and 0 transitions.
Performed 71 Post agglomeration using F-continuation condition.Transition count delta: 71
Iterating post reduction 2 with 74 rules applied. Total rules applied 565 place count 406 transition count 888
Reduce places removed 71 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 3 with 75 rules applied. Total rules applied 640 place count 335 transition count 884
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 642 place count 333 transition count 884
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 12 Pre rules applied. Total rules applied 642 place count 333 transition count 872
Deduced a syphon composed of 12 places in 4 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 5 with 24 rules applied. Total rules applied 666 place count 321 transition count 872
Discarding 32 places :
Symmetric choice reduction at 5 with 32 rule applications. Total rules 698 place count 289 transition count 840
Iterating global reduction 5 with 32 rules applied. Total rules applied 730 place count 289 transition count 840
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 731 place count 289 transition count 839
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 731 place count 289 transition count 838
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 733 place count 288 transition count 838
Discarding 6 places :
Symmetric choice reduction at 6 with 6 rule applications. Total rules 739 place count 282 transition count 508
Iterating global reduction 6 with 6 rules applied. Total rules applied 745 place count 282 transition count 508
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Deduced a syphon composed of 19 places in 1 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 6 with 38 rules applied. Total rules applied 783 place count 263 transition count 489
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 6 with 10 rules applied. Total rules applied 793 place count 258 transition count 489
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 6 with 2 rules applied. Total rules applied 795 place count 258 transition count 487
Free-agglomeration rule applied 23 times.
Iterating global reduction 6 with 23 rules applied. Total rules applied 818 place count 258 transition count 464
Reduce places removed 23 places and 0 transitions.
Iterating post reduction 6 with 23 rules applied. Total rules applied 841 place count 235 transition count 464
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 842 place count 235 transition count 463
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 843 place count 235 transition count 463
Partial Post-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 7 with 2 rules applied. Total rules applied 845 place count 235 transition count 463
Applied a total of 845 rules in 580 ms. Remains 235 /699 variables (removed 464) and now considering 463/1266 (removed 803) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 582 ms. Remains : 235/699 places, 463/1266 transitions.
Incomplete random walk after 10000 steps, including 272 resets, run finished after 280 ms. (steps per millisecond=35 ) properties (out of 5) seen :1
FORMULA StigmergyElection-PT-05b-ReachabilityCardinality-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 40 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 49 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 51 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 48 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 463 rows 235 cols
[2023-03-20 13:14:12] [INFO ] Computed 5 place invariants in 15 ms
[2023-03-20 13:14:13] [INFO ] After 74ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-20 13:14:13] [INFO ] [Nat]Absence check using 5 positive place invariants in 5 ms returned sat
[2023-03-20 13:14:13] [INFO ] After 415ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-20 13:14:13] [INFO ] State equation strengthened by 103 read => feed constraints.
[2023-03-20 13:14:13] [INFO ] After 211ms SMT Verify possible using 103 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-20 13:14:13] [INFO ] Deduced a trap composed of 75 places in 185 ms of which 0 ms to minimize.
[2023-03-20 13:14:14] [INFO ] Deduced a trap composed of 72 places in 184 ms of which 1 ms to minimize.
[2023-03-20 13:14:14] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 441 ms
[2023-03-20 13:14:14] [INFO ] Deduced a trap composed of 60 places in 198 ms of which 1 ms to minimize.
[2023-03-20 13:14:14] [INFO ] Deduced a trap composed of 66 places in 187 ms of which 1 ms to minimize.
[2023-03-20 13:14:14] [INFO ] Deduced a trap composed of 62 places in 172 ms of which 0 ms to minimize.
[2023-03-20 13:14:14] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 659 ms
[2023-03-20 13:14:15] [INFO ] Deduced a trap composed of 61 places in 169 ms of which 1 ms to minimize.
[2023-03-20 13:14:15] [INFO ] Deduced a trap composed of 65 places in 156 ms of which 1 ms to minimize.
[2023-03-20 13:14:15] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 441 ms
[2023-03-20 13:14:15] [INFO ] After 2039ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 310 ms.
[2023-03-20 13:14:15] [INFO ] After 2886ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 48 ms.
Support contains 90 out of 235 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 235/235 places, 463/463 transitions.
Graph (trivial) has 63 edges and 235 vertex of which 6 / 235 are part of one of the 3 SCC in 1 ms
Free SCC test removed 3 places
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions removed 27 transitions
Trivial Post-agglo rules discarded 27 transitions
Performed 27 trivial Post agglomeration. Transition count delta: 27
Iterating post reduction 0 with 27 rules applied. Total rules applied 28 place count 232 transition count 430
Reduce places removed 27 places and 0 transitions.
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Iterating post reduction 1 with 39 rules applied. Total rules applied 67 place count 205 transition count 418
Reduce places removed 12 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 14 rules applied. Total rules applied 81 place count 193 transition count 416
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 81 place count 193 transition count 412
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 89 place count 189 transition count 412
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 90 place count 188 transition count 376
Iterating global reduction 3 with 1 rules applied. Total rules applied 91 place count 188 transition count 376
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 2 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 97 place count 185 transition count 373
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 98 place count 184 transition count 372
Iterating global reduction 3 with 1 rules applied. Total rules applied 99 place count 184 transition count 372
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
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 101 place count 183 transition count 372
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 3 with 4 rules applied. Total rules applied 105 place count 183 transition count 368
Free-agglomeration rule applied 4 times.
Iterating global reduction 3 with 4 rules applied. Total rules applied 109 place count 183 transition count 364
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 113 place count 179 transition count 364
Applied a total of 113 rules in 127 ms. Remains 179 /235 variables (removed 56) and now considering 364/463 (removed 99) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 128 ms. Remains : 179/235 places, 364/463 transitions.
Incomplete random walk after 10000 steps, including 311 resets, run finished after 253 ms. (steps per millisecond=39 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 45 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 52 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 58 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 55 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 509501 steps, run timeout after 3001 ms. (steps per millisecond=169 ) properties seen :{}
Probabilistic random walk after 509501 steps, saw 105089 distinct states, run finished after 3003 ms. (steps per millisecond=169 ) properties seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 364 rows 179 cols
[2023-03-20 13:14:19] [INFO ] Computed 5 place invariants in 4 ms
[2023-03-20 13:14:19] [INFO ] After 69ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-20 13:14:19] [INFO ] [Nat]Absence check using 5 positive place invariants in 4 ms returned sat
[2023-03-20 13:14:20] [INFO ] After 263ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-20 13:14:20] [INFO ] State equation strengthened by 90 read => feed constraints.
[2023-03-20 13:14:20] [INFO ] After 279ms SMT Verify possible using 90 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-20 13:14:20] [INFO ] Deduced a trap composed of 46 places in 155 ms of which 0 ms to minimize.
[2023-03-20 13:14:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 193 ms
[2023-03-20 13:14:20] [INFO ] Deduced a trap composed of 51 places in 121 ms of which 1 ms to minimize.
[2023-03-20 13:14:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 159 ms
[2023-03-20 13:14:21] [INFO ] Deduced a trap composed of 46 places in 150 ms of which 2 ms to minimize.
[2023-03-20 13:14:21] [INFO ] Deduced a trap composed of 32 places in 132 ms of which 1 ms to minimize.
[2023-03-20 13:14:21] [INFO ] Deduced a trap composed of 48 places in 121 ms of which 2 ms to minimize.
[2023-03-20 13:14:21] [INFO ] Deduced a trap composed of 47 places in 111 ms of which 1 ms to minimize.
[2023-03-20 13:14:21] [INFO ] Deduced a trap composed of 49 places in 135 ms of which 1 ms to minimize.
[2023-03-20 13:14:21] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 777 ms
[2023-03-20 13:14:21] [INFO ] After 1652ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 237 ms.
[2023-03-20 13:14:21] [INFO ] After 2239ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 23 ms.
Support contains 90 out of 179 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 179/179 places, 364/364 transitions.
Applied a total of 0 rules in 12 ms. Remains 179 /179 variables (removed 0) and now considering 364/364 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 179/179 places, 364/364 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 179/179 places, 364/364 transitions.
Applied a total of 0 rules in 11 ms. Remains 179 /179 variables (removed 0) and now considering 364/364 (removed 0) transitions.
[2023-03-20 13:14:21] [INFO ] Invariant cache hit.
[2023-03-20 13:14:22] [INFO ] Implicit Places using invariants in 103 ms returned []
[2023-03-20 13:14:22] [INFO ] Invariant cache hit.
[2023-03-20 13:14:22] [INFO ] State equation strengthened by 90 read => feed constraints.
[2023-03-20 13:14:22] [INFO ] Implicit Places using invariants and state equation in 273 ms returned []
Implicit Place search using SMT with State Equation took 386 ms to find 0 implicit places.
[2023-03-20 13:14:22] [INFO ] Redundant transitions in 30 ms returned []
[2023-03-20 13:14:22] [INFO ] Invariant cache hit.
[2023-03-20 13:14:22] [INFO ] Dead Transitions using invariants and state equation in 372 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 811 ms. Remains : 179/179 places, 364/364 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 179 transition count 362
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 177 transition count 362
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 4 place count 177 transition count 361
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 6 place count 176 transition count 361
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 10 place count 174 transition count 359
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 2 with 5 rules applied. Total rules applied 15 place count 174 transition count 359
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 16 place count 174 transition count 358
Applied a total of 16 rules in 49 ms. Remains 174 /179 variables (removed 5) and now considering 358/364 (removed 6) transitions.
Running SMT prover for 4 properties.
// Phase 1: matrix 358 rows 174 cols
[2023-03-20 13:14:22] [INFO ] Computed 5 place invariants in 5 ms
[2023-03-20 13:14:22] [INFO ] After 69ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-20 13:14:23] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2023-03-20 13:14:23] [INFO ] After 277ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-20 13:14:23] [INFO ] Deduced a trap composed of 49 places in 132 ms of which 1 ms to minimize.
[2023-03-20 13:14:23] [INFO ] Deduced a trap composed of 51 places in 161 ms of which 0 ms to minimize.
[2023-03-20 13:14:23] [INFO ] Deduced a trap composed of 55 places in 166 ms of which 1 ms to minimize.
[2023-03-20 13:14:24] [INFO ] Deduced a trap composed of 53 places in 138 ms of which 0 ms to minimize.
[2023-03-20 13:14:24] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 694 ms
[2023-03-20 13:14:24] [INFO ] Deduced a trap composed of 44 places in 181 ms of which 1 ms to minimize.
[2023-03-20 13:14:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 219 ms
[2023-03-20 13:14:24] [INFO ] Deduced a trap composed of 46 places in 140 ms of which 0 ms to minimize.
[2023-03-20 13:14:24] [INFO ] Deduced a trap composed of 48 places in 173 ms of which 1 ms to minimize.
[2023-03-20 13:14:24] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 379 ms
[2023-03-20 13:14:24] [INFO ] After 1766ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 205 ms.
[2023-03-20 13:14:25] [INFO ] After 2064ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
[2023-03-20 13:14:25] [INFO ] Export to MCC of 4 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 8 ms.
[2023-03-20 13:14:25] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 179 places, 364 transitions and 2023 arcs took 5 ms.
[2023-03-20 13:14:25] [INFO ] Flatten gal took : 153 ms
Total runtime 25919 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT StigmergyElection-PT-05b
BK_EXAMINATION: ReachabilityCardinality
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/373
ReachabilityCardinality

FORMULA StigmergyElection-PT-05b-ReachabilityCardinality-00 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA StigmergyElection-PT-05b-ReachabilityCardinality-01 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA StigmergyElection-PT-05b-ReachabilityCardinality-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA StigmergyElection-PT-05b-ReachabilityCardinality-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

BK_STOP 1679318067219

--------------------
content from stderr:

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityCardinality -timeout 360 -rebuildPNML
lola: MEM LIMIT 32
lola: MEM LIMIT 5
lola: NET
lola: input: PNML file (--pnmlnet)
lola: reading net from /home/mcc/execution/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/ReachabilityCardinality.xml
lola: Created skeleton in 0.000000 secs.
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: 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: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: LAUNCH task # 26 (type EXCL) for 0 StigmergyElection-PT-05b-ReachabilityCardinality-00
lola: time limit : 1799 sec
lola: memory limit: 32 pages
lola: LAUNCH task # 16 (type FNDP) for 0 StigmergyElection-PT-05b-ReachabilityCardinality-00
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 17 (type EQUN) for 0 StigmergyElection-PT-05b-ReachabilityCardinality-00
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 0 StigmergyElection-PT-05b-ReachabilityCardinality-00
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:711
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: rewrite Frontend/Parser/formula_rewrite.k:711
lola: FINISHED task # 16 (type FNDP) for StigmergyElection-PT-05b-ReachabilityCardinality-00
lola: result : true
lola: fired transitions : 78
lola: tried executions : 1
lola: time used : 0.000000
lola: memory pages used : 0
lola: CANCELED task # 17 (type EQUN) for StigmergyElection-PT-05b-ReachabilityCardinality-00 (obsolete)
lola: CANCELED task # 25 (type SRCH) for StigmergyElection-PT-05b-ReachabilityCardinality-00 (obsolete)
lola: CANCELED task # 26 (type EXCL) for StigmergyElection-PT-05b-ReachabilityCardinality-00 (obsolete)
lola: LAUNCH task # 30 (type EXCL) for 3 StigmergyElection-PT-05b-ReachabilityCardinality-01
lola: time limit : 1199 sec
lola: memory limit: 32 pages
lola: LAUNCH task # 28 (type FNDP) for 9 StigmergyElection-PT-05b-ReachabilityCardinality-11
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 32 (type EQUN) for 9 StigmergyElection-PT-05b-ReachabilityCardinality-11
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: LAUNCH task # 35 (type SRCH) for 9 StigmergyElection-PT-05b-ReachabilityCardinality-11
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: FINISHED task # 25 (type SRCH) for StigmergyElection-PT-05b-ReachabilityCardinality-00
lola: result : true
lola: markings : 84
lola: fired transitions : 101
lola: time used : 0.000000
lola: memory pages used : 1
lola: FINISHED task # 30 (type EXCL) for StigmergyElection-PT-05b-ReachabilityCardinality-01
lola: result : true
lola: markings : 40
lola: fired transitions : 45
lola: time used : 0.000000
lola: memory pages used : 1
lola: LAUNCH task # 24 (type EXCL) for 6 StigmergyElection-PT-05b-ReachabilityCardinality-04
lola: time limit : 1799 sec
lola: memory limit: 32 pages
lola: FINISHED task # 28 (type FNDP) for StigmergyElection-PT-05b-ReachabilityCardinality-11
lola: result : true
lola: fired transitions : 30
lola: tried executions : 1
lola: time used : 0.000000
lola: memory pages used : 0
lola: CANCELED task # 32 (type EQUN) for StigmergyElection-PT-05b-ReachabilityCardinality-11 (obsolete)
lola: CANCELED task # 35 (type SRCH) for StigmergyElection-PT-05b-ReachabilityCardinality-11 (obsolete)
lola: LAUNCH task # 13 (type FNDP) for 6 StigmergyElection-PT-05b-ReachabilityCardinality-04
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 14 (type EQUN) for 6 StigmergyElection-PT-05b-ReachabilityCardinality-04
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 # 23 (type SRCH) for 6 StigmergyElection-PT-05b-ReachabilityCardinality-04
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: FINISHED task # 23 (type SRCH) for StigmergyElection-PT-05b-ReachabilityCardinality-04
lola: result : true
lola: markings : 19
lola: fired transitions : 18
lola: time used : 0.000000
lola: memory pages used : 1
lola: CANCELED task # 13 (type FNDP) for StigmergyElection-PT-05b-ReachabilityCardinality-04 (obsolete)
lola: CANCELED task # 14 (type EQUN) for StigmergyElection-PT-05b-ReachabilityCardinality-04 (obsolete)
lola: CANCELED task # 24 (type EXCL) for StigmergyElection-PT-05b-ReachabilityCardinality-04 (obsolete)
lola: Portfolio finished: no open formulas

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
StigmergyElection-PT-05b-ReachabilityCardinality-00: AG false findpath
StigmergyElection-PT-05b-ReachabilityCardinality-01: EF true tandem / relaxed
StigmergyElection-PT-05b-ReachabilityCardinality-04: AG false tandem / insertion
StigmergyElection-PT-05b-ReachabilityCardinality-11: EF true findpath


Time elapsed: 1 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="StigmergyElection-PT-05b"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="lolaxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool lolaxred"
echo " Input is StigmergyElection-PT-05b, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r455-smll-167912647600614"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/StigmergyElection-PT-05b.tgz
mv StigmergyElection-PT-05b execution
cd execution
if [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "UpperBounds" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] || [ "ReachabilityCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' ReachabilityCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;