About the Execution of LoLa+red for ShieldPPPt-PT-050B
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 2114.792 | 347370.00 | 418502.00 | 73.10 | 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.r391-oct2-167903715600685.qcow2', fmt=qcow2 cluster_size=65536 extended_l2=off compression_type=zlib size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 backing_fmt=qcow2 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 ShieldPPPt-PT-050B, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r391-oct2-167903715600685
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.5M
-rw-r--r-- 1 mcc users 8.5K Feb 25 20:57 CTLCardinality.txt
-rw-r--r-- 1 mcc users 98K Feb 25 20:57 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.4K Feb 25 20:56 CTLFireability.txt
-rw-r--r-- 1 mcc users 61K Feb 25 20:56 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.5K Feb 25 17:01 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 17:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 17:01 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 17:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 16K Feb 25 20:57 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 178K Feb 25 20:57 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.7K Feb 25 20:57 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 84K Feb 25 20:57 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 17:01 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 17:01 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 955K 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 ShieldPPPt-PT-050B-UpperBounds-00
FORMULA_NAME ShieldPPPt-PT-050B-UpperBounds-01
FORMULA_NAME ShieldPPPt-PT-050B-UpperBounds-02
FORMULA_NAME ShieldPPPt-PT-050B-UpperBounds-03
FORMULA_NAME ShieldPPPt-PT-050B-UpperBounds-04
FORMULA_NAME ShieldPPPt-PT-050B-UpperBounds-05
FORMULA_NAME ShieldPPPt-PT-050B-UpperBounds-06
FORMULA_NAME ShieldPPPt-PT-050B-UpperBounds-07
FORMULA_NAME ShieldPPPt-PT-050B-UpperBounds-08
FORMULA_NAME ShieldPPPt-PT-050B-UpperBounds-09
FORMULA_NAME ShieldPPPt-PT-050B-UpperBounds-10
FORMULA_NAME ShieldPPPt-PT-050B-UpperBounds-11
FORMULA_NAME ShieldPPPt-PT-050B-UpperBounds-12
FORMULA_NAME ShieldPPPt-PT-050B-UpperBounds-13
FORMULA_NAME ShieldPPPt-PT-050B-UpperBounds-14
FORMULA_NAME ShieldPPPt-PT-050B-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1679280578946
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=ShieldPPPt-PT-050B
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-20 02:49:41] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-20 02:49:41] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-20 02:49:41] [INFO ] Load time of PNML (sax parser for PT used): 167 ms
[2023-03-20 02:49:41] [INFO ] Transformed 3903 places.
[2023-03-20 02:49:41] [INFO ] Transformed 3553 transitions.
[2023-03-20 02:49:41] [INFO ] Found NUPN structural information;
[2023-03-20 02:49:41] [INFO ] Parsed PT model containing 3903 places and 3553 transitions and 8906 arcs in 413 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 5 ms.
// Phase 1: matrix 3553 rows 3903 cols
[2023-03-20 02:49:42] [INFO ] Computed 551 place invariants in 73 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 113 ms. (steps per millisecond=88 ) properties (out of 16) seen :9
FORMULA ShieldPPPt-PT-050B-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-050B-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-050B-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-050B-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-050B-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-050B-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-050B-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-050B-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-050B-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 7) 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 7) 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 7) 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 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 7) seen :0
[2023-03-20 02:49:42] [INFO ] Invariant cache hit.
[2023-03-20 02:49:44] [INFO ] [Real]Absence check using 551 positive place invariants in 550 ms returned sat
[2023-03-20 02:49:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 02:49:47] [INFO ] [Real]Absence check using state equation in 2719 ms returned sat
[2023-03-20 02:49:47] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 02:49:48] [INFO ] [Nat]Absence check using 551 positive place invariants in 360 ms returned sat
[2023-03-20 02:49:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 02:49:51] [INFO ] [Nat]Absence check using state equation in 2942 ms returned sat
[2023-03-20 02:49:55] [INFO ] Deduced a trap composed of 25 places in 3745 ms of which 20 ms to minimize.
[2023-03-20 02:49:55] [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-20 02:49:56] [INFO ] [Real]Absence check using 551 positive place invariants in 800 ms returned sat
[2023-03-20 02:49:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 02:50:00] [INFO ] [Real]Absence check using state equation in 3057 ms returned sat
[2023-03-20 02:50:00] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 02:50:01] [INFO ] [Nat]Absence check using 551 positive place invariants in 390 ms returned sat
[2023-03-20 02:50:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 02:50:04] [INFO ] [Nat]Absence check using state equation in 2526 ms returned sat
[2023-03-20 02:50:07] [INFO ] Deduced a trap composed of 22 places in 2665 ms of which 5 ms to minimize.
[2023-03-20 02:50:07] [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-20 02:50:07] [INFO ] [Real]Absence check using 551 positive place invariants in 349 ms returned sat
[2023-03-20 02:50:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 02:50:10] [INFO ] [Real]Absence check using state equation in 2827 ms returned sat
[2023-03-20 02:50:10] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 02:50:11] [INFO ] [Nat]Absence check using 551 positive place invariants in 256 ms returned sat
[2023-03-20 02:50:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 02:50:15] [INFO ] [Nat]Absence check using state equation in 3125 ms returned sat
[2023-03-20 02:50:17] [INFO ] Deduced a trap composed of 23 places in 1971 ms of which 15 ms to minimize.
[2023-03-20 02:50:17] [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-20 02:50:18] [INFO ] [Real]Absence check using 551 positive place invariants in 258 ms returned sat
[2023-03-20 02:50:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 02:50:20] [INFO ] [Real]Absence check using state equation in 2651 ms returned sat
[2023-03-20 02:50:21] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 02:50:22] [INFO ] [Nat]Absence check using 551 positive place invariants in 281 ms returned sat
[2023-03-20 02:50:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 02:50:24] [INFO ] [Nat]Absence check using state equation in 2233 ms returned sat
[2023-03-20 02:50:26] [INFO ] Deduced a trap composed of 23 places in 1915 ms of which 17 ms to minimize.
[2023-03-20 02:50:26] [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-20 02:50:28] [INFO ] [Real]Absence check using 551 positive place invariants in 490 ms returned sat
[2023-03-20 02:50:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 02:50:30] [INFO ] [Real]Absence check using state equation in 2539 ms returned sat
[2023-03-20 02:50:30] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 02:50:32] [INFO ] [Nat]Absence check using 551 positive place invariants in 292 ms returned sat
[2023-03-20 02:50:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 02:50:35] [INFO ] [Nat]Absence check using state equation in 2706 ms returned sat
[2023-03-20 02:50:36] [INFO ] Deduced a trap composed of 27 places in 1733 ms of which 17 ms to minimize.
[2023-03-20 02:50:36] [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-20 02:50:37] [INFO ] [Real]Absence check using 551 positive place invariants in 251 ms returned sat
[2023-03-20 02:50:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 02:50:40] [INFO ] [Real]Absence check using state equation in 2497 ms returned sat
[2023-03-20 02:50:40] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 02:50:42] [INFO ] [Nat]Absence check using 551 positive place invariants in 350 ms returned sat
[2023-03-20 02:50:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 02:50:45] [INFO ] [Nat]Absence check using state equation in 3022 ms returned sat
[2023-03-20 02:50:47] [INFO ] Deduced a trap composed of 22 places in 1804 ms of which 18 ms to minimize.
[2023-03-20 02:50:47] [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 5
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-20 02:50:47] [INFO ] [Real]Absence check using 551 positive place invariants in 310 ms returned sat
[2023-03-20 02:50:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 02:50:50] [INFO ] [Real]Absence check using state equation in 3004 ms returned sat
[2023-03-20 02:50:51] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 02:50:52] [INFO ] [Nat]Absence check using 551 positive place invariants in 244 ms returned sat
[2023-03-20 02:50:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 02:50:54] [INFO ] [Nat]Absence check using state equation in 2694 ms returned sat
[2023-03-20 02:50:58] [INFO ] Deduced a trap composed of 20 places in 3915 ms of which 6 ms to minimize.
[2023-03-20 02:50:58] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 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)
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 1, 1, 1] Max seen :[0, 0, 0, 0, 0, 0, 0]
Support contains 7 out of 3903 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3903/3903 places, 3553/3553 transitions.
Drop transitions removed 949 transitions
Trivial Post-agglo rules discarded 949 transitions
Performed 949 trivial Post agglomeration. Transition count delta: 949
Iterating post reduction 0 with 949 rules applied. Total rules applied 949 place count 3903 transition count 2604
Reduce places removed 949 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 951 rules applied. Total rules applied 1900 place count 2954 transition count 2602
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 2 rules applied. Total rules applied 1902 place count 2953 transition count 2601
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1903 place count 2952 transition count 2601
Performed 200 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 200 Pre rules applied. Total rules applied 1903 place count 2952 transition count 2401
Deduced a syphon composed of 200 places in 7 ms
Reduce places removed 200 places and 0 transitions.
Iterating global reduction 4 with 400 rules applied. Total rules applied 2303 place count 2752 transition count 2401
Discarding 349 places :
Symmetric choice reduction at 4 with 349 rule applications. Total rules 2652 place count 2403 transition count 2052
Iterating global reduction 4 with 349 rules applied. Total rules applied 3001 place count 2403 transition count 2052
Performed 149 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 149 Pre rules applied. Total rules applied 3001 place count 2403 transition count 1903
Deduced a syphon composed of 149 places in 13 ms
Reduce places removed 149 places and 0 transitions.
Iterating global reduction 4 with 298 rules applied. Total rules applied 3299 place count 2254 transition count 1903
Performed 848 Post agglomeration using F-continuation condition.Transition count delta: 848
Deduced a syphon composed of 848 places in 7 ms
Reduce places removed 848 places and 0 transitions.
Iterating global reduction 4 with 1696 rules applied. Total rules applied 4995 place count 1406 transition count 1055
Renaming transitions due to excessive name length > 1024 char.
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 2 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 5197 place count 1305 transition count 1055
Performed 46 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 46 places in 4 ms
Reduce places removed 46 places and 0 transitions.
Iterating global reduction 4 with 92 rules applied. Total rules applied 5289 place count 1259 transition count 1055
Free-agglomeration rule applied 2 times.
Iterating global reduction 4 with 2 rules applied. Total rules applied 5291 place count 1259 transition count 1053
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 5293 place count 1257 transition count 1053
Partial Free-agglomeration rule applied 147 times.
Drop transitions removed 147 transitions
Iterating global reduction 5 with 147 rules applied. Total rules applied 5440 place count 1257 transition count 1053
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 5441 place count 1256 transition count 1052
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 5442 place count 1255 transition count 1052
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 2 Pre rules applied. Total rules applied 5442 place count 1255 transition count 1050
Deduced a syphon composed of 2 places in 4 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 5446 place count 1253 transition count 1050
Applied a total of 5446 rules in 1519 ms. Remains 1253 /3903 variables (removed 2650) and now considering 1050/3553 (removed 2503) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1519 ms. Remains : 1253/3903 places, 1050/3553 transitions.
// Phase 1: matrix 1050 rows 1253 cols
[2023-03-20 02:51:00] [INFO ] Computed 550 place invariants in 6 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 8590 ms. (steps per millisecond=116 ) properties (out of 7) seen :5
FORMULA ShieldPPPt-PT-050B-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-050B-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-050B-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-050B-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-050B-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Interrupted Best-First random walk after 814183 steps, including 2 resets, run timeout after 5001 ms. (steps per millisecond=162 ) properties seen 0
Interrupted Best-First random walk after 828594 steps, including 2 resets, run timeout after 5001 ms. (steps per millisecond=165 ) properties seen 0
[2023-03-20 02:51:19] [INFO ] Invariant cache hit.
[2023-03-20 02:51:19] [INFO ] [Real]Absence check using 550 positive place invariants in 193 ms returned sat
[2023-03-20 02:51:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 02:51:19] [INFO ] [Real]Absence check using state equation in 461 ms returned sat
[2023-03-20 02:51:19] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 02:51:20] [INFO ] [Nat]Absence check using 550 positive place invariants in 627 ms returned sat
[2023-03-20 02:51:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 02:51:21] [INFO ] [Nat]Absence check using state equation in 459 ms returned sat
[2023-03-20 02:51:21] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-20 02:51:21] [INFO ] [Nat]Added 2 Read/Feed constraints in 2 ms returned sat
[2023-03-20 02:51:21] [INFO ] Computed and/alt/rep : 1046/2458/1046 causal constraints (skipped 0 transitions) in 65 ms.
[2023-03-20 02:51:41] [INFO ] Added : 840 causal constraints over 168 iterations in 20210 ms.(timeout) Result :sat
Minimization took 456 ms.
[2023-03-20 02:51:42] [INFO ] [Real]Absence check using 550 positive place invariants in 182 ms returned sat
[2023-03-20 02:51:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 02:51:43] [INFO ] [Real]Absence check using state equation in 445 ms returned sat
[2023-03-20 02:51:43] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 02:51:43] [INFO ] [Nat]Absence check using 550 positive place invariants in 104 ms returned sat
[2023-03-20 02:51:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 02:51:43] [INFO ] [Nat]Absence check using state equation in 421 ms returned sat
[2023-03-20 02:51:43] [INFO ] [Nat]Added 2 Read/Feed constraints in 1 ms returned sat
[2023-03-20 02:51:43] [INFO ] Computed and/alt/rep : 1046/2458/1046 causal constraints (skipped 0 transitions) in 63 ms.
[2023-03-20 02:52:04] [INFO ] Added : 825 causal constraints over 165 iterations in 20215 ms.(timeout) Result :sat
Minimization took 403 ms.
Current structural bounds on expressions (after SMT) : [1, 1] Max seen :[0, 0]
Support contains 2 out of 1253 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1253/1253 places, 1050/1050 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 1253 transition count 1049
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 1252 transition count 1049
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 4 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 8 place count 1249 transition count 1046
Applied a total of 8 rules in 76 ms. Remains 1249 /1253 variables (removed 4) and now considering 1046/1050 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 76 ms. Remains : 1249/1253 places, 1046/1050 transitions.
// Phase 1: matrix 1046 rows 1249 cols
[2023-03-20 02:52:07] [INFO ] Computed 550 place invariants in 3 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 8521 ms. (steps per millisecond=117 ) properties (out of 2) seen :0
Interrupted Best-First random walk after 855823 steps, including 2 resets, run timeout after 5001 ms. (steps per millisecond=171 ) properties seen 0
Interrupted Best-First random walk after 872135 steps, including 2 resets, run timeout after 5001 ms. (steps per millisecond=174 ) properties seen 0
[2023-03-20 02:52:25] [INFO ] Invariant cache hit.
[2023-03-20 02:52:26] [INFO ] [Real]Absence check using 550 positive place invariants in 186 ms returned sat
[2023-03-20 02:52:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 02:52:26] [INFO ] [Real]Absence check using state equation in 756 ms returned sat
[2023-03-20 02:52:27] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 02:52:27] [INFO ] [Nat]Absence check using 550 positive place invariants in 123 ms returned sat
[2023-03-20 02:52:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 02:52:27] [INFO ] [Nat]Absence check using state equation in 571 ms returned sat
[2023-03-20 02:52:27] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-20 02:52:27] [INFO ] [Nat]Added 2 Read/Feed constraints in 4 ms returned sat
[2023-03-20 02:52:28] [INFO ] Computed and/alt/rep : 1042/2461/1042 causal constraints (skipped 0 transitions) in 113 ms.
[2023-03-20 02:52:48] [INFO ] Added : 860 causal constraints over 172 iterations in 20102 ms.(timeout) Result :sat
Minimization took 457 ms.
[2023-03-20 02:52:49] [INFO ] [Real]Absence check using 550 positive place invariants in 124 ms returned sat
[2023-03-20 02:52:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 02:52:49] [INFO ] [Real]Absence check using state equation in 410 ms returned sat
[2023-03-20 02:52:49] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 02:52:49] [INFO ] [Nat]Absence check using 550 positive place invariants in 86 ms returned sat
[2023-03-20 02:52:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 02:52:50] [INFO ] [Nat]Absence check using state equation in 430 ms returned sat
[2023-03-20 02:52:50] [INFO ] [Nat]Added 2 Read/Feed constraints in 20 ms returned sat
[2023-03-20 02:52:50] [INFO ] Computed and/alt/rep : 1042/2461/1042 causal constraints (skipped 0 transitions) in 95 ms.
[2023-03-20 02:53:10] [INFO ] Added : 870 causal constraints over 174 iterations in 20227 ms.(timeout) Result :sat
Minimization took 600 ms.
Current structural bounds on expressions (after SMT) : [1, 1] Max seen :[0, 0]
FORMULA ShieldPPPt-PT-050B-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 1 out of 1249 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1249/1249 places, 1046/1046 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 1249 transition count 1045
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 1248 transition count 1045
Applied a total of 2 rules in 47 ms. Remains 1248 /1249 variables (removed 1) and now considering 1045/1046 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 48 ms. Remains : 1248/1249 places, 1045/1046 transitions.
// Phase 1: matrix 1045 rows 1248 cols
[2023-03-20 02:53:13] [INFO ] Computed 550 place invariants in 7 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 8180 ms. (steps per millisecond=122 ) properties (out of 1) seen :0
Interrupted Best-First random walk after 891603 steps, including 2 resets, run timeout after 5001 ms. (steps per millisecond=178 ) properties seen 0
[2023-03-20 02:53:27] [INFO ] Invariant cache hit.
[2023-03-20 02:53:27] [INFO ] [Real]Absence check using 550 positive place invariants in 129 ms returned sat
[2023-03-20 02:53:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 02:53:27] [INFO ] [Real]Absence check using state equation in 494 ms returned sat
[2023-03-20 02:53:28] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-20 02:53:28] [INFO ] [Real]Added 2 Read/Feed constraints in 1 ms returned sat
[2023-03-20 02:53:28] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 02:53:28] [INFO ] [Nat]Absence check using 550 positive place invariants in 84 ms returned sat
[2023-03-20 02:53:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 02:53:28] [INFO ] [Nat]Absence check using state equation in 525 ms returned sat
[2023-03-20 02:53:28] [INFO ] [Nat]Added 2 Read/Feed constraints in 3 ms returned sat
[2023-03-20 02:53:29] [INFO ] Computed and/alt/rep : 1041/2460/1041 causal constraints (skipped 0 transitions) in 97 ms.
[2023-03-20 02:53:49] [INFO ] Added : 905 causal constraints over 181 iterations in 20173 ms.(timeout) Result :sat
Minimization took 542 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 1248 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1248/1248 places, 1045/1045 transitions.
Applied a total of 0 rules in 48 ms. Remains 1248 /1248 variables (removed 0) and now considering 1045/1045 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 48 ms. Remains : 1248/1248 places, 1045/1045 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1248/1248 places, 1045/1045 transitions.
Applied a total of 0 rules in 34 ms. Remains 1248 /1248 variables (removed 0) and now considering 1045/1045 (removed 0) transitions.
[2023-03-20 02:53:51] [INFO ] Invariant cache hit.
[2023-03-20 02:53:52] [INFO ] Implicit Places using invariants in 1256 ms returned [1231, 1235]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 1278 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 1246/1248 places, 1045/1045 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 1244 transition count 1043
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 1244 transition count 1043
Applied a total of 4 rules in 72 ms. Remains 1244 /1246 variables (removed 2) and now considering 1043/1045 (removed 2) transitions.
// Phase 1: matrix 1043 rows 1244 cols
[2023-03-20 02:53:52] [INFO ] Computed 548 place invariants in 3 ms
[2023-03-20 02:53:53] [INFO ] Implicit Places using invariants in 1068 ms returned []
[2023-03-20 02:53:53] [INFO ] Invariant cache hit.
[2023-03-20 02:53:55] [INFO ] Implicit Places using invariants and state equation in 2083 ms returned []
Implicit Place search using SMT with State Equation took 3157 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 1244/1248 places, 1043/1045 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 4541 ms. Remains : 1244/1248 places, 1043/1045 transitions.
[2023-03-20 02:53:55] [INFO ] Invariant cache hit.
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 8082 ms. (steps per millisecond=123 ) properties (out of 1) seen :0
Interrupted Best-First random walk after 887598 steps, including 2 resets, run timeout after 5001 ms. (steps per millisecond=177 ) properties seen 0
[2023-03-20 02:54:08] [INFO ] Invariant cache hit.
[2023-03-20 02:54:08] [INFO ] [Real]Absence check using 548 positive place invariants in 156 ms returned sat
[2023-03-20 02:54:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 02:54:09] [INFO ] [Real]Absence check using state equation in 615 ms returned sat
[2023-03-20 02:54:09] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 02:54:09] [INFO ] [Nat]Absence check using 548 positive place invariants in 106 ms returned sat
[2023-03-20 02:54:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 02:54:10] [INFO ] [Nat]Absence check using state equation in 551 ms returned sat
[2023-03-20 02:54:10] [INFO ] Computed and/alt/rep : 1039/2447/1039 causal constraints (skipped 0 transitions) in 50 ms.
[2023-03-20 02:54:30] [INFO ] Added : 915 causal constraints over 183 iterations in 20115 ms.(timeout) Result :sat
Minimization took 538 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 1244 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1244/1244 places, 1043/1043 transitions.
Applied a total of 0 rules in 36 ms. Remains 1244 /1244 variables (removed 0) and now considering 1043/1043 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36 ms. Remains : 1244/1244 places, 1043/1043 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1244/1244 places, 1043/1043 transitions.
Applied a total of 0 rules in 35 ms. Remains 1244 /1244 variables (removed 0) and now considering 1043/1043 (removed 0) transitions.
[2023-03-20 02:54:32] [INFO ] Invariant cache hit.
[2023-03-20 02:54:33] [INFO ] Implicit Places using invariants in 984 ms returned []
[2023-03-20 02:54:33] [INFO ] Invariant cache hit.
[2023-03-20 02:54:35] [INFO ] Implicit Places using invariants and state equation in 2172 ms returned []
Implicit Place search using SMT with State Equation took 3159 ms to find 0 implicit places.
[2023-03-20 02:54:35] [INFO ] Redundant transitions in 61 ms returned []
[2023-03-20 02:54:35] [INFO ] Invariant cache hit.
[2023-03-20 02:54:36] [INFO ] Dead Transitions using invariants and state equation in 792 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4089 ms. Remains : 1244/1244 places, 1043/1043 transitions.
Starting property specific reduction for ShieldPPPt-PT-050B-UpperBounds-15
[2023-03-20 02:54:36] [INFO ] Invariant cache hit.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 1) seen :0
[2023-03-20 02:54:36] [INFO ] Invariant cache hit.
[2023-03-20 02:54:36] [INFO ] [Real]Absence check using 548 positive place invariants in 125 ms returned sat
[2023-03-20 02:54:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 02:54:37] [INFO ] [Real]Absence check using state equation in 651 ms returned sat
[2023-03-20 02:54:37] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 02:54:37] [INFO ] [Nat]Absence check using 548 positive place invariants in 110 ms returned sat
[2023-03-20 02:54:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 02:54:38] [INFO ] [Nat]Absence check using state equation in 550 ms returned sat
[2023-03-20 02:54:38] [INFO ] Computed and/alt/rep : 1039/2447/1039 causal constraints (skipped 0 transitions) in 95 ms.
[2023-03-20 02:54:43] [INFO ] Deduced a trap composed of 2 places in 834 ms of which 4 ms to minimize.
[2023-03-20 02:54:43] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:733)
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] Max seen :[0]
Support contains 1 out of 1244 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1244/1244 places, 1043/1043 transitions.
Applied a total of 0 rules in 52 ms. Remains 1244 /1244 variables (removed 0) and now considering 1043/1043 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 53 ms. Remains : 1244/1244 places, 1043/1043 transitions.
[2023-03-20 02:54:43] [INFO ] Invariant cache hit.
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 8091 ms. (steps per millisecond=123 ) properties (out of 1) seen :0
Interrupted Best-First random walk after 930900 steps, including 2 resets, run timeout after 5001 ms. (steps per millisecond=186 ) properties seen 0
[2023-03-20 02:54:56] [INFO ] Invariant cache hit.
[2023-03-20 02:54:56] [INFO ] [Real]Absence check using 548 positive place invariants in 176 ms returned sat
[2023-03-20 02:54:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 02:54:57] [INFO ] [Real]Absence check using state equation in 451 ms returned sat
[2023-03-20 02:54:57] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 02:54:57] [INFO ] [Nat]Absence check using 548 positive place invariants in 116 ms returned sat
[2023-03-20 02:54:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 02:54:58] [INFO ] [Nat]Absence check using state equation in 1190 ms returned sat
[2023-03-20 02:54:59] [INFO ] Computed and/alt/rep : 1039/2447/1039 causal constraints (skipped 0 transitions) in 115 ms.
[2023-03-20 02:55:19] [INFO ] Added : 950 causal constraints over 190 iterations in 20105 ms.(timeout) Result :sat
Minimization took 606 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 1244 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1244/1244 places, 1043/1043 transitions.
Applied a total of 0 rules in 31 ms. Remains 1244 /1244 variables (removed 0) and now considering 1043/1043 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 31 ms. Remains : 1244/1244 places, 1043/1043 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1244/1244 places, 1043/1043 transitions.
Applied a total of 0 rules in 28 ms. Remains 1244 /1244 variables (removed 0) and now considering 1043/1043 (removed 0) transitions.
[2023-03-20 02:55:20] [INFO ] Invariant cache hit.
[2023-03-20 02:55:21] [INFO ] Implicit Places using invariants in 986 ms returned []
[2023-03-20 02:55:21] [INFO ] Invariant cache hit.
[2023-03-20 02:55:24] [INFO ] Implicit Places using invariants and state equation in 2575 ms returned []
Implicit Place search using SMT with State Equation took 3571 ms to find 0 implicit places.
[2023-03-20 02:55:24] [INFO ] Redundant transitions in 24 ms returned []
[2023-03-20 02:55:24] [INFO ] Invariant cache hit.
[2023-03-20 02:55:25] [INFO ] Dead Transitions using invariants and state equation in 822 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4494 ms. Remains : 1244/1244 places, 1043/1043 transitions.
Ending property specific reduction for ShieldPPPt-PT-050B-UpperBounds-15 in 48948 ms.
[2023-03-20 02:55:25] [INFO ] Flatten gal took : 150 ms
[2023-03-20 02:55:25] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/UpperBounds.sr.xml took 15 ms.
[2023-03-20 02:55:25] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1244 places, 1043 transitions and 4601 arcs took 6 ms.
Total runtime 344428 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT ShieldPPPt-PT-050B
BK_EXAMINATION: UpperBounds
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/382
Upper Bounds
FORMULA ShieldPPPt-PT-050B-UpperBounds-15 1 TECHNIQUES SEQUENTIAL_PROCESSING TOPOLOGICAL EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
BK_STOP 1679280926316
--------------------
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
lola: MEM LIMIT 32
lola: MEM LIMIT 5
lola: NET
lola: input: PNML file (--pnmlnet)
lola: reading net from /home/mcc/execution/382/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/382/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/382/UpperBounds.xml
lola: Rule S: 0 transitions removed,0 places removed
lola: LAUNCH task # 5 (type EXCL) for 0 ShieldPPPt-PT-050B-UpperBounds-15
lola: time limit : 3599 sec
lola: memory limit: 32 pages
lola: LAUNCH task # 3 (type FNDP) for 0 ShieldPPPt-PT-050B-UpperBounds-15
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 4 (type EQUN) for 0 ShieldPPPt-PT-050B-UpperBounds-15
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: Structural Bound: 1
lola: REPORT NUM
lola: FINISHED task # 5 (type EXCL) for ShieldPPPt-PT-050B-UpperBounds-15
lola: markings : 94
lola: fired transitions : 93
lola: time used : 0.000000
lola: memory pages used : 1
lola: CANCELED task # 3 (type FNDP) for ShieldPPPt-PT-050B-UpperBounds-15 (obsolete)
lola: CANCELED task # 4 (type EQUN) for ShieldPPPt-PT-050B-UpperBounds-15 (obsolete)
lola: Portfolio finished: no open formulas
FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldPPPt-PT-050B-UpperBounds-15: BOUND 1 state space
Time elapsed: 1 secs. Pages in use: 1
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="ShieldPPPt-PT-050B"
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 ShieldPPPt-PT-050B, 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 r391-oct2-167903715600685"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/ShieldPPPt-PT-050B.tgz
mv ShieldPPPt-PT-050B 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 ;