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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.9M
-rw-r--r-- 1 mcc users 6.7K Feb 26 16:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 71K Feb 26 16:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Feb 26 16:21 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K Feb 26 16:21 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.3K Feb 25 17:14 LTLCardinality.txt
-rw-r--r-- 1 mcc users 30K Feb 25 17:14 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K 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 13K Feb 26 16:23 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 139K Feb 26 16:23 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.4K Feb 26 16:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 81K Feb 26 16:22 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 3.4M 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-07b-ReachabilityCardinality-00
FORMULA_NAME StigmergyElection-PT-07b-ReachabilityCardinality-01
FORMULA_NAME StigmergyElection-PT-07b-ReachabilityCardinality-02
FORMULA_NAME StigmergyElection-PT-07b-ReachabilityCardinality-03
FORMULA_NAME StigmergyElection-PT-07b-ReachabilityCardinality-04
FORMULA_NAME StigmergyElection-PT-07b-ReachabilityCardinality-05
FORMULA_NAME StigmergyElection-PT-07b-ReachabilityCardinality-06
FORMULA_NAME StigmergyElection-PT-07b-ReachabilityCardinality-07
FORMULA_NAME StigmergyElection-PT-07b-ReachabilityCardinality-08
FORMULA_NAME StigmergyElection-PT-07b-ReachabilityCardinality-09
FORMULA_NAME StigmergyElection-PT-07b-ReachabilityCardinality-10
FORMULA_NAME StigmergyElection-PT-07b-ReachabilityCardinality-11
FORMULA_NAME StigmergyElection-PT-07b-ReachabilityCardinality-12
FORMULA_NAME StigmergyElection-PT-07b-ReachabilityCardinality-13
FORMULA_NAME StigmergyElection-PT-07b-ReachabilityCardinality-14
FORMULA_NAME StigmergyElection-PT-07b-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1679322234898

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-07b
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-20 14:23:58] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-20 14:23:58] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-20 14:23:59] [INFO ] Load time of PNML (sax parser for PT used): 763 ms
[2023-03-20 14:23:59] [INFO ] Transformed 971 places.
[2023-03-20 14:23:59] [INFO ] Transformed 5542 transitions.
[2023-03-20 14:23:59] [INFO ] Found NUPN structural information;
[2023-03-20 14:23:59] [INFO ] Parsed PT model containing 971 places and 5542 transitions and 65199 arcs in 989 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 40 ms.
Working with output stream class java.io.PrintStream
FORMULA StigmergyElection-PT-07b-ReachabilityCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyElection-PT-07b-ReachabilityCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyElection-PT-07b-ReachabilityCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyElection-PT-07b-ReachabilityCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyElection-PT-07b-ReachabilityCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 81 resets, run finished after 785 ms. (steps per millisecond=12 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 11 resets, run finished after 90 ms. (steps per millisecond=111 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 12 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 11 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 11) seen :0
Interrupted probabilistic random walk after 110394 steps, run timeout after 3001 ms. (steps per millisecond=36 ) properties seen :{}
Probabilistic random walk after 110394 steps, saw 22277 distinct states, run finished after 3003 ms. (steps per millisecond=36 ) properties seen :0
Running SMT prover for 11 properties.
// Phase 1: matrix 5542 rows 971 cols
[2023-03-20 14:24:04] [INFO ] Computed 8 place invariants in 181 ms
[2023-03-20 14:24:06] [INFO ] After 994ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:11
[2023-03-20 14:24:06] [INFO ] [Nat]Absence check using 8 positive place invariants in 20 ms returned sat
[2023-03-20 14:24:13] [INFO ] After 5929ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :9
[2023-03-20 14:24:17] [INFO ] Deduced a trap composed of 193 places in 3835 ms of which 10 ms to minimize.
[2023-03-20 14:24:20] [INFO ] Deduced a trap composed of 189 places in 2730 ms of which 2 ms to minimize.
[2023-03-20 14:24:20] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 7207 ms
[2023-03-20 14:24:23] [INFO ] Deduced a trap composed of 194 places in 2971 ms of which 3 ms to minimize.
[2023-03-20 14:24:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 3389 ms
[2023-03-20 14:24:28] [INFO ] Deduced a trap composed of 193 places in 3714 ms of which 6 ms to minimize.
[2023-03-20 14:24:31] [INFO ] Deduced a trap composed of 194 places in 3172 ms of which 1 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:902)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-20 14:24:31] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-20 14:24:31] [INFO ] After 25588ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:11
FORMULA StigmergyElection-PT-07b-ReachabilityCardinality-14 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA StigmergyElection-PT-07b-ReachabilityCardinality-07 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 11 Parikh solutions to 9 different solutions.
Parikh walk visited 0 properties in 377 ms.
Support contains 120 out of 971 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 971/971 places, 5542/5542 transitions.
Graph (trivial) has 760 edges and 971 vertex of which 68 / 971 are part of one of the 13 SCC in 14 ms
Free SCC test removed 55 places
Drop transitions removed 70 transitions
Reduce isomorphic transitions removed 70 transitions.
Graph (complete) has 2030 edges and 916 vertex of which 905 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.74 ms
Discarding 11 places :
Also discarding 5 output transitions
Drop transitions removed 5 transitions
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions removed 436 transitions
Trivial Post-agglo rules discarded 436 transitions
Performed 436 trivial Post agglomeration. Transition count delta: 436
Iterating post reduction 0 with 441 rules applied. Total rules applied 443 place count 905 transition count 5026
Reduce places removed 436 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 445 rules applied. Total rules applied 888 place count 469 transition count 5017
Reduce places removed 4 places and 0 transitions.
Performed 68 Post agglomeration using F-continuation condition.Transition count delta: 68
Iterating post reduction 2 with 72 rules applied. Total rules applied 960 place count 465 transition count 4949
Reduce places removed 68 places and 0 transitions.
Iterating post reduction 3 with 68 rules applied. Total rules applied 1028 place count 397 transition count 4949
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 21 Pre rules applied. Total rules applied 1028 place count 397 transition count 4928
Deduced a syphon composed of 21 places in 7 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 4 with 42 rules applied. Total rules applied 1070 place count 376 transition count 4928
Discarding 36 places :
Symmetric choice reduction at 4 with 36 rule applications. Total rules 1106 place count 340 transition count 4892
Iterating global reduction 4 with 36 rules applied. Total rules applied 1142 place count 340 transition count 4892
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 1144 place count 340 transition count 4890
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 1144 place count 340 transition count 4888
Deduced a syphon composed of 2 places in 11 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 1148 place count 338 transition count 4888
Discarding 6 places :
Symmetric choice reduction at 5 with 6 rule applications. Total rules 1154 place count 332 transition count 1918
Iterating global reduction 5 with 6 rules applied. Total rules applied 1160 place count 332 transition count 1918
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 1162 place count 332 transition count 1916
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: 28
Deduced a syphon composed of 28 places in 4 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 6 with 56 rules applied. Total rules applied 1218 place count 304 transition count 1888
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 1220 place count 302 transition count 1886
Iterating global reduction 6 with 2 rules applied. Total rules applied 1222 place count 302 transition count 1886
Performed 12 Post agglomeration using F-continuation condition with reduction of 6 identical transitions.
Deduced a syphon composed of 12 places in 2 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 6 with 24 rules applied. Total rules applied 1246 place count 290 transition count 1888
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 1248 place count 290 transition count 1886
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 7 with 3 rules applied. Total rules applied 1251 place count 290 transition count 1883
Free-agglomeration rule applied 44 times.
Iterating global reduction 7 with 44 rules applied. Total rules applied 1295 place count 290 transition count 1839
Reduce places removed 44 places and 0 transitions.
Iterating post reduction 7 with 44 rules applied. Total rules applied 1339 place count 246 transition count 1839
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 8 with 4 rules applied. Total rules applied 1343 place count 246 transition count 1835
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 1344 place count 246 transition count 1835
Applied a total of 1344 rules in 2314 ms. Remains 246 /971 variables (removed 725) and now considering 1835/5542 (removed 3707) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2316 ms. Remains : 246/971 places, 1835/5542 transitions.
Incomplete random walk after 10000 steps, including 291 resets, run finished after 331 ms. (steps per millisecond=30 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 45 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 45 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 50 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 47 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 48 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 44 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 48 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 50 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 46 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 9) seen :0
Interrupted probabilistic random walk after 300360 steps, run timeout after 3001 ms. (steps per millisecond=100 ) properties seen :{0=1, 1=1, 3=1}
Probabilistic random walk after 300360 steps, saw 55684 distinct states, run finished after 3002 ms. (steps per millisecond=100 ) properties seen :3
FORMULA StigmergyElection-PT-07b-ReachabilityCardinality-05 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA StigmergyElection-PT-07b-ReachabilityCardinality-03 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA StigmergyElection-PT-07b-ReachabilityCardinality-00 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Running SMT prover for 6 properties.
// Phase 1: matrix 1835 rows 246 cols
[2023-03-20 14:24:38] [INFO ] Computed 7 place invariants in 16 ms
[2023-03-20 14:24:38] [INFO ] After 111ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-20 14:24:38] [INFO ] [Nat]Absence check using 7 positive place invariants in 5 ms returned sat
[2023-03-20 14:24:40] [INFO ] After 1514ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-20 14:24:40] [INFO ] State equation strengthened by 1264 read => feed constraints.
[2023-03-20 14:24:42] [INFO ] After 1860ms SMT Verify possible using 1264 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2023-03-20 14:24:43] [INFO ] Deduced a trap composed of 59 places in 1341 ms of which 2 ms to minimize.
[2023-03-20 14:24:44] [INFO ] Deduced a trap composed of 48 places in 1052 ms of which 1 ms to minimize.
[2023-03-20 14:24:45] [INFO ] Deduced a trap composed of 47 places in 827 ms of which 2 ms to minimize.
[2023-03-20 14:24:46] [INFO ] Deduced a trap composed of 43 places in 932 ms of which 0 ms to minimize.
[2023-03-20 14:24:47] [INFO ] Deduced a trap composed of 34 places in 880 ms of which 1 ms to minimize.
[2023-03-20 14:24:47] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 5580 ms
[2023-03-20 14:24:48] [INFO ] Deduced a trap composed of 52 places in 735 ms of which 1 ms to minimize.
[2023-03-20 14:24:48] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 878 ms
[2023-03-20 14:24:50] [INFO ] Deduced a trap composed of 33 places in 945 ms of which 1 ms to minimize.
[2023-03-20 14:24:51] [INFO ] Deduced a trap composed of 58 places in 970 ms of which 1 ms to minimize.
[2023-03-20 14:24:52] [INFO ] Deduced a trap composed of 50 places in 917 ms of which 1 ms to minimize.
[2023-03-20 14:24:53] [INFO ] Deduced a trap composed of 47 places in 978 ms of which 1 ms to minimize.
[2023-03-20 14:24:54] [INFO ] Deduced a trap composed of 48 places in 875 ms of which 1 ms to minimize.
[2023-03-20 14:24:54] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 5 trap constraints in 5187 ms
[2023-03-20 14:24:55] [INFO ] Deduced a trap composed of 35 places in 859 ms of which 1 ms to minimize.
[2023-03-20 14:24:56] [INFO ] Deduced a trap composed of 34 places in 788 ms of which 1 ms to minimize.
[2023-03-20 14:24:56] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 2 trap constraints in 1865 ms
[2023-03-20 14:24:58] [INFO ] Deduced a trap composed of 46 places in 827 ms of which 0 ms to minimize.
[2023-03-20 14:24:59] [INFO ] Deduced a trap composed of 47 places in 989 ms of which 1 ms to minimize.
[2023-03-20 14:25:00] [INFO ] Deduced a trap composed of 49 places in 921 ms of which 1 ms to minimize.
[2023-03-20 14:25:00] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 3187 ms
[2023-03-20 14:25:00] [INFO ] After 20139ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :4
Attempting to minimize the solution found.
Minimization took 969 ms.
[2023-03-20 14:25:01] [INFO ] After 23049ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :4
FORMULA StigmergyElection-PT-07b-ReachabilityCardinality-12 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA StigmergyElection-PT-07b-ReachabilityCardinality-09 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 6 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 89 ms.
Support contains 45 out of 246 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 246/246 places, 1835/1835 transitions.
Graph (trivial) has 151 edges and 246 vertex of which 24 / 246 are part of one of the 10 SCC in 1 ms
Free SCC test removed 14 places
Drop transitions removed 26 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 27 transitions.
Graph (complete) has 848 edges and 232 vertex of which 230 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.5 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 48 transitions
Trivial Post-agglo rules discarded 48 transitions
Performed 48 trivial Post agglomeration. Transition count delta: 48
Iterating post reduction 0 with 50 rules applied. Total rules applied 52 place count 230 transition count 1758
Reduce places removed 48 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 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 56 rules applied. Total rules applied 108 place count 182 transition count 1750
Reduce places removed 3 places and 0 transitions.
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Iterating post reduction 2 with 14 rules applied. Total rules applied 122 place count 179 transition count 1739
Reduce places removed 11 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 13 rules applied. Total rules applied 135 place count 168 transition count 1737
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 10 Pre rules applied. Total rules applied 135 place count 168 transition count 1727
Deduced a syphon composed of 10 places in 2 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 4 with 20 rules applied. Total rules applied 155 place count 158 transition count 1727
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 161 place count 152 transition count 1578
Iterating global reduction 4 with 6 rules applied. Total rules applied 167 place count 152 transition count 1578
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 168 place count 151 transition count 1576
Iterating global reduction 4 with 1 rules applied. Total rules applied 169 place count 151 transition count 1576
Performed 12 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 4 with 24 rules applied. Total rules applied 193 place count 139 transition count 1562
Drop transitions removed 1 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 198 place count 139 transition count 1557
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 201 place count 136 transition count 1537
Iterating global reduction 5 with 3 rules applied. Total rules applied 204 place count 136 transition count 1537
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 206 place count 135 transition count 1536
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 5 with 10 rules applied. Total rules applied 216 place count 130 transition count 1545
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 219 place count 130 transition count 1542
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 6 with 2 rules applied. Total rules applied 221 place count 130 transition count 1540
Free-agglomeration rule applied 14 times with reduction of 216 identical transitions.
Iterating global reduction 6 with 14 rules applied. Total rules applied 235 place count 130 transition count 1310
Reduce places removed 14 places and 0 transitions.
Ensure Unique test removed 420 transitions
Reduce isomorphic transitions removed 420 transitions.
Iterating post reduction 6 with 434 rules applied. Total rules applied 669 place count 116 transition count 890
Drop transitions removed 64 transitions
Redundant transition composition rules discarded 64 transitions
Iterating global reduction 7 with 64 rules applied. Total rules applied 733 place count 116 transition count 826
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 734 place count 116 transition count 826
Applied a total of 734 rules in 1153 ms. Remains 116 /246 variables (removed 130) and now considering 826/1835 (removed 1009) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1153 ms. Remains : 116/246 places, 826/1835 transitions.
Incomplete random walk after 10000 steps, including 413 resets, run finished after 298 ms. (steps per millisecond=33 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 57 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 60 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 60 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 63 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 535563 steps, run timeout after 3001 ms. (steps per millisecond=178 ) properties seen :{}
Probabilistic random walk after 535563 steps, saw 89106 distinct states, run finished after 3003 ms. (steps per millisecond=178 ) properties seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 826 rows 116 cols
[2023-03-20 14:25:06] [INFO ] Computed 8 place invariants in 9 ms
[2023-03-20 14:25:06] [INFO ] After 45ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-20 14:25:06] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2023-03-20 14:25:06] [INFO ] After 409ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-20 14:25:06] [INFO ] State equation strengthened by 658 read => feed constraints.
[2023-03-20 14:25:07] [INFO ] After 567ms SMT Verify possible using 658 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-20 14:25:07] [INFO ] Deduced a trap composed of 18 places in 352 ms of which 1 ms to minimize.
[2023-03-20 14:25:08] [INFO ] Deduced a trap composed of 15 places in 324 ms of which 1 ms to minimize.
[2023-03-20 14:25:08] [INFO ] Deduced a trap composed of 19 places in 309 ms of which 1 ms to minimize.
[2023-03-20 14:25:08] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1170 ms
[2023-03-20 14:25:09] [INFO ] Deduced a trap composed of 24 places in 405 ms of which 1 ms to minimize.
[2023-03-20 14:25:09] [INFO ] Deduced a trap composed of 18 places in 329 ms of which 1 ms to minimize.
[2023-03-20 14:25:09] [INFO ] Deduced a trap composed of 17 places in 329 ms of which 1 ms to minimize.
[2023-03-20 14:25:09] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1212 ms
[2023-03-20 14:25:10] [INFO ] Deduced a trap composed of 20 places in 307 ms of which 0 ms to minimize.
[2023-03-20 14:25:10] [INFO ] Deduced a trap composed of 20 places in 280 ms of which 0 ms to minimize.
[2023-03-20 14:25:10] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 689 ms
[2023-03-20 14:25:10] [INFO ] After 3928ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 285 ms.
[2023-03-20 14:25:11] [INFO ] After 4804ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 48 ms.
Support contains 45 out of 116 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 116/116 places, 826/826 transitions.
Applied a total of 0 rules in 115 ms. Remains 116 /116 variables (removed 0) and now considering 826/826 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 115 ms. Remains : 116/116 places, 826/826 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 116/116 places, 826/826 transitions.
Applied a total of 0 rules in 109 ms. Remains 116 /116 variables (removed 0) and now considering 826/826 (removed 0) transitions.
[2023-03-20 14:25:11] [INFO ] Invariant cache hit.
[2023-03-20 14:25:11] [INFO ] Implicit Places using invariants in 150 ms returned []
[2023-03-20 14:25:11] [INFO ] Invariant cache hit.
[2023-03-20 14:25:12] [INFO ] State equation strengthened by 658 read => feed constraints.
[2023-03-20 14:25:13] [INFO ] Implicit Places using invariants and state equation in 1399 ms returned []
Implicit Place search using SMT with State Equation took 1551 ms to find 0 implicit places.
[2023-03-20 14:25:13] [INFO ] Redundant transitions in 59 ms returned []
[2023-03-20 14:25:13] [INFO ] Invariant cache hit.
[2023-03-20 14:25:13] [INFO ] Dead Transitions using invariants and state equation in 491 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2226 ms. Remains : 116/116 places, 826/826 transitions.
Drop transitions removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 0 with 8 rules applied. Total rules applied 8 place count 116 transition count 818
Partial Free-agglomeration rule applied 8 times.
Drop transitions removed 8 transitions
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 116 transition count 818
Applied a total of 16 rules in 67 ms. Remains 116 /116 variables (removed 0) and now considering 818/826 (removed 8) transitions.
Running SMT prover for 4 properties.
[2023-03-20 14:25:13] [INFO ] Flow matrix only has 817 transitions (discarded 1 similar events)
// Phase 1: matrix 817 rows 116 cols
[2023-03-20 14:25:13] [INFO ] Computed 8 place invariants in 6 ms
[2023-03-20 14:25:13] [INFO ] After 50ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-20 14:25:13] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2023-03-20 14:25:14] [INFO ] After 461ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-20 14:25:14] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-20 14:25:14] [INFO ] After 244ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-20 14:25:14] [INFO ] After 565ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 238 ms.
[2023-03-20 14:25:15] [INFO ] After 1318ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
[2023-03-20 14:25:15] [INFO ] Export to MCC of 4 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 5 ms.
[2023-03-20 14:25:15] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 116 places, 826 transitions and 10068 arcs took 16 ms.
[2023-03-20 14:25:15] [INFO ] Flatten gal took : 281 ms
Total runtime 77076 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT StigmergyElection-PT-07b
BK_EXAMINATION: ReachabilityCardinality
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/376
ReachabilityCardinality

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

FORMULA StigmergyElection-PT-07b-ReachabilityCardinality-06 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA StigmergyElection-PT-07b-ReachabilityCardinality-08 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA StigmergyElection-PT-07b-ReachabilityCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

BK_STOP 1679322317870

--------------------
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/376/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/376/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/376/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: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 # 17 (type EXCL) for 0 StigmergyElection-PT-07b-ReachabilityCardinality-04
lola: time limit : 899 sec
lola: memory limit: 32 pages
lola: LAUNCH task # 13 (type FNDP) for 0 StigmergyElection-PT-07b-ReachabilityCardinality-04
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 14 (type EQUN) for 0 StigmergyElection-PT-07b-ReachabilityCardinality-04
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 16 (type SRCH) for 0 StigmergyElection-PT-07b-ReachabilityCardinality-04
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: FINISHED task # 17 (type EXCL) for StigmergyElection-PT-07b-ReachabilityCardinality-04
lola: result : true
lola: markings : 31
lola: fired transitions : 38
lola: time used : 0.000000
lola: memory pages used : 1
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: CANCELED task # 13 (type FNDP) for StigmergyElection-PT-07b-ReachabilityCardinality-04 (obsolete)
lola: CANCELED task # 14 (type EQUN) for StigmergyElection-PT-07b-ReachabilityCardinality-04 (obsolete)
lola: CANCELED task # 16 (type SRCH) for StigmergyElection-PT-07b-ReachabilityCardinality-04 (obsolete)
lola: FINISHED task # 13 (type FNDP) for StigmergyElection-PT-07b-ReachabilityCardinality-04
lola: result : true
lola: fired transitions : 14
lola: tried executions : 1
lola: time used : 0.000000
lola: memory pages used : 0
sara: try reading problem file /home/mcc/execution/376/ReachabilityCardinality-14.sara.
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 # 23 (type EXCL) for 3 StigmergyElection-PT-07b-ReachabilityCardinality-06
lola: time limit : 1199 sec
lola: memory limit: 32 pages
lola: LAUNCH task # 19 (type FNDP) for 3 StigmergyElection-PT-07b-ReachabilityCardinality-06
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 20 (type EQUN) for 3 StigmergyElection-PT-07b-ReachabilityCardinality-06
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 22 (type SRCH) for 3 StigmergyElection-PT-07b-ReachabilityCardinality-06
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: FINISHED task # 22 (type SRCH) for StigmergyElection-PT-07b-ReachabilityCardinality-06
lola: result : true
lola: markings : 12
lola: fired transitions : 11
lola: time used : 0.000000
lola: memory pages used : 1
lola: CANCELED task # 19 (type FNDP) for StigmergyElection-PT-07b-ReachabilityCardinality-06 (obsolete)
lola: CANCELED task # 20 (type EQUN) for StigmergyElection-PT-07b-ReachabilityCardinality-06 (obsolete)
lola: CANCELED task # 23 (type EXCL) for StigmergyElection-PT-07b-ReachabilityCardinality-06 (obsolete)
lola: FINISHED task # 19 (type FNDP) for StigmergyElection-PT-07b-ReachabilityCardinality-06
lola: result : true
lola: fired transitions : 10
lola: tried executions : 1
lola: time used : 0.000000
lola: memory pages used : 0
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 # 30 (type EXCL) for 6 StigmergyElection-PT-07b-ReachabilityCardinality-08
lola: time limit : 1799 sec
lola: memory limit: 32 pages
lola: LAUNCH task # 26 (type FNDP) for 6 StigmergyElection-PT-07b-ReachabilityCardinality-08
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 27 (type EQUN) for 6 StigmergyElection-PT-07b-ReachabilityCardinality-08
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 29 (type SRCH) for 6 StigmergyElection-PT-07b-ReachabilityCardinality-08
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: FINISHED task # 29 (type SRCH) for StigmergyElection-PT-07b-ReachabilityCardinality-08
lola: result : true
lola: markings : 16
lola: fired transitions : 15
lola: time used : 0.000000
lola: memory pages used : 1
lola: CANCELED task # 26 (type FNDP) for StigmergyElection-PT-07b-ReachabilityCardinality-08 (obsolete)
lola: CANCELED task # 27 (type EQUN) for StigmergyElection-PT-07b-ReachabilityCardinality-08 (obsolete)
lola: CANCELED task # 30 (type EXCL) for StigmergyElection-PT-07b-ReachabilityCardinality-08 (obsolete)
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: LAUNCH task # 37 (type EXCL) for 9 StigmergyElection-PT-07b-ReachabilityCardinality-13
lola: time limit : 3599 sec
lola: memory limit: 32 pages
lola: LAUNCH task # 33 (type FNDP) for 9 StigmergyElection-PT-07b-ReachabilityCardinality-13
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 34 (type EQUN) for 9 StigmergyElection-PT-07b-ReachabilityCardinality-13
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 36 (type SRCH) for 9 StigmergyElection-PT-07b-ReachabilityCardinality-13
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: FINISHED task # 26 (type FNDP) for StigmergyElection-PT-07b-ReachabilityCardinality-08
lola: result : true
lola: fired transitions : 14
lola: tried executions : 1
lola: time used : 0.000000
lola: memory pages used : 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
sara: try reading problem file /home/mcc/execution/376/ReachabilityCardinality-20.sara.
lola: FINISHED task # 36 (type SRCH) for StigmergyElection-PT-07b-ReachabilityCardinality-13
lola: result : true
lola: markings : 22
lola: fired transitions : 21
lola: time used : 0.000000
lola: memory pages used : 1
lola: CANCELED task # 33 (type FNDP) for StigmergyElection-PT-07b-ReachabilityCardinality-13 (obsolete)
lola: CANCELED task # 34 (type EQUN) for StigmergyElection-PT-07b-ReachabilityCardinality-13 (obsolete)
lola: CANCELED task # 37 (type EXCL) for StigmergyElection-PT-07b-ReachabilityCardinality-13 (obsolete)
lola: Portfolio finished: no open formulas

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
StigmergyElection-PT-07b-ReachabilityCardinality-04: AG false tandem / relaxed
StigmergyElection-PT-07b-ReachabilityCardinality-06: EF true tandem / insertion
StigmergyElection-PT-07b-ReachabilityCardinality-08: AG false tandem / insertion
StigmergyElection-PT-07b-ReachabilityCardinality-13: AG false tandem / insertion


Time elapsed: 1 secs. Pages in use: 2

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="StigmergyElection-PT-07b"
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-07b, 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-167912647700646"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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