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.r457-smll-167912649500581.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 ltsminxred
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 r457-smll-167912649500581
=====================================================================

--------------------
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 1679542926447

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=ltsminxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=StigmergyElection-PT-03b
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-23 03:42:08] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-23 03:42:08] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-23 03:42:09] [INFO ] Load time of PNML (sax parser for PT used): 105 ms
[2023-03-23 03:42:09] [INFO ] Transformed 427 places.
[2023-03-23 03:42:09] [INFO ] Transformed 518 transitions.
[2023-03-23 03:42:09] [INFO ] Found NUPN structural information;
[2023-03-23 03:42:09] [INFO ] Parsed PT model containing 427 places and 518 transitions and 1323 arcs in 226 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
// Phase 1: matrix 518 rows 427 cols
[2023-03-23 03:42:09] [INFO ] Computed 4 place invariants in 35 ms
Incomplete random walk after 10000 steps, including 58 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 16) seen :7
FORMULA StigmergyElection-PT-03b-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyElection-PT-03b-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
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-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 40 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 9) seen :1
FORMULA StigmergyElection-PT-03b-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10000 steps, including 42 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 41 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 42 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 41 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 43 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 40 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 42 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 8) seen :0
[2023-03-23 03:42:09] [INFO ] Invariant cache hit.
[2023-03-23 03:42:09] [INFO ] [Real]Absence check using 4 positive place invariants in 14 ms returned sat
[2023-03-23 03:42:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 03:42:10] [INFO ] [Real]Absence check using state equation in 264 ms returned sat
[2023-03-23 03:42:10] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 03:42:10] [INFO ] [Nat]Absence check using 4 positive place invariants in 10 ms returned sat
[2023-03-23 03:42:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 03:42:10] [INFO ] [Nat]Absence check using state equation in 251 ms returned sat
[2023-03-23 03:42:10] [INFO ] Deduced a trap composed of 190 places in 239 ms of which 5 ms to minimize.
[2023-03-23 03:42:11] [INFO ] Deduced a trap composed of 191 places in 197 ms of which 1 ms to minimize.
[2023-03-23 03:42:11] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 533 ms
[2023-03-23 03:42:11] [INFO ] Computed and/alt/rep : 477/791/477 causal constraints (skipped 40 transitions) in 61 ms.
[2023-03-23 03:42:14] [INFO ] Deduced a trap composed of 190 places in 229 ms of which 1 ms to minimize.
[2023-03-23 03:42:14] [INFO ] Deduced a trap composed of 190 places in 167 ms of which 2 ms to minimize.
[2023-03-23 03:42:14] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 521 ms
[2023-03-23 03:42:14] [INFO ] Added : 379 causal constraints over 76 iterations in 3759 ms. Result :sat
Minimization took 173 ms.
[2023-03-23 03:42:15] [INFO ] [Real]Absence check using 4 positive place invariants in 10 ms returned sat
[2023-03-23 03:42:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 03:42:15] [INFO ] [Real]Absence check using state equation in 229 ms returned sat
[2023-03-23 03:42:15] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 03:42:15] [INFO ] [Nat]Absence check using 4 positive place invariants in 11 ms returned sat
[2023-03-23 03:42:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 03:42:15] [INFO ] [Nat]Absence check using state equation in 223 ms returned sat
[2023-03-23 03:42:16] [INFO ] Deduced a trap composed of 194 places in 190 ms of which 1 ms to minimize.
[2023-03-23 03:42:16] [INFO ] Deduced a trap composed of 191 places in 149 ms of which 1 ms to minimize.
[2023-03-23 03:42:16] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 406 ms
[2023-03-23 03:42:16] [INFO ] Computed and/alt/rep : 477/791/477 causal constraints (skipped 40 transitions) in 42 ms.
[2023-03-23 03:42:18] [INFO ] Deduced a trap composed of 190 places in 211 ms of which 1 ms to minimize.
[2023-03-23 03:42:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 284 ms
[2023-03-23 03:42:18] [INFO ] Added : 315 causal constraints over 63 iterations in 2654 ms. Result :sat
Minimization took 169 ms.
[2023-03-23 03:42:19] [INFO ] [Real]Absence check using 4 positive place invariants in 11 ms returned sat
[2023-03-23 03:42:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 03:42:19] [INFO ] [Real]Absence check using state equation in 226 ms returned sat
[2023-03-23 03:42:19] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 03:42:19] [INFO ] [Nat]Absence check using 4 positive place invariants in 11 ms returned sat
[2023-03-23 03:42:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 03:42:19] [INFO ] [Nat]Absence check using state equation in 213 ms returned sat
[2023-03-23 03:42:19] [INFO ] Deduced a trap composed of 189 places in 189 ms of which 1 ms to minimize.
[2023-03-23 03:42:20] [INFO ] Deduced a trap composed of 189 places in 148 ms of which 1 ms to minimize.
[2023-03-23 03:42:20] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 409 ms
[2023-03-23 03:42:20] [INFO ] Computed and/alt/rep : 477/791/477 causal constraints (skipped 40 transitions) in 38 ms.
[2023-03-23 03:42:22] [INFO ] Deduced a trap composed of 190 places in 148 ms of which 1 ms to minimize.
[2023-03-23 03:42:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 214 ms
[2023-03-23 03:42:22] [INFO ] Added : 285 causal constraints over 57 iterations in 2318 ms. Result :sat
Minimization took 144 ms.
[2023-03-23 03:42:22] [INFO ] [Real]Absence check using 4 positive place invariants in 9 ms returned sat
[2023-03-23 03:42:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 03:42:22] [INFO ] [Real]Absence check using state equation in 211 ms returned sat
[2023-03-23 03:42:23] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 03:42:23] [INFO ] [Nat]Absence check using 4 positive place invariants in 11 ms returned sat
[2023-03-23 03:42:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 03:42:23] [INFO ] [Nat]Absence check using state equation in 208 ms returned sat
[2023-03-23 03:42:23] [INFO ] Deduced a trap composed of 190 places in 178 ms of which 1 ms to minimize.
[2023-03-23 03:42:23] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 226 ms
[2023-03-23 03:42:23] [INFO ] Computed and/alt/rep : 477/791/477 causal constraints (skipped 40 transitions) in 33 ms.
[2023-03-23 03:42:26] [INFO ] Deduced a trap composed of 190 places in 204 ms of which 0 ms to minimize.
[2023-03-23 03:42:26] [INFO ] Deduced a trap composed of 189 places in 146 ms of which 0 ms to minimize.
[2023-03-23 03:42:26] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 456 ms
[2023-03-23 03:42:26] [INFO ] Added : 310 causal constraints over 63 iterations in 2869 ms. Result :sat
Minimization took 166 ms.
[2023-03-23 03:42:26] [INFO ] [Real]Absence check using 4 positive place invariants in 10 ms returned sat
[2023-03-23 03:42:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 03:42:26] [INFO ] [Real]Absence check using state equation in 211 ms returned sat
[2023-03-23 03:42:26] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 03:42:27] [INFO ] [Nat]Absence check using 4 positive place invariants in 11 ms returned sat
[2023-03-23 03:42:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 03:42:27] [INFO ] [Nat]Absence check using state equation in 215 ms returned sat
[2023-03-23 03:42:27] [INFO ] Deduced a trap composed of 194 places in 175 ms of which 1 ms to minimize.
[2023-03-23 03:42:27] [INFO ] Deduced a trap composed of 190 places in 137 ms of which 0 ms to minimize.
[2023-03-23 03:42:27] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 381 ms
[2023-03-23 03:42:27] [INFO ] Computed and/alt/rep : 477/791/477 causal constraints (skipped 40 transitions) in 33 ms.
[2023-03-23 03:42:29] [INFO ] Deduced a trap composed of 190 places in 122 ms of which 1 ms to minimize.
[2023-03-23 03:42:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 191 ms
[2023-03-23 03:42:30] [INFO ] Added : 291 causal constraints over 59 iterations in 2416 ms. Result :sat
Minimization took 136 ms.
[2023-03-23 03:42:30] [INFO ] [Real]Absence check using 4 positive place invariants in 10 ms returned sat
[2023-03-23 03:42:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 03:42:30] [INFO ] [Real]Absence check using state equation in 207 ms returned sat
[2023-03-23 03:42:30] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 03:42:30] [INFO ] [Nat]Absence check using 4 positive place invariants in 10 ms returned sat
[2023-03-23 03:42:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 03:42:30] [INFO ] [Nat]Absence check using state equation in 188 ms returned sat
[2023-03-23 03:42:31] [INFO ] Deduced a trap composed of 241 places in 189 ms of which 1 ms to minimize.
[2023-03-23 03:42:31] [INFO ] Deduced a trap composed of 189 places in 143 ms of which 1 ms to minimize.
[2023-03-23 03:42:31] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 413 ms
[2023-03-23 03:42:31] [INFO ] Computed and/alt/rep : 477/791/477 causal constraints (skipped 40 transitions) in 37 ms.
[2023-03-23 03:42:34] [INFO ] Added : 356 causal constraints over 72 iterations in 2802 ms. Result :sat
Minimization took 228 ms.
[2023-03-23 03:42:34] [INFO ] [Real]Absence check using 4 positive place invariants in 10 ms returned sat
[2023-03-23 03:42:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 03:42:34] [INFO ] [Real]Absence check using state equation in 194 ms returned sat
[2023-03-23 03:42:34] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 03:42:34] [INFO ] [Nat]Absence check using 4 positive place invariants in 10 ms returned sat
[2023-03-23 03:42:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 03:42:34] [INFO ] [Nat]Absence check using state equation in 187 ms returned sat
[2023-03-23 03:42:35] [INFO ] Deduced a trap composed of 189 places in 215 ms of which 0 ms to minimize.
[2023-03-23 03:42:35] [INFO ] Deduced a trap composed of 189 places in 163 ms of which 1 ms to minimize.
[2023-03-23 03:42:35] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 463 ms
[2023-03-23 03:42:35] [INFO ] Computed and/alt/rep : 477/791/477 causal constraints (skipped 40 transitions) in 41 ms.
[2023-03-23 03:42:39] [INFO ] Deduced a trap composed of 189 places in 316 ms of which 2 ms to minimize.
[2023-03-23 03:42:39] [INFO ] Deduced a trap composed of 190 places in 188 ms of which 1 ms to minimize.
[2023-03-23 03:42:39] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 673 ms
[2023-03-23 03:42:40] [INFO ] Deduced a trap composed of 20 places in 318 ms of which 0 ms to minimize.
[2023-03-23 03:42:40] [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 6
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 03:42:40] [INFO ] [Real]Absence check using 4 positive place invariants in 10 ms returned sat
[2023-03-23 03:42:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 03:42:40] [INFO ] [Real]Absence check using state equation in 186 ms returned sat
[2023-03-23 03:42:40] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 03:42:40] [INFO ] [Nat]Absence check using 4 positive place invariants in 12 ms returned sat
[2023-03-23 03:42:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 03:42:40] [INFO ] [Nat]Absence check using state equation in 312 ms returned sat
[2023-03-23 03:42:41] [INFO ] Deduced a trap composed of 189 places in 320 ms of which 1 ms to minimize.
[2023-03-23 03:42:41] [INFO ] Deduced a trap composed of 189 places in 232 ms of which 1 ms to minimize.
[2023-03-23 03:42:41] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 664 ms
[2023-03-23 03:42:41] [INFO ] Computed and/alt/rep : 477/791/477 causal constraints (skipped 40 transitions) in 54 ms.
[2023-03-23 03:42:45] [INFO ] Deduced a trap composed of 189 places in 315 ms of which 1 ms to minimize.
[2023-03-23 03:42:45] [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 7
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, 1, 1, 1, 1] Max seen :[0, 0, 0, 0, 0, 0, 0, 0]
FORMULA StigmergyElection-PT-03b-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA StigmergyElection-PT-03b-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA StigmergyElection-PT-03b-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA StigmergyElection-PT-03b-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA StigmergyElection-PT-03b-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA StigmergyElection-PT-03b-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 2 out of 427 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 427/427 places, 518/518 transitions.
Graph (trivial) has 431 edges and 427 vertex of which 63 / 427 are part of one of the 9 SCC in 8 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 268 transitions
Trivial Post-agglo rules discarded 268 transitions
Performed 268 trivial Post agglomeration. Transition count delta: 268
Iterating post reduction 0 with 271 rules applied. Total rules applied 273 place count 367 transition count 175
Reduce places removed 268 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 286 rules applied. Total rules applied 559 place count 99 transition count 157
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 570 place count 90 transition count 155
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 572 place count 88 transition count 155
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 6 Pre rules applied. Total rules applied 572 place count 88 transition count 149
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 584 place count 82 transition count 149
Discarding 26 places :
Symmetric choice reduction at 4 with 26 rule applications. Total rules 610 place count 56 transition count 123
Iterating global reduction 4 with 26 rules applied. Total rules applied 636 place count 56 transition count 123
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 636 place count 56 transition count 120
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 642 place count 53 transition count 120
Discarding 10 places :
Symmetric choice reduction at 4 with 10 rule applications. Total rules 652 place count 43 transition count 73
Iterating global reduction 4 with 10 rules applied. Total rules applied 662 place count 43 transition count 73
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 4 with 7 rules applied. Total rules applied 669 place count 43 transition count 66
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 5 with 14 rules applied. Total rules applied 683 place count 36 transition count 59
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 684 place count 36 transition count 58
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 686 place count 34 transition count 56
Iterating global reduction 6 with 2 rules applied. Total rules applied 688 place count 34 transition count 56
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 692 place count 32 transition count 58
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 6 with 4 rules applied. Total rules applied 696 place count 32 transition count 54
Free-agglomeration rule applied 16 times.
Iterating global reduction 6 with 16 rules applied. Total rules applied 712 place count 32 transition count 38
Reduce places removed 16 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 25 rules applied. Total rules applied 737 place count 16 transition count 29
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 740 place count 13 transition count 26
Iterating global reduction 7 with 3 rules applied. Total rules applied 743 place count 13 transition count 26
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 744 place count 13 transition count 25
Applied a total of 744 rules in 111 ms. Remains 13 /427 variables (removed 414) and now considering 25/518 (removed 493) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 112 ms. Remains : 13/427 places, 25/518 transitions.
// Phase 1: matrix 25 rows 13 cols
[2023-03-23 03:42:46] [INFO ] Computed 4 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 1139 ms. (steps per millisecond=877 ) properties (out of 2) seen :2
FORMULA StigmergyElection-PT-03b-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyElection-PT-03b-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 38954 ms.
ITS solved all properties within timeout

BK_STOP 1679542968926

--------------------
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="ltsminxred"
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 ltsminxred"
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 r457-smll-167912649500581"
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 ;