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.r400-tall-171690532200381.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 itstools
Input is StigmergyElection-PT-10a, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r400-tall-171690532200381
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 51M
-rw-r--r-- 1 mcc users 7.8K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 89K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Apr 23 08:00 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 23 08:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Apr 23 08:00 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Apr 23 08:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 11 19:58 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 117K Apr 11 19:58 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.5K Apr 11 19:27 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 47K Apr 11 19:27 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 23 08:00 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 23 08:00 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 50M 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 StigmergyElection-PT-10a-UpperBounds-00
FORMULA_NAME StigmergyElection-PT-10a-UpperBounds-01
FORMULA_NAME StigmergyElection-PT-10a-UpperBounds-02
FORMULA_NAME StigmergyElection-PT-10a-UpperBounds-03
FORMULA_NAME StigmergyElection-PT-10a-UpperBounds-04
FORMULA_NAME StigmergyElection-PT-10a-UpperBounds-05
FORMULA_NAME StigmergyElection-PT-10a-UpperBounds-06
FORMULA_NAME StigmergyElection-PT-10a-UpperBounds-07
FORMULA_NAME StigmergyElection-PT-10a-UpperBounds-08
FORMULA_NAME StigmergyElection-PT-10a-UpperBounds-09
FORMULA_NAME StigmergyElection-PT-10a-UpperBounds-10
FORMULA_NAME StigmergyElection-PT-10a-UpperBounds-11
FORMULA_NAME StigmergyElection-PT-10a-UpperBounds-12
FORMULA_NAME StigmergyElection-PT-10a-UpperBounds-13
FORMULA_NAME StigmergyElection-PT-10a-UpperBounds-14
FORMULA_NAME StigmergyElection-PT-10a-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1717016728310

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=StigmergyElection-PT-10a
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202405141337
[2024-05-29 21:05:29] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-29 21:05:29] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-29 21:05:31] [INFO ] Load time of PNML (sax parser for PT used): 1911 ms
[2024-05-29 21:05:31] [INFO ] Transformed 142 places.
[2024-05-29 21:05:31] [INFO ] Transformed 50162 transitions.
[2024-05-29 21:05:31] [INFO ] Found NUPN structural information;
[2024-05-29 21:05:31] [INFO ] Parsed PT model containing 142 places and 50162 transitions and 999212 arcs in 2405 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 9 ms.
Ensure Unique test removed 47924 transitions
Reduce redundant transitions removed 47924 transitions.
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]
[2024-05-29 21:05:32] [INFO ] Flow matrix only has 2208 transitions (discarded 30 similar events)
// Phase 1: matrix 2208 rows 142 cols
[2024-05-29 21:05:32] [INFO ] Computed 11 invariants in 32 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 (2 resets) in 1045 ms. (9 steps per ms)
FORMULA StigmergyElection-PT-10a-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA StigmergyElection-PT-10a-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA StigmergyElection-PT-10a-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA StigmergyElection-PT-10a-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA StigmergyElection-PT-10a-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA StigmergyElection-PT-10a-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA StigmergyElection-PT-10a-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA StigmergyElection-PT-10a-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA StigmergyElection-PT-10a-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA StigmergyElection-PT-10a-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA StigmergyElection-PT-10a-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 50005 steps (10 resets) in 70 ms. (704 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1]
[2024-05-29 21:05:33] [INFO ] Flow matrix only has 2208 transitions (discarded 30 similar events)
[2024-05-29 21:05:33] [INFO ] Invariant cache hit.
[2024-05-29 21:05:33] [INFO ] [Real]Absence check using 11 positive place invariants in 10 ms returned sat
[2024-05-29 21:05:34] [INFO ] [Real]Absence check using state equation in 440 ms returned sat
[2024-05-29 21:05:34] [INFO ] State equation strengthened by 2095 read => feed constraints.
[2024-05-29 21:05:34] [INFO ] [Real]Added 2095 Read/Feed constraints in 242 ms returned sat
[2024-05-29 21:05:34] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 21:05:34] [INFO ] [Nat]Absence check using 11 positive place invariants in 4 ms returned sat
[2024-05-29 21:05:35] [INFO ] [Nat]Absence check using state equation in 381 ms returned sat
[2024-05-29 21:05:35] [INFO ] [Nat]Added 2095 Read/Feed constraints in 268 ms returned sat
[2024-05-29 21:05:36] [INFO ] Deduced a trap composed of 14 places in 774 ms of which 16 ms to minimize.
[2024-05-29 21:05:36] [INFO ] Deduced a trap composed of 15 places in 628 ms of which 1 ms to minimize.
[2024-05-29 21:05:37] [INFO ] Deduced a trap composed of 13 places in 523 ms of which 2 ms to minimize.
[2024-05-29 21:05:37] [INFO ] Deduced a trap composed of 13 places in 430 ms of which 2 ms to minimize.
[2024-05-29 21:05:38] [INFO ] Deduced a trap composed of 12 places in 470 ms of which 1 ms to minimize.
[2024-05-29 21:05:38] [INFO ] Deduced a trap composed of 12 places in 360 ms of which 1 ms to minimize.
[2024-05-29 21:05:39] [INFO ] Deduced a trap composed of 12 places in 293 ms of which 1 ms to minimize.
[2024-05-29 21:05:39] [INFO ] Deduced a trap composed of 12 places in 235 ms of which 2 ms to minimize.
[2024-05-29 21:05:39] [INFO ] Deduced a trap composed of 12 places in 161 ms of which 2 ms to minimize.
[2024-05-29 21:05:39] [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:299)
at fr.lip6.move.gal.structural.smt.SMTTrapUtils.refineWithTraps(SMTTrapUtils.java:177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:868)
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-05-29 21:05:39] [INFO ] [Real]Absence check using 11 positive place invariants in 4 ms returned sat
[2024-05-29 21:05:40] [INFO ] [Real]Absence check using state equation in 373 ms returned sat
[2024-05-29 21:05:40] [INFO ] [Real]Added 2095 Read/Feed constraints in 207 ms returned sat
[2024-05-29 21:05:40] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 21:05:40] [INFO ] [Nat]Absence check using 11 positive place invariants in 4 ms returned sat
[2024-05-29 21:05:40] [INFO ] [Nat]Absence check using state equation in 342 ms returned sat
[2024-05-29 21:05:41] [INFO ] [Nat]Added 2095 Read/Feed constraints in 277 ms returned sat
[2024-05-29 21:05:41] [INFO ] Deduced a trap composed of 15 places in 633 ms of which 1 ms to minimize.
[2024-05-29 21:05:42] [INFO ] Deduced a trap composed of 13 places in 518 ms of which 1 ms to minimize.
[2024-05-29 21:05:42] [INFO ] Deduced a trap composed of 13 places in 438 ms of which 1 ms to minimize.
[2024-05-29 21:05:43] [INFO ] Deduced a trap composed of 13 places in 367 ms of which 1 ms to minimize.
[2024-05-29 21:05:43] [INFO ] Deduced a trap composed of 15 places in 329 ms of which 1 ms to minimize.
[2024-05-29 21:05:44] [INFO ] Deduced a trap composed of 13 places in 335 ms of which 1 ms to minimize.
[2024-05-29 21:05:44] [INFO ] Deduced a trap composed of 12 places in 317 ms of which 1 ms to minimize.
[2024-05-29 21:05:44] [INFO ] Deduced a trap composed of 13 places in 315 ms of which 1 ms to minimize.
[2024-05-29 21:05:45] [INFO ] Deduced a trap composed of 13 places in 358 ms of which 1 ms to minimize.
[2024-05-29 21:05:45] [INFO ] Deduced a trap composed of 13 places in 319 ms of which 1 ms to minimize.
[2024-05-29 21:05:45] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 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:299)
at fr.lip6.move.gal.structural.smt.SMTTrapUtils.refineWithTraps(SMTTrapUtils.java:177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:868)
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-05-29 21:05:45] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2024-05-29 21:05:46] [INFO ] [Real]Absence check using state equation in 362 ms returned sat
[2024-05-29 21:05:46] [INFO ] [Real]Added 2095 Read/Feed constraints in 216 ms returned sat
[2024-05-29 21:05:46] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 21:05:46] [INFO ] [Nat]Absence check using 11 positive place invariants in 6 ms returned sat
[2024-05-29 21:05:46] [INFO ] [Nat]Absence check using state equation in 376 ms returned sat
[2024-05-29 21:05:47] [INFO ] [Nat]Added 2095 Read/Feed constraints in 275 ms returned sat
[2024-05-29 21:05:47] [INFO ] Deduced a trap composed of 14 places in 694 ms of which 2 ms to minimize.
[2024-05-29 21:05:48] [INFO ] Deduced a trap composed of 13 places in 566 ms of which 1 ms to minimize.
[2024-05-29 21:05:49] [INFO ] Deduced a trap composed of 14 places in 487 ms of which 2 ms to minimize.
[2024-05-29 21:05:49] [INFO ] Deduced a trap composed of 12 places in 410 ms of which 1 ms to minimize.
[2024-05-29 21:05:49] [INFO ] Deduced a trap composed of 12 places in 356 ms of which 1 ms to minimize.
[2024-05-29 21:05:50] [INFO ] Deduced a trap composed of 13 places in 288 ms of which 1 ms to minimize.
[2024-05-29 21:05:50] [INFO ] Deduced a trap composed of 13 places in 290 ms of which 0 ms to minimize.
[2024-05-29 21:05:50] [INFO ] Deduced a trap composed of 12 places in 235 ms of which 1 ms to minimize.
[2024-05-29 21:05:51] [INFO ] Deduced a trap composed of 12 places in 278 ms of which 1 ms to minimize.
[2024-05-29 21:05:51] [INFO ] Deduced a trap composed of 13 places in 233 ms of which 0 ms to minimize.
[2024-05-29 21:05:51] [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.SMTTrapUtils.refineWithTraps(SMTTrapUtils.java:177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:868)
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-05-29 21:05:51] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2024-05-29 21:05:52] [INFO ] [Real]Absence check using state equation in 364 ms returned sat
[2024-05-29 21:05:52] [INFO ] [Real]Added 2095 Read/Feed constraints in 208 ms returned sat
[2024-05-29 21:05:52] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 21:05:52] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2024-05-29 21:05:52] [INFO ] [Nat]Absence check using state equation in 359 ms returned sat
[2024-05-29 21:05:52] [INFO ] [Nat]Added 2095 Read/Feed constraints in 253 ms returned sat
[2024-05-29 21:05:53] [INFO ] Deduced a trap composed of 14 places in 637 ms of which 1 ms to minimize.
[2024-05-29 21:05:54] [INFO ] Deduced a trap composed of 14 places in 564 ms of which 1 ms to minimize.
[2024-05-29 21:05:54] [INFO ] Deduced a trap composed of 12 places in 489 ms of which 2 ms to minimize.
[2024-05-29 21:05:55] [INFO ] Deduced a trap composed of 12 places in 417 ms of which 1 ms to minimize.
[2024-05-29 21:05:55] [INFO ] Deduced a trap composed of 13 places in 319 ms of which 1 ms to minimize.
[2024-05-29 21:05:56] [INFO ] Deduced a trap composed of 13 places in 283 ms of which 3 ms to minimize.
[2024-05-29 21:05:56] [INFO ] Deduced a trap composed of 12 places in 299 ms of which 1 ms to minimize.
[2024-05-29 21:05:56] [INFO ] Deduced a trap composed of 12 places in 219 ms of which 0 ms to minimize.
[2024-05-29 21:05:57] [INFO ] Deduced a trap composed of 12 places in 242 ms of which 1 ms to minimize.
[2024-05-29 21:05:57] [INFO ] Deduced a trap composed of 12 places in 188 ms of which 1 ms to minimize.
[2024-05-29 21:05:57] [INFO ] Trap strengthening (SAT) tested/added 10/10 trap constraints in 4347 ms
[2024-05-29 21:05:57] [INFO ] [Real]Absence check using 11 positive place invariants in 4 ms returned sat
[2024-05-29 21:05:57] [INFO ] [Real]Absence check using state equation in 343 ms returned sat
[2024-05-29 21:05:57] [INFO ] [Real]Added 2095 Read/Feed constraints in 211 ms returned sat
[2024-05-29 21:05:58] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 21:05:58] [INFO ] [Nat]Absence check using 11 positive place invariants in 4 ms returned sat
[2024-05-29 21:05:58] [INFO ] [Nat]Absence check using state equation in 349 ms returned sat
[2024-05-29 21:05:58] [INFO ] [Nat]Added 2095 Read/Feed constraints in 258 ms returned sat
[2024-05-29 21:05:59] [INFO ] Deduced a trap composed of 12 places in 647 ms of which 2 ms to minimize.
[2024-05-29 21:06:00] [INFO ] Deduced a trap composed of 14 places in 637 ms of which 1 ms to minimize.
[2024-05-29 21:06:00] [INFO ] Deduced a trap composed of 13 places in 526 ms of which 1 ms to minimize.
[2024-05-29 21:06:01] [INFO ] Deduced a trap composed of 14 places in 465 ms of which 1 ms to minimize.
[2024-05-29 21:06:01] [INFO ] Deduced a trap composed of 13 places in 422 ms of which 0 ms to minimize.
[2024-05-29 21:06:02] [INFO ] Deduced a trap composed of 12 places in 337 ms of which 1 ms to minimize.
[2024-05-29 21:06:02] [INFO ] Deduced a trap composed of 13 places in 362 ms of which 1 ms to minimize.
[2024-05-29 21:06:02] [INFO ] Deduced a trap composed of 14 places in 288 ms of which 0 ms to minimize.
[2024-05-29 21:06:03] [INFO ] Deduced a trap composed of 12 places in 227 ms of which 1 ms to minimize.
[2024-05-29 21:06:03] [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:299)
at fr.lip6.move.gal.structural.smt.SMTTrapUtils.refineWithTraps(SMTTrapUtils.java:177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:868)
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)
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 1, 0] Max Struct:[1, 1, 1, 1, 1]
Support contains 5 out of 142 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 142/142 places, 2238/2238 transitions.
Graph (complete) has 501 edges and 142 vertex of which 134 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.22 ms
Discarding 8 places :
Also discarding 8 output transitions
Drop transitions (Output transitions of discarded places.) removed 8 transitions
Drop transitions (Empty/Sink Transition effects.) removed 31 transitions
Reduce isomorphic transitions removed 31 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 20 transitions
Trivial Post-agglo rules discarded 20 transitions
Performed 20 trivial Post agglomeration. Transition count delta: 20
Iterating post reduction 0 with 51 rules applied. Total rules applied 52 place count 134 transition count 2179
Reduce places removed 20 places and 0 transitions.
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 1 with 50 rules applied. Total rules applied 102 place count 114 transition count 2149
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 112 place count 104 transition count 2149
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 18 Pre rules applied. Total rules applied 112 place count 104 transition count 2131
Deduced a syphon composed of 18 places in 2 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 3 with 36 rules applied. Total rules applied 148 place count 86 transition count 2131
Discarding 20 places :
Symmetric choice reduction at 3 with 20 rule applications. Total rules 168 place count 66 transition count 2111
Iterating global reduction 3 with 20 rules applied. Total rules applied 188 place count 66 transition count 2111
Discarding 18 places :
Symmetric choice reduction at 3 with 18 rule applications. Total rules 206 place count 48 transition count 2093
Iterating global reduction 3 with 18 rules applied. Total rules applied 224 place count 48 transition count 2093
Ensure Unique test removed 1031 transitions
Reduce isomorphic transitions removed 1031 transitions.
Iterating post reduction 3 with 1031 rules applied. Total rules applied 1255 place count 48 transition count 1062
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 4 with 20 rules applied. Total rules applied 1275 place count 38 transition count 1052
Discarding 10 places :
Symmetric choice reduction at 4 with 10 rule applications. Total rules 1285 place count 28 transition count 1042
Iterating global reduction 4 with 10 rules applied. Total rules applied 1295 place count 28 transition count 1042
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 1296 place count 27 transition count 1041
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1297 place count 26 transition count 1041
Performed 10 Post agglomeration using F-continuation condition with reduction of 1013 identical transitions.
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 5 with 28 rules applied. Total rules applied 1325 place count 8 transition count 18
Drop transitions (Empty/Sink Transition effects.) removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 5 with 10 rules applied. Total rules applied 1335 place count 8 transition count 8
Applied a total of 1335 rules in 499 ms. Remains 8 /142 variables (removed 134) and now considering 8/2238 (removed 2230) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 509 ms. Remains : 8/142 places, 8/2238 transitions.
// Phase 1: matrix 8 rows 8 cols
[2024-05-29 21:06:03] [INFO ] Computed 2 invariants in 0 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 1, 0] Max Struct:[1, 1, 1, 1, 1]
FORMULA StigmergyElection-PT-10a-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 1000000 steps (166795 resets) in 390 ms. (2557 steps per ms)
FORMULA StigmergyElection-PT-10a-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA StigmergyElection-PT-10a-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA StigmergyElection-PT-10a-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA StigmergyElection-PT-10a-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 1000001 steps (35713 resets) in 222 ms. (4484 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[] Max Struct:[]
RANDOM walk for 0 steps (0 resets) in 4 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 )
[2024-05-29 21:06:04] [INFO ] Flatten gal took : 17 ms
[2024-05-29 21:06:04] [INFO ] Flatten gal took : 2 ms
[2024-05-29 21:06:04] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality3531279281507134997.gal : 3 ms
[2024-05-29 21:06:04] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality7405726536841129089.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality3531279281507134997.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality7405726536841129089.prop' '--nowitness' '--gen-order' 'FOLLOW'
ITS runner timed out or was interrupted.

ITS tools runner thread asked to quit. Dying gracefully.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[] Max Struct:[]
All properties solved without resorting to model-checking.
Total runtime 35059 ms.

BK_STOP 1717016764576

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ 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//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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-10a"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="itstools"
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 itstools"
echo " Input is StigmergyElection-PT-10a, 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 r400-tall-171690532200381"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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