About the Execution of Smart+red for StigmergyCommit-PT-08a
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 507.747 | 72937.00 | 97235.00 | 627.70 | 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2023-input.r459-smll-167912651300493.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool smartxred
Input is StigmergyCommit-PT-08a, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r459-smll-167912651300493
=====================================================================
--------------------
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 1679373070521
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=smartxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=StigmergyCommit-PT-08a
Applying reductions before tool smart
Invoking reducer
Running Version 202303021504
[2023-03-21 04:31:13] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-21 04:31:13] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-21 04:31:15] [INFO ] Load time of PNML (sax parser for PT used): 1513 ms
[2023-03-21 04:31:15] [INFO ] Transformed 328 places.
[2023-03-21 04:31:15] [INFO ] Transformed 18744 transitions.
[2023-03-21 04:31:15] [INFO ] Found NUPN structural information;
[2023-03-21 04:31:15] [INFO ] Parsed PT model containing 328 places and 18744 transitions and 330279 arcs in 1886 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 9 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 04:31:15] [INFO ] Computed 10 place invariants in 117 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 632 ms. (steps per millisecond=15 ) properties (out of 16) seen :5
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-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 15 ms. (steps per millisecond=666 ) properties (out of 11) 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 11) 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 11) 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 11) 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 11) 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 11) 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 11) 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 11) 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 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 11) seen :0
[2023-03-21 04:31:16] [INFO ] Flow matrix only has 1422 transitions (discarded 27 similar events)
// Phase 1: matrix 1422 rows 328 cols
[2023-03-21 04:31:16] [INFO ] Computed 10 place invariants in 14 ms
[2023-03-21 04:31:17] [INFO ] [Real]Absence check using 10 positive place invariants in 17 ms returned sat
[2023-03-21 04:31:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 04:31:17] [INFO ] [Real]Absence check using state equation in 507 ms returned sat
[2023-03-21 04:31:17] [INFO ] Solution in real domain found non-integer solution.
[2023-03-21 04:31:18] [INFO ] [Nat]Absence check using 10 positive place invariants in 17 ms returned sat
[2023-03-21 04:31:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-21 04:31:18] [INFO ] [Nat]Absence check using state equation in 580 ms returned sat
[2023-03-21 04:31:18] [INFO ] State equation strengthened by 1147 read => feed constraints.
[2023-03-21 04:31:19] [INFO ] [Nat]Added 1147 Read/Feed constraints in 396 ms returned sat
[2023-03-21 04:31:20] [INFO ] Deduced a trap composed of 19 places in 885 ms of which 5 ms to minimize.
[2023-03-21 04:31:20] [INFO ] Deduced a trap composed of 18 places in 644 ms of which 2 ms to minimize.
[2023-03-21 04:31:21] [INFO ] Deduced a trap composed of 16 places in 483 ms of which 2 ms to minimize.
[2023-03-21 04:31:21] [INFO ] Deduced a trap composed of 16 places in 397 ms of which 3 ms to minimize.
[2023-03-21 04:31:22] [INFO ] Deduced a trap composed of 17 places in 400 ms of which 1 ms to minimize.
[2023-03-21 04:31:22] [INFO ] Deduced a trap composed of 19 places in 289 ms of which 1 ms to minimize.
[2023-03-21 04:31:22] [INFO ] Deduced a trap composed of 16 places in 225 ms of which 0 ms to minimize.
[2023-03-21 04:31: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 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 04:31:23] [INFO ] [Real]Absence check using 10 positive place invariants in 10 ms returned sat
[2023-03-21 04:31:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 04:31:23] [INFO ] [Real]Absence check using state equation in 496 ms returned sat
[2023-03-21 04:31:23] [INFO ] Solution in real domain found non-integer solution.
[2023-03-21 04:31:23] [INFO ] [Nat]Absence check using 10 positive place invariants in 11 ms returned sat
[2023-03-21 04:31:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-21 04:31:24] [INFO ] [Nat]Absence check using state equation in 390 ms returned sat
[2023-03-21 04:31:24] [INFO ] [Nat]Added 1147 Read/Feed constraints in 317 ms returned sat
[2023-03-21 04:31:25] [INFO ] Deduced a trap composed of 16 places in 715 ms of which 2 ms to minimize.
[2023-03-21 04:31:26] [INFO ] Deduced a trap composed of 18 places in 739 ms of which 3 ms to minimize.
[2023-03-21 04:31:26] [INFO ] Deduced a trap composed of 17 places in 621 ms of which 1 ms to minimize.
[2023-03-21 04:31:27] [INFO ] Deduced a trap composed of 17 places in 594 ms of which 1 ms to minimize.
[2023-03-21 04:31:27] [INFO ] Deduced a trap composed of 18 places in 502 ms of which 1 ms to minimize.
[2023-03-21 04:31:28] [INFO ] Deduced a trap composed of 17 places in 515 ms of which 1 ms to minimize.
[2023-03-21 04:31:28] [INFO ] Deduced a trap composed of 17 places in 424 ms of which 1 ms to minimize.
[2023-03-21 04:31:28] [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 04:31:29] [INFO ] [Real]Absence check using 10 positive place invariants in 10 ms returned sat
[2023-03-21 04:31:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 04:31:29] [INFO ] [Real]Absence check using state equation in 468 ms returned sat
[2023-03-21 04:31:29] [INFO ] Solution in real domain found non-integer solution.
[2023-03-21 04:31:29] [INFO ] [Nat]Absence check using 10 positive place invariants in 12 ms returned sat
[2023-03-21 04:31:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-21 04:31:30] [INFO ] [Nat]Absence check using state equation in 427 ms returned sat
[2023-03-21 04:31:30] [INFO ] [Nat]Added 1147 Read/Feed constraints in 460 ms returned sat
[2023-03-21 04:31:31] [INFO ] Deduced a trap composed of 17 places in 815 ms of which 1 ms to minimize.
[2023-03-21 04:31:32] [INFO ] Deduced a trap composed of 17 places in 606 ms of which 1 ms to minimize.
[2023-03-21 04:31:32] [INFO ] Deduced a trap composed of 17 places in 603 ms of which 1 ms to minimize.
[2023-03-21 04:31:33] [INFO ] Deduced a trap composed of 17 places in 393 ms of which 1 ms to minimize.
[2023-03-21 04:31:33] [INFO ] Deduced a trap composed of 16 places in 454 ms of which 1 ms to minimize.
[2023-03-21 04:31:34] [INFO ] Deduced a trap composed of 17 places in 449 ms of which 1 ms to minimize.
[2023-03-21 04:31:34] [INFO ] Deduced a trap composed of 17 places in 263 ms of which 1 ms to minimize.
[2023-03-21 04:31:34] [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.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 04:31:34] [INFO ] [Real]Absence check using 10 positive place invariants in 16 ms returned sat
[2023-03-21 04:31:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 04:31:35] [INFO ] [Real]Absence check using state equation in 510 ms returned sat
[2023-03-21 04:31:35] [INFO ] Solution in real domain found non-integer solution.
[2023-03-21 04:31:35] [INFO ] [Nat]Absence check using 10 positive place invariants in 17 ms returned sat
[2023-03-21 04:31:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-21 04:31:36] [INFO ] [Nat]Absence check using state equation in 504 ms returned sat
[2023-03-21 04:31:36] [INFO ] [Nat]Added 1147 Read/Feed constraints in 300 ms returned sat
[2023-03-21 04:31:36] [INFO ] Deduced a trap composed of 19 places in 522 ms of which 0 ms to minimize.
[2023-03-21 04:31:37] [INFO ] Deduced a trap composed of 17 places in 466 ms of which 0 ms to minimize.
[2023-03-21 04:31:38] [INFO ] Deduced a trap composed of 16 places in 542 ms of which 1 ms to minimize.
[2023-03-21 04:31:38] [INFO ] Deduced a trap composed of 16 places in 321 ms of which 0 ms to minimize.
[2023-03-21 04:31:38] [INFO ] Deduced a trap composed of 19 places in 389 ms of which 1 ms to minimize.
[2023-03-21 04:31:39] [INFO ] Deduced a trap composed of 17 places in 378 ms of which 1 ms to minimize.
[2023-03-21 04:31:39] [INFO ] Deduced a trap composed of 17 places in 326 ms of which 1 ms to minimize.
[2023-03-21 04:31:40] [INFO ] Deduced a trap composed of 18 places in 320 ms of which 1 ms to minimize.
[2023-03-21 04:31:40] [INFO ] Deduced a trap composed of 17 places in 280 ms of which 0 ms to minimize.
[2023-03-21 04:31:40] [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 04:31:40] [INFO ] [Real]Absence check using 10 positive place invariants in 15 ms returned sat
[2023-03-21 04:31:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 04:31:41] [INFO ] [Real]Absence check using state equation in 499 ms returned sat
[2023-03-21 04:31:41] [INFO ] Solution in real domain found non-integer solution.
[2023-03-21 04:31:41] [INFO ] [Nat]Absence check using 10 positive place invariants in 15 ms returned sat
[2023-03-21 04:31:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-21 04:31:41] [INFO ] [Nat]Absence check using state equation in 458 ms returned sat
[2023-03-21 04:31:42] [INFO ] [Nat]Added 1147 Read/Feed constraints in 465 ms returned sat
[2023-03-21 04:31:42] [INFO ] Deduced a trap composed of 18 places in 606 ms of which 1 ms to minimize.
[2023-03-21 04:31:43] [INFO ] Deduced a trap composed of 17 places in 457 ms of which 1 ms to minimize.
[2023-03-21 04:31:43] [INFO ] Deduced a trap composed of 18 places in 375 ms of which 1 ms to minimize.
[2023-03-21 04:31:44] [INFO ] Deduced a trap composed of 18 places in 404 ms of which 1 ms to minimize.
[2023-03-21 04:31:44] [INFO ] Deduced a trap composed of 18 places in 260 ms of which 1 ms to minimize.
[2023-03-21 04:31:45] [INFO ] Deduced a trap composed of 17 places in 412 ms of which 1 ms to minimize.
[2023-03-21 04:31:45] [INFO ] Deduced a trap composed of 17 places in 345 ms of which 1 ms to minimize.
[2023-03-21 04:31:45] [INFO ] Deduced a trap composed of 17 places in 277 ms of which 1 ms to minimize.
[2023-03-21 04:31:46] [INFO ] Deduced a trap composed of 17 places in 279 ms of which 1 ms to minimize.
[2023-03-21 04:31:46] [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 04:31:46] [INFO ] [Real]Absence check using 10 positive place invariants in 13 ms returned sat
[2023-03-21 04:31:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 04:31:46] [INFO ] [Real]Absence check using state equation in 443 ms returned sat
[2023-03-21 04:31:46] [INFO ] Solution in real domain found non-integer solution.
[2023-03-21 04:31:47] [INFO ] [Nat]Absence check using 10 positive place invariants in 12 ms returned sat
[2023-03-21 04:31:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-21 04:31:47] [INFO ] [Nat]Absence check using state equation in 424 ms returned sat
[2023-03-21 04:31:47] [INFO ] [Nat]Added 1147 Read/Feed constraints in 362 ms returned sat
[2023-03-21 04:31:48] [INFO ] Deduced a trap composed of 16 places in 780 ms of which 5 ms to minimize.
[2023-03-21 04:31:49] [INFO ] Deduced a trap composed of 18 places in 605 ms of which 1 ms to minimize.
[2023-03-21 04:31:49] [INFO ] Deduced a trap composed of 18 places in 506 ms of which 1 ms to minimize.
[2023-03-21 04:31:50] [INFO ] Deduced a trap composed of 17 places in 417 ms of which 1 ms to minimize.
[2023-03-21 04:31:50] [INFO ] Deduced a trap composed of 16 places in 352 ms of which 0 ms to minimize.
[2023-03-21 04:31:51] [INFO ] Deduced a trap composed of 18 places in 362 ms of which 1 ms to minimize.
[2023-03-21 04:31:51] [INFO ] Deduced a trap composed of 17 places in 283 ms of which 1 ms to minimize.
[2023-03-21 04:31:51] [INFO ] Deduced a trap composed of 16 places in 205 ms of which 1 ms to minimize.
[2023-03-21 04:31:51] [INFO ] Trap strengthening (SAT) tested/added 8/8 trap constraints in 4104 ms
[2023-03-21 04:31:52] [INFO ] [Real]Absence check using 10 positive place invariants in 17 ms returned sat
[2023-03-21 04:31:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 04:31:52] [INFO ] [Real]Absence check using state equation in 554 ms returned sat
[2023-03-21 04:31:52] [INFO ] Solution in real domain found non-integer solution.
[2023-03-21 04:31:52] [INFO ] [Nat]Absence check using 10 positive place invariants in 15 ms returned sat
[2023-03-21 04:31:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-21 04:31:53] [INFO ] [Nat]Absence check using state equation in 434 ms returned sat
[2023-03-21 04:31:53] [INFO ] [Nat]Added 1147 Read/Feed constraints in 320 ms returned sat
[2023-03-21 04:31:54] [INFO ] Deduced a trap composed of 16 places in 700 ms of which 1 ms to minimize.
[2023-03-21 04:31:54] [INFO ] Deduced a trap composed of 16 places in 558 ms of which 1 ms to minimize.
[2023-03-21 04:31:55] [INFO ] Deduced a trap composed of 17 places in 513 ms of which 1 ms to minimize.
[2023-03-21 04:31:56] [INFO ] Deduced a trap composed of 16 places in 407 ms of which 2 ms to minimize.
[2023-03-21 04:31:56] [INFO ] Deduced a trap composed of 18 places in 331 ms of which 1 ms to minimize.
[2023-03-21 04:31:56] [INFO ] Deduced a trap composed of 16 places in 349 ms of which 1 ms to minimize.
[2023-03-21 04:31:57] [INFO ] Deduced a trap composed of 18 places in 285 ms of which 1 ms to minimize.
[2023-03-21 04:31:57] [INFO ] Deduced a trap composed of 16 places in 214 ms of which 0 ms to minimize.
[2023-03-21 04:31:57] [INFO ] Deduced a trap composed of 16 places in 210 ms of which 1 ms to minimize.
[2023-03-21 04:31:57] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 6
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.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 04:31:57] [INFO ] [Real]Absence check using 10 positive place invariants in 10 ms returned sat
[2023-03-21 04:31:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 04:31:58] [INFO ] [Real]Absence check using state equation in 360 ms returned sat
[2023-03-21 04:31:58] [INFO ] Solution in real domain found non-integer solution.
[2023-03-21 04:31:58] [INFO ] [Nat]Absence check using 10 positive place invariants in 11 ms returned sat
[2023-03-21 04:31:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-21 04:31:58] [INFO ] [Nat]Absence check using state equation in 366 ms returned sat
[2023-03-21 04:31:59] [INFO ] [Nat]Added 1147 Read/Feed constraints in 398 ms returned sat
[2023-03-21 04:31:59] [INFO ] Deduced a trap composed of 17 places in 775 ms of which 6 ms to minimize.
[2023-03-21 04:32:00] [INFO ] Deduced a trap composed of 17 places in 754 ms of which 1 ms to minimize.
[2023-03-21 04:32:01] [INFO ] Deduced a trap composed of 17 places in 695 ms of which 2 ms to minimize.
[2023-03-21 04:32:02] [INFO ] Deduced a trap composed of 17 places in 615 ms of which 1 ms to minimize.
[2023-03-21 04:32:02] [INFO ] Deduced a trap composed of 16 places in 491 ms of which 0 ms to minimize.
[2023-03-21 04:32:03] [INFO ] Deduced a trap composed of 19 places in 411 ms of which 1 ms to minimize.
[2023-03-21 04:32:03] [INFO ] Trap strengthening (SAT) tested/added 6/6 trap constraints in 4150 ms
[2023-03-21 04:32:03] [INFO ] [Real]Absence check using 10 positive place invariants in 10 ms returned sat
[2023-03-21 04:32:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 04:32:03] [INFO ] [Real]Absence check using state equation in 403 ms returned sat
[2023-03-21 04:32:03] [INFO ] Solution in real domain found non-integer solution.
[2023-03-21 04:32:03] [INFO ] [Nat]Absence check using 10 positive place invariants in 12 ms returned sat
[2023-03-21 04:32:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-21 04:32:04] [INFO ] [Nat]Absence check using state equation in 430 ms returned sat
[2023-03-21 04:32:04] [INFO ] [Nat]Added 1147 Read/Feed constraints in 388 ms returned sat
[2023-03-21 04:32:05] [INFO ] Deduced a trap composed of 17 places in 710 ms of which 7 ms to minimize.
[2023-03-21 04:32:06] [INFO ] Deduced a trap composed of 18 places in 535 ms of which 2 ms to minimize.
[2023-03-21 04:32:06] [INFO ] Deduced a trap composed of 19 places in 551 ms of which 4 ms to minimize.
[2023-03-21 04:32:07] [INFO ] Deduced a trap composed of 17 places in 524 ms of which 1 ms to minimize.
[2023-03-21 04:32:07] [INFO ] Deduced a trap composed of 16 places in 450 ms of which 2 ms to minimize.
[2023-03-21 04:32:08] [INFO ] Deduced a trap composed of 16 places in 463 ms of which 1 ms to minimize.
[2023-03-21 04:32:08] [INFO ] Deduced a trap composed of 19 places in 489 ms of which 0 ms to minimize.
[2023-03-21 04:32:08] [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 04:32:09] [INFO ] [Real]Absence check using 10 positive place invariants in 11 ms returned sat
[2023-03-21 04:32:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 04:32:09] [INFO ] [Real]Absence check using state equation in 422 ms returned sat
[2023-03-21 04:32:09] [INFO ] [Real]Added 1147 Read/Feed constraints in 265 ms returned sat
[2023-03-21 04:32:09] [INFO ] Solution in real domain found non-integer solution.
[2023-03-21 04:32:10] [INFO ] [Nat]Absence check using 10 positive place invariants in 17 ms returned sat
[2023-03-21 04:32:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-21 04:32:10] [INFO ] [Nat]Absence check using state equation in 508 ms returned sat
[2023-03-21 04:32:10] [INFO ] [Nat]Added 1147 Read/Feed constraints in 384 ms returned sat
[2023-03-21 04:32:11] [INFO ] Deduced a trap composed of 16 places in 561 ms of which 1 ms to minimize.
[2023-03-21 04:32:12] [INFO ] Deduced a trap composed of 17 places in 457 ms of which 1 ms to minimize.
[2023-03-21 04:32:12] [INFO ] Deduced a trap composed of 18 places in 367 ms of which 0 ms to minimize.
[2023-03-21 04:32:12] [INFO ] Deduced a trap composed of 16 places in 385 ms of which 1 ms to minimize.
[2023-03-21 04:32:13] [INFO ] Deduced a trap composed of 17 places in 447 ms of which 1 ms to minimize.
[2023-03-21 04:32:13] [INFO ] Deduced a trap composed of 17 places in 434 ms of which 0 ms to minimize.
[2023-03-21 04:32:14] [INFO ] Deduced a trap composed of 17 places in 363 ms of which 1 ms to minimize.
[2023-03-21 04:32:14] [INFO ] Deduced a trap composed of 16 places in 302 ms of which 1 ms to minimize.
[2023-03-21 04:32:14] [INFO ] Trap strengthening (SAT) tested/added 8/8 trap constraints in 3956 ms
[2023-03-21 04:32:14] [INFO ] [Real]Absence check using 10 positive place invariants in 10 ms returned sat
[2023-03-21 04:32:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 04:32:15] [INFO ] [Real]Absence check using state equation in 482 ms returned sat
[2023-03-21 04:32:15] [INFO ] Solution in real domain found non-integer solution.
[2023-03-21 04:32:15] [INFO ] [Nat]Absence check using 10 positive place invariants in 10 ms returned sat
[2023-03-21 04:32:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-21 04:32:15] [INFO ] [Nat]Absence check using state equation in 361 ms returned sat
[2023-03-21 04:32:16] [INFO ] [Nat]Added 1147 Read/Feed constraints in 303 ms returned sat
[2023-03-21 04:32:16] [INFO ] Deduced a trap composed of 16 places in 546 ms of which 1 ms to minimize.
[2023-03-21 04:32:17] [INFO ] Deduced a trap composed of 17 places in 455 ms of which 1 ms to minimize.
[2023-03-21 04:32:17] [INFO ] Deduced a trap composed of 16 places in 389 ms of which 1 ms to minimize.
[2023-03-21 04:32:18] [INFO ] Deduced a trap composed of 17 places in 318 ms of which 1 ms to minimize.
[2023-03-21 04:32:18] [INFO ] Deduced a trap composed of 16 places in 320 ms of which 0 ms to minimize.
[2023-03-21 04:32:18] [INFO ] Deduced a trap composed of 16 places in 266 ms of which 0 ms to minimize.
[2023-03-21 04:32:19] [INFO ] Deduced a trap composed of 17 places in 264 ms of which 0 ms to minimize.
[2023-03-21 04:32:19] [INFO ] Deduced a trap composed of 16 places in 205 ms of which 0 ms to minimize.
[2023-03-21 04:32:19] [INFO ] Deduced a trap composed of 16 places in 154 ms of which 0 ms to minimize.
[2023-03-21 04:32:19] [INFO ] Deduced a trap composed of 16 places in 153 ms of which 1 ms to minimize.
[2023-03-21 04:32:20] [INFO ] Deduced a trap composed of 18 places in 106 ms of which 0 ms to minimize.
[2023-03-21 04:32:20] [INFO ] Deduced a trap composed of 16 places in 154 ms of which 0 ms to minimize.
[2023-03-21 04:32:20] [INFO ] Deduced a trap composed of 16 places in 126 ms of which 1 ms to minimize.
[2023-03-21 04:32:20] [INFO ] Trap strengthening (SAT) tested/added 13/13 trap constraints in 4251 ms
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] Max seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
FORMULA StigmergyCommit-PT-08a-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 10 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.23 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 53 transitions
Trivial Post-agglo rules discarded 53 transitions
Performed 53 trivial Post agglomeration. Transition count delta: 53
Iterating post reduction 0 with 81 rules applied. Total rules applied 82 place count 319 transition count 1359
Reduce places removed 53 places and 0 transitions.
Ensure Unique test removed 35 transitions
Reduce isomorphic transitions removed 35 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 97 rules applied. Total rules applied 179 place count 266 transition count 1315
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 188 place count 257 transition count 1315
Performed 59 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 59 Pre rules applied. Total rules applied 188 place count 257 transition count 1256
Deduced a syphon composed of 59 places in 1 ms
Reduce places removed 59 places and 0 transitions.
Iterating global reduction 3 with 118 rules applied. Total rules applied 306 place count 198 transition count 1256
Discarding 44 places :
Symmetric choice reduction at 3 with 44 rule applications. Total rules 350 place count 154 transition count 1212
Iterating global reduction 3 with 44 rules applied. Total rules applied 394 place count 154 transition count 1212
Discarding 43 places :
Symmetric choice reduction at 3 with 43 rule applications. Total rules 437 place count 111 transition count 1169
Iterating global reduction 3 with 43 rules applied. Total rules applied 480 place count 111 transition count 1169
Ensure Unique test removed 518 transitions
Reduce isomorphic transitions removed 518 transitions.
Iterating post reduction 3 with 518 rules applied. Total rules applied 998 place count 111 transition count 651
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 1006 place count 103 transition count 643
Iterating global reduction 4 with 8 rules applied. Total rules applied 1014 place count 103 transition count 643
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 1020 place count 97 transition count 637
Iterating global reduction 4 with 6 rules applied. Total rules applied 1026 place count 97 transition count 637
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 1031 place count 97 transition count 632
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 1 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 5 with 30 rules applied. Total rules applied 1061 place count 82 transition count 617
Drop transitions removed 6 transitions
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 5 with 12 rules applied. Total rules applied 1073 place count 82 transition count 605
Discarding 8 places :
Symmetric choice reduction at 6 with 8 rule applications. Total rules 1081 place count 74 transition count 597
Iterating global reduction 6 with 8 rules applied. Total rules applied 1089 place count 74 transition count 597
Discarding 7 places :
Symmetric choice reduction at 6 with 7 rule applications. Total rules 1096 place count 67 transition count 590
Iterating global reduction 6 with 7 rules applied. Total rules applied 1103 place count 67 transition count 590
Discarding 7 places :
Symmetric choice reduction at 6 with 7 rule applications. Total rules 1110 place count 60 transition count 583
Iterating global reduction 6 with 7 rules applied. Total rules applied 1117 place count 60 transition count 583
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 6 with 3 rules applied. Total rules applied 1120 place count 60 transition count 580
Free-agglomeration rule applied 3 times.
Iterating global reduction 6 with 3 rules applied. Total rules applied 1123 place count 60 transition count 577
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 1126 place count 57 transition count 577
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 1127 place count 57 transition count 576
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 7 with 5 rules applied. Total rules applied 1132 place count 57 transition count 576
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 7 with 3 rules applied. Total rules applied 1135 place count 57 transition count 573
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 1136 place count 56 transition count 572
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 7 with 7 rules applied. Total rules applied 1143 place count 55 transition count 566
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 8 with 6 rules applied. Total rules applied 1149 place count 49 transition count 566
Performed 13 Post agglomeration using F-continuation condition with reduction of 499 identical transitions.
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 9 with 26 rules applied. Total rules applied 1175 place count 36 transition count 54
Drop transitions removed 9 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 9 with 10 rules applied. Total rules applied 1185 place count 36 transition count 44
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 10 with 16 rules applied. Total rules applied 1201 place count 26 transition count 38
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 10 with 6 rules applied. Total rules applied 1207 place count 26 transition count 32
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 11 with 2 rules applied. Total rules applied 1209 place count 26 transition count 30
Free-agglomeration rule applied 1 times.
Iterating global reduction 11 with 1 rules applied. Total rules applied 1210 place count 26 transition count 29
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 11 with 1 rules applied. Total rules applied 1211 place count 25 transition count 29
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 12 with 1 rules applied. Total rules applied 1212 place count 25 transition count 29
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 12 with 1 rules applied. Total rules applied 1213 place count 25 transition count 28
Reduce places removed 3 places and 3 transitions.
Iterating global reduction 13 with 3 rules applied. Total rules applied 1216 place count 22 transition count 25
Applied a total of 1216 rules in 1018 ms. Remains 22 /328 variables (removed 306) and now considering 25/1449 (removed 1424) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1019 ms. Remains : 22/328 places, 25/1449 transitions.
// Phase 1: matrix 25 rows 22 cols
[2023-03-21 04:32:21] [INFO ] Computed 5 place invariants in 3 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 836 ms. (steps per millisecond=1196 ) properties (out of 10) seen :10
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-10 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-03 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 69074 ms.
ITS solved all properties within timeout
BK_STOP 1679373143458
--------------------
content from stderr:
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -timeout 360 -rebuildPNML
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="StigmergyCommit-PT-08a"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="smartxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool smartxred"
echo " Input is 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 r459-smll-167912651300493"
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 '
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 ;