fond
Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r103-tall-167814477800045
Last Updated
May 14, 2023

About the Execution of LoLa+red for CloudReconfiguration-PT-306

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
654.476 92693.00 110858.00 389.00 1 1 1 1 1 1 1 1 1 1 1 1 1 1 0 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.r103-tall-167814477800045.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 CloudReconfiguration-PT-306, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r103-tall-167814477800045
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.1M
-rw-r--r-- 1 mcc users 8.5K Feb 25 11:50 CTLCardinality.txt
-rw-r--r-- 1 mcc users 94K Feb 25 11:50 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.6K Feb 25 11:49 CTLFireability.txt
-rw-r--r-- 1 mcc users 37K Feb 25 11:49 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.9K Feb 25 15:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 15:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Feb 25 15:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Feb 25 15:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 25 11:50 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 113K Feb 25 11:50 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.5K Feb 25 11:50 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 81K Feb 25 11:50 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 15:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 15:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 660K 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 CloudReconfiguration-PT-306-UpperBounds-00
FORMULA_NAME CloudReconfiguration-PT-306-UpperBounds-01
FORMULA_NAME CloudReconfiguration-PT-306-UpperBounds-02
FORMULA_NAME CloudReconfiguration-PT-306-UpperBounds-03
FORMULA_NAME CloudReconfiguration-PT-306-UpperBounds-04
FORMULA_NAME CloudReconfiguration-PT-306-UpperBounds-05
FORMULA_NAME CloudReconfiguration-PT-306-UpperBounds-06
FORMULA_NAME CloudReconfiguration-PT-306-UpperBounds-07
FORMULA_NAME CloudReconfiguration-PT-306-UpperBounds-08
FORMULA_NAME CloudReconfiguration-PT-306-UpperBounds-09
FORMULA_NAME CloudReconfiguration-PT-306-UpperBounds-10
FORMULA_NAME CloudReconfiguration-PT-306-UpperBounds-11
FORMULA_NAME CloudReconfiguration-PT-306-UpperBounds-12
FORMULA_NAME CloudReconfiguration-PT-306-UpperBounds-13
FORMULA_NAME CloudReconfiguration-PT-306-UpperBounds-14
FORMULA_NAME CloudReconfiguration-PT-306-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1678229023902

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=CloudReconfiguration-PT-306
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-07 22:43:45] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-07 22:43:45] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-07 22:43:45] [INFO ] Load time of PNML (sax parser for PT used): 115 ms
[2023-03-07 22:43:45] [INFO ] Transformed 2584 places.
[2023-03-07 22:43:45] [INFO ] Transformed 3094 transitions.
[2023-03-07 22:43:45] [INFO ] Found NUPN structural information;
[2023-03-07 22:43:45] [INFO ] Parsed PT model containing 2584 places and 3094 transitions and 6459 arcs in 220 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 5 ms.
// Phase 1: matrix 3094 rows 2584 cols
[2023-03-07 22:43:45] [INFO ] Computed 4 place invariants in 51 ms
Incomplete random walk after 10000 steps, including 121 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 16) seen :1
FORMULA CloudReconfiguration-PT-306-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 34 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 10001 steps, including 36 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 10001 steps, including 33 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 10001 steps, including 30 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 10001 steps, including 38 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 10000 steps, including 37 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 15) seen :1
FORMULA CloudReconfiguration-PT-306-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10000 steps, including 34 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 33 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 14) seen :1
FORMULA CloudReconfiguration-PT-306-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 36 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 44 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 45 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 38 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 33 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 13) seen :0
[2023-03-07 22:43:46] [INFO ] Invariant cache hit.
[2023-03-07 22:43:46] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 42 ms returned sat
[2023-03-07 22:43:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-07 22:43:47] [INFO ] [Real]Absence check using state equation in 1122 ms returned sat
[2023-03-07 22:43:48] [INFO ] Solution in real domain found non-integer solution.
[2023-03-07 22:43:48] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 42 ms returned sat
[2023-03-07 22:43:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-07 22:43:49] [INFO ] [Nat]Absence check using state equation in 1135 ms returned sat
[2023-03-07 22:43:49] [INFO ] Computed and/alt/rep : 3085/3789/3085 causal constraints (skipped 8 transitions) in 159 ms.
[2023-03-07 22:43:53] [INFO ] Added : 125 causal constraints over 25 iterations in 3337 ms. Result :unknown
[2023-03-07 22:43:53] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 38 ms returned sat
[2023-03-07 22:43:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-07 22:43:54] [INFO ] [Real]Absence check using state equation in 1217 ms returned sat
[2023-03-07 22:43:54] [INFO ] Solution in real domain found non-integer solution.
[2023-03-07 22:43:55] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 42 ms returned sat
[2023-03-07 22:43:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-07 22:43:56] [INFO ] [Nat]Absence check using state equation in 1217 ms returned sat
[2023-03-07 22:43:56] [INFO ] Computed and/alt/rep : 3085/3789/3085 causal constraints (skipped 8 transitions) in 162 ms.
[2023-03-07 22:43:59] [INFO ] Added : 130 causal constraints over 26 iterations in 3382 ms. Result :unknown
[2023-03-07 22:44:00] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 39 ms returned sat
[2023-03-07 22:44:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-07 22:44:01] [INFO ] [Real]Absence check using state equation in 1199 ms returned sat
[2023-03-07 22:44:01] [INFO ] Solution in real domain found non-integer solution.
[2023-03-07 22:44:02] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 41 ms returned sat
[2023-03-07 22:44:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-07 22:44:03] [INFO ] [Nat]Absence check using state equation in 1233 ms returned sat
[2023-03-07 22:44:03] [INFO ] Computed and/alt/rep : 3085/3789/3085 causal constraints (skipped 8 transitions) in 134 ms.
[2023-03-07 22:44:06] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 2
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1186)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-07 22:44:07] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 38 ms returned sat
[2023-03-07 22:44:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-07 22:44:08] [INFO ] [Real]Absence check using state equation in 1117 ms returned sat
[2023-03-07 22:44:08] [INFO ] Solution in real domain found non-integer solution.
[2023-03-07 22:44:08] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 40 ms returned sat
[2023-03-07 22:44:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-07 22:44:09] [INFO ] [Nat]Absence check using state equation in 1144 ms returned sat
[2023-03-07 22:44:10] [INFO ] Computed and/alt/rep : 3085/3789/3085 causal constraints (skipped 8 transitions) in 135 ms.
[2023-03-07 22:44:13] [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.refineWithCausalOrder(DeadlockTester.java:1186)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-07 22:44:13] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 39 ms returned sat
[2023-03-07 22:44:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-07 22:44:14] [INFO ] [Real]Absence check using state equation in 1194 ms returned sat
[2023-03-07 22:44:15] [INFO ] Solution in real domain found non-integer solution.
[2023-03-07 22:44:15] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 41 ms returned sat
[2023-03-07 22:44:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-07 22:44:16] [INFO ] [Nat]Absence check using state equation in 1186 ms returned sat
[2023-03-07 22:44:16] [INFO ] Computed and/alt/rep : 3085/3789/3085 causal constraints (skipped 8 transitions) in 142 ms.
[2023-03-07 22:44:20] [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.refineWithCausalOrder(DeadlockTester.java:1186)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-07 22:44:20] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 38 ms returned sat
[2023-03-07 22:44:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-07 22:44:21] [INFO ] [Real]Absence check using state equation in 1169 ms returned sat
[2023-03-07 22:44:21] [INFO ] Solution in real domain found non-integer solution.
[2023-03-07 22:44:22] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 41 ms returned sat
[2023-03-07 22:44:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-07 22:44:23] [INFO ] [Nat]Absence check using state equation in 1196 ms returned sat
[2023-03-07 22:44:23] [INFO ] Computed and/alt/rep : 3085/3789/3085 causal constraints (skipped 8 transitions) in 140 ms.
[2023-03-07 22:44:26] [INFO ] Added : 128 causal constraints over 26 iterations in 3377 ms. Result :unknown
[2023-03-07 22:44:27] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 40 ms returned sat
[2023-03-07 22:44:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-07 22:44:28] [INFO ] [Real]Absence check using state equation in 1263 ms returned sat
[2023-03-07 22:44:28] [INFO ] Solution in real domain found non-integer solution.
[2023-03-07 22:44:28] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 43 ms returned sat
[2023-03-07 22:44:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-07 22:44:30] [INFO ] [Nat]Absence check using state equation in 1170 ms returned sat
[2023-03-07 22:44:30] [INFO ] Computed and/alt/rep : 3085/3789/3085 causal constraints (skipped 8 transitions) in 151 ms.
[2023-03-07 22:44:33] [INFO ] Added : 135 causal constraints over 27 iterations in 3386 ms. Result :unknown
[2023-03-07 22:44:34] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 39 ms returned sat
[2023-03-07 22:44:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-07 22:44:35] [INFO ] [Real]Absence check using state equation in 1214 ms returned sat
[2023-03-07 22:44:35] [INFO ] Solution in real domain found non-integer solution.
[2023-03-07 22:44:35] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 41 ms returned sat
[2023-03-07 22:44:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-07 22:44:36] [INFO ] [Nat]Absence check using state equation in 1175 ms returned sat
[2023-03-07 22:44:37] [INFO ] Computed and/alt/rep : 3085/3789/3085 causal constraints (skipped 8 transitions) in 144 ms.
[2023-03-07 22:44:40] [INFO ] Added : 125 causal constraints over 25 iterations in 3409 ms. Result :unknown
[2023-03-07 22:44:40] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 38 ms returned sat
[2023-03-07 22:44:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-07 22:44:41] [INFO ] [Real]Absence check using state equation in 1197 ms returned sat
[2023-03-07 22:44:42] [INFO ] Solution in real domain found non-integer solution.
[2023-03-07 22:44:42] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 49 ms returned sat
[2023-03-07 22:44:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-07 22:44:43] [INFO ] [Nat]Absence check using state equation in 1163 ms returned sat
[2023-03-07 22:44:43] [INFO ] Computed and/alt/rep : 3085/3789/3085 causal constraints (skipped 8 transitions) in 133 ms.
[2023-03-07 22:44:47] [INFO ] Added : 128 causal constraints over 26 iterations in 3393 ms. Result :unknown
[2023-03-07 22:44:47] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 38 ms returned sat
[2023-03-07 22:44:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-07 22:44:48] [INFO ] [Real]Absence check using state equation in 1186 ms returned sat
[2023-03-07 22:44:48] [INFO ] Solution in real domain found non-integer solution.
[2023-03-07 22:44:49] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 42 ms returned sat
[2023-03-07 22:44:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-07 22:44:50] [INFO ] [Nat]Absence check using state equation in 1178 ms returned sat
[2023-03-07 22:44:50] [INFO ] Computed and/alt/rep : 3085/3789/3085 causal constraints (skipped 8 transitions) in 140 ms.
[2023-03-07 22:44:53] [INFO ] Added : 135 causal constraints over 27 iterations in 3396 ms. Result :unknown
[2023-03-07 22:44:54] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 39 ms returned sat
[2023-03-07 22:44:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-07 22:44:55] [INFO ] [Real]Absence check using state equation in 1163 ms returned sat
[2023-03-07 22:44:55] [INFO ] Solution in real domain found non-integer solution.
[2023-03-07 22:44:55] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 53 ms returned sat
[2023-03-07 22:44:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-07 22:44:57] [INFO ] [Nat]Absence check using state equation in 1147 ms returned sat
[2023-03-07 22:44:57] [INFO ] Computed and/alt/rep : 3085/3789/3085 causal constraints (skipped 8 transitions) in 132 ms.
[2023-03-07 22:45:00] [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 10
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1186)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-07 22:45:00] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 40 ms returned sat
[2023-03-07 22:45:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-07 22:45:02] [INFO ] [Real]Absence check using state equation in 1147 ms returned sat
[2023-03-07 22:45:02] [INFO ] Solution in real domain found non-integer solution.
[2023-03-07 22:45:02] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 42 ms returned sat
[2023-03-07 22:45:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-07 22:45:03] [INFO ] [Nat]Absence check using state equation in 1134 ms returned sat
[2023-03-07 22:45:03] [INFO ] Computed and/alt/rep : 3085/3789/3085 causal constraints (skipped 8 transitions) in 146 ms.
[2023-03-07 22:45:07] [INFO ] Added : 135 causal constraints over 27 iterations in 3452 ms. Result :unknown
[2023-03-07 22:45:07] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 46 ms returned sat
[2023-03-07 22:45:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-07 22:45:08] [INFO ] [Real]Absence check using state equation in 1148 ms returned sat
[2023-03-07 22:45:08] [INFO ] Solution in real domain found non-integer solution.
[2023-03-07 22:45:09] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 40 ms returned sat
[2023-03-07 22:45:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-07 22:45:10] [INFO ] [Nat]Absence check using state equation in 1211 ms returned sat
[2023-03-07 22:45:10] [INFO ] Computed and/alt/rep : 3085/3789/3085 causal constraints (skipped 8 transitions) in 148 ms.
[2023-03-07 22:45:13] [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 12
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1186)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] Max seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Support contains 13 out of 2584 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2584/2584 places, 3094/3094 transitions.
Graph (trivial) has 2930 edges and 2584 vertex of which 844 / 2584 are part of one of the 63 SCC in 11 ms
Free SCC test removed 781 places
Drop transitions removed 955 transitions
Reduce isomorphic transitions removed 955 transitions.
Graph (complete) has 2417 edges and 1803 vertex of which 1789 are kept as prefixes of interest. Removing 14 places using SCC suffix rule.5 ms
Discarding 14 places :
Also discarding 9 output transitions
Drop transitions removed 9 transitions
Drop transitions removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Drop transitions removed 1198 transitions
Trivial Post-agglo rules discarded 1198 transitions
Performed 1198 trivial Post agglomeration. Transition count delta: 1198
Iterating post reduction 0 with 1207 rules applied. Total rules applied 1209 place count 1789 transition count 923
Reduce places removed 1198 places and 0 transitions.
Ensure Unique test removed 76 transitions
Reduce isomorphic transitions removed 76 transitions.
Drop transitions removed 66 transitions
Trivial Post-agglo rules discarded 66 transitions
Performed 66 trivial Post agglomeration. Transition count delta: 66
Iterating post reduction 1 with 1340 rules applied. Total rules applied 2549 place count 591 transition count 781
Reduce places removed 66 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 2 with 75 rules applied. Total rules applied 2624 place count 525 transition count 772
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 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 3 with 12 rules applied. Total rules applied 2636 place count 522 transition count 763
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 4 with 11 rules applied. Total rules applied 2647 place count 516 transition count 758
Reduce places removed 2 places and 0 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Iterating post reduction 5 with 10 rules applied. Total rules applied 2657 place count 514 transition count 750
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 6 with 8 rules applied. Total rules applied 2665 place count 506 transition count 750
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 21 Pre rules applied. Total rules applied 2665 place count 506 transition count 729
Deduced a syphon composed of 21 places in 1 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 7 with 42 rules applied. Total rules applied 2707 place count 485 transition count 729
Discarding 77 places :
Symmetric choice reduction at 7 with 77 rule applications. Total rules 2784 place count 408 transition count 652
Iterating global reduction 7 with 77 rules applied. Total rules applied 2861 place count 408 transition count 652
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 8 Pre rules applied. Total rules applied 2861 place count 408 transition count 644
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 7 with 16 rules applied. Total rules applied 2877 place count 400 transition count 644
Discarding 58 places :
Symmetric choice reduction at 7 with 58 rule applications. Total rules 2935 place count 342 transition count 586
Iterating global reduction 7 with 58 rules applied. Total rules applied 2993 place count 342 transition count 586
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Drop transitions removed 17 transitions
Trivial Post-agglo rules discarded 17 transitions
Performed 17 trivial Post agglomeration. Transition count delta: 17
Iterating post reduction 7 with 34 rules applied. Total rules applied 3027 place count 342 transition count 552
Reduce places removed 17 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 8 with 27 rules applied. Total rules applied 3054 place count 325 transition count 542
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 9 with 5 rules applied. Total rules applied 3059 place count 320 transition count 542
Discarding 19 places :
Symmetric choice reduction at 10 with 19 rule applications. Total rules 3078 place count 301 transition count 513
Iterating global reduction 10 with 19 rules applied. Total rules applied 3097 place count 301 transition count 513
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 10 with 9 rules applied. Total rules applied 3106 place count 301 transition count 504
Discarding 7 places :
Symmetric choice reduction at 11 with 7 rule applications. Total rules 3113 place count 294 transition count 490
Iterating global reduction 11 with 7 rules applied. Total rules applied 3120 place count 294 transition count 490
Discarding 3 places :
Symmetric choice reduction at 11 with 3 rule applications. Total rules 3123 place count 291 transition count 484
Iterating global reduction 11 with 3 rules applied. Total rules applied 3126 place count 291 transition count 484
Performed 153 Post agglomeration using F-continuation condition with reduction of 79 identical transitions.
Deduced a syphon composed of 153 places in 1 ms
Reduce places removed 153 places and 0 transitions.
Iterating global reduction 11 with 306 rules applied. Total rules applied 3432 place count 138 transition count 252
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 11 with 2 rules applied. Total rules applied 3434 place count 138 transition count 250
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 12 with 6 rules applied. Total rules applied 3440 place count 135 transition count 247
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 12 with 6 rules applied. Total rules applied 3446 place count 135 transition count 241
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 13 with 6 rules applied. Total rules applied 3452 place count 132 transition count 238
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 13 with 6 rules applied. Total rules applied 3458 place count 132 transition count 232
Performed 33 Post agglomeration using F-continuation condition with reduction of 10 identical transitions.
Deduced a syphon composed of 33 places in 0 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 14 with 66 rules applied. Total rules applied 3524 place count 99 transition count 270
Drop transitions removed 18 transitions
Ensure Unique test removed 25 transitions
Reduce isomorphic transitions removed 43 transitions.
Iterating post reduction 14 with 43 rules applied. Total rules applied 3567 place count 99 transition count 227
Discarding 22 places :
Symmetric choice reduction at 15 with 22 rule applications. Total rules 3589 place count 77 transition count 197
Iterating global reduction 15 with 22 rules applied. Total rules applied 3611 place count 77 transition count 197
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 15 with 12 rules applied. Total rules applied 3623 place count 77 transition count 185
Discarding 4 places :
Symmetric choice reduction at 16 with 4 rule applications. Total rules 3627 place count 73 transition count 177
Iterating global reduction 16 with 4 rules applied. Total rules applied 3631 place count 73 transition count 177
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 16 with 4 rules applied. Total rules applied 3635 place count 73 transition count 173
Drop transitions removed 20 transitions
Redundant transition composition rules discarded 20 transitions
Iterating global reduction 17 with 20 rules applied. Total rules applied 3655 place count 73 transition count 153
Discarding 2 places :
Symmetric choice reduction at 17 with 2 rule applications. Total rules 3657 place count 71 transition count 148
Iterating global reduction 17 with 2 rules applied. Total rules applied 3659 place count 71 transition count 148
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 17 with 1 rules applied. Total rules applied 3660 place count 71 transition count 147
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 18 with 1 rules applied. Total rules applied 3661 place count 71 transition count 146
Free-agglomeration rule applied 5 times.
Iterating global reduction 18 with 5 rules applied. Total rules applied 3666 place count 71 transition count 141
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 18 with 5 rules applied. Total rules applied 3671 place count 66 transition count 141
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 19 with 1 rules applied. Total rules applied 3672 place count 66 transition count 140
Partial Free-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 19 with 4 rules applied. Total rules applied 3676 place count 66 transition count 140
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 19 with 1 rules applied. Total rules applied 3677 place count 66 transition count 139
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 20 with 1 rules applied. Total rules applied 3678 place count 66 transition count 138
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 20 with 1 rules applied. Total rules applied 3679 place count 65 transition count 137
Applied a total of 3679 rules in 269 ms. Remains 65 /2584 variables (removed 2519) and now considering 137/3094 (removed 2957) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 269 ms. Remains : 65/2584 places, 137/3094 transitions.
Normalized transition count is 132 out of 137 initially.
// Phase 1: matrix 132 rows 65 cols
[2023-03-07 22:45:14] [INFO ] Computed 4 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 22931 resets, run finished after 988 ms. (steps per millisecond=1012 ) properties (out of 13) seen :12
FORMULA CloudReconfiguration-PT-306-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-306-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-306-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-306-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-306-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-306-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-306-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-306-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-306-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-306-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-306-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-306-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000001 steps, including 5548 resets, run finished after 270 ms. (steps per millisecond=3703 ) properties (out of 1) seen :0
[2023-03-07 22:45:15] [INFO ] Flow matrix only has 132 transitions (discarded 5 similar events)
// Phase 1: matrix 132 rows 65 cols
[2023-03-07 22:45:15] [INFO ] Computed 4 place invariants in 2 ms
[2023-03-07 22:45:15] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-07 22:45:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-07 22:45:15] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2023-03-07 22:45:15] [INFO ] Solution in real domain found non-integer solution.
[2023-03-07 22:45:15] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-07 22:45:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-07 22:45:15] [INFO ] [Nat]Absence check using state equation in 20 ms returned sat
[2023-03-07 22:45:15] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-07 22:45:15] [INFO ] [Nat]Added 2 Read/Feed constraints in 1 ms returned sat
[2023-03-07 22:45:15] [INFO ] Deduced a trap composed of 13 places in 43 ms of which 3 ms to minimize.
[2023-03-07 22:45:15] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 48 ms
Current structural bounds on expressions (after SMT) : [0] Max seen :[0]
FORMULA CloudReconfiguration-PT-306-UpperBounds-14 0 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 90261 ms.
ITS solved all properties within timeout

BK_STOP 1678229116595

--------------------
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="CloudReconfiguration-PT-306"
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 CloudReconfiguration-PT-306, 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 r103-tall-167814477800045"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/CloudReconfiguration-PT-306.tgz
mv CloudReconfiguration-PT-306 execution
cd execution
if [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "UpperBounds" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] || [ "UpperBounds" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "UpperBounds" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "UpperBounds" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "UpperBounds.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property UpperBounds.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "UpperBounds.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' UpperBounds.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] ; then
echo "FORMULA_NAME UpperBounds"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;