Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r453-smll-167912645500477.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool itstools
Input is StigmergyCommit-PT-07a, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r453-smll-167912645500477
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 5.9M
-rw-r--r-- 1 mcc users 5.4K Feb 26 11:00 CTLCardinality.txt
-rw-r--r-- 1 mcc users 53K Feb 26 11:00 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Feb 26 10:59 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K Feb 26 10:59 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Feb 25 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Feb 25 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Feb 26 11:01 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 164K Feb 26 11:01 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.0K Feb 26 11:00 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 54K Feb 26 11:00 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 17:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 17:12 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 5.4M Mar 5 18:23 model.pnml

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

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

The expected result is a vector of positive values
NUM_VECTOR

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

=== Now, execution of the tool begins

BK_START 1679360901745

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=StigmergyCommit-PT-07a
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202303021504
[2023-03-21 01:08:24] [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]
[2023-03-21 01:08:24] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-21 01:08:25] [INFO ] Load time of PNML (sax parser for PT used): 978 ms
[2023-03-21 01:08:25] [INFO ] Transformed 292 places.
[2023-03-21 01:08:25] [INFO ] Transformed 7108 transitions.
[2023-03-21 01:08:25] [INFO ] Found NUPN structural information;
[2023-03-21 01:08:25] [INFO ] Parsed PT model containing 292 places and 7108 transitions and 108222 arcs in 1146 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 9 ms.
Ensure Unique test removed 6218 transitions
Reduce redundant transitions removed 6218 transitions.
Normalized transition count is 866 out of 890 initially.
// Phase 1: matrix 866 rows 292 cols
[2023-03-21 01:08:25] [INFO ] Computed 9 place invariants in 62 ms
Incomplete random walk after 10000 steps, including 3 resets, run finished after 327 ms. (steps per millisecond=30 ) properties (out of 16) seen :10
FORMULA StigmergyCommit-PT-07a-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-07a-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-07a-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-07a-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-07a-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-07a-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-07a-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-07a-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-07a-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-07a-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 6) seen :0
[2023-03-21 01:08:26] [INFO ] Flow matrix only has 866 transitions (discarded 24 similar events)
// Phase 1: matrix 866 rows 292 cols
[2023-03-21 01:08:26] [INFO ] Computed 9 place invariants in 30 ms
[2023-03-21 01:08:26] [INFO ] [Real]Absence check using 9 positive place invariants in 19 ms returned sat
[2023-03-21 01:08:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 01:08:27] [INFO ] [Real]Absence check using state equation in 502 ms returned sat
[2023-03-21 01:08:27] [INFO ] Solution in real domain found non-integer solution.
[2023-03-21 01:08:27] [INFO ] [Nat]Absence check using 9 positive place invariants in 15 ms returned sat
[2023-03-21 01:08:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-21 01:08:27] [INFO ] [Nat]Absence check using state equation in 365 ms returned sat
[2023-03-21 01:08:27] [INFO ] State equation strengthened by 621 read => feed constraints.
[2023-03-21 01:08:28] [INFO ] [Nat]Added 621 Read/Feed constraints in 276 ms returned sat
[2023-03-21 01:08:28] [INFO ] Deduced a trap composed of 16 places in 462 ms of which 12 ms to minimize.
[2023-03-21 01:08:29] [INFO ] Deduced a trap composed of 17 places in 352 ms of which 1 ms to minimize.
[2023-03-21 01:08:29] [INFO ] Deduced a trap composed of 17 places in 257 ms of which 1 ms to minimize.
[2023-03-21 01:08:29] [INFO ] Deduced a trap composed of 16 places in 196 ms of which 3 ms to minimize.
[2023-03-21 01:08:29] [INFO ] Deduced a trap composed of 18 places in 148 ms of which 1 ms to minimize.
[2023-03-21 01:08:30] [INFO ] Deduced a trap composed of 17 places in 156 ms of which 1 ms to minimize.
[2023-03-21 01:08:30] [INFO ] Deduced a trap composed of 16 places in 148 ms of which 0 ms to minimize.
[2023-03-21 01:08:30] [INFO ] Deduced a trap composed of 16 places in 152 ms of which 1 ms to minimize.
[2023-03-21 01:08:30] [INFO ] Deduced a trap composed of 16 places in 150 ms of which 1 ms to minimize.
[2023-03-21 01:08:30] [INFO ] Deduced a trap composed of 16 places in 102 ms of which 1 ms to minimize.
[2023-03-21 01:08:31] [INFO ] Deduced a trap composed of 16 places in 105 ms of which 1 ms to minimize.
[2023-03-21 01:08:31] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 2988 ms
[2023-03-21 01:08:31] [INFO ] Computed and/alt/rep : 330/418/330 causal constraints (skipped 535 transitions) in 198 ms.
[2023-03-21 01:08:32] [INFO ] Deduced a trap composed of 2 places in 361 ms of which 1 ms to minimize.
[2023-03-21 01:08:32] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-21 01:08:32] [INFO ] [Real]Absence check using 9 positive place invariants in 14 ms returned sat
[2023-03-21 01:08:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 01:08:33] [INFO ] [Real]Absence check using state equation in 326 ms returned sat
[2023-03-21 01:08:33] [INFO ] Solution in real domain found non-integer solution.
[2023-03-21 01:08:33] [INFO ] [Nat]Absence check using 9 positive place invariants in 10 ms returned sat
[2023-03-21 01:08:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-21 01:08:33] [INFO ] [Nat]Absence check using state equation in 234 ms returned sat
[2023-03-21 01:08:33] [INFO ] [Nat]Added 621 Read/Feed constraints in 321 ms returned sat
[2023-03-21 01:08:34] [INFO ] Deduced a trap composed of 18 places in 425 ms of which 1 ms to minimize.
[2023-03-21 01:08:34] [INFO ] Deduced a trap composed of 18 places in 355 ms of which 1 ms to minimize.
[2023-03-21 01:08:34] [INFO ] Deduced a trap composed of 16 places in 215 ms of which 1 ms to minimize.
[2023-03-21 01:08:35] [INFO ] Deduced a trap composed of 16 places in 213 ms of which 1 ms to minimize.
[2023-03-21 01:08:35] [INFO ] Deduced a trap composed of 16 places in 198 ms of which 1 ms to minimize.
[2023-03-21 01:08:35] [INFO ] Deduced a trap composed of 16 places in 157 ms of which 0 ms to minimize.
[2023-03-21 01:08:35] [INFO ] Deduced a trap composed of 16 places in 95 ms of which 1 ms to minimize.
[2023-03-21 01:08:35] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 2057 ms
[2023-03-21 01:08:35] [INFO ] Computed and/alt/rep : 330/418/330 causal constraints (skipped 535 transitions) in 137 ms.
[2023-03-21 01:08:36] [INFO ] Added : 63 causal constraints over 13 iterations in 1158 ms. Result :sat
Minimization took 250 ms.
[2023-03-21 01:08:37] [INFO ] [Real]Absence check using 9 positive place invariants in 10 ms returned sat
[2023-03-21 01:08:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 01:08:37] [INFO ] [Real]Absence check using state equation in 289 ms returned sat
[2023-03-21 01:08:37] [INFO ] Solution in real domain found non-integer solution.
[2023-03-21 01:08:37] [INFO ] [Nat]Absence check using 9 positive place invariants in 15 ms returned sat
[2023-03-21 01:08:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-21 01:08:38] [INFO ] [Nat]Absence check using state equation in 354 ms returned sat
[2023-03-21 01:08:38] [INFO ] [Nat]Added 621 Read/Feed constraints in 233 ms returned sat
[2023-03-21 01:08:38] [INFO ] Deduced a trap composed of 16 places in 314 ms of which 4 ms to minimize.
[2023-03-21 01:08:39] [INFO ] Deduced a trap composed of 17 places in 369 ms of which 1 ms to minimize.
[2023-03-21 01:08:39] [INFO ] Deduced a trap composed of 16 places in 251 ms of which 2 ms to minimize.
[2023-03-21 01:08:39] [INFO ] Deduced a trap composed of 17 places in 242 ms of which 1 ms to minimize.
[2023-03-21 01:08:40] [INFO ] Deduced a trap composed of 17 places in 216 ms of which 0 ms to minimize.
[2023-03-21 01:08:40] [INFO ] Deduced a trap composed of 17 places in 229 ms of which 1 ms to minimize.
[2023-03-21 01:08:40] [INFO ] Deduced a trap composed of 16 places in 184 ms of which 0 ms to minimize.
[2023-03-21 01:08:40] [INFO ] Deduced a trap composed of 17 places in 222 ms of which 0 ms to minimize.
[2023-03-21 01:08:41] [INFO ] Deduced a trap composed of 16 places in 177 ms of which 1 ms to minimize.
[2023-03-21 01:08:41] [INFO ] Deduced a trap composed of 16 places in 174 ms of which 0 ms to minimize.
[2023-03-21 01:08:41] [INFO ] Deduced a trap composed of 16 places in 144 ms of which 1 ms to minimize.
[2023-03-21 01:08:41] [INFO ] Deduced a trap composed of 16 places in 100 ms of which 1 ms to minimize.
[2023-03-21 01:08:41] [INFO ] Deduced a trap composed of 16 places in 163 ms of which 1 ms to minimize.
[2023-03-21 01:08:42] [INFO ] Deduced a trap composed of 16 places in 115 ms of which 1 ms to minimize.
[2023-03-21 01:08:42] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 3714 ms
[2023-03-21 01:08:42] [INFO ] Computed and/alt/rep : 330/418/330 causal constraints (skipped 535 transitions) in 113 ms.
[2023-03-21 01:08:42] [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:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1186)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-21 01:08:42] [INFO ] [Real]Absence check using 9 positive place invariants in 10 ms returned sat
[2023-03-21 01:08:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 01:08:43] [INFO ] [Real]Absence check using state equation in 291 ms returned sat
[2023-03-21 01:08:43] [INFO ] Solution in real domain found non-integer solution.
[2023-03-21 01:08:43] [INFO ] [Nat]Absence check using 9 positive place invariants in 11 ms returned sat
[2023-03-21 01:08:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-21 01:08:43] [INFO ] [Nat]Absence check using state equation in 286 ms returned sat
[2023-03-21 01:08:43] [INFO ] [Nat]Added 621 Read/Feed constraints in 203 ms returned sat
[2023-03-21 01:08:44] [INFO ] Deduced a trap composed of 17 places in 426 ms of which 1 ms to minimize.
[2023-03-21 01:08:44] [INFO ] Deduced a trap composed of 18 places in 273 ms of which 5 ms to minimize.
[2023-03-21 01:08:44] [INFO ] Deduced a trap composed of 17 places in 345 ms of which 1 ms to minimize.
[2023-03-21 01:08:45] [INFO ] Deduced a trap composed of 16 places in 291 ms of which 1 ms to minimize.
[2023-03-21 01:08:45] [INFO ] Deduced a trap composed of 17 places in 214 ms of which 1 ms to minimize.
[2023-03-21 01:08:45] [INFO ] Deduced a trap composed of 16 places in 178 ms of which 1 ms to minimize.
[2023-03-21 01:08:45] [INFO ] Deduced a trap composed of 16 places in 142 ms of which 0 ms to minimize.
[2023-03-21 01:08:46] [INFO ] Deduced a trap composed of 16 places in 76 ms of which 0 ms to minimize.
[2023-03-21 01:08:46] [INFO ] Deduced a trap composed of 16 places in 168 ms of which 0 ms to minimize.
[2023-03-21 01:08:46] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 2642 ms
[2023-03-21 01:08:46] [INFO ] Computed and/alt/rep : 330/418/330 causal constraints (skipped 535 transitions) in 103 ms.
[2023-03-21 01:08:47] [INFO ] Added : 67 causal constraints over 14 iterations in 1271 ms. Result :sat
Minimization took 245 ms.
[2023-03-21 01:08:48] [INFO ] [Real]Absence check using 9 positive place invariants in 13 ms returned sat
[2023-03-21 01:08:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 01:08:48] [INFO ] [Real]Absence check using state equation in 315 ms returned sat
[2023-03-21 01:08:48] [INFO ] Solution in real domain found non-integer solution.
[2023-03-21 01:08:48] [INFO ] [Nat]Absence check using 9 positive place invariants in 11 ms returned sat
[2023-03-21 01:08:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-21 01:08:48] [INFO ] [Nat]Absence check using state equation in 293 ms returned sat
[2023-03-21 01:08:48] [INFO ] [Nat]Added 621 Read/Feed constraints in 223 ms returned sat
[2023-03-21 01:08:49] [INFO ] Deduced a trap composed of 18 places in 383 ms of which 1 ms to minimize.
[2023-03-21 01:08:49] [INFO ] Deduced a trap composed of 16 places in 343 ms of which 2 ms to minimize.
[2023-03-21 01:08:50] [INFO ] Deduced a trap composed of 16 places in 278 ms of which 1 ms to minimize.
[2023-03-21 01:08:50] [INFO ] Deduced a trap composed of 17 places in 213 ms of which 1 ms to minimize.
[2023-03-21 01:08:50] [INFO ] Deduced a trap composed of 16 places in 145 ms of which 0 ms to minimize.
[2023-03-21 01:08:50] [INFO ] Deduced a trap composed of 16 places in 139 ms of which 0 ms to minimize.
[2023-03-21 01:08:51] [INFO ] Deduced a trap composed of 16 places in 114 ms of which 1 ms to minimize.
[2023-03-21 01:08:51] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 2085 ms
[2023-03-21 01:08:51] [INFO ] Computed and/alt/rep : 330/418/330 causal constraints (skipped 535 transitions) in 161 ms.
[2023-03-21 01:08:52] [INFO ] Added : 64 causal constraints over 13 iterations in 1337 ms. Result :sat
Minimization took 223 ms.
[2023-03-21 01:08:52] [INFO ] [Real]Absence check using 9 positive place invariants in 14 ms returned sat
[2023-03-21 01:08:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 01:08:53] [INFO ] [Real]Absence check using state equation in 366 ms returned sat
[2023-03-21 01:08:53] [INFO ] Solution in real domain found non-integer solution.
[2023-03-21 01:08:53] [INFO ] [Nat]Absence check using 9 positive place invariants in 11 ms returned sat
[2023-03-21 01:08:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-21 01:08:53] [INFO ] [Nat]Absence check using state equation in 332 ms returned sat
[2023-03-21 01:08:53] [INFO ] [Nat]Added 621 Read/Feed constraints in 221 ms returned sat
[2023-03-21 01:08:54] [INFO ] Deduced a trap composed of 16 places in 528 ms of which 1 ms to minimize.
[2023-03-21 01:08:54] [INFO ] Deduced a trap composed of 19 places in 403 ms of which 2 ms to minimize.
[2023-03-21 01:08:55] [INFO ] Deduced a trap composed of 17 places in 274 ms of which 1 ms to minimize.
[2023-03-21 01:08:55] [INFO ] Deduced a trap composed of 17 places in 288 ms of which 1 ms to minimize.
[2023-03-21 01:08:55] [INFO ] Deduced a trap composed of 16 places in 227 ms of which 1 ms to minimize.
[2023-03-21 01:08:56] [INFO ] Deduced a trap composed of 19 places in 169 ms of which 3 ms to minimize.
[2023-03-21 01:08:56] [INFO ] Deduced a trap composed of 16 places in 127 ms of which 1 ms to minimize.
[2023-03-21 01:08:56] [INFO ] Deduced a trap composed of 16 places in 130 ms of which 1 ms to minimize.
[2023-03-21 01:08:56] [INFO ] Deduced a trap composed of 18 places in 102 ms of which 0 ms to minimize.
[2023-03-21 01:08:56] [INFO ] Deduced a trap composed of 16 places in 184 ms of which 1 ms to minimize.
[2023-03-21 01:08:56] [INFO ] Deduced a trap composed of 16 places in 141 ms of which 1 ms to minimize.
[2023-03-21 01:08:57] [INFO ] Deduced a trap composed of 16 places in 104 ms of which 0 ms to minimize.
[2023-03-21 01:08:57] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 3307 ms
[2023-03-21 01:08:57] [INFO ] Computed and/alt/rep : 330/418/330 causal constraints (skipped 535 transitions) in 135 ms.
[2023-03-21 01:08:58] [INFO ] Added : 67 causal constraints over 14 iterations in 1050 ms. Result :unknown
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 1, 1] Max seen :[0, 0, 0, 0, 0, 0]
FORMULA StigmergyCommit-PT-07a-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA StigmergyCommit-PT-07a-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA StigmergyCommit-PT-07a-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA StigmergyCommit-PT-07a-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA StigmergyCommit-PT-07a-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 1 out of 292 places. Attempting structural reductions.
Drop transitions removed 1 transitions
Starting structural reductions in REACHABILITY mode, iteration 0 : 292/292 places, 889/889 transitions.
Graph (complete) has 650 edges and 292 vertex of which 284 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.10 ms
Discarding 8 places :
Also discarding 8 output transitions
Drop transitions removed 8 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Drop transitions removed 49 transitions
Trivial Post-agglo rules discarded 49 transitions
Performed 49 trivial Post agglomeration. Transition count delta: 49
Iterating post reduction 0 with 75 rules applied. Total rules applied 76 place count 283 transition count 806
Reduce places removed 50 places and 1 transitions.
Ensure Unique test removed 32 transitions
Reduce isomorphic transitions removed 32 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 1 with 90 rules applied. Total rules applied 166 place count 233 transition count 765
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 174 place count 225 transition count 765
Performed 55 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 55 Pre rules applied. Total rules applied 174 place count 225 transition count 710
Deduced a syphon composed of 55 places in 1 ms
Reduce places removed 55 places and 0 transitions.
Iterating global reduction 3 with 110 rules applied. Total rules applied 284 place count 170 transition count 710
Discarding 40 places :
Symmetric choice reduction at 3 with 40 rule applications. Total rules 324 place count 130 transition count 670
Iterating global reduction 3 with 40 rules applied. Total rules applied 364 place count 130 transition count 670
Discarding 40 places :
Symmetric choice reduction at 3 with 40 rule applications. Total rules 404 place count 90 transition count 630
Iterating global reduction 3 with 40 rules applied. Total rules applied 444 place count 90 transition count 630
Ensure Unique test removed 263 transitions
Reduce isomorphic transitions removed 263 transitions.
Iterating post reduction 3 with 263 rules applied. Total rules applied 707 place count 90 transition count 367
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 715 place count 82 transition count 359
Iterating global reduction 4 with 8 rules applied. Total rules applied 723 place count 82 transition count 359
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 731 place count 74 transition count 351
Iterating global reduction 4 with 8 rules applied. Total rules applied 739 place count 74 transition count 351
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 4 with 7 rules applied. Total rules applied 746 place count 74 transition count 344
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 5 with 32 rules applied. Total rules applied 778 place count 58 transition count 328
Drop transitions removed 8 transitions
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 5 with 16 rules applied. Total rules applied 794 place count 58 transition count 312
Discarding 7 places :
Symmetric choice reduction at 6 with 7 rule applications. Total rules 801 place count 51 transition count 305
Iterating global reduction 6 with 7 rules applied. Total rules applied 808 place count 51 transition count 305
Discarding 7 places :
Symmetric choice reduction at 6 with 7 rule applications. Total rules 815 place count 44 transition count 298
Iterating global reduction 6 with 7 rules applied. Total rules applied 822 place count 44 transition count 298
Discarding 7 places :
Symmetric choice reduction at 6 with 7 rule applications. Total rules 829 place count 37 transition count 291
Iterating global reduction 6 with 7 rules applied. Total rules applied 836 place count 37 transition count 291
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 837 place count 36 transition count 290
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 6 with 9 rules applied. Total rules applied 846 place count 35 transition count 282
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 7 with 8 rules applied. Total rules applied 854 place count 27 transition count 282
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 1 Pre rules applied. Total rules applied 854 place count 27 transition count 281
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 856 place count 26 transition count 281
Performed 8 Post agglomeration using F-continuation condition with reduction of 247 identical transitions.
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 8 with 16 rules applied. Total rules applied 872 place count 18 transition count 26
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 8 with 8 rules applied. Total rules applied 880 place count 18 transition count 18
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 9 with 23 rules applied. Total rules applied 903 place count 3 transition count 10
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 9 with 8 rules applied. Total rules applied 911 place count 3 transition count 2
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 10 with 1 Pre rules applied. Total rules applied 911 place count 3 transition count 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 913 place count 2 transition count 1
Applied a total of 913 rules in 239 ms. Remains 2 /292 variables (removed 290) and now considering 1/889 (removed 888) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 239 ms. Remains : 2/292 places, 1/889 transitions.
// Phase 1: matrix 1 rows 2 cols
[2023-03-21 01:08:58] [INFO ] Computed 1 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 500000 resets, run finished after 339 ms. (steps per millisecond=2949 ) properties (out of 1) seen :1
FORMULA StigmergyCommit-PT-07a-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 34780 ms.

BK_STOP 1679360940286

--------------------
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.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /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="StigmergyCommit-PT-07a"
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-5348"
echo " Executing tool itstools"
echo " Input is StigmergyCommit-PT-07a, 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 r453-smll-167912645500477"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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