fond
Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r459-smll-167912651500597
Last Updated
May 14, 2023

About the Execution of Smart+red for StigmergyElection-PT-04b

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
354.348 67982.00 88852.00 415.00 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 normal

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-167912651500597.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-04b, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r459-smll-167912651500597
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 644K
-rw-r--r-- 1 mcc users 6.8K Feb 26 16:30 CTLCardinality.txt
-rw-r--r-- 1 mcc users 73K Feb 26 16:30 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Feb 26 16:29 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K Feb 26 16:29 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Feb 25 17:14 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K 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 11K Feb 26 16:31 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 109K Feb 26 16:31 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.1K Feb 26 16:30 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 69K 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 203K 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-04b-UpperBounds-00
FORMULA_NAME StigmergyElection-PT-04b-UpperBounds-01
FORMULA_NAME StigmergyElection-PT-04b-UpperBounds-02
FORMULA_NAME StigmergyElection-PT-04b-UpperBounds-03
FORMULA_NAME StigmergyElection-PT-04b-UpperBounds-04
FORMULA_NAME StigmergyElection-PT-04b-UpperBounds-05
FORMULA_NAME StigmergyElection-PT-04b-UpperBounds-06
FORMULA_NAME StigmergyElection-PT-04b-UpperBounds-07
FORMULA_NAME StigmergyElection-PT-04b-UpperBounds-08
FORMULA_NAME StigmergyElection-PT-04b-UpperBounds-09
FORMULA_NAME StigmergyElection-PT-04b-UpperBounds-10
FORMULA_NAME StigmergyElection-PT-04b-UpperBounds-11
FORMULA_NAME StigmergyElection-PT-04b-UpperBounds-12
FORMULA_NAME StigmergyElection-PT-04b-UpperBounds-13
FORMULA_NAME StigmergyElection-PT-04b-UpperBounds-14
FORMULA_NAME StigmergyElection-PT-04b-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1679434520225

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-04b
Applying reductions before tool smart
Invoking reducer
Running Version 202303021504
[2023-03-21 21:35:23] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-21 21:35:23] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-21 21:35:23] [INFO ] Load time of PNML (sax parser for PT used): 136 ms
[2023-03-21 21:35:23] [INFO ] Transformed 563 places.
[2023-03-21 21:35:23] [INFO ] Transformed 780 transitions.
[2023-03-21 21:35:23] [INFO ] Found NUPN structural information;
[2023-03-21 21:35:23] [INFO ] Parsed PT model containing 563 places and 780 transitions and 2680 arcs in 241 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 8 ms.
// Phase 1: matrix 780 rows 563 cols
[2023-03-21 21:35:23] [INFO ] Computed 5 place invariants in 41 ms
Incomplete random walk after 10000 steps, including 134 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 16) seen :6
FORMULA StigmergyElection-PT-04b-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyElection-PT-04b-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyElection-PT-04b-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyElection-PT-04b-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyElection-PT-04b-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyElection-PT-04b-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 27 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 28 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 26 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 28 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 29 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 27 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 28 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 28 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 27 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 28 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 10) seen :0
[2023-03-21 21:35:24] [INFO ] Invariant cache hit.
[2023-03-21 21:35:24] [INFO ] [Real]Absence check using 5 positive place invariants in 18 ms returned sat
[2023-03-21 21:35:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 21:35:25] [INFO ] [Real]Absence check using state equation in 528 ms returned sat
[2023-03-21 21:35:25] [INFO ] Solution in real domain found non-integer solution.
[2023-03-21 21:35:25] [INFO ] [Nat]Absence check using 5 positive place invariants in 21 ms returned sat
[2023-03-21 21:35:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-21 21:35:25] [INFO ] [Nat]Absence check using state equation in 467 ms returned sat
[2023-03-21 21:35:26] [INFO ] Deduced a trap composed of 192 places in 440 ms of which 7 ms to minimize.
[2023-03-21 21:35:26] [INFO ] Deduced a trap composed of 192 places in 320 ms of which 2 ms to minimize.
[2023-03-21 21:35:27] [INFO ] Deduced a trap composed of 191 places in 273 ms of which 2 ms to minimize.
[2023-03-21 21:35:27] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1293 ms
[2023-03-21 21:35:27] [INFO ] Computed and/alt/rep : 704/1384/704 causal constraints (skipped 75 transitions) in 111 ms.
[2023-03-21 21:35:30] [INFO ] Deduced a trap composed of 20 places in 650 ms of which 2 ms to minimize.
[2023-03-21 21:35:30] [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 21:35:31] [INFO ] [Real]Absence check using 5 positive place invariants in 14 ms returned sat
[2023-03-21 21:35:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 21:35:31] [INFO ] [Real]Absence check using state equation in 366 ms returned sat
[2023-03-21 21:35:31] [INFO ] Solution in real domain found non-integer solution.
[2023-03-21 21:35:31] [INFO ] [Nat]Absence check using 5 positive place invariants in 22 ms returned sat
[2023-03-21 21:35:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-21 21:35:32] [INFO ] [Nat]Absence check using state equation in 453 ms returned sat
[2023-03-21 21:35:32] [INFO ] Deduced a trap composed of 191 places in 503 ms of which 2 ms to minimize.
[2023-03-21 21:35:33] [INFO ] Deduced a trap composed of 218 places in 510 ms of which 1 ms to minimize.
[2023-03-21 21:35:33] [INFO ] Deduced a trap composed of 191 places in 440 ms of which 2 ms to minimize.
[2023-03-21 21:35:33] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1689 ms
[2023-03-21 21:35:33] [INFO ] Computed and/alt/rep : 704/1384/704 causal constraints (skipped 75 transitions) in 103 ms.
[2023-03-21 21:35:37] [INFO ] Deduced a trap composed of 20 places in 553 ms of which 3 ms to minimize.
[2023-03-21 21:35:37] [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 21:35:37] [INFO ] [Real]Absence check using 5 positive place invariants in 14 ms returned sat
[2023-03-21 21:35:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 21:35:37] [INFO ] [Real]Absence check using state equation in 293 ms returned sat
[2023-03-21 21:35:37] [INFO ] Solution in real domain found non-integer solution.
[2023-03-21 21:35:37] [INFO ] [Nat]Absence check using 5 positive place invariants in 22 ms returned sat
[2023-03-21 21:35:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-21 21:35:38] [INFO ] [Nat]Absence check using state equation in 455 ms returned sat
[2023-03-21 21:35:38] [INFO ] Deduced a trap composed of 190 places in 361 ms of which 1 ms to minimize.
[2023-03-21 21:35:38] [INFO ] Deduced a trap composed of 189 places in 312 ms of which 1 ms to minimize.
[2023-03-21 21:35:38] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 811 ms
[2023-03-21 21:35:39] [INFO ] Computed and/alt/rep : 704/1384/704 causal constraints (skipped 75 transitions) in 96 ms.
[2023-03-21 21:35:42] [INFO ] Added : 245 causal constraints over 49 iterations in 3550 ms. Result :unknown
[2023-03-21 21:35:42] [INFO ] [Real]Absence check using 5 positive place invariants in 21 ms returned sat
[2023-03-21 21:35:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 21:35:43] [INFO ] [Real]Absence check using state equation in 436 ms returned sat
[2023-03-21 21:35:43] [INFO ] Solution in real domain found non-integer solution.
[2023-03-21 21:35:43] [INFO ] [Nat]Absence check using 5 positive place invariants in 20 ms returned sat
[2023-03-21 21:35:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-21 21:35:43] [INFO ] [Nat]Absence check using state equation in 414 ms returned sat
[2023-03-21 21:35:44] [INFO ] Deduced a trap composed of 195 places in 418 ms of which 1 ms to minimize.
[2023-03-21 21:35:44] [INFO ] Deduced a trap composed of 193 places in 321 ms of which 1 ms to minimize.
[2023-03-21 21:35:45] [INFO ] Deduced a trap composed of 191 places in 324 ms of which 0 ms to minimize.
[2023-03-21 21:35:45] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1269 ms
[2023-03-21 21:35:45] [INFO ] Computed and/alt/rep : 704/1384/704 causal constraints (skipped 75 transitions) in 86 ms.
[2023-03-21 21:35:48] [INFO ] Deduced a trap composed of 20 places in 546 ms of which 2 ms to minimize.
[2023-03-21 21:35:48] [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 21:35:49] [INFO ] [Real]Absence check using 5 positive place invariants in 21 ms returned sat
[2023-03-21 21:35:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 21:35:49] [INFO ] [Real]Absence check using state equation in 445 ms returned sat
[2023-03-21 21:35:49] [INFO ] Solution in real domain found non-integer solution.
[2023-03-21 21:35:49] [INFO ] [Nat]Absence check using 5 positive place invariants in 21 ms returned sat
[2023-03-21 21:35:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-21 21:35:50] [INFO ] [Nat]Absence check using state equation in 446 ms returned sat
[2023-03-21 21:35:50] [INFO ] Deduced a trap composed of 244 places in 528 ms of which 2 ms to minimize.
[2023-03-21 21:35:51] [INFO ] Deduced a trap composed of 195 places in 436 ms of which 6 ms to minimize.
[2023-03-21 21:35:51] [INFO ] Deduced a trap composed of 189 places in 421 ms of which 1 ms to minimize.
[2023-03-21 21:35:52] [INFO ] Deduced a trap composed of 191 places in 328 ms of which 1 ms to minimize.
[2023-03-21 21:35:52] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1980 ms
[2023-03-21 21:35:52] [INFO ] Computed and/alt/rep : 704/1384/704 causal constraints (skipped 75 transitions) in 93 ms.
[2023-03-21 21:35:54] [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 21:35:54] [INFO ] [Real]Absence check using 5 positive place invariants in 20 ms returned sat
[2023-03-21 21:35:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 21:35:55] [INFO ] [Real]Absence check using state equation in 450 ms returned sat
[2023-03-21 21:35:55] [INFO ] Solution in real domain found non-integer solution.
[2023-03-21 21:35:55] [INFO ] [Nat]Absence check using 5 positive place invariants in 22 ms returned sat
[2023-03-21 21:35:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-21 21:35:55] [INFO ] [Nat]Absence check using state equation in 446 ms returned sat
[2023-03-21 21:35:56] [INFO ] Deduced a trap composed of 191 places in 541 ms of which 2 ms to minimize.
[2023-03-21 21:35:57] [INFO ] Deduced a trap composed of 191 places in 426 ms of which 1 ms to minimize.
[2023-03-21 21:35:57] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1106 ms
[2023-03-21 21:35:57] [INFO ] Computed and/alt/rep : 704/1384/704 causal constraints (skipped 75 transitions) in 94 ms.
[2023-03-21 21:36:00] [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 5
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 21:36:00] [INFO ] [Real]Absence check using 5 positive place invariants in 20 ms returned sat
[2023-03-21 21:36:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 21:36:00] [INFO ] [Real]Absence check using state equation in 436 ms returned sat
[2023-03-21 21:36:01] [INFO ] Solution in real domain found non-integer solution.
[2023-03-21 21:36:01] [INFO ] [Nat]Absence check using 5 positive place invariants in 21 ms returned sat
[2023-03-21 21:36:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-21 21:36:01] [INFO ] [Nat]Absence check using state equation in 422 ms returned sat
[2023-03-21 21:36:02] [INFO ] Deduced a trap composed of 189 places in 500 ms of which 1 ms to minimize.
[2023-03-21 21:36:02] [INFO ] Deduced a trap composed of 191 places in 385 ms of which 2 ms to minimize.
[2023-03-21 21:36:02] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1034 ms
[2023-03-21 21:36:02] [INFO ] Computed and/alt/rep : 704/1384/704 causal constraints (skipped 75 transitions) in 84 ms.
[2023-03-21 21:36:06] [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.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 21:36:06] [INFO ] [Real]Absence check using 5 positive place invariants in 21 ms returned sat
[2023-03-21 21:36:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 21:36:06] [INFO ] [Real]Absence check using state equation in 444 ms returned sat
[2023-03-21 21:36:06] [INFO ] Solution in real domain found non-integer solution.
[2023-03-21 21:36:06] [INFO ] [Nat]Absence check using 5 positive place invariants in 21 ms returned sat
[2023-03-21 21:36:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-21 21:36:07] [INFO ] [Nat]Absence check using state equation in 454 ms returned sat
[2023-03-21 21:36:08] [INFO ] Deduced a trap composed of 247 places in 536 ms of which 1 ms to minimize.
[2023-03-21 21:36:08] [INFO ] Deduced a trap composed of 246 places in 441 ms of which 1 ms to minimize.
[2023-03-21 21:36:09] [INFO ] Deduced a trap composed of 191 places in 442 ms of which 1 ms to minimize.
[2023-03-21 21:36:09] [INFO ] Deduced a trap composed of 207 places in 429 ms of which 1 ms to minimize.
[2023-03-21 21:36:09] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 2104 ms
[2023-03-21 21:36:09] [INFO ] Computed and/alt/rep : 704/1384/704 causal constraints (skipped 75 transitions) in 83 ms.
[2023-03-21 21:36:12] [INFO ] Deduced a trap composed of 20 places in 567 ms of which 2 ms to minimize.
[2023-03-21 21:36:12] [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)
[2023-03-21 21:36:12] [INFO ] [Real]Absence check using 5 positive place invariants in 21 ms returned sat
[2023-03-21 21:36:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 21:36:13] [INFO ] [Real]Absence check using state equation in 440 ms returned sat
[2023-03-21 21:36:13] [INFO ] Solution in real domain found non-integer solution.
[2023-03-21 21:36:13] [INFO ] [Nat]Absence check using 5 positive place invariants in 21 ms returned sat
[2023-03-21 21:36:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-21 21:36:13] [INFO ] [Nat]Absence check using state equation in 433 ms returned sat
[2023-03-21 21:36:14] [INFO ] Deduced a trap composed of 244 places in 515 ms of which 2 ms to minimize.
[2023-03-21 21:36:14] [INFO ] Deduced a trap composed of 195 places in 408 ms of which 2 ms to minimize.
[2023-03-21 21:36:15] [INFO ] Deduced a trap composed of 189 places in 430 ms of which 2 ms to minimize.
[2023-03-21 21:36:15] [INFO ] Deduced a trap composed of 191 places in 319 ms of which 1 ms to minimize.
[2023-03-21 21:36:15] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1931 ms
[2023-03-21 21:36:15] [INFO ] Computed and/alt/rep : 704/1384/704 causal constraints (skipped 75 transitions) in 83 ms.
[2023-03-21 21:36:18] [INFO ] Added : 160 causal constraints over 32 iterations in 2449 ms. Result :unknown
[2023-03-21 21:36:18] [INFO ] [Real]Absence check using 5 positive place invariants in 20 ms returned sat
[2023-03-21 21:36:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 21:36:18] [INFO ] [Real]Absence check using state equation in 443 ms returned sat
[2023-03-21 21:36:18] [INFO ] Solution in real domain found non-integer solution.
[2023-03-21 21:36:19] [INFO ] [Nat]Absence check using 5 positive place invariants in 22 ms returned sat
[2023-03-21 21:36:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-21 21:36:19] [INFO ] [Nat]Absence check using state equation in 406 ms returned sat
[2023-03-21 21:36:20] [INFO ] Deduced a trap composed of 191 places in 546 ms of which 1 ms to minimize.
[2023-03-21 21:36:20] [INFO ] Deduced a trap composed of 191 places in 503 ms of which 1 ms to minimize.
[2023-03-21 21:36:20] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1187 ms
[2023-03-21 21:36:20] [INFO ] Computed and/alt/rep : 704/1384/704 causal constraints (skipped 75 transitions) in 68 ms.
[2023-03-21 21:36:24] [INFO ] Deduced a trap composed of 20 places in 516 ms of which 2 ms to minimize.
[2023-03-21 21:36:24] [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 9
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, 1, 1] Max seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
FORMULA StigmergyElection-PT-04b-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA StigmergyElection-PT-04b-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 8 out of 563 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 563/563 places, 780/780 transitions.
Graph (trivial) has 558 edges and 563 vertex of which 70 / 563 are part of one of the 11 SCC in 10 ms
Free SCC test removed 59 places
Drop transitions removed 75 transitions
Reduce isomorphic transitions removed 75 transitions.
Graph (complete) has 870 edges and 504 vertex of which 496 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.7 ms
Discarding 8 places :
Also discarding 4 output transitions
Drop transitions removed 4 transitions
Drop transitions removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions removed 349 transitions
Trivial Post-agglo rules discarded 349 transitions
Performed 349 trivial Post agglomeration. Transition count delta: 349
Iterating post reduction 0 with 352 rules applied. Total rules applied 354 place count 496 transition count 349
Reduce places removed 349 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 1 with 365 rules applied. Total rules applied 719 place count 147 transition count 333
Reduce places removed 8 places and 0 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Iterating post reduction 2 with 15 rules applied. Total rules applied 734 place count 139 transition count 326
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 741 place count 132 transition count 326
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 12 Pre rules applied. Total rules applied 741 place count 132 transition count 314
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 4 with 24 rules applied. Total rules applied 765 place count 120 transition count 314
Discarding 30 places :
Symmetric choice reduction at 4 with 30 rule applications. Total rules 795 place count 90 transition count 284
Iterating global reduction 4 with 30 rules applied. Total rules applied 825 place count 90 transition count 284
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 825 place count 90 transition count 283
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 827 place count 89 transition count 283
Discarding 10 places :
Symmetric choice reduction at 4 with 10 rule applications. Total rules 837 place count 79 transition count 144
Iterating global reduction 4 with 10 rules applied. Total rules applied 847 place count 79 transition count 144
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 4 with 9 rules applied. Total rules applied 856 place count 79 transition count 135
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 5 with 34 rules applied. Total rules applied 890 place count 62 transition count 118
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 891 place count 62 transition count 117
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 894 place count 59 transition count 114
Iterating global reduction 6 with 3 rules applied. Total rules applied 897 place count 59 transition count 114
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 6 with 10 rules applied. Total rules applied 907 place count 54 transition count 123
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 909 place count 54 transition count 121
Drop transitions removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 7 with 9 rules applied. Total rules applied 918 place count 54 transition count 112
Free-agglomeration rule applied 21 times.
Iterating global reduction 7 with 21 rules applied. Total rules applied 939 place count 54 transition count 91
Reduce places removed 21 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 7 with 24 rules applied. Total rules applied 963 place count 33 transition count 88
Discarding 3 places :
Symmetric choice reduction at 8 with 3 rule applications. Total rules 966 place count 30 transition count 85
Iterating global reduction 8 with 3 rules applied. Total rules applied 969 place count 30 transition count 85
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 8 with 3 rules applied. Total rules applied 972 place count 30 transition count 82
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 9 with 3 rules applied. Total rules applied 975 place count 30 transition count 79
Applied a total of 975 rules in 220 ms. Remains 30 /563 variables (removed 533) and now considering 79/780 (removed 701) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 220 ms. Remains : 30/563 places, 79/780 transitions.
// Phase 1: matrix 79 rows 30 cols
[2023-03-21 21:36:25] [INFO ] Computed 4 place invariants in 3 ms
Incomplete random walk after 1000000 steps, including 15172 resets, run finished after 2306 ms. (steps per millisecond=433 ) properties (out of 8) seen :8
FORMULA StigmergyElection-PT-04b-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyElection-PT-04b-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyElection-PT-04b-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyElection-PT-04b-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyElection-PT-04b-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyElection-PT-04b-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyElection-PT-04b-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyElection-PT-04b-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 63895 ms.
ITS solved all properties within timeout

BK_STOP 1679434588207

--------------------
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-04b"
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-04b, 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-167912651500597"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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