About the Execution of LoLa+red for LeafsetExtension-PT-S64C4
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 905.399 | 71329.00 | 85150.00 | 562.30 | 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.r231-tall-167856416200541.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 lolaxred
Input is LeafsetExtension-PT-S64C4, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r231-tall-167856416200541
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 14M
-rw-r--r-- 1 mcc users 15K Feb 25 16:55 CTLCardinality.txt
-rw-r--r-- 1 mcc users 97K Feb 25 16:55 CTLCardinality.xml
-rw-r--r-- 1 mcc users 9.2K Feb 25 16:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K Feb 25 16:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 5.8K Feb 25 16:21 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 16:21 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.3K Feb 25 16:21 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Feb 25 16:21 LTLFireability.xml
-rw-r--r-- 1 mcc users 29K Feb 25 16:56 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 183K Feb 25 16:56 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 15K Feb 25 16:55 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 65K Feb 25 16:55 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 16:21 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.3K Feb 25 16:21 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 14M Mar 5 18:22 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 LeafsetExtension-PT-S64C4-UpperBounds-00
FORMULA_NAME LeafsetExtension-PT-S64C4-UpperBounds-01
FORMULA_NAME LeafsetExtension-PT-S64C4-UpperBounds-02
FORMULA_NAME LeafsetExtension-PT-S64C4-UpperBounds-03
FORMULA_NAME LeafsetExtension-PT-S64C4-UpperBounds-04
FORMULA_NAME LeafsetExtension-PT-S64C4-UpperBounds-05
FORMULA_NAME LeafsetExtension-PT-S64C4-UpperBounds-06
FORMULA_NAME LeafsetExtension-PT-S64C4-UpperBounds-07
FORMULA_NAME LeafsetExtension-PT-S64C4-UpperBounds-08
FORMULA_NAME LeafsetExtension-PT-S64C4-UpperBounds-09
FORMULA_NAME LeafsetExtension-PT-S64C4-UpperBounds-10
FORMULA_NAME LeafsetExtension-PT-S64C4-UpperBounds-11
FORMULA_NAME LeafsetExtension-PT-S64C4-UpperBounds-12
FORMULA_NAME LeafsetExtension-PT-S64C4-UpperBounds-13
FORMULA_NAME LeafsetExtension-PT-S64C4-UpperBounds-14
FORMULA_NAME LeafsetExtension-PT-S64C4-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1679462614147
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=lolaxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=LeafsetExtension-PT-S64C4
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-22 05:23:35] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-22 05:23:35] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-22 05:23:36] [INFO ] Load time of PNML (sax parser for PT used): 527 ms
[2023-03-22 05:23:36] [INFO ] Transformed 21462 places.
[2023-03-22 05:23:36] [INFO ] Transformed 21129 transitions.
[2023-03-22 05:23:36] [INFO ] Parsed PT model containing 21462 places and 21129 transitions and 67740 arcs in 664 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 8 ms.
// Phase 1: matrix 21129 rows 21462 cols
[2023-03-22 05:23:39] [INFO ] Computed 333 place invariants in 2640 ms
Incomplete random walk after 10000 steps, including 302 resets, run finished after 241 ms. (steps per millisecond=41 ) properties (out of 16) seen :3
FORMULA LeafsetExtension-PT-S64C4-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LeafsetExtension-PT-S64C4-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LeafsetExtension-PT-S64C4-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 13) seen :2
FORMULA LeafsetExtension-PT-S64C4-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA LeafsetExtension-PT-S64C4-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 11) seen :0
[2023-03-22 05:23:39] [INFO ] Invariant cache hit.
[2023-03-22 05:23:43] [INFO ] [Real]Absence check using 67 positive place invariants in 759 ms returned sat
[2023-03-22 05:23:43] [INFO ] [Real]Absence check using 67 positive and 266 generalized place invariants in 598 ms returned sat
[2023-03-22 05:23:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 05:23:44] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:899)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2618)
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-22 05:23:48] [INFO ] [Real]Absence check using 67 positive place invariants in 747 ms returned sat
[2023-03-22 05:23:48] [INFO ] [Real]Absence check using 67 positive and 266 generalized place invariants in 571 ms returned sat
[2023-03-22 05:23:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 05:23:49] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Stream closed... while checking expression at index 1
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Stream closed...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:899)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2618)
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-22 05:23:52] [INFO ] [Real]Absence check using 67 positive place invariants in 735 ms returned sat
[2023-03-22 05:23:53] [INFO ] [Real]Absence check using 67 positive and 266 generalized place invariants in 583 ms returned sat
[2023-03-22 05:23:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 05:23:54] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ... while checking expression at index 2
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:899)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2618)
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-22 05:23:58] [INFO ] [Real]Absence check using 67 positive place invariants in 747 ms returned sat
[2023-03-22 05:23:58] [INFO ] [Real]Absence check using 67 positive and 266 generalized place invariants in 603 ms returned sat
[2023-03-22 05:23:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 05:23:59] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ... while checking expression at index 3
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:899)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2618)
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-22 05:24:02] [INFO ] [Real]Absence check using 67 positive place invariants in 713 ms returned sat
[2023-03-22 05:24:03] [INFO ] [Real]Absence check using 67 positive and 266 generalized place invariants in 534 ms returned sat
[2023-03-22 05:24:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 05:24:04] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ... while checking expression at index 4
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:899)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2618)
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-22 05:24:08] [INFO ] [Real]Absence check using 67 positive place invariants in 733 ms returned sat
[2023-03-22 05:24:08] [INFO ] [Real]Absence check using 67 positive and 266 generalized place invariants in 585 ms returned sat
[2023-03-22 05:24:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 05:24:09] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ... while checking expression at index 5
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:899)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2618)
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-22 05:24:13] [INFO ] [Real]Absence check using 67 positive place invariants in 750 ms returned sat
[2023-03-22 05:24:13] [INFO ] [Real]Absence check using 67 positive and 266 generalized place invariants in 609 ms returned sat
[2023-03-22 05:24:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 05:24:14] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")... while checking expression at index 6
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:899)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2618)
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-22 05:24:18] [INFO ] [Real]Absence check using 67 positive place invariants in 782 ms returned sat
[2023-03-22 05:24:18] [INFO ] [Real]Absence check using 67 positive and 266 generalized place invariants in 604 ms returned sat
[2023-03-22 05:24:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 05:24:19] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ... while checking expression at index 7
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:899)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2618)
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-22 05:24:22] [INFO ] [Real]Absence check using 67 positive place invariants in 702 ms returned sat
[2023-03-22 05:24:23] [INFO ] [Real]Absence check using 67 positive and 266 generalized place invariants in 538 ms returned sat
[2023-03-22 05:24:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 05:24:24] [INFO ] [Real]Absence check using state equation in 1518 ms returned unknown
[2023-03-22 05:24:27] [INFO ] [Real]Absence check using 67 positive place invariants in 733 ms returned sat
[2023-03-22 05:24:28] [INFO ] [Real]Absence check using 67 positive and 266 generalized place invariants in 568 ms returned sat
[2023-03-22 05:24:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 05:24:29] [INFO ] [Real]Absence check using state equation in 1530 ms returned unknown
[2023-03-22 05:24:32] [INFO ] [Real]Absence check using 67 positive place invariants in 734 ms returned sat
[2023-03-22 05:24:33] [INFO ] [Real]Absence check using 67 positive and 266 generalized place invariants in 571 ms returned sat
[2023-03-22 05:24:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 05:24:34] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")... while checking expression at index 10
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:899)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2618)
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, 1] Max seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Support contains 11 out of 21462 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 21462/21462 places, 21129/21129 transitions.
Graph (complete) has 42457 edges and 21462 vertex of which 620 are kept as prefixes of interest. Removing 20842 places using SCC suffix rule.32 ms
Discarding 20842 places :
Also discarding 12216 output transitions
Drop transitions removed 12216 transitions
Drop transitions removed 4275 transitions
Reduce isomorphic transitions removed 4275 transitions.
Drop transitions removed 190 transitions
Trivial Post-agglo rules discarded 190 transitions
Performed 190 trivial Post agglomeration. Transition count delta: 190
Iterating post reduction 0 with 4465 rules applied. Total rules applied 4466 place count 620 transition count 4448
Reduce places removed 192 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 1 with 198 rules applied. Total rules applied 4664 place count 428 transition count 4442
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 4670 place count 422 transition count 4442
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 4670 place count 422 transition count 4434
Deduced a syphon composed of 8 places in 2 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 4686 place count 414 transition count 4434
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 4688 place count 414 transition count 4432
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 4690 place count 412 transition count 4432
Partial Free-agglomeration rule applied 186 times.
Drop transitions removed 186 transitions
Iterating global reduction 4 with 186 rules applied. Total rules applied 4876 place count 412 transition count 4432
Discarding 6 places :
Implicit places reduction removed 6 places
Iterating post reduction 4 with 6 rules applied. Total rules applied 4882 place count 406 transition count 4432
Free-agglomeration rule (complex) applied 4 times.
Iterating global reduction 5 with 4 rules applied. Total rules applied 4886 place count 406 transition count 4428
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 4890 place count 402 transition count 4428
Applied a total of 4890 rules in 592 ms. Remains 402 /21462 variables (removed 21060) and now considering 4428/21129 (removed 16701) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 593 ms. Remains : 402/21462 places, 4428/21129 transitions.
Successfully produced net in file /tmp/petri1000_14042691355479225242.dot
Successfully produced net in file /tmp/petri1001_8097258718498843956.dot
Successfully produced net in file /tmp/petri1002_11086171383267324186.dot
Successfully produced net in file /tmp/petri1003_10110249477469856167.dot
Successfully produced net in file /tmp/petri1004_7836858221297654390.dot
Successfully produced net in file /tmp/petri1005_4142587462104873238.dot
Successfully produced net in file /tmp/petri1006_10291692260677093874.dot
Successfully produced net in file /tmp/petri1007_12819762676586368512.dot
Successfully produced net in file /tmp/petri1008_12533742168782687093.dot
Successfully produced net in file /tmp/petri1009_13623261092298295461.dot
Successfully produced net in file /tmp/petri1010_9372871522448511343.dot
Successfully produced net in file /tmp/petri1011_13706449387434640387.dot
Successfully produced net in file /tmp/petri1012_17419240940372497812.dot
Successfully produced net in file /tmp/petri1013_4677467249212575961.dot
Successfully produced net in file /tmp/petri1014_5586783584224641519.dot
Successfully produced net in file /tmp/petri1015_10565544602790259585.dot
Successfully produced net in file /tmp/petri1016_13299247681367176519.dot
Successfully produced net in file /tmp/petri1017_3442528733976217177.dot
Successfully produced net in file /tmp/petri1018_17107293248759484885.dot
Successfully produced net in file /tmp/petri1019_6911368584829397388.dot
Successfully produced net in file /tmp/petri1020_17520198231571719246.dot
Successfully produced net in file /tmp/petri1021_14541831640564058002.dot
Successfully produced net in file /tmp/petri1022_13833640835133907316.dot
Successfully produced net in file /tmp/petri1023_1887059530161035422.dot
Successfully produced net in file /tmp/petri1024_2708374094368781154.dot
Successfully produced net in file /tmp/petri1025_16445787927908297592.dot
Successfully produced net in file /tmp/petri1026_1868344792671857299.dot
Successfully produced net in file /tmp/petri1027_5479869109235249423.dot
Successfully produced net in file /tmp/petri1028_17827794594176824664.dot
Successfully produced net in file /tmp/petri1029_16887983448514132719.dot
Successfully produced net in file /tmp/petri1030_7488039555619337278.dot
Successfully produced net in file /tmp/petri1031_15420048504415178519.dot
Successfully produced net in file /tmp/petri1032_5554185333920261594.dot
Successfully produced net in file /tmp/petri1033_6819710108389218464.dot
Successfully produced net in file /tmp/petri1034_4093306751078490269.dot
Successfully produced net in file /tmp/petri1035_12553496728807009030.dot
Successfully produced net in file /tmp/petri1036_5843245825733931567.dot
Successfully produced net in file /tmp/petri1037_281344947215142703.dot
Successfully produced net in file /tmp/petri1038_10625296090413429419.dot
Successfully produced net in file /tmp/petri1039_14332695558100542903.dot
Successfully produced net in file /tmp/petri1040_8188366357031847436.dot
Successfully produced net in file /tmp/petri1041_8785877772924362041.dot
Successfully produced net in file /tmp/petri1042_2904121558562542422.dot
Successfully produced net in file /tmp/petri1043_15253518437865932082.dot
Successfully produced net in file /tmp/petri1044_7156385417849688210.dot
Successfully produced net in file /tmp/petri1045_10266380824662997423.dot
Successfully produced net in file /tmp/petri1046_7274747615505668028.dot
Successfully produced net in file /tmp/petri1047_17419799746762892982.dot
Successfully produced net in file /tmp/petri1048_4120306154821625149.dot
Successfully produced net in file /tmp/petri1049_9627756844125066495.dot
Successfully produced net in file /tmp/petri1050_14415352367470084534.dot
Successfully produced net in file /tmp/petri1051_13500613042333521371.dot
Successfully produced net in file /tmp/petri1052_3203583430699405213.dot
Successfully produced net in file /tmp/petri1053_11918377706702991353.dot
Successfully produced net in file /tmp/petri1054_12324111648521743187.dot
Successfully produced net in file /tmp/petri1055_17033341642262313362.dot
Successfully produced net in file /tmp/petri1056_10211541283609063866.dot
Successfully produced net in file /tmp/petri1057_12749158688219560223.dot
Successfully produced net in file /tmp/petri1058_15756112758853169745.dot
Successfully produced net in file /tmp/petri1059_2786859739818630893.dot
Successfully produced net in file /tmp/petri1060_13803978056355210053.dot
Successfully produced net in file /tmp/petri1061_14790763537348082399.dot
Successfully produced net in file /tmp/petri1062_9826233469687795816.dot
Successfully produced net in file /tmp/petri1063_7490606062343179523.dot
Successfully produced net in file /tmp/petri1064_642374597764043600.dot
Successfully produced net in file /tmp/petri1065_9468483434411774640.dot
Successfully produced net in file /tmp/petri1066_5535974706572447172.dot
Successfully produced net in file /tmp/petri1067_10787633911678878342.dot
Successfully produced net in file /tmp/petri1068_3897281358833091829.dot
Successfully produced net in file /tmp/petri1069_9888831800455970863.dot
Successfully produced net in file /tmp/petri1070_6323662908673272962.dot
Successfully produced net in file /tmp/petri1071_6598088504955842010.dot
Successfully produced net in file /tmp/petri1072_18027390161978286520.dot
Successfully produced net in file /tmp/petri1073_16135956115676455308.dot
Successfully produced net in file /tmp/petri1074_14961728165848209551.dot
Successfully produced net in file /tmp/petri1075_18270996965185201255.dot
Successfully produced net in file /tmp/petri1076_2298832222946787734.dot
Successfully produced net in file /tmp/petri1077_8876184320253905809.dot
Successfully produced net in file /tmp/petri1078_2287865161020802423.dot
Successfully produced net in file /tmp/petri1079_5645370662904006697.dot
Successfully produced net in file /tmp/petri1080_2841544085427067160.dot
Successfully produced net in file /tmp/petri1081_13266377792384731224.dot
Successfully produced net in file /tmp/petri1082_12459968892435725555.dot
Successfully produced net in file /tmp/petri1083_1075596326393010059.dot
Successfully produced net in file /tmp/petri1084_1033273976168298629.dot
Successfully produced net in file /tmp/petri1085_4655562234622578429.dot
Successfully produced net in file /tmp/petri1086_16350228398533052498.dot
Successfully produced net in file /tmp/petri1087_15642790386681143171.dot
Successfully produced net in file /tmp/petri1088_15063583641368168483.dot
Successfully produced net in file /tmp/petri1089_15024370459650393000.dot
Successfully produced net in file /tmp/petri1090_89942158542323815.dot
Successfully produced net in file /tmp/petri1091_6971823647463825475.dot
Successfully produced net in file /tmp/petri1092_5383713434195129895.dot
Successfully produced net in file /tmp/petri1093_6689922499271295780.dot
Successfully produced net in file /tmp/petri1094_4917297790678745116.dot
Successfully produced net in file /tmp/petri1095_10349981139354055340.dot
Successfully produced net in file /tmp/petri1096_17867366659230800269.dot
Successfully produced net in file /tmp/petri1097_9356580796717234826.dot
Successfully produced net in file /tmp/petri1098_3220501505706692509.dot
Successfully produced net in file /tmp/petri1099_14976585790193903880.dot
Successfully produced net in file /tmp/petri1100_13916431035594802005.dot
Successfully produced net in file /tmp/petri1101_5467646257855877681.dot
Successfully produced net in file /tmp/petri1102_11784974198213698628.dot
Successfully produced net in file /tmp/petri1103_17683139886675232266.dot
Successfully produced net in file /tmp/petri1104_10457782389218984737.dot
Successfully produced net in file /tmp/petri1105_7556924731693314028.dot
Successfully produced net in file /tmp/petri1106_3391844542591055729.dot
Successfully produced net in file /tmp/petri1107_12521886335611273093.dot
Successfully produced net in file /tmp/petri1108_3454262538842497301.dot
Successfully produced net in file /tmp/petri1109_7902050319985339552.dot
Successfully produced net in file /tmp/petri1110_682991980101699241.dot
Successfully produced net in file /tmp/petri1111_16927357737390141275.dot
Successfully produced net in file /tmp/petri1112_17941378372999317732.dot
Successfully produced net in file /tmp/petri1113_8948620350146081853.dot
Successfully produced net in file /tmp/petri1114_13320087811129071191.dot
Successfully produced net in file /tmp/petri1115_6701607983434801550.dot
Successfully produced net in file /tmp/petri1116_16157787729833617578.dot
Successfully produced net in file /tmp/petri1117_4931941824898847677.dot
Successfully produced net in file /tmp/petri1118_7002477768438177583.dot
Successfully produced net in file /tmp/petri1119_12526280794838251233.dot
Successfully produced net in file /tmp/petri1120_11839298824288679260.dot
Successfully produced net in file /tmp/petri1121_9782731619192135696.dot
Successfully produced net in file /tmp/petri1122_13830194770856881112.dot
Successfully produced net in file /tmp/petri1123_1871134027765577913.dot
Successfully produced net in file /tmp/petri1124_13280797741689975253.dot
Successfully produced net in file /tmp/petri1125_12096831231072926967.dot
Successfully produced net in file /tmp/petri1126_15030113399833476167.dot
Successfully produced net in file /tmp/petri1127_1847609389319858465.dot
Successfully produced net in file /tmp/petri1128_3425325200262211902.dot
Successfully produced net in file /tmp/petri1129_11835395918004348962.dot
Successfully produced net in file /tmp/petri1130_2961196239640365128.dot
Successfully produced net in file /tmp/petri1131_11890139838880106996.dot
Successfully produced net in file /tmp/petri1132_3242459744191516323.dot
Successfully produced net in file /tmp/petri1133_10617716842317846522.dot
Successfully produced net in file /tmp/petri1134_16861088015447519521.dot
Successfully produced net in file /tmp/petri1135_11634843341314536997.dot
Successfully produced net in file /tmp/petri1136_289657790977537047.dot
Successfully produced net in file /tmp/petri1137_13287812102825294037.dot
Successfully produced net in file /tmp/petri1138_11463995817281313979.dot
Successfully produced net in file /tmp/petri1139_592881767721833864.dot
Successfully produced net in file /tmp/petri1140_10019338404104840851.dot
Successfully produced net in file /tmp/petri1141_87136045733258909.dot
Successfully produced net in file /tmp/petri1142_154348754972118930.dot
Successfully produced net in file /tmp/petri1143_16177112035227119225.dot
Successfully produced net in file /tmp/petri1144_10851920993746950269.dot
Successfully produced net in file /tmp/petri1145_3754843579084906988.dot
Successfully produced net in file /tmp/petri1146_6773866502990529501.dot
Successfully produced net in file /tmp/petri1147_14808135519755781277.dot
Successfully produced net in file /tmp/petri1148_7300089118206768960.dot
Successfully produced net in file /tmp/petri1149_9607690269410716335.dot
Successfully produced net in file /tmp/petri1150_11215969210893030968.dot
Successfully produced net in file /tmp/petri1151_12324481038039605587.dot
Successfully produced net in file /tmp/petri1152_652018326441206116.dot
Successfully produced net in file /tmp/petri1153_6210951853482221866.dot
Successfully produced net in file /tmp/petri1154_16788540005248555515.dot
Successfully produced net in file /tmp/petri1155_14979420996920653423.dot
Successfully produced net in file /tmp/petri1156_394971917064351466.dot
Successfully produced net in file /tmp/petri1157_12963592395406884246.dot
Successfully produced net in file /tmp/petri1158_15651272906178630896.dot
Successfully produced net in file /tmp/petri1159_11567827573926312489.dot
Successfully produced net in file /tmp/petri1160_13677946445277956701.dot
Successfully produced net in file /tmp/petri1161_11233396793515375116.dot
Successfully produced net in file /tmp/petri1162_12471350342639748094.dot
Successfully produced net in file /tmp/petri1163_11282408831060322037.dot
Successfully produced net in file /tmp/petri1164_10036416874005090332.dot
Successfully produced net in file /tmp/petri1165_16059552162524525826.dot
Successfully produced net in file /tmp/petri1166_14304914867052714823.dot
Successfully produced net in file /tmp/petri1167_3453876818773094291.dot
Successfully produced net in file /tmp/petri1168_13314722361416519910.dot
Successfully produced net in file /tmp/petri1169_1936587586679168983.dot
Successfully produced net in file /tmp/petri1170_5347227391938324635.dot
Successfully produced net in file /tmp/petri1171_1657936748922557496.dot
Successfully produced net in file /tmp/petri1172_2681102592174522448.dot
Successfully produced net in file /tmp/petri1173_16336652030331931500.dot
Successfully produced net in file /tmp/petri1174_2134794263304053707.dot
Successfully produced net in file /tmp/petri1175_5621246394761221824.dot
Successfully produced net in file /tmp/petri1176_14647591876164399908.dot
Successfully produced net in file /tmp/petri1177_3805998948254395339.dot
Successfully produced net in file /tmp/petri1178_7385864024253474147.dot
Successfully produced net in file /tmp/petri1179_7851400718850699649.dot
Successfully produced net in file /tmp/petri1180_10258317587676024465.dot
Successfully produced net in file /tmp/petri1181_13186212512932905600.dot
Successfully produced net in file /tmp/petri1182_9334139133659902560.dot
Successfully produced net in file /tmp/petri1183_6912153279194034429.dot
Successfully produced net in file /tmp/petri1184_7354103182559481551.dot
Successfully produced net in file /tmp/petri1185_7476004990526115935.dot
Drop transitions removed 186 transitions
Dominated transitions for bounds rules discarded 186 transitions
Normalized transition count is 344 out of 4242 initially.
// Phase 1: matrix 344 rows 402 cols
[2023-03-22 05:24:36] [INFO ] Computed 60 place invariants in 17 ms
Incomplete random walk after 1000000 steps, including 108320 resets, run finished after 8299 ms. (steps per millisecond=120 ) properties (out of 11) seen :11
FORMULA LeafsetExtension-PT-S64C4-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LeafsetExtension-PT-S64C4-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LeafsetExtension-PT-S64C4-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LeafsetExtension-PT-S64C4-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LeafsetExtension-PT-S64C4-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LeafsetExtension-PT-S64C4-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LeafsetExtension-PT-S64C4-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LeafsetExtension-PT-S64C4-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LeafsetExtension-PT-S64C4-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LeafsetExtension-PT-S64C4-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LeafsetExtension-PT-S64C4-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 68854 ms.
ITS solved all properties within timeout
BK_STOP 1679462685476
--------------------
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="LeafsetExtension-PT-S64C4"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="lolaxred"
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 lolaxred"
echo " Input is LeafsetExtension-PT-S64C4, 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 r231-tall-167856416200541"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/LeafsetExtension-PT-S64C4.tgz
mv LeafsetExtension-PT-S64C4 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 ;