Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r536-tall-171690531700133.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool ltsminxred
Input is StigmergyCommit-PT-04b, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r536-tall-171690531700133
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.0M
-rw-r--r-- 1 mcc users 7.5K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 81K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K May 19 07:17 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 19 16:41 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 19 07:34 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 19 19:21 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.0K Apr 11 17:53 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 77K Apr 11 17:53 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.7K Apr 11 17:53 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 74K Apr 11 17:53 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 23 07:58 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:58 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 627K May 18 16:43 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 StigmergyCommit-PT-04b-UpperBounds-00
FORMULA_NAME StigmergyCommit-PT-04b-UpperBounds-01
FORMULA_NAME StigmergyCommit-PT-04b-UpperBounds-02
FORMULA_NAME StigmergyCommit-PT-04b-UpperBounds-03
FORMULA_NAME StigmergyCommit-PT-04b-UpperBounds-04
FORMULA_NAME StigmergyCommit-PT-04b-UpperBounds-05
FORMULA_NAME StigmergyCommit-PT-04b-UpperBounds-06
FORMULA_NAME StigmergyCommit-PT-04b-UpperBounds-07
FORMULA_NAME StigmergyCommit-PT-04b-UpperBounds-08
FORMULA_NAME StigmergyCommit-PT-04b-UpperBounds-09
FORMULA_NAME StigmergyCommit-PT-04b-UpperBounds-10
FORMULA_NAME StigmergyCommit-PT-04b-UpperBounds-11
FORMULA_NAME StigmergyCommit-PT-04b-UpperBounds-12
FORMULA_NAME StigmergyCommit-PT-04b-UpperBounds-13
FORMULA_NAME StigmergyCommit-PT-04b-UpperBounds-14
FORMULA_NAME StigmergyCommit-PT-04b-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1717229934034

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=StigmergyCommit-PT-04b
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 08:18:55] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2024-06-01 08:18:55] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 08:18:55] [INFO ] Load time of PNML (sax parser for PT used): 155 ms
[2024-06-01 08:18:55] [INFO ] Transformed 1534 places.
[2024-06-01 08:18:55] [INFO ] Transformed 2136 transitions.
[2024-06-01 08:18:55] [INFO ] Found NUPN structural information;
[2024-06-01 08:18:55] [INFO ] Parsed PT model containing 1534 places and 2136 transitions and 8601 arcs in 269 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
Current structural bounds on expressions (Initiallly, because the net is safe) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
// Phase 1: matrix 2136 rows 1534 cols
[2024-06-01 08:18:55] [INFO ] Computed 6 invariants in 51 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
RANDOM walk for 10000 steps (106 resets) in 44 ms. (222 steps per ms)
FORMULA StigmergyCommit-PT-04b-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA StigmergyCommit-PT-04b-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA StigmergyCommit-PT-04b-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA StigmergyCommit-PT-04b-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA StigmergyCommit-PT-04b-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA StigmergyCommit-PT-04b-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 100009 steps (188 resets) in 96 ms. (1031 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-01 08:18:55] [INFO ] Invariant cache hit.
[2024-06-01 08:18:56] [INFO ] [Real]Absence check using 6 positive place invariants in 35 ms returned sat
[2024-06-01 08:18:56] [INFO ] [Real]Absence check using state equation in 715 ms returned sat
[2024-06-01 08:18:58] [INFO ] Deduced a trap composed of 397 places in 888 ms of which 81 ms to minimize.
[2024-06-01 08:18:58] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 08:18:58] [INFO ] [Nat]Absence check using 6 positive place invariants in 33 ms returned sat
[2024-06-01 08:18:59] [INFO ] [Nat]Absence check using state equation in 666 ms returned sat
[2024-06-01 08:18:59] [INFO ] Deduced a trap composed of 397 places in 659 ms of which 11 ms to minimize.
[2024-06-01 08:19:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 838 ms
[2024-06-01 08:19:00] [INFO ] Computed and/alt/rep : 2011/4310/2011 causal constraints (skipped 124 transitions) in 147 ms.
Maximisation of solution failed !
Minimization took 2 ms.
[2024-06-01 08:19:03] [INFO ] [Real]Absence check using 6 positive place invariants in 29 ms returned sat
[2024-06-01 08:19:04] [INFO ] [Real]Absence check using state equation in 621 ms returned sat
[2024-06-01 08:19:04] [INFO ] Deduced a trap composed of 297 places in 710 ms of which 18 ms to minimize.
[2024-06-01 08:19:05] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 08:19:05] [INFO ] [Nat]Absence check using 6 positive place invariants in 29 ms returned sat
[2024-06-01 08:19:05] [INFO ] [Nat]Absence check using state equation in 622 ms returned sat
[2024-06-01 08:19:06] [INFO ] Deduced a trap composed of 297 places in 613 ms of which 9 ms to minimize.
[2024-06-01 08:19:07] [INFO ] Deduced a trap composed of 397 places in 632 ms of which 9 ms to minimize.
[2024-06-01 08:19:07] [INFO ] Deduced a trap composed of 300 places in 608 ms of which 8 ms to minimize.
[2024-06-01 08:19:08] [INFO ] Deduced a trap composed of 489 places in 546 ms of which 7 ms to minimize.
[2024-06-01 08:19:08] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 2741 ms
[2024-06-01 08:19:08] [INFO ] Computed and/alt/rep : 2011/4310/2011 causal constraints (skipped 124 transitions) in 150 ms.
Maximisation of solution failed !
Minimization took 0 ms.
[2024-06-01 08:19:10] [INFO ] [Real]Absence check using 6 positive place invariants in 26 ms returned sat
[2024-06-01 08:19:10] [INFO ] [Real]Absence check using state equation in 539 ms returned sat
[2024-06-01 08:19:11] [INFO ] Deduced a trap composed of 398 places in 656 ms of which 10 ms to minimize.
[2024-06-01 08:19:11] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 08:19:12] [INFO ] [Nat]Absence check using 6 positive place invariants in 28 ms returned sat
[2024-06-01 08:19:12] [INFO ] [Nat]Absence check using state equation in 566 ms returned sat
[2024-06-01 08:19:13] [INFO ] Deduced a trap composed of 398 places in 665 ms of which 9 ms to minimize.
[2024-06-01 08:19:13] [INFO ] Deduced a trap composed of 399 places in 551 ms of which 8 ms to minimize.
[2024-06-01 08:19:14] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1438 ms
[2024-06-01 08:19:14] [INFO ] Computed and/alt/rep : 2011/4310/2011 causal constraints (skipped 124 transitions) in 105 ms.
[2024-06-01 08:19:16] [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 2
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:299)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1137)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:875)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2251)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
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:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2024-06-01 08:19:17] [INFO ] [Real]Absence check using 6 positive place invariants in 26 ms returned sat
[2024-06-01 08:19:17] [INFO ] [Real]Absence check using state equation in 581 ms returned sat
[2024-06-01 08:19:18] [INFO ] Deduced a trap composed of 491 places in 666 ms of which 9 ms to minimize.
[2024-06-01 08:19:18] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 08:19:18] [INFO ] [Nat]Absence check using 6 positive place invariants in 28 ms returned sat
[2024-06-01 08:19:19] [INFO ] [Nat]Absence check using state equation in 559 ms returned sat
[2024-06-01 08:19:20] [INFO ] Deduced a trap composed of 491 places in 627 ms of which 9 ms to minimize.
[2024-06-01 08:19:20] [INFO ] Deduced a trap composed of 396 places in 555 ms of which 7 ms to minimize.
[2024-06-01 08:19:21] [INFO ] Deduced a trap composed of 398 places in 541 ms of which 7 ms to minimize.
[2024-06-01 08:19:21] [INFO ] Deduced a trap composed of 403 places in 440 ms of which 6 ms to minimize.
[2024-06-01 08:19:21] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 2473 ms
[2024-06-01 08:19:21] [INFO ] Computed and/alt/rep : 2011/4310/2011 causal constraints (skipped 124 transitions) in 106 ms.
[2024-06-01 08:19:23] [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: Broken pipe ... 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: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:299)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1137)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:875)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2251)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
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:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2024-06-01 08:19:23] [INFO ] [Real]Absence check using 6 positive place invariants in 26 ms returned sat
[2024-06-01 08:19:24] [INFO ] [Real]Absence check using state equation in 610 ms returned sat
[2024-06-01 08:19:24] [INFO ] Computed and/alt/rep : 2011/4310/2011 causal constraints (skipped 124 transitions) in 117 ms.
[2024-06-01 08:19:26] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 08:19:26] [INFO ] [Nat]Absence check using 6 positive place invariants in 28 ms returned sat
[2024-06-01 08:19:27] [INFO ] [Nat]Absence check using state equation in 563 ms returned sat
[2024-06-01 08:19:27] [INFO ] Computed and/alt/rep : 2011/4310/2011 causal constraints (skipped 124 transitions) in 105 ms.
[2024-06-01 08:19:31] [INFO ] Added : 212 causal constraints over 43 iterations in 3901 ms. Result :sat
Minimization took 223 ms.
[2024-06-01 08:19:31] [INFO ] [Real]Absence check using 6 positive place invariants in 26 ms returned sat
[2024-06-01 08:19:32] [INFO ] [Real]Absence check using state equation in 594 ms returned sat
[2024-06-01 08:19:32] [INFO ] Deduced a trap composed of 397 places in 552 ms of which 8 ms to minimize.
[2024-06-01 08:19:33] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 08:19:33] [INFO ] [Nat]Absence check using 6 positive place invariants in 27 ms returned sat
[2024-06-01 08:19:33] [INFO ] [Nat]Absence check using state equation in 561 ms returned sat
[2024-06-01 08:19:34] [INFO ] Deduced a trap composed of 397 places in 543 ms of which 8 ms to minimize.
[2024-06-01 08:19:34] [INFO ] Deduced a trap composed of 399 places in 450 ms of which 7 ms to minimize.
[2024-06-01 08:19:35] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1179 ms
[2024-06-01 08:19:35] [INFO ] Computed and/alt/rep : 2011/4310/2011 causal constraints (skipped 124 transitions) in 125 ms.
[2024-06-01 08:19:38] [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:299)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1137)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:875)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2251)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
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:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2024-06-01 08:19:38] [INFO ] [Real]Absence check using 6 positive place invariants in 26 ms returned sat
[2024-06-01 08:19:38] [INFO ] [Real]Absence check using state equation in 560 ms returned sat
[2024-06-01 08:19:39] [INFO ] Deduced a trap composed of 397 places in 635 ms of which 9 ms to minimize.
[2024-06-01 08:19:39] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 08:19:40] [INFO ] [Nat]Absence check using 6 positive place invariants in 28 ms returned sat
[2024-06-01 08:19:40] [INFO ] [Nat]Absence check using state equation in 583 ms returned sat
[2024-06-01 08:19:41] [INFO ] Deduced a trap composed of 397 places in 644 ms of which 9 ms to minimize.
[2024-06-01 08:19:41] [INFO ] Deduced a trap composed of 424 places in 520 ms of which 8 ms to minimize.
[2024-06-01 08:19:41] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1359 ms
[2024-06-01 08:19:42] [INFO ] Computed and/alt/rep : 2011/4310/2011 causal constraints (skipped 124 transitions) in 119 ms.
[2024-06-01 08:19:44] [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:299)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1137)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:875)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2251)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
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:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2024-06-01 08:19:45] [INFO ] [Real]Absence check using 6 positive place invariants in 26 ms returned sat
[2024-06-01 08:19:45] [INFO ] [Real]Absence check using state equation in 596 ms returned sat
[2024-06-01 08:19:46] [INFO ] Deduced a trap composed of 487 places in 632 ms of which 9 ms to minimize.
[2024-06-01 08:19:46] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 08:19:46] [INFO ] [Nat]Absence check using 6 positive place invariants in 28 ms returned sat
[2024-06-01 08:19:47] [INFO ] [Nat]Absence check using state equation in 582 ms returned sat
[2024-06-01 08:19:47] [INFO ] Deduced a trap composed of 487 places in 646 ms of which 9 ms to minimize.
[2024-06-01 08:19:48] [INFO ] Deduced a trap composed of 399 places in 540 ms of which 7 ms to minimize.
[2024-06-01 08:19:48] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1373 ms
[2024-06-01 08:19:48] [INFO ] Computed and/alt/rep : 2011/4310/2011 causal constraints (skipped 124 transitions) in 108 ms.
Maximisation of solution failed !
Minimization took 1 ms.
[2024-06-01 08:19:51] [INFO ] [Real]Absence check using 6 positive place invariants in 35 ms returned sat
[2024-06-01 08:19:52] [INFO ] [Real]Absence check using state equation in 626 ms returned sat
[2024-06-01 08:19:53] [INFO ] Deduced a trap composed of 396 places in 695 ms of which 9 ms to minimize.
[2024-06-01 08:19:53] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 08:19:53] [INFO ] [Nat]Absence check using 6 positive place invariants in 32 ms returned sat
[2024-06-01 08:19:54] [INFO ] [Nat]Absence check using state equation in 609 ms returned sat
[2024-06-01 08:19:54] [INFO ] Deduced a trap composed of 396 places in 666 ms of which 8 ms to minimize.
[2024-06-01 08:19:55] [INFO ] Deduced a trap composed of 940 places in 634 ms of which 9 ms to minimize.
[2024-06-01 08:19:55] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1495 ms
[2024-06-01 08:19:55] [INFO ] Computed and/alt/rep : 2011/4310/2011 causal constraints (skipped 124 transitions) in 104 ms.
Maximisation of solution failed !
Minimization took 0 ms.
[2024-06-01 08:19:58] [INFO ] [Real]Absence check using 6 positive place invariants in 29 ms returned sat
[2024-06-01 08:19:59] [INFO ] [Real]Absence check using state equation in 574 ms returned sat
[2024-06-01 08:19:59] [INFO ] Deduced a trap composed of 462 places in 671 ms of which 9 ms to minimize.
[2024-06-01 08:20:00] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 08:20:00] [INFO ] [Nat]Absence check using 6 positive place invariants in 28 ms returned sat
[2024-06-01 08:20:00] [INFO ] [Nat]Absence check using state equation in 571 ms returned sat
[2024-06-01 08:20:01] [INFO ] Deduced a trap composed of 462 places in 651 ms of which 11 ms to minimize.
[2024-06-01 08:20:01] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 791 ms
[2024-06-01 08:20:01] [INFO ] Computed and/alt/rep : 2011/4310/2011 causal constraints (skipped 124 transitions) in 206 ms.
Maximisation of solution failed !
Minimization took 1 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
Support contains 10 out of 1534 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1534/1534 places, 2136/2136 transitions.
Graph (trivial) has 1504 edges and 1534 vertex of which 102 / 1534 are part of one of the 14 SCC in 9 ms
Free SCC test removed 88 places
Drop transitions (Empty/Sink Transition effects.) removed 112 transitions
Reduce isomorphic transitions removed 112 transitions.
Graph (complete) has 2164 edges and 1446 vertex of which 1438 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.13 ms
Discarding 8 places :
Also discarding 4 output transitions
Drop transitions (Output transitions of discarded places.) removed 4 transitions
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1140 transitions
Trivial Post-agglo rules discarded 1140 transitions
Performed 1140 trivial Post agglomeration. Transition count delta: 1140
Iterating post reduction 0 with 1143 rules applied. Total rules applied 1145 place count 1438 transition count 877
Reduce places removed 1140 places and 0 transitions.
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 1 with 1176 rules applied. Total rules applied 2321 place count 298 transition count 841
Reduce places removed 14 places and 0 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Iterating post reduction 2 with 20 rules applied. Total rules applied 2341 place count 284 transition count 835
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 2347 place count 278 transition count 835
Performed 48 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 48 Pre rules applied. Total rules applied 2347 place count 278 transition count 787
Deduced a syphon composed of 48 places in 1 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 4 with 96 rules applied. Total rules applied 2443 place count 230 transition count 787
Discarding 62 places :
Symmetric choice reduction at 4 with 62 rule applications. Total rules 2505 place count 168 transition count 725
Iterating global reduction 4 with 62 rules applied. Total rules applied 2567 place count 168 transition count 725
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 2567 place count 168 transition count 724
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 2569 place count 167 transition count 724
Discarding 34 places :
Symmetric choice reduction at 4 with 34 rule applications. Total rules 2603 place count 133 transition count 284
Iterating global reduction 4 with 34 rules applied. Total rules applied 2637 place count 133 transition count 284
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 4 with 15 rules applied. Total rules applied 2652 place count 133 transition count 269
Discarding 8 places :
Symmetric choice reduction at 5 with 8 rule applications. Total rules 2660 place count 125 transition count 261
Iterating global reduction 5 with 8 rules applied. Total rules applied 2668 place count 125 transition count 261
Discarding 8 places :
Symmetric choice reduction at 5 with 8 rule applications. Total rules 2676 place count 117 transition count 253
Iterating global reduction 5 with 8 rules applied. Total rules applied 2684 place count 117 transition count 253
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 2690 place count 117 transition count 247
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 6 with 34 rules applied. Total rules applied 2724 place count 100 transition count 230
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 2725 place count 100 transition count 229
Discarding 5 places :
Symmetric choice reduction at 7 with 5 rule applications. Total rules 2730 place count 95 transition count 224
Iterating global reduction 7 with 5 rules applied. Total rules applied 2735 place count 95 transition count 224
Discarding 5 places :
Symmetric choice reduction at 7 with 5 rule applications. Total rules 2740 place count 90 transition count 219
Iterating global reduction 7 with 5 rules applied. Total rules applied 2745 place count 90 transition count 219
Discarding 5 places :
Symmetric choice reduction at 7 with 5 rule applications. Total rules 2750 place count 85 transition count 214
Iterating global reduction 7 with 5 rules applied. Total rules applied 2755 place count 85 transition count 214
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -15
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 7 with 6 rules applied. Total rules applied 2761 place count 82 transition count 229
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 2762 place count 82 transition count 228
Free-agglomeration rule applied 31 times.
Iterating global reduction 7 with 31 rules applied. Total rules applied 2793 place count 82 transition count 197
Reduce places removed 31 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 7 with 48 rules applied. Total rules applied 2841 place count 51 transition count 180
Discarding 5 places :
Symmetric choice reduction at 8 with 5 rule applications. Total rules 2846 place count 46 transition count 175
Iterating global reduction 8 with 5 rules applied. Total rules applied 2851 place count 46 transition count 175
Drop transitions (Redundant composition of simpler transitions.) removed 38 transitions
Redundant transition composition rules discarded 38 transitions
Iterating global reduction 8 with 38 rules applied. Total rules applied 2889 place count 46 transition count 137
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 2891 place count 45 transition count 136
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 2893 place count 44 transition count 141
Partial Free-agglomeration rule applied 4 times.
Drop transitions (Partial Free agglomeration) removed 4 transitions
Iterating global reduction 8 with 4 rules applied. Total rules applied 2897 place count 44 transition count 141
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 8 with 2 rules applied. Total rules applied 2899 place count 44 transition count 139
Applied a total of 2899 rules in 409 ms. Remains 44 /1534 variables (removed 1490) and now considering 139/2136 (removed 1997) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 439 ms. Remains : 44/1534 places, 139/2136 transitions.
// Phase 1: matrix 139 rows 44 cols
[2024-06-01 08:20:05] [INFO ] Computed 5 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
RANDOM walk for 1000000 steps (2 resets) in 678 ms. (1472 steps per ms)
FORMULA StigmergyCommit-PT-04b-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA StigmergyCommit-PT-04b-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA StigmergyCommit-PT-04b-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA StigmergyCommit-PT-04b-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA StigmergyCommit-PT-04b-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA StigmergyCommit-PT-04b-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA StigmergyCommit-PT-04b-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA StigmergyCommit-PT-04b-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA StigmergyCommit-PT-04b-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 1000000 steps (2 resets) in 497 ms. (2008 steps per ms)
FORMULA StigmergyCommit-PT-04b-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Current structural bounds on expressions (after WALK) : Max Seen:[] Max Struct:[]
RANDOM walk for 0 steps (0 resets) in 5 ms. (0 steps per ms) remains 0/0 properties
Finished probabilistic random walk after 0 steps, run visited all 0 properties in 0 ms. (steps per millisecond=0 )
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[] Max Struct:[]
All properties solved without resorting to model-checking.
Total runtime 71530 ms.
ITS solved all properties within timeout

BK_STOP 1717230006858

--------------------
content from stderr:

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /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="StigmergyCommit-PT-04b"
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-5568"
echo " Executing tool ltsminxred"
echo " Input is StigmergyCommit-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 r536-tall-171690531700133"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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