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.r458-smll-167912650500581.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 marciexred
Input is StigmergyElection-PT-03b, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r458-smll-167912650500581
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 560K
-rw-r--r-- 1 mcc users 5.9K Feb 26 16:27 CTLCardinality.txt
-rw-r--r-- 1 mcc users 62K Feb 26 16:27 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K Feb 26 16:27 CTLFireability.txt
-rw-r--r-- 1 mcc users 61K Feb 26 16:27 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K 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 18K Feb 25 17:14 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 26 16:28 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 112K Feb 26 16:28 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.3K Feb 26 16:28 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 82K Feb 26 16:28 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 117K 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 positive values
NUM_VECTOR

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

=== Now, execution of the tool begins

BK_START 1679550894902

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=marciexred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=StigmergyElection-PT-03b
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-23 05:54:58] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-23 05:54:58] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-23 05:54:58] [INFO ] Load time of PNML (sax parser for PT used): 162 ms
[2023-03-23 05:54:58] [INFO ] Transformed 427 places.
[2023-03-23 05:54:58] [INFO ] Transformed 518 transitions.
[2023-03-23 05:54:58] [INFO ] Found NUPN structural information;
[2023-03-23 05:54:58] [INFO ] Parsed PT model containing 427 places and 518 transitions and 1323 arcs in 317 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 10 ms.
// Phase 1: matrix 518 rows 427 cols
[2023-03-23 05:54:58] [INFO ] Computed 4 place invariants in 47 ms
Incomplete random walk after 10000 steps, including 175 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 16) seen :6
FORMULA StigmergyElection-PT-03b-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyElection-PT-03b-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyElection-PT-03b-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyElection-PT-03b-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyElection-PT-03b-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyElection-PT-03b-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 42 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 40 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 10) seen :4
FORMULA StigmergyElection-PT-03b-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA StigmergyElection-PT-03b-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA StigmergyElection-PT-03b-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA StigmergyElection-PT-03b-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 42 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 36 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 6) seen :2
FORMULA StigmergyElection-PT-03b-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA StigmergyElection-PT-03b-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
[2023-03-23 05:54:58] [INFO ] Invariant cache hit.
[2023-03-23 05:54:59] [INFO ] [Real]Absence check using 4 positive place invariants in 15 ms returned sat
[2023-03-23 05:54:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 05:54:59] [INFO ] [Real]Absence check using state equation in 454 ms returned sat
[2023-03-23 05:54:59] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 05:54:59] [INFO ] [Nat]Absence check using 4 positive place invariants in 11 ms returned sat
[2023-03-23 05:55:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 05:55:00] [INFO ] [Nat]Absence check using state equation in 308 ms returned sat
[2023-03-23 05:55:00] [INFO ] Deduced a trap composed of 190 places in 287 ms of which 4 ms to minimize.
[2023-03-23 05:55:00] [INFO ] Deduced a trap composed of 191 places in 232 ms of which 1 ms to minimize.
[2023-03-23 05:55:00] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 649 ms
[2023-03-23 05:55:01] [INFO ] Computed and/alt/rep : 477/791/477 causal constraints (skipped 40 transitions) in 66 ms.
[2023-03-23 05:55:04] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 0
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.refineWithCausalOrder(DeadlockTester.java:1186)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
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-23 05:55:05] [INFO ] [Real]Absence check using 4 positive place invariants in 15 ms returned sat
[2023-03-23 05:55:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 05:55:05] [INFO ] [Real]Absence check using state equation in 312 ms returned sat
[2023-03-23 05:55:05] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 05:55:05] [INFO ] [Nat]Absence check using 4 positive place invariants in 16 ms returned sat
[2023-03-23 05:55:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 05:55:05] [INFO ] [Nat]Absence check using state equation in 292 ms returned sat
[2023-03-23 05:55:06] [INFO ] Deduced a trap composed of 190 places in 381 ms of which 3 ms to minimize.
[2023-03-23 05:55:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 465 ms
[2023-03-23 05:55:06] [INFO ] Computed and/alt/rep : 477/791/477 causal constraints (skipped 40 transitions) in 69 ms.
[2023-03-23 05:55:10] [INFO ] Deduced a trap composed of 190 places in 259 ms of which 2 ms to minimize.
[2023-03-23 05:55:10] [INFO ] Deduced a trap composed of 189 places in 192 ms of which 0 ms to minimize.
[2023-03-23 05:55:10] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 1
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.refineWithCausalOrder(DeadlockTester.java:1177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
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-23 05:55:10] [INFO ] [Real]Absence check using 4 positive place invariants in 10 ms returned sat
[2023-03-23 05:55:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 05:55:10] [INFO ] [Real]Absence check using state equation in 314 ms returned sat
[2023-03-23 05:55:10] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 05:55:11] [INFO ] [Nat]Absence check using 4 positive place invariants in 11 ms returned sat
[2023-03-23 05:55:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 05:55:11] [INFO ] [Nat]Absence check using state equation in 244 ms returned sat
[2023-03-23 05:55:11] [INFO ] Deduced a trap composed of 190 places in 232 ms of which 1 ms to minimize.
[2023-03-23 05:55:11] [INFO ] Deduced a trap composed of 190 places in 267 ms of which 1 ms to minimize.
[2023-03-23 05:55:11] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 583 ms
[2023-03-23 05:55:12] [INFO ] Computed and/alt/rep : 477/791/477 causal constraints (skipped 40 transitions) in 52 ms.
[2023-03-23 05:55:15] [INFO ] Added : 318 causal constraints over 64 iterations in 3614 ms. Result :sat
Minimization took 271 ms.
[2023-03-23 05:55:16] [INFO ] [Real]Absence check using 4 positive place invariants in 15 ms returned sat
[2023-03-23 05:55:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 05:55:16] [INFO ] [Real]Absence check using state equation in 294 ms returned sat
[2023-03-23 05:55:16] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 05:55:16] [INFO ] [Nat]Absence check using 4 positive place invariants in 16 ms returned sat
[2023-03-23 05:55:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 05:55:16] [INFO ] [Nat]Absence check using state equation in 287 ms returned sat
[2023-03-23 05:55:17] [INFO ] Deduced a trap composed of 241 places in 285 ms of which 3 ms to minimize.
[2023-03-23 05:55:17] [INFO ] Deduced a trap composed of 189 places in 217 ms of which 0 ms to minimize.
[2023-03-23 05:55:17] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 617 ms
[2023-03-23 05:55:17] [INFO ] Computed and/alt/rep : 477/791/477 causal constraints (skipped 40 transitions) in 37 ms.
[2023-03-23 05:55:21] [INFO ] Deduced a trap composed of 20 places in 381 ms of which 1 ms to minimize.
[2023-03-23 05:55:21] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 3
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.refineWithCausalOrder(DeadlockTester.java:1177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
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)
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1] Max seen :[0, 0, 0, 0]
FORMULA StigmergyElection-PT-03b-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 3 out of 427 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 427/427 places, 518/518 transitions.
Graph (trivial) has 429 edges and 427 vertex of which 63 / 427 are part of one of the 9 SCC in 9 ms
Free SCC test removed 54 places
Drop transitions removed 69 transitions
Reduce isomorphic transitions removed 69 transitions.
Graph (complete) has 579 edges and 373 vertex of which 367 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.3 ms
Discarding 6 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Drop transitions removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions removed 266 transitions
Trivial Post-agglo rules discarded 266 transitions
Performed 266 trivial Post agglomeration. Transition count delta: 266
Iterating post reduction 0 with 269 rules applied. Total rules applied 271 place count 367 transition count 177
Reduce places removed 266 places and 0 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Drop transitions removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 1 with 284 rules applied. Total rules applied 555 place count 101 transition count 159
Reduce places removed 9 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 11 rules applied. Total rules applied 566 place count 92 transition count 157
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 568 place count 90 transition count 157
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 7 Pre rules applied. Total rules applied 568 place count 90 transition count 150
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 582 place count 83 transition count 150
Discarding 25 places :
Symmetric choice reduction at 4 with 25 rule applications. Total rules 607 place count 58 transition count 125
Iterating global reduction 4 with 25 rules applied. Total rules applied 632 place count 58 transition count 125
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 632 place count 58 transition count 122
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 638 place count 55 transition count 122
Discarding 9 places :
Symmetric choice reduction at 4 with 9 rule applications. Total rules 647 place count 46 transition count 79
Iterating global reduction 4 with 9 rules applied. Total rules applied 656 place count 46 transition count 79
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 662 place count 46 transition count 73
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 5 with 14 rules applied. Total rules applied 676 place count 39 transition count 66
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 677 place count 39 transition count 65
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 679 place count 37 transition count 63
Iterating global reduction 6 with 2 rules applied. Total rules applied 681 place count 37 transition count 63
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 685 place count 35 transition count 65
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 6 with 4 rules applied. Total rules applied 689 place count 35 transition count 61
Free-agglomeration rule applied 17 times.
Iterating global reduction 6 with 17 rules applied. Total rules applied 706 place count 35 transition count 44
Reduce places removed 17 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 6 with 26 rules applied. Total rules applied 732 place count 18 transition count 35
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 735 place count 15 transition count 32
Iterating global reduction 7 with 3 rules applied. Total rules applied 738 place count 15 transition count 32
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 739 place count 15 transition count 31
Applied a total of 739 rules in 121 ms. Remains 15 /427 variables (removed 412) and now considering 31/518 (removed 487) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 121 ms. Remains : 15/427 places, 31/518 transitions.
// Phase 1: matrix 31 rows 15 cols
[2023-03-23 05:55:22] [INFO ] Computed 4 place invariants in 2 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 1270 ms. (steps per millisecond=787 ) properties (out of 3) seen :3
FORMULA StigmergyElection-PT-03b-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyElection-PT-03b-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyElection-PT-03b-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 25598 ms.
ITS solved all properties within timeout

BK_STOP 1679550931942

--------------------
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 UpperBounds -timeout 360 -rebuildPNML

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-03b"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="marciexred"
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 marciexred"
echo " Input is StigmergyElection-PT-03b, examination is UpperBounds"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r458-smll-167912650500581"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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