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

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

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

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

The expected result is a vector of positive values
NUM_VECTOR

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

=== Now, execution of the tool begins

BK_START 1679436511338

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=smartxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=StigmergyElection-PT-05b
Applying reductions before tool smart
Invoking reducer
Running Version 202303021504
[2023-03-21 22:08:33] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-21 22:08:33] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-21 22:08:34] [INFO ] Load time of PNML (sax parser for PT used): 197 ms
[2023-03-21 22:08:34] [INFO ] Transformed 699 places.
[2023-03-21 22:08:34] [INFO ] Transformed 1266 transitions.
[2023-03-21 22:08:34] [INFO ] Found NUPN structural information;
[2023-03-21 22:08:34] [INFO ] Parsed PT model containing 699 places and 1266 transitions and 6741 arcs in 335 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 8 ms.
// Phase 1: matrix 1266 rows 699 cols
[2023-03-21 22:08:34] [INFO ] Computed 6 place invariants in 50 ms
Incomplete random walk after 10000 steps, including 111 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 16) seen :10
FORMULA StigmergyElection-PT-05b-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyElection-PT-05b-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyElection-PT-05b-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyElection-PT-05b-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyElection-PT-05b-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyElection-PT-05b-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyElection-PT-05b-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyElection-PT-05b-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyElection-PT-05b-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyElection-PT-05b-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 20 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 6) seen :0
[2023-03-21 22:08:34] [INFO ] Invariant cache hit.
[2023-03-21 22:08:35] [INFO ] [Real]Absence check using 6 positive place invariants in 22 ms returned sat
[2023-03-21 22:08:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 22:08:35] [INFO ] [Real]Absence check using state equation in 529 ms returned sat
[2023-03-21 22:08:35] [INFO ] Solution in real domain found non-integer solution.
[2023-03-21 22:08:35] [INFO ] [Nat]Absence check using 6 positive place invariants in 19 ms returned sat
[2023-03-21 22:08:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-21 22:08:36] [INFO ] [Nat]Absence check using state equation in 520 ms returned sat
[2023-03-21 22:08:37] [INFO ] Deduced a trap composed of 189 places in 596 ms of which 4 ms to minimize.
[2023-03-21 22:08:37] [INFO ] Deduced a trap composed of 189 places in 713 ms of which 2 ms to minimize.
[2023-03-21 22:08:38] [INFO ] Deduced a trap composed of 190 places in 666 ms of which 2 ms to minimize.
[2023-03-21 22:08:39] [INFO ] Deduced a trap composed of 189 places in 405 ms of which 2 ms to minimize.
[2023-03-21 22:08:39] [INFO ] Deduced a trap composed of 189 places in 477 ms of which 1 ms to minimize.
[2023-03-21 22:08:39] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 3202 ms
[2023-03-21 22:08:39] [INFO ] Computed and/alt/rep : 1141/3195/1141 causal constraints (skipped 124 transitions) in 147 ms.
[2023-03-21 22:08:41] [INFO ] Deduced a trap composed of 20 places in 889 ms of which 2 ms to minimize.
[2023-03-21 22:08:41] [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.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-21 22:08:41] [INFO ] [Real]Absence check using 6 positive place invariants in 16 ms returned sat
[2023-03-21 22:08:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 22:08:42] [INFO ] [Real]Absence check using state equation in 476 ms returned sat
[2023-03-21 22:08:42] [INFO ] Solution in real domain found non-integer solution.
[2023-03-21 22:08:42] [INFO ] [Nat]Absence check using 6 positive place invariants in 19 ms returned sat
[2023-03-21 22:08:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-21 22:08:42] [INFO ] [Nat]Absence check using state equation in 454 ms returned sat
[2023-03-21 22:08:43] [INFO ] Deduced a trap composed of 160 places in 603 ms of which 1 ms to minimize.
[2023-03-21 22:08:44] [INFO ] Deduced a trap composed of 189 places in 592 ms of which 1 ms to minimize.
[2023-03-21 22:08:44] [INFO ] Deduced a trap composed of 190 places in 524 ms of which 1 ms to minimize.
[2023-03-21 22:08:45] [INFO ] Deduced a trap composed of 189 places in 466 ms of which 2 ms to minimize.
[2023-03-21 22:08:45] [INFO ] Deduced a trap composed of 107 places in 571 ms of which 2 ms to minimize.
[2023-03-21 22:08:45] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 3052 ms
[2023-03-21 22:08:46] [INFO ] Computed and/alt/rep : 1141/3195/1141 causal constraints (skipped 124 transitions) in 128 ms.
[2023-03-21 22:08:47] [INFO ] Deduced a trap composed of 20 places in 603 ms of which 1 ms to minimize.
[2023-03-21 22:08:47] [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-21 22:08:48] [INFO ] [Real]Absence check using 6 positive place invariants in 17 ms returned sat
[2023-03-21 22:08:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 22:08:48] [INFO ] [Real]Absence check using state equation in 451 ms returned sat
[2023-03-21 22:08:48] [INFO ] Solution in real domain found non-integer solution.
[2023-03-21 22:08:48] [INFO ] [Nat]Absence check using 6 positive place invariants in 17 ms returned sat
[2023-03-21 22:08:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-21 22:08:49] [INFO ] [Nat]Absence check using state equation in 443 ms returned sat
[2023-03-21 22:08:49] [INFO ] Deduced a trap composed of 192 places in 486 ms of which 1 ms to minimize.
[2023-03-21 22:08:50] [INFO ] Deduced a trap composed of 192 places in 420 ms of which 1 ms to minimize.
[2023-03-21 22:08:50] [INFO ] Deduced a trap composed of 192 places in 346 ms of which 1 ms to minimize.
[2023-03-21 22:08:50] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1447 ms
[2023-03-21 22:08:50] [INFO ] Computed and/alt/rep : 1141/3195/1141 causal constraints (skipped 124 transitions) in 94 ms.
[2023-03-21 22:08:52] [INFO ] Added : 155 causal constraints over 31 iterations in 2222 ms. Result :sat
Minimization took 237 ms.
[2023-03-21 22:08:53] [INFO ] [Real]Absence check using 6 positive place invariants in 17 ms returned sat
[2023-03-21 22:08:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 22:08:53] [INFO ] [Real]Absence check using state equation in 453 ms returned sat
[2023-03-21 22:08:53] [INFO ] Solution in real domain found non-integer solution.
[2023-03-21 22:08:54] [INFO ] [Nat]Absence check using 6 positive place invariants in 28 ms returned sat
[2023-03-21 22:08:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-21 22:08:54] [INFO ] [Nat]Absence check using state equation in 602 ms returned sat
[2023-03-21 22:08:55] [INFO ] Deduced a trap composed of 244 places in 573 ms of which 1 ms to minimize.
[2023-03-21 22:08:55] [INFO ] Deduced a trap composed of 192 places in 473 ms of which 1 ms to minimize.
[2023-03-21 22:08:55] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1259 ms
[2023-03-21 22:08:56] [INFO ] Computed and/alt/rep : 1141/3195/1141 causal constraints (skipped 124 transitions) in 130 ms.
[2023-03-21 22:08:59] [INFO ] Deduced a trap composed of 20 places in 603 ms of which 1 ms to minimize.
[2023-03-21 22:08:59] [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)
[2023-03-21 22:08:59] [INFO ] [Real]Absence check using 6 positive place invariants in 16 ms returned sat
[2023-03-21 22:08:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 22:09:00] [INFO ] [Real]Absence check using state equation in 448 ms returned sat
[2023-03-21 22:09:00] [INFO ] Solution in real domain found non-integer solution.
[2023-03-21 22:09:00] [INFO ] [Nat]Absence check using 6 positive place invariants in 27 ms returned sat
[2023-03-21 22:09:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-21 22:09:00] [INFO ] [Nat]Absence check using state equation in 599 ms returned sat
[2023-03-21 22:09:01] [INFO ] Deduced a trap composed of 190 places in 528 ms of which 1 ms to minimize.
[2023-03-21 22:09:02] [INFO ] Deduced a trap composed of 190 places in 490 ms of which 1 ms to minimize.
[2023-03-21 22:09:02] [INFO ] Deduced a trap composed of 190 places in 430 ms of which 1 ms to minimize.
[2023-03-21 22:09:02] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1747 ms
[2023-03-21 22:09:02] [INFO ] Computed and/alt/rep : 1141/3195/1141 causal constraints (skipped 124 transitions) in 112 ms.
[2023-03-21 22:09:05] [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 4
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-21 22:09:05] [INFO ] [Real]Absence check using 6 positive place invariants in 27 ms returned sat
[2023-03-21 22:09:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 22:09:05] [INFO ] [Real]Absence check using state equation in 581 ms returned sat
[2023-03-21 22:09:05] [INFO ] Solution in real domain found non-integer solution.
[2023-03-21 22:09:06] [INFO ] [Nat]Absence check using 6 positive place invariants in 16 ms returned sat
[2023-03-21 22:09:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-21 22:09:06] [INFO ] [Nat]Absence check using state equation in 510 ms returned sat
[2023-03-21 22:09:07] [INFO ] Deduced a trap composed of 190 places in 589 ms of which 1 ms to minimize.
[2023-03-21 22:09:08] [INFO ] Deduced a trap composed of 190 places in 659 ms of which 2 ms to minimize.
[2023-03-21 22:09:08] [INFO ] Deduced a trap composed of 190 places in 422 ms of which 1 ms to minimize.
[2023-03-21 22:09:08] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1905 ms
[2023-03-21 22:09:08] [INFO ] Computed and/alt/rep : 1141/3195/1141 causal constraints (skipped 124 transitions) in 88 ms.
[2023-03-21 22:09:10] [INFO ] Added : 157 causal constraints over 32 iterations in 2272 ms. Result :sat
Minimization took 152 ms.
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 1, 1] Max seen :[0, 0, 0, 0, 0, 0]
FORMULA StigmergyElection-PT-05b-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 5 out of 699 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 699/699 places, 1266/1266 transitions.
Graph (trivial) has 703 edges and 699 vertex of which 90 / 699 are part of one of the 14 SCC in 12 ms
Free SCC test removed 76 places
Drop transitions removed 97 transitions
Reduce isomorphic transitions removed 97 transitions.
Graph (complete) has 1189 edges and 623 vertex of which 613 are kept as prefixes of interest. Removing 10 places using SCC suffix rule.16 ms
Discarding 10 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 446 transitions
Trivial Post-agglo rules discarded 446 transitions
Performed 446 trivial Post agglomeration. Transition count delta: 446
Iterating post reduction 0 with 451 rules applied. Total rules applied 453 place count 613 transition count 713
Reduce places removed 446 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Drop transitions removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 1 with 470 rules applied. Total rules applied 923 place count 167 transition count 689
Reduce places removed 12 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 13 rules applied. Total rules applied 936 place count 155 transition count 688
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 937 place count 154 transition count 688
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 13 Pre rules applied. Total rules applied 937 place count 154 transition count 675
Deduced a syphon composed of 13 places in 2 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 4 with 26 rules applied. Total rules applied 963 place count 141 transition count 675
Discarding 40 places :
Symmetric choice reduction at 4 with 40 rule applications. Total rules 1003 place count 101 transition count 635
Iterating global reduction 4 with 40 rules applied. Total rules applied 1043 place count 101 transition count 635
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 4 Pre rules applied. Total rules applied 1043 place count 101 transition count 631
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 1051 place count 97 transition count 631
Discarding 14 places :
Symmetric choice reduction at 4 with 14 rule applications. Total rules 1065 place count 83 transition count 196
Iterating global reduction 4 with 14 rules applied. Total rules applied 1079 place count 83 transition count 196
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 4 with 11 rules applied. Total rules applied 1090 place count 83 transition count 185
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 5 with 30 rules applied. Total rules applied 1120 place count 68 transition count 170
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 1121 place count 68 transition count 169
Discarding 5 places :
Symmetric choice reduction at 6 with 5 rule applications. Total rules 1126 place count 63 transition count 164
Iterating global reduction 6 with 5 rules applied. Total rules applied 1131 place count 63 transition count 164
Performed 7 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 6 with 14 rules applied. Total rules applied 1145 place count 56 transition count 171
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 1146 place count 56 transition count 170
Drop transitions removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 7 with 8 rules applied. Total rules applied 1154 place count 56 transition count 162
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 1156 place count 55 transition count 168
Drop transitions removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 7 with 8 rules applied. Total rules applied 1164 place count 55 transition count 160
Free-agglomeration rule applied 26 times.
Iterating global reduction 7 with 26 rules applied. Total rules applied 1190 place count 55 transition count 134
Reduce places removed 26 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 7 with 35 rules applied. Total rules applied 1225 place count 29 transition count 125
Discarding 4 places :
Symmetric choice reduction at 8 with 4 rule applications. Total rules 1229 place count 25 transition count 121
Iterating global reduction 8 with 4 rules applied. Total rules applied 1233 place count 25 transition count 121
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 8 with 15 rules applied. Total rules applied 1248 place count 25 transition count 106
Applied a total of 1248 rules in 331 ms. Remains 25 /699 variables (removed 674) and now considering 106/1266 (removed 1160) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 331 ms. Remains : 25/699 places, 106/1266 transitions.
// Phase 1: matrix 106 rows 25 cols
[2023-03-21 22:09:11] [INFO ] Computed 6 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 3714 ms. (steps per millisecond=269 ) properties (out of 5) seen :5
FORMULA StigmergyElection-PT-05b-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyElection-PT-05b-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyElection-PT-05b-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyElection-PT-05b-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyElection-PT-05b-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 41296 ms.
ITS solved all properties within timeout

BK_STOP 1679436556014

--------------------
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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ 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-05b"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="smartxred"
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 smartxred"
echo " Input is StigmergyElection-PT-05b, 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 r459-smll-167912651500613"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/StigmergyElection-PT-05b.tgz
mv StigmergyElection-PT-05b execution
cd execution
if [ "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 ;