Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2022-input.r042-smll-165252095500253.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
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 r042-smll-165252095500253
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 868K
-rw-r--r-- 1 mcc users 6.3K Apr 29 14:32 CTLCardinality.txt
-rw-r--r-- 1 mcc users 63K Apr 29 14:32 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K Apr 29 14:31 CTLFireability.txt
-rw-r--r-- 1 mcc users 44K Apr 29 14:31 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.6K May 9 07:19 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 9 07:19 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 9 07:19 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 9 07:19 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 9 07:19 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 9 07:19 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:33 equiv_col
-rw-r--r-- 1 mcc users 4 May 10 09:33 instance
-rw-r--r-- 1 mcc users 6 May 10 09:33 iscolored
-rw-r--r-- 1 mcc users 660K May 10 09:33 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 1652650216217

Running Version 202205111006
[2022-05-15 21:30:18] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-15 21:30:18] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-15 21:30:19] [INFO ] Load time of PNML (sax parser for PT used): 361 ms
[2022-05-15 21:30:19] [INFO ] Transformed 2584 places.
[2022-05-15 21:30:19] [INFO ] Transformed 3094 transitions.
[2022-05-15 21:30:19] [INFO ] Found NUPN structural information;
[2022-05-15 21:30:19] [INFO ] Parsed PT model containing 2584 places and 3094 transitions in 560 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 11 ms.
// Phase 1: matrix 3094 rows 2584 cols
[2022-05-15 21:30:19] [INFO ] Computed 4 place invariants in 87 ms
Incomplete random walk after 10000 steps, including 110 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 16) seen :1
FORMULA CloudReconfiguration-PT-306-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 40 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 10001 steps, including 36 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 10000 steps, including 43 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 10001 steps, including 37 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 10001 steps, including 36 resets, run finished after 18 ms. (steps per millisecond=555 ) 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 38 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 35 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 37 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 14) seen :1
FORMULA CloudReconfiguration-PT-306-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 35 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 40 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 43 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 41 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 38 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 13) seen :0
// Phase 1: matrix 3094 rows 2584 cols
[2022-05-15 21:30:19] [INFO ] Computed 4 place invariants in 29 ms
[2022-05-15 21:30:20] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 73 ms returned sat
[2022-05-15 21:30:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 21:30:22] [INFO ] [Real]Absence check using state equation in 1904 ms returned sat
[2022-05-15 21:30:23] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 21:30:23] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 72 ms returned sat
[2022-05-15 21:30:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 21:30:25] [INFO ] [Nat]Absence check using state equation in 1845 ms returned sat
[2022-05-15 21:30:26] [INFO ] Computed and/alt/rep : 3085/3789/3085 causal constraints (skipped 8 transitions) in 262 ms.
[2022-05-15 21:30:28] [INFO ] Added : 55 causal constraints over 11 iterations in 2317 ms. Result :unknown
[2022-05-15 21:30:28] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 66 ms returned sat
[2022-05-15 21:30:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 21:30:31] [INFO ] [Real]Absence check using state equation in 2131 ms returned sat
[2022-05-15 21:30:31] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 21:30:31] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 69 ms returned sat
[2022-05-15 21:30:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 21:30:33] [INFO ] [Nat]Absence check using state equation in 1877 ms returned sat
[2022-05-15 21:30:34] [INFO ] Computed and/alt/rep : 3085/3789/3085 causal constraints (skipped 8 transitions) in 328 ms.
[2022-05-15 21:30: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 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:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1188)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:925)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2622)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:639)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
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:401)
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:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
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)
[2022-05-15 21:30:37] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 66 ms returned sat
[2022-05-15 21:30:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 21:30:38] [INFO ] [Real]Absence check using state equation in 1856 ms returned sat
[2022-05-15 21:30:39] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 21:30:39] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 69 ms returned sat
[2022-05-15 21:30:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 21:30:41] [INFO ] [Nat]Absence check using state equation in 1899 ms returned sat
[2022-05-15 21:30:41] [INFO ] Computed and/alt/rep : 3085/3789/3085 causal constraints (skipped 8 transitions) in 228 ms.
[2022-05-15 21:30:44] [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:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1188)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:925)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2622)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:639)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
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:401)
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:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
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)
[2022-05-15 21:30:44] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 67 ms returned sat
[2022-05-15 21:30:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 21:30:46] [INFO ] [Real]Absence check using state equation in 1869 ms returned sat
[2022-05-15 21:30:46] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 21:30:47] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 69 ms returned sat
[2022-05-15 21:30:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 21:30:49] [INFO ] [Nat]Absence check using state equation in 1807 ms returned sat
[2022-05-15 21:30:49] [INFO ] Computed and/alt/rep : 3085/3789/3085 causal constraints (skipped 8 transitions) in 223 ms.
[2022-05-15 21:30:51] [INFO ] Added : 60 causal constraints over 12 iterations in 2552 ms. Result :unknown
[2022-05-15 21:30:52] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 70 ms returned sat
[2022-05-15 21:30:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 21:30:54] [INFO ] [Real]Absence check using state equation in 1822 ms returned sat
[2022-05-15 21:30:54] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 21:30:55] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 69 ms returned sat
[2022-05-15 21:30:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 21:30:57] [INFO ] [Nat]Absence check using state equation in 1929 ms returned sat
[2022-05-15 21:30:57] [INFO ] Computed and/alt/rep : 3085/3789/3085 causal constraints (skipped 8 transitions) in 196 ms.
[2022-05-15 21:30:59] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: 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:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1188)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:925)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2622)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:639)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
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:401)
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:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
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)
[2022-05-15 21:31:00] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 68 ms returned sat
[2022-05-15 21:31:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 21:31:02] [INFO ] [Real]Absence check using state equation in 2060 ms returned sat
[2022-05-15 21:31:02] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 21:31:03] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 69 ms returned sat
[2022-05-15 21:31:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 21:31:05] [INFO ] [Nat]Absence check using state equation in 2137 ms returned sat
[2022-05-15 21:31:06] [INFO ] Computed and/alt/rep : 3085/3789/3085 causal constraints (skipped 8 transitions) in 291 ms.
[2022-05-15 21:31: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 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:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1188)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:925)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2622)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:639)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
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:401)
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:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
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)
[2022-05-15 21:31:08] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 70 ms returned sat
[2022-05-15 21:31:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 21:31:10] [INFO ] [Real]Absence check using state equation in 2101 ms returned sat
[2022-05-15 21:31:10] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 21:31:11] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 70 ms returned sat
[2022-05-15 21:31:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 21:31:13] [INFO ] [Nat]Absence check using state equation in 2148 ms returned sat
[2022-05-15 21:31:14] [INFO ] Computed and/alt/rep : 3085/3789/3085 causal constraints (skipped 8 transitions) in 213 ms.
[2022-05-15 21:31:15] [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:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1188)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:925)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2622)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:639)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
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:401)
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:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
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)
[2022-05-15 21:31:16] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 67 ms returned sat
[2022-05-15 21:31:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 21:31:18] [INFO ] [Real]Absence check using state equation in 1846 ms returned sat
[2022-05-15 21:31:18] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 21:31:19] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 71 ms returned sat
[2022-05-15 21:31:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 21:31:21] [INFO ] [Nat]Absence check using state equation in 1736 ms returned sat
[2022-05-15 21:31:21] [INFO ] Computed and/alt/rep : 3085/3789/3085 causal constraints (skipped 8 transitions) in 203 ms.
0timeout
^^^^^^^^
(error "Invalid token: 0timeout")
[2022-05-15 21:31:23] [INFO ] Added : 65 causal constraints over 13 iterations in 2614 ms. Result :unknown
[2022-05-15 21:31:24] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 66 ms returned sat
[2022-05-15 21:31:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 21:31:26] [INFO ] [Real]Absence check using state equation in 1820 ms returned sat
[2022-05-15 21:31:26] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 21:31:26] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 69 ms returned sat
[2022-05-15 21:31:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 21:31:28] [INFO ] [Nat]Absence check using state equation in 1804 ms returned sat
[2022-05-15 21:31:29] [INFO ] Computed and/alt/rep : 3085/3789/3085 causal constraints (skipped 8 transitions) in 203 ms.
[2022-05-15 21:31:31] [INFO ] Added : 65 causal constraints over 13 iterations in 2517 ms. Result :unknown
[2022-05-15 21:31:32] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 67 ms returned sat
[2022-05-15 21:31:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 21:31:34] [INFO ] [Real]Absence check using state equation in 2029 ms returned sat
[2022-05-15 21:31:34] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 21:31:34] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 70 ms returned sat
[2022-05-15 21:31:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 21:31:36] [INFO ] [Nat]Absence check using state equation in 2079 ms returned sat
[2022-05-15 21:31:37] [INFO ] Computed and/alt/rep : 3085/3789/3085 causal constraints (skipped 8 transitions) in 204 ms.
[2022-05-15 21:31:39] [INFO ] Added : 60 causal constraints over 12 iterations in 2233 ms. Result :unknown
[2022-05-15 21:31:39] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 67 ms returned sat
[2022-05-15 21:31:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 21:31:41] [INFO ] [Real]Absence check using state equation in 1785 ms returned sat
[2022-05-15 21:31:41] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 21:31:42] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 70 ms returned sat
[2022-05-15 21:31:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 21:31:44] [INFO ] [Nat]Absence check using state equation in 1801 ms returned sat
[2022-05-15 21:31:44] [INFO ] Computed and/alt/rep : 3085/3789/3085 causal constraints (skipped 8 transitions) in 203 ms.
[2022-05-15 21:31:46] [INFO ] Added : 65 causal constraints over 13 iterations in 2528 ms. Result :unknown
[2022-05-15 21:31:47] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 67 ms returned sat
[2022-05-15 21:31:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 21:31:49] [INFO ] [Real]Absence check using state equation in 1813 ms returned sat
[2022-05-15 21:31:49] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 21:31:49] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 70 ms returned sat
[2022-05-15 21:31:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 21:31:51] [INFO ] [Nat]Absence check using state equation in 1884 ms returned sat
[2022-05-15 21:31:52] [INFO ] Computed and/alt/rep : 3085/3789/3085 causal constraints (skipped 8 transitions) in 209 ms.
[2022-05-15 21:31:54] [INFO ] Added : 60 causal constraints over 12 iterations in 2444 ms. Result :unknown
[2022-05-15 21:31:55] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 67 ms returned sat
[2022-05-15 21:31:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 21:31:56] [INFO ] [Real]Absence check using state equation in 1768 ms returned sat
[2022-05-15 21:31:57] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 21:31:57] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 70 ms returned sat
[2022-05-15 21:31:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 21:31:59] [INFO ] [Nat]Absence check using state equation in 1962 ms returned sat
[2022-05-15 21:32:00] [INFO ] Computed and/alt/rep : 3085/3789/3085 causal constraints (skipped 8 transitions) in 273 ms.
[2022-05-15 21:32:02] [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:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1188)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:925)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2622)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:639)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
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:401)
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:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
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 SAFETY mode, iteration 0 : 2584/2584 places, 3094/3094 transitions.
Graph (trivial) has 2932 edges and 2584 vertex of which 863 / 2584 are part of one of the 64 SCC in 21 ms
Free SCC test removed 799 places
Drop transitions removed 977 transitions
Reduce isomorphic transitions removed 977 transitions.
Graph (complete) has 2395 edges and 1785 vertex of which 1771 are kept as prefixes of interest. Removing 14 places using SCC suffix rule.11 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 1181 transitions
Trivial Post-agglo rules discarded 1181 transitions
Performed 1181 trivial Post agglomeration. Transition count delta: 1181
Iterating post reduction 0 with 1190 rules applied. Total rules applied 1192 place count 1771 transition count 918
Reduce places removed 1181 places and 0 transitions.
Ensure Unique test removed 77 transitions
Reduce isomorphic transitions removed 77 transitions.
Drop transitions removed 64 transitions
Trivial Post-agglo rules discarded 64 transitions
Performed 64 trivial Post agglomeration. Transition count delta: 64
Iterating post reduction 1 with 1322 rules applied. Total rules applied 2514 place count 590 transition count 777
Reduce places removed 64 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 73 rules applied. Total rules applied 2587 place count 526 transition count 768
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 3 with 9 rules applied. Total rules applied 2596 place count 523 transition count 762
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 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 8 rules applied. Total rules applied 2604 place count 519 transition count 758
Reduce places removed 2 places and 0 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Iterating post reduction 5 with 9 rules applied. Total rules applied 2613 place count 517 transition count 751
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 6 with 7 rules applied. Total rules applied 2620 place count 510 transition count 751
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 21 Pre rules applied. Total rules applied 2620 place count 510 transition count 730
Deduced a syphon composed of 21 places in 2 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 7 with 42 rules applied. Total rules applied 2662 place count 489 transition count 730
Discarding 78 places :
Symmetric choice reduction at 7 with 78 rule applications. Total rules 2740 place count 411 transition count 652
Iterating global reduction 7 with 78 rules applied. Total rules applied 2818 place count 411 transition count 652
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 7 with 2 rules applied. Total rules applied 2820 place count 411 transition count 650
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 2821 place count 410 transition count 650
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 8 Pre rules applied. Total rules applied 2821 place count 410 transition count 642
Deduced a syphon composed of 8 places in 3 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 9 with 16 rules applied. Total rules applied 2837 place count 402 transition count 642
Discarding 59 places :
Symmetric choice reduction at 9 with 59 rule applications. Total rules 2896 place count 343 transition count 583
Iterating global reduction 9 with 59 rules applied. Total rules applied 2955 place count 343 transition count 583
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Drop transitions removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 9 with 30 rules applied. Total rules applied 2985 place count 343 transition count 553
Reduce places removed 15 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 10 with 25 rules applied. Total rules applied 3010 place count 328 transition count 543
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 11 with 5 rules applied. Total rules applied 3015 place count 323 transition count 543
Discarding 19 places :
Symmetric choice reduction at 12 with 19 rule applications. Total rules 3034 place count 304 transition count 514
Iterating global reduction 12 with 19 rules applied. Total rules applied 3053 place count 304 transition count 514
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 12 with 8 rules applied. Total rules applied 3061 place count 304 transition count 506
Discarding 8 places :
Symmetric choice reduction at 13 with 8 rule applications. Total rules 3069 place count 296 transition count 490
Iterating global reduction 13 with 8 rules applied. Total rules applied 3077 place count 296 transition count 490
Discarding 3 places :
Symmetric choice reduction at 13 with 3 rule applications. Total rules 3080 place count 293 transition count 484
Iterating global reduction 13 with 3 rules applied. Total rules applied 3083 place count 293 transition count 484
Performed 156 Post agglomeration using F-continuation condition with reduction of 84 identical transitions.
Deduced a syphon composed of 156 places in 1 ms
Reduce places removed 156 places and 0 transitions.
Iterating global reduction 13 with 312 rules applied. Total rules applied 3395 place count 137 transition count 244
Drop transitions removed 2 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 13 with 3 rules applied. Total rules applied 3398 place count 137 transition count 241
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 14 with 6 rules applied. Total rules applied 3404 place count 134 transition count 238
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 14 with 6 rules applied. Total rules applied 3410 place count 134 transition count 232
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 15 with 6 rules applied. Total rules applied 3416 place count 131 transition count 229
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 15 with 6 rules applied. Total rules applied 3422 place count 131 transition count 223
Performed 33 Post agglomeration using F-continuation condition with reduction of 15 identical transitions.
Deduced a syphon composed of 33 places in 1 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 16 with 66 rules applied. Total rules applied 3488 place count 98 transition count 264
Drop transitions removed 20 transitions
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 41 transitions.
Iterating post reduction 16 with 41 rules applied. Total rules applied 3529 place count 98 transition count 223
Discarding 22 places :
Symmetric choice reduction at 17 with 22 rule applications. Total rules 3551 place count 76 transition count 194
Iterating global reduction 17 with 22 rules applied. Total rules applied 3573 place count 76 transition count 194
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 17 with 10 rules applied. Total rules applied 3583 place count 76 transition count 184
Discarding 4 places :
Symmetric choice reduction at 18 with 4 rule applications. Total rules 3587 place count 72 transition count 176
Iterating global reduction 18 with 4 rules applied. Total rules applied 3591 place count 72 transition count 176
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 18 with 4 rules applied. Total rules applied 3595 place count 72 transition count 172
Drop transitions removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 19 with 19 rules applied. Total rules applied 3614 place count 72 transition count 153
Discarding 2 places :
Symmetric choice reduction at 19 with 2 rule applications. Total rules 3616 place count 70 transition count 146
Iterating global reduction 19 with 2 rules applied. Total rules applied 3618 place count 70 transition count 146
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 19 with 1 rules applied. Total rules applied 3619 place count 70 transition count 145
Discarding 1 places :
Symmetric choice reduction at 20 with 1 rule applications. Total rules 3620 place count 69 transition count 144
Iterating global reduction 20 with 1 rules applied. Total rules applied 3621 place count 69 transition count 144
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 20 with 1 rules applied. Total rules applied 3622 place count 69 transition count 143
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 21 with 1 rules applied. Total rules applied 3623 place count 69 transition count 142
Free-agglomeration rule applied 4 times.
Iterating global reduction 21 with 4 rules applied. Total rules applied 3627 place count 69 transition count 138
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 21 with 5 rules applied. Total rules applied 3632 place count 65 transition count 137
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 22 with 1 rules applied. Total rules applied 3633 place count 65 transition count 136
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 22 with 2 rules applied. Total rules applied 3635 place count 65 transition count 136
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 22 with 1 rules applied. Total rules applied 3636 place count 64 transition count 135
Applied a total of 3636 rules in 586 ms. Remains 64 /2584 variables (removed 2520) and now considering 135/3094 (removed 2959) transitions.
Finished structural reductions, in 1 iterations. Remains : 64/2584 places, 135/3094 transitions.
Normalized transition count is 131 out of 135 initially.
// Phase 1: matrix 131 rows 64 cols
[2022-05-15 21:32:02] [INFO ] Computed 4 place invariants in 2 ms
Incomplete random walk after 1000000 steps, including 22072 resets, run finished after 1318 ms. (steps per millisecond=758 ) properties (out of 13) seen :11
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-10 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 5466 resets, run finished after 321 ms. (steps per millisecond=3115 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000001 steps, including 5427 resets, run finished after 321 ms. (steps per millisecond=3115 ) properties (out of 2) seen :0
[2022-05-15 21:32:04] [INFO ] Flow matrix only has 131 transitions (discarded 4 similar events)
// Phase 1: matrix 131 rows 64 cols
[2022-05-15 21:32:04] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-15 21:32:04] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2022-05-15 21:32:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 21:32:04] [INFO ] [Real]Absence check using state equation in 37 ms returned sat
[2022-05-15 21:32:04] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 21:32:04] [INFO ] [Nat]Absence check using 4 positive place invariants in 3 ms returned sat
[2022-05-15 21:32:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 21:32:04] [INFO ] [Nat]Absence check using state equation in 37 ms returned sat
[2022-05-15 21:32:04] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-05-15 21:32:04] [INFO ] [Nat]Added 2 Read/Feed constraints in 2 ms returned sat
[2022-05-15 21:32:04] [INFO ] Deduced a trap composed of 15 places in 46 ms of which 4 ms to minimize.
[2022-05-15 21:32:04] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 53 ms
[2022-05-15 21:32:04] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2022-05-15 21:32:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 21:32:04] [INFO ] [Real]Absence check using state equation in 58 ms returned sat
[2022-05-15 21:32:04] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 21:32:05] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2022-05-15 21:32:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 21:32:05] [INFO ] [Nat]Absence check using state equation in 38 ms returned sat
[2022-05-15 21:32:05] [INFO ] [Nat]Added 2 Read/Feed constraints in 1 ms returned sat
[2022-05-15 21:32:05] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 2 ms to minimize.
[2022-05-15 21:32:05] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 42 ms
Current structural bounds on expressions (after SMT) : [0, 0] Max seen :[0, 0]
FORMULA CloudReconfiguration-PT-306-UpperBounds-15 0 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA CloudReconfiguration-PT-306-UpperBounds-02 0 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 106619 ms.

BK_STOP 1652650325182

--------------------
content from stderr:

+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination UpperBounds -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m

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="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
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 r042-smll-165252095500253"
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 ;