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-167912645500493.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-08a, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r453-smll-167912645500493
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 18M
-rw-r--r-- 1 mcc users 6.7K Feb 26 11:04 CTLCardinality.txt
-rw-r--r-- 1 mcc users 71K Feb 26 11:04 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K Feb 26 11:02 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K Feb 26 11:02 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Feb 25 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Feb 25 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Feb 25 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Feb 25 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 26 11:06 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 118K Feb 26 11:06 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.8K Feb 26 11:05 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 62K Feb 26 11:05 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 17M 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-08a-UpperBounds-00
FORMULA_NAME StigmergyCommit-PT-08a-UpperBounds-01
FORMULA_NAME StigmergyCommit-PT-08a-UpperBounds-02
FORMULA_NAME StigmergyCommit-PT-08a-UpperBounds-03
FORMULA_NAME StigmergyCommit-PT-08a-UpperBounds-04
FORMULA_NAME StigmergyCommit-PT-08a-UpperBounds-05
FORMULA_NAME StigmergyCommit-PT-08a-UpperBounds-06
FORMULA_NAME StigmergyCommit-PT-08a-UpperBounds-07
FORMULA_NAME StigmergyCommit-PT-08a-UpperBounds-08
FORMULA_NAME StigmergyCommit-PT-08a-UpperBounds-09
FORMULA_NAME StigmergyCommit-PT-08a-UpperBounds-10
FORMULA_NAME StigmergyCommit-PT-08a-UpperBounds-11
FORMULA_NAME StigmergyCommit-PT-08a-UpperBounds-12
FORMULA_NAME StigmergyCommit-PT-08a-UpperBounds-13
FORMULA_NAME StigmergyCommit-PT-08a-UpperBounds-14
FORMULA_NAME StigmergyCommit-PT-08a-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1679367803618

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-08a
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202303021504
[2023-03-21 03:03:26] [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 03:03:26] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-21 03:03:27] [INFO ] Load time of PNML (sax parser for PT used): 1260 ms
[2023-03-21 03:03:27] [INFO ] Transformed 328 places.
[2023-03-21 03:03:27] [INFO ] Transformed 18744 transitions.
[2023-03-21 03:03:27] [INFO ] Found NUPN structural information;
[2023-03-21 03:03:27] [INFO ] Parsed PT model containing 328 places and 18744 transitions and 330279 arcs in 1576 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 8 ms.
Ensure Unique test removed 17295 transitions
Reduce redundant transitions removed 17295 transitions.
Normalized transition count is 1422 out of 1449 initially.
// Phase 1: matrix 1422 rows 328 cols
[2023-03-21 03:03:27] [INFO ] Computed 10 place invariants in 35 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 563 ms. (steps per millisecond=17 ) properties (out of 16) seen :6
FORMULA StigmergyCommit-PT-08a-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-08a-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-08a-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-08a-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-08a-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-08a-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 10) 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 10) 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 10) 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 10) 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 10) 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 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 10) seen :0
[2023-03-21 03:03:28] [INFO ] Flow matrix only has 1422 transitions (discarded 27 similar events)
// Phase 1: matrix 1422 rows 328 cols
[2023-03-21 03:03:28] [INFO ] Computed 10 place invariants in 19 ms
[2023-03-21 03:03:29] [INFO ] [Real]Absence check using 10 positive place invariants in 37 ms returned sat
[2023-03-21 03:03:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 03:03:30] [INFO ] [Real]Absence check using state equation in 832 ms returned sat
[2023-03-21 03:03:30] [INFO ] Solution in real domain found non-integer solution.
[2023-03-21 03:03:30] [INFO ] [Nat]Absence check using 10 positive place invariants in 12 ms returned sat
[2023-03-21 03:03:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-21 03:03:30] [INFO ] [Nat]Absence check using state equation in 462 ms returned sat
[2023-03-21 03:03:31] [INFO ] State equation strengthened by 1147 read => feed constraints.
[2023-03-21 03:03:31] [INFO ] [Nat]Added 1147 Read/Feed constraints in 287 ms returned sat
[2023-03-21 03:03:32] [INFO ] Deduced a trap composed of 19 places in 671 ms of which 5 ms to minimize.
[2023-03-21 03:03:32] [INFO ] Deduced a trap composed of 18 places in 622 ms of which 1 ms to minimize.
[2023-03-21 03:03:33] [INFO ] Deduced a trap composed of 16 places in 475 ms of which 2 ms to minimize.
[2023-03-21 03:03:33] [INFO ] Deduced a trap composed of 16 places in 401 ms of which 2 ms to minimize.
[2023-03-21 03:03:34] [INFO ] Deduced a trap composed of 17 places in 354 ms of which 2 ms to minimize.
[2023-03-21 03:03:34] [INFO ] Deduced a trap composed of 19 places in 313 ms of which 0 ms to minimize.
[2023-03-21 03:03:34] [INFO ] Deduced a trap composed of 16 places in 287 ms of which 0 ms to minimize.
[2023-03-21 03:03:35] [INFO ] Deduced a trap composed of 16 places in 368 ms of which 1 ms to minimize.
[2023-03-21 03:03:35] [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.verifyPossible(DeadlockTester.java:916)
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 03:03:35] [INFO ] [Real]Absence check using 10 positive place invariants in 20 ms returned sat
[2023-03-21 03:03:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 03:03:35] [INFO ] [Real]Absence check using state equation in 384 ms returned sat
[2023-03-21 03:03:35] [INFO ] Solution in real domain found non-integer solution.
[2023-03-21 03:03:36] [INFO ] [Nat]Absence check using 10 positive place invariants in 16 ms returned sat
[2023-03-21 03:03:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-21 03:03:36] [INFO ] [Nat]Absence check using state equation in 490 ms returned sat
[2023-03-21 03:03:36] [INFO ] [Nat]Added 1147 Read/Feed constraints in 418 ms returned sat
[2023-03-21 03:03:37] [INFO ] Deduced a trap composed of 17 places in 560 ms of which 1 ms to minimize.
[2023-03-21 03:03:38] [INFO ] Deduced a trap composed of 17 places in 462 ms of which 1 ms to minimize.
[2023-03-21 03:03:38] [INFO ] Deduced a trap composed of 17 places in 503 ms of which 1 ms to minimize.
[2023-03-21 03:03:39] [INFO ] Deduced a trap composed of 17 places in 387 ms of which 1 ms to minimize.
[2023-03-21 03:03:39] [INFO ] Deduced a trap composed of 16 places in 328 ms of which 8 ms to minimize.
[2023-03-21 03:03:39] [INFO ] Deduced a trap composed of 17 places in 319 ms of which 0 ms to minimize.
[2023-03-21 03:03:40] [INFO ] Deduced a trap composed of 17 places in 263 ms of which 0 ms to minimize.
[2023-03-21 03:03:40] [INFO ] Deduced a trap composed of 17 places in 328 ms of which 1 ms to minimize.
[2023-03-21 03:03:41] [INFO ] Deduced a trap composed of 17 places in 262 ms of which 1 ms to minimize.
[2023-03-21 03:03:41] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 1
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:916)
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 03:03:41] [INFO ] [Real]Absence check using 10 positive place invariants in 10 ms returned sat
[2023-03-21 03:03:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 03:03:41] [INFO ] [Real]Absence check using state equation in 368 ms returned sat
[2023-03-21 03:03:41] [INFO ] Solution in real domain found non-integer solution.
[2023-03-21 03:03:41] [INFO ] [Nat]Absence check using 10 positive place invariants in 10 ms returned sat
[2023-03-21 03:03:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-21 03:03:41] [INFO ] [Nat]Absence check using state equation in 358 ms returned sat
[2023-03-21 03:03:42] [INFO ] [Nat]Added 1147 Read/Feed constraints in 311 ms returned sat
[2023-03-21 03:03:42] [INFO ] Deduced a trap composed of 19 places in 554 ms of which 1 ms to minimize.
[2023-03-21 03:03:43] [INFO ] Deduced a trap composed of 17 places in 466 ms of which 1 ms to minimize.
[2023-03-21 03:03:43] [INFO ] Deduced a trap composed of 16 places in 381 ms of which 0 ms to minimize.
[2023-03-21 03:03:44] [INFO ] Deduced a trap composed of 16 places in 317 ms of which 1 ms to minimize.
[2023-03-21 03:03:44] [INFO ] Deduced a trap composed of 19 places in 380 ms of which 3 ms to minimize.
[2023-03-21 03:03:45] [INFO ] Deduced a trap composed of 17 places in 375 ms of which 0 ms to minimize.
[2023-03-21 03:03:45] [INFO ] Deduced a trap composed of 17 places in 329 ms of which 0 ms to minimize.
[2023-03-21 03:03:45] [INFO ] Deduced a trap composed of 18 places in 318 ms of which 0 ms to minimize.
[2023-03-21 03:03:46] [INFO ] Deduced a trap composed of 17 places in 269 ms of which 0 ms to minimize.
[2023-03-21 03:03:46] [INFO ] Deduced a trap composed of 16 places in 206 ms of which 0 ms to minimize.
[2023-03-21 03:03:46] [INFO ] Trap strengthening (SAT) tested/added 10/10 trap constraints in 4245 ms
[2023-03-21 03:03:46] [INFO ] [Real]Absence check using 10 positive place invariants in 11 ms returned sat
[2023-03-21 03:03:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 03:03:46] [INFO ] [Real]Absence check using state equation in 364 ms returned sat
[2023-03-21 03:03:47] [INFO ] Solution in real domain found non-integer solution.
[2023-03-21 03:03:47] [INFO ] [Nat]Absence check using 10 positive place invariants in 11 ms returned sat
[2023-03-21 03:03:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-21 03:03:47] [INFO ] [Nat]Absence check using state equation in 362 ms returned sat
[2023-03-21 03:03:47] [INFO ] [Nat]Added 1147 Read/Feed constraints in 389 ms returned sat
[2023-03-21 03:03:48] [INFO ] Deduced a trap composed of 18 places in 522 ms of which 1 ms to minimize.
[2023-03-21 03:03:48] [INFO ] Deduced a trap composed of 17 places in 443 ms of which 0 ms to minimize.
[2023-03-21 03:03:49] [INFO ] Deduced a trap composed of 18 places in 379 ms of which 1 ms to minimize.
[2023-03-21 03:03:49] [INFO ] Deduced a trap composed of 18 places in 317 ms of which 1 ms to minimize.
[2023-03-21 03:03:50] [INFO ] Deduced a trap composed of 18 places in 269 ms of which 0 ms to minimize.
[2023-03-21 03:03:50] [INFO ] Deduced a trap composed of 17 places in 315 ms of which 1 ms to minimize.
[2023-03-21 03:03:50] [INFO ] Deduced a trap composed of 17 places in 258 ms of which 1 ms to minimize.
[2023-03-21 03:03:51] [INFO ] Deduced a trap composed of 17 places in 279 ms of which 3 ms to minimize.
[2023-03-21 03:03:51] [INFO ] Deduced a trap composed of 17 places in 262 ms of which 1 ms to minimize.
[2023-03-21 03:03:51] [INFO ] Deduced a trap composed of 16 places in 273 ms of which 1 ms to minimize.
[2023-03-21 03:03:52] [INFO ] Deduced a trap composed of 2 places in 611 ms of which 1 ms to minimize.
[2023-03-21 03:03:52] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 3
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:916)
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 03:03:52] [INFO ] [Real]Absence check using 10 positive place invariants in 8 ms returned sat
[2023-03-21 03:03:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 03:03:53] [INFO ] [Real]Absence check using state equation in 358 ms returned sat
[2023-03-21 03:03:53] [INFO ] Solution in real domain found non-integer solution.
[2023-03-21 03:03:53] [INFO ] [Nat]Absence check using 10 positive place invariants in 12 ms returned sat
[2023-03-21 03:03:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-21 03:03:53] [INFO ] [Nat]Absence check using state equation in 440 ms returned sat
[2023-03-21 03:03:54] [INFO ] [Nat]Added 1147 Read/Feed constraints in 365 ms returned sat
[2023-03-21 03:03:54] [INFO ] Deduced a trap composed of 16 places in 717 ms of which 1 ms to minimize.
[2023-03-21 03:03:55] [INFO ] Deduced a trap composed of 18 places in 451 ms of which 1 ms to minimize.
[2023-03-21 03:03:55] [INFO ] Deduced a trap composed of 18 places in 528 ms of which 1 ms to minimize.
[2023-03-21 03:03:56] [INFO ] Deduced a trap composed of 17 places in 311 ms of which 1 ms to minimize.
[2023-03-21 03:03:56] [INFO ] Deduced a trap composed of 16 places in 253 ms of which 1 ms to minimize.
[2023-03-21 03:03:57] [INFO ] Deduced a trap composed of 18 places in 249 ms of which 1 ms to minimize.
[2023-03-21 03:03:57] [INFO ] Deduced a trap composed of 17 places in 205 ms of which 0 ms to minimize.
[2023-03-21 03:03:57] [INFO ] Deduced a trap composed of 16 places in 154 ms of which 1 ms to minimize.
[2023-03-21 03:03:58] [INFO ] Deduced a trap composed of 16 places in 156 ms of which 0 ms to minimize.
[2023-03-21 03:03:58] [INFO ] Deduced a trap composed of 2 places in 784 ms of which 1 ms to minimize.
[2023-03-21 03:03:58] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 4
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:916)
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 03:03:59] [INFO ] [Real]Absence check using 10 positive place invariants in 14 ms returned sat
[2023-03-21 03:03:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 03:03:59] [INFO ] [Real]Absence check using state equation in 468 ms returned sat
[2023-03-21 03:03:59] [INFO ] Solution in real domain found non-integer solution.
[2023-03-21 03:03:59] [INFO ] [Nat]Absence check using 10 positive place invariants in 10 ms returned sat
[2023-03-21 03:03:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-21 03:04:00] [INFO ] [Nat]Absence check using state equation in 484 ms returned sat
[2023-03-21 03:04:00] [INFO ] [Nat]Added 1147 Read/Feed constraints in 368 ms returned sat
[2023-03-21 03:04:01] [INFO ] Deduced a trap composed of 16 places in 594 ms of which 1 ms to minimize.
[2023-03-21 03:04:01] [INFO ] Deduced a trap composed of 16 places in 452 ms of which 1 ms to minimize.
[2023-03-21 03:04:02] [INFO ] Deduced a trap composed of 17 places in 383 ms of which 1 ms to minimize.
[2023-03-21 03:04:02] [INFO ] Deduced a trap composed of 16 places in 318 ms of which 0 ms to minimize.
[2023-03-21 03:04:02] [INFO ] Deduced a trap composed of 18 places in 259 ms of which 1 ms to minimize.
[2023-03-21 03:04:03] [INFO ] Deduced a trap composed of 16 places in 261 ms of which 1 ms to minimize.
[2023-03-21 03:04:03] [INFO ] Deduced a trap composed of 18 places in 214 ms of which 1 ms to minimize.
[2023-03-21 03:04:03] [INFO ] Deduced a trap composed of 16 places in 169 ms of which 11 ms to minimize.
[2023-03-21 03:04:04] [INFO ] Deduced a trap composed of 16 places in 212 ms of which 0 ms to minimize.
[2023-03-21 03:04:04] [INFO ] Deduced a trap composed of 16 places in 113 ms of which 1 ms to minimize.
[2023-03-21 03:04:04] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 3805 ms
[2023-03-21 03:04:04] [INFO ] Computed and/alt/rep : 371/470/371 causal constraints (skipped 1050 transitions) in 314 ms.
[2023-03-21 03:04:04] [INFO ] Added : 0 causal constraints over 0 iterations in 315 ms. Result :unknown
[2023-03-21 03:04:04] [INFO ] [Real]Absence check using 10 positive place invariants in 15 ms returned sat
[2023-03-21 03:04:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 03:04:05] [INFO ] [Real]Absence check using state equation in 502 ms returned sat
[2023-03-21 03:04:05] [INFO ] Solution in real domain found non-integer solution.
[2023-03-21 03:04:05] [INFO ] [Nat]Absence check using 10 positive place invariants in 11 ms returned sat
[2023-03-21 03:04:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-21 03:04:05] [INFO ] [Nat]Absence check using state equation in 346 ms returned sat
[2023-03-21 03:04:06] [INFO ] [Nat]Added 1147 Read/Feed constraints in 388 ms returned sat
[2023-03-21 03:04:06] [INFO ] Deduced a trap composed of 17 places in 705 ms of which 1 ms to minimize.
[2023-03-21 03:04:07] [INFO ] Deduced a trap composed of 17 places in 545 ms of which 1 ms to minimize.
[2023-03-21 03:04:08] [INFO ] Deduced a trap composed of 17 places in 732 ms of which 1 ms to minimize.
[2023-03-21 03:04:09] [INFO ] Deduced a trap composed of 17 places in 622 ms of which 1 ms to minimize.
[2023-03-21 03:04:09] [INFO ] Deduced a trap composed of 16 places in 524 ms of which 2 ms to minimize.
[2023-03-21 03:04:10] [INFO ] Deduced a trap composed of 19 places in 431 ms of which 1 ms to minimize.
[2023-03-21 03:04:10] [INFO ] Trap strengthening (SAT) tested/added 6/6 trap constraints in 4180 ms
[2023-03-21 03:04:10] [INFO ] [Real]Absence check using 10 positive place invariants in 11 ms returned sat
[2023-03-21 03:04:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 03:04:10] [INFO ] [Real]Absence check using state equation in 458 ms returned sat
[2023-03-21 03:04:10] [INFO ] Solution in real domain found non-integer solution.
[2023-03-21 03:04:11] [INFO ] [Nat]Absence check using 10 positive place invariants in 16 ms returned sat
[2023-03-21 03:04:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-21 03:04:11] [INFO ] [Nat]Absence check using state equation in 570 ms returned sat
[2023-03-21 03:04:12] [INFO ] [Nat]Added 1147 Read/Feed constraints in 539 ms returned sat
[2023-03-21 03:04:13] [INFO ] Deduced a trap composed of 17 places in 735 ms of which 2 ms to minimize.
[2023-03-21 03:04:13] [INFO ] Deduced a trap composed of 18 places in 719 ms of which 1 ms to minimize.
[2023-03-21 03:04:14] [INFO ] Deduced a trap composed of 19 places in 715 ms of which 3 ms to minimize.
[2023-03-21 03:04:15] [INFO ] Deduced a trap composed of 17 places in 706 ms of which 1 ms to minimize.
[2023-03-21 03:04:16] [INFO ] Deduced a trap composed of 16 places in 609 ms of which 1 ms to minimize.
[2023-03-21 03:04: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 7
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:916)
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 03:04:16] [INFO ] [Real]Absence check using 10 positive place invariants in 15 ms returned sat
[2023-03-21 03:04:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 03:04:16] [INFO ] [Real]Absence check using state equation in 508 ms returned sat
[2023-03-21 03:04:17] [INFO ] [Real]Added 1147 Read/Feed constraints in 348 ms returned sat
[2023-03-21 03:04:17] [INFO ] Solution in real domain found non-integer solution.
[2023-03-21 03:04:17] [INFO ] [Nat]Absence check using 10 positive place invariants in 15 ms returned sat
[2023-03-21 03:04:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-21 03:04:17] [INFO ] [Nat]Absence check using state equation in 495 ms returned sat
[2023-03-21 03:04:18] [INFO ] [Nat]Added 1147 Read/Feed constraints in 386 ms returned sat
[2023-03-21 03:04:18] [INFO ] Deduced a trap composed of 16 places in 758 ms of which 2 ms to minimize.
[2023-03-21 03:04:19] [INFO ] Deduced a trap composed of 17 places in 602 ms of which 1 ms to minimize.
[2023-03-21 03:04:20] [INFO ] Deduced a trap composed of 18 places in 630 ms of which 1 ms to minimize.
[2023-03-21 03:04:21] [INFO ] Deduced a trap composed of 16 places in 492 ms of which 1 ms to minimize.
[2023-03-21 03:04:21] [INFO ] Deduced a trap composed of 17 places in 441 ms of which 1 ms to minimize.
[2023-03-21 03:04:22] [INFO ] Deduced a trap composed of 17 places in 415 ms of which 1 ms to minimize.
[2023-03-21 03:04:22] [INFO ] Deduced a trap composed of 17 places in 422 ms of which 1 ms to minimize.
[2023-03-21 03:04:22] [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 8
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.verifyPossible(DeadlockTester.java:916)
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 03:04:22] [INFO ] [Real]Absence check using 10 positive place invariants in 15 ms returned sat
[2023-03-21 03:04:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 03:04:23] [INFO ] [Real]Absence check using state equation in 563 ms returned sat
[2023-03-21 03:04:23] [INFO ] Solution in real domain found non-integer solution.
[2023-03-21 03:04:23] [INFO ] [Nat]Absence check using 10 positive place invariants in 15 ms returned sat
[2023-03-21 03:04:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-21 03:04:24] [INFO ] [Nat]Absence check using state equation in 490 ms returned sat
[2023-03-21 03:04:24] [INFO ] [Nat]Added 1147 Read/Feed constraints in 287 ms returned sat
[2023-03-21 03:04:24] [INFO ] Deduced a trap composed of 16 places in 607 ms of which 1 ms to minimize.
[2023-03-21 03:04:25] [INFO ] Deduced a trap composed of 17 places in 502 ms of which 1 ms to minimize.
[2023-03-21 03:04:25] [INFO ] Deduced a trap composed of 16 places in 406 ms of which 1 ms to minimize.
[2023-03-21 03:04:26] [INFO ] Deduced a trap composed of 17 places in 362 ms of which 1 ms to minimize.
[2023-03-21 03:04:26] [INFO ] Deduced a trap composed of 16 places in 378 ms of which 1 ms to minimize.
[2023-03-21 03:04:27] [INFO ] Deduced a trap composed of 16 places in 328 ms of which 1 ms to minimize.
[2023-03-21 03:04:27] [INFO ] Deduced a trap composed of 17 places in 362 ms of which 1 ms to minimize.
[2023-03-21 03:04:27] [INFO ] Deduced a trap composed of 16 places in 278 ms of which 0 ms to minimize.
[2023-03-21 03:04:28] [INFO ] Deduced a trap composed of 16 places in 213 ms of which 1 ms to minimize.
[2023-03-21 03:04:29] [INFO ] Deduced a trap composed of 2 places in 922 ms of which 1 ms to minimize.
[2023-03-21 03:04:29] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 9
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:916)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] Max seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
FORMULA StigmergyCommit-PT-08a-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 9 out of 328 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 328/328 places, 1449/1449 transitions.
Graph (complete) has 759 edges and 328 vertex of which 319 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.34 ms
Discarding 9 places :
Also discarding 9 output transitions
Drop transitions removed 9 transitions
Drop transitions removed 28 transitions
Reduce isomorphic transitions removed 28 transitions.
Drop transitions removed 51 transitions
Trivial Post-agglo rules discarded 51 transitions
Performed 51 trivial Post agglomeration. Transition count delta: 51
Iterating post reduction 0 with 79 rules applied. Total rules applied 80 place count 319 transition count 1361
Reduce places removed 51 places and 0 transitions.
Ensure Unique test removed 34 transitions
Reduce isomorphic transitions removed 34 transitions.
Drop transitions removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 1 with 94 rules applied. Total rules applied 174 place count 268 transition count 1318
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 183 place count 259 transition count 1318
Performed 60 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 60 Pre rules applied. Total rules applied 183 place count 259 transition count 1258
Deduced a syphon composed of 60 places in 4 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 3 with 120 rules applied. Total rules applied 303 place count 199 transition count 1258
Discarding 44 places :
Symmetric choice reduction at 3 with 44 rule applications. Total rules 347 place count 155 transition count 1214
Iterating global reduction 3 with 44 rules applied. Total rules applied 391 place count 155 transition count 1214
Discarding 43 places :
Symmetric choice reduction at 3 with 43 rule applications. Total rules 434 place count 112 transition count 1171
Iterating global reduction 3 with 43 rules applied. Total rules applied 477 place count 112 transition count 1171
Ensure Unique test removed 518 transitions
Reduce isomorphic transitions removed 518 transitions.
Iterating post reduction 3 with 518 rules applied. Total rules applied 995 place count 112 transition count 653
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 1003 place count 104 transition count 645
Iterating global reduction 4 with 8 rules applied. Total rules applied 1011 place count 104 transition count 645
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 1018 place count 97 transition count 638
Iterating global reduction 4 with 7 rules applied. Total rules applied 1025 place count 97 transition count 638
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 1031 place count 97 transition count 632
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 1 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 5 with 32 rules applied. Total rules applied 1063 place count 81 transition count 616
Drop transitions removed 7 transitions
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 5 with 14 rules applied. Total rules applied 1077 place count 81 transition count 602
Discarding 8 places :
Symmetric choice reduction at 6 with 8 rule applications. Total rules 1085 place count 73 transition count 594
Iterating global reduction 6 with 8 rules applied. Total rules applied 1093 place count 73 transition count 594
Discarding 7 places :
Symmetric choice reduction at 6 with 7 rule applications. Total rules 1100 place count 66 transition count 587
Iterating global reduction 6 with 7 rules applied. Total rules applied 1107 place count 66 transition count 587
Discarding 7 places :
Symmetric choice reduction at 6 with 7 rule applications. Total rules 1114 place count 59 transition count 580
Iterating global reduction 6 with 7 rules applied. Total rules applied 1121 place count 59 transition count 580
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 6 with 2 rules applied. Total rules applied 1123 place count 59 transition count 578
Free-agglomeration rule applied 3 times.
Iterating global reduction 6 with 3 rules applied. Total rules applied 1126 place count 59 transition count 575
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 1129 place count 56 transition count 575
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 1130 place count 56 transition count 574
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 7 with 3 rules applied. Total rules applied 1133 place count 56 transition count 574
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 7 with 2 rules applied. Total rules applied 1135 place count 56 transition count 572
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 1136 place count 55 transition count 571
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 7 with 9 rules applied. Total rules applied 1145 place count 54 transition count 563
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 8 with 8 rules applied. Total rules applied 1153 place count 46 transition count 563
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 1 Pre rules applied. Total rules applied 1153 place count 46 transition count 562
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 1155 place count 45 transition count 562
Performed 11 Post agglomeration using F-continuation condition with reduction of 500 identical transitions.
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 9 with 22 rules applied. Total rules applied 1177 place count 34 transition count 51
Drop transitions removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 9 with 9 rules applied. Total rules applied 1186 place count 34 transition count 42
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 10 with 18 rules applied. Total rules applied 1204 place count 23 transition count 35
Drop transitions removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 10 with 7 rules applied. Total rules applied 1211 place count 23 transition count 28
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 11 with 2 rules applied. Total rules applied 1213 place count 23 transition count 26
Free-agglomeration rule applied 1 times.
Iterating global reduction 11 with 1 rules applied. Total rules applied 1214 place count 23 transition count 25
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 11 with 1 rules applied. Total rules applied 1215 place count 22 transition count 25
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 12 with 2 rules applied. Total rules applied 1217 place count 20 transition count 23
Applied a total of 1217 rules in 1096 ms. Remains 20 /328 variables (removed 308) and now considering 23/1449 (removed 1426) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1096 ms. Remains : 20/328 places, 23/1449 transitions.
// Phase 1: matrix 23 rows 20 cols
[2023-03-21 03:04:30] [INFO ] Computed 5 place invariants in 0 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 799 ms. (steps per millisecond=1251 ) properties (out of 9) seen :9
FORMULA StigmergyCommit-PT-08a-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-08a-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-08a-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-08a-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-08a-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-08a-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-08a-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-08a-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-08a-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 65590 ms.

BK_STOP 1679367872661

--------------------
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-08a"
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-08a, 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-167912645500493"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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