About the Execution of LTSMin+red for DLCround-PT-07b
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 618.699 | 50840.00 | 70656.00 | 572.70 | 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2023-input.r105-tall-167814481500693.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 ltsminxred
Input is DLCround-PT-07b, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r105-tall-167814481500693
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.4M
-rw-r--r-- 1 mcc users 7.4K Feb 25 18:21 CTLCardinality.txt
-rw-r--r-- 1 mcc users 83K Feb 25 18:21 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.9K Feb 25 18:20 CTLFireability.txt
-rw-r--r-- 1 mcc users 42K Feb 25 18:20 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.8K Feb 25 15:53 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 15:53 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 15:53 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 15:53 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.3K Feb 25 18:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 93K Feb 25 18:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.2K Feb 25 18:21 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 68K Feb 25 18:21 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 15:53 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 15:53 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 963K 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 DLCround-PT-07b-UpperBounds-00
FORMULA_NAME DLCround-PT-07b-UpperBounds-01
FORMULA_NAME DLCround-PT-07b-UpperBounds-02
FORMULA_NAME DLCround-PT-07b-UpperBounds-03
FORMULA_NAME DLCround-PT-07b-UpperBounds-04
FORMULA_NAME DLCround-PT-07b-UpperBounds-05
FORMULA_NAME DLCround-PT-07b-UpperBounds-06
FORMULA_NAME DLCround-PT-07b-UpperBounds-07
FORMULA_NAME DLCround-PT-07b-UpperBounds-08
FORMULA_NAME DLCround-PT-07b-UpperBounds-09
FORMULA_NAME DLCround-PT-07b-UpperBounds-10
FORMULA_NAME DLCround-PT-07b-UpperBounds-11
FORMULA_NAME DLCround-PT-07b-UpperBounds-12
FORMULA_NAME DLCround-PT-07b-UpperBounds-13
FORMULA_NAME DLCround-PT-07b-UpperBounds-14
FORMULA_NAME DLCround-PT-07b-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1678361895882
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=ltsminxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DLCround-PT-07b
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-09 11:38:17] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-09 11:38:17] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-09 11:38:17] [INFO ] Load time of PNML (sax parser for PT used): 158 ms
[2023-03-09 11:38:17] [INFO ] Transformed 2703 places.
[2023-03-09 11:38:17] [INFO ] Transformed 4071 transitions.
[2023-03-09 11:38:17] [INFO ] Found NUPN structural information;
[2023-03-09 11:38:17] [INFO ] Parsed PT model containing 2703 places and 4071 transitions and 11073 arcs in 367 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
// Phase 1: matrix 4071 rows 2703 cols
[2023-03-09 11:38:18] [INFO ] Computed 132 place invariants in 46 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 16) seen :11
FORMULA DLCround-PT-07b-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-07b-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-07b-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-07b-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-07b-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-07b-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-07b-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-07b-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-07b-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-07b-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-07b-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 5) seen :0
[2023-03-09 11:38:18] [INFO ] Invariant cache hit.
[2023-03-09 11:38:19] [INFO ] [Real]Absence check using 132 positive place invariants in 113 ms returned sat
[2023-03-09 11:38:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 11:38:20] [INFO ] [Real]Absence check using state equation in 1276 ms returned sat
[2023-03-09 11:38:20] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 11:38:21] [INFO ] [Nat]Absence check using 132 positive place invariants in 101 ms returned sat
[2023-03-09 11:38:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 11:38:22] [INFO ] [Nat]Absence check using state equation in 1319 ms returned sat
[2023-03-09 11:38:22] [INFO ] Computed and/alt/rep : 3814/7298/3814 causal constraints (skipped 256 transitions) in 227 ms.
[2023-03-09 11:38:27] [INFO ] Deduced a trap composed of 18 places in 1532 ms of which 11 ms to minimize.
[2023-03-09 11:38:27] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java: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-09 11:38:27] [INFO ] [Real]Absence check using 132 positive place invariants in 104 ms returned sat
[2023-03-09 11:38:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 11:38:29] [INFO ] [Real]Absence check using state equation in 1373 ms returned sat
[2023-03-09 11:38:29] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 11:38:29] [INFO ] [Nat]Absence check using 132 positive place invariants in 105 ms returned sat
[2023-03-09 11:38:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 11:38:30] [INFO ] [Nat]Absence check using state equation in 1337 ms returned sat
[2023-03-09 11:38:31] [INFO ] Computed and/alt/rep : 3814/7298/3814 causal constraints (skipped 256 transitions) in 185 ms.
[2023-03-09 11:38:35] [INFO ] Deduced a trap composed of 18 places in 1519 ms of which 2 ms to minimize.
[2023-03-09 11:38:35] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 1
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java: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-09 11:38:36] [INFO ] [Real]Absence check using 132 positive place invariants in 103 ms returned sat
[2023-03-09 11:38:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 11:38:37] [INFO ] [Real]Absence check using state equation in 1325 ms returned sat
[2023-03-09 11:38:37] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 11:38:38] [INFO ] [Nat]Absence check using 132 positive place invariants in 111 ms returned sat
[2023-03-09 11:38:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 11:38:39] [INFO ] [Nat]Absence check using state equation in 1338 ms returned sat
[2023-03-09 11:38:39] [INFO ] Computed and/alt/rep : 3814/7298/3814 causal constraints (skipped 256 transitions) in 165 ms.
[2023-03-09 11:38:42] [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-09 11:38:43] [INFO ] [Real]Absence check using 132 positive place invariants in 99 ms returned sat
[2023-03-09 11:38:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 11:38:44] [INFO ] [Real]Absence check using state equation in 1242 ms returned sat
[2023-03-09 11:38:44] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 11:38:44] [INFO ] [Nat]Absence check using 132 positive place invariants in 107 ms returned sat
[2023-03-09 11:38:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 11:38:46] [INFO ] [Nat]Absence check using state equation in 1324 ms returned sat
[2023-03-09 11:38:46] [INFO ] Computed and/alt/rep : 3814/7298/3814 causal constraints (skipped 256 transitions) in 194 ms.
[2023-03-09 11:38:51] [INFO ] Deduced a trap composed of 18 places in 1534 ms of which 3 ms to minimize.
[2023-03-09 11:38:51] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 3
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java: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-09 11:38:51] [INFO ] [Real]Absence check using 132 positive place invariants in 98 ms returned sat
[2023-03-09 11:38:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 11:38:52] [INFO ] [Real]Absence check using state equation in 1320 ms returned sat
[2023-03-09 11:38:52] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 11:38:53] [INFO ] [Nat]Absence check using 132 positive place invariants in 102 ms returned sat
[2023-03-09 11:38:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 11:38:54] [INFO ] [Nat]Absence check using state equation in 1370 ms returned sat
[2023-03-09 11:38:55] [INFO ] Computed and/alt/rep : 3814/7298/3814 causal constraints (skipped 256 transitions) in 180 ms.
[2023-03-09 11:38:57] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 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)
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 1] Max seen :[0, 0, 0, 0, 0]
Support contains 5 out of 2703 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2703/2703 places, 4071/4071 transitions.
Graph (trivial) has 2533 edges and 2703 vertex of which 512 / 2703 are part of one of the 36 SCC in 11 ms
Free SCC test removed 476 places
Drop transitions removed 532 transitions
Reduce isomorphic transitions removed 532 transitions.
Drop transitions removed 993 transitions
Trivial Post-agglo rules discarded 993 transitions
Performed 993 trivial Post agglomeration. Transition count delta: 993
Iterating post reduction 0 with 993 rules applied. Total rules applied 994 place count 2227 transition count 2546
Reduce places removed 993 places and 0 transitions.
Ensure Unique test removed 36 transitions
Reduce isomorphic transitions removed 36 transitions.
Drop transitions removed 28 transitions
Trivial Post-agglo rules discarded 28 transitions
Performed 28 trivial Post agglomeration. Transition count delta: 28
Iterating post reduction 1 with 1057 rules applied. Total rules applied 2051 place count 1234 transition count 2482
Reduce places removed 28 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 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 2 with 36 rules applied. Total rules applied 2087 place count 1206 transition count 2474
Reduce places removed 4 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 5 rules applied. Total rules applied 2092 place count 1202 transition count 2473
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 2093 place count 1201 transition count 2473
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 4 Pre rules applied. Total rules applied 2093 place count 1201 transition count 2469
Deduced a syphon composed of 4 places in 8 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 5 with 8 rules applied. Total rules applied 2101 place count 1197 transition count 2469
Discarding 342 places :
Symmetric choice reduction at 5 with 342 rule applications. Total rules 2443 place count 855 transition count 2127
Iterating global reduction 5 with 342 rules applied. Total rules applied 2785 place count 855 transition count 2127
Performed 146 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 146 Pre rules applied. Total rules applied 2785 place count 855 transition count 1981
Deduced a syphon composed of 146 places in 20 ms
Reduce places removed 146 places and 0 transitions.
Iterating global reduction 5 with 292 rules applied. Total rules applied 3077 place count 709 transition count 1981
Discarding 60 places :
Symmetric choice reduction at 5 with 60 rule applications. Total rules 3137 place count 649 transition count 1342
Iterating global reduction 5 with 60 rules applied. Total rules applied 3197 place count 649 transition count 1342
Ensure Unique test removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Iterating post reduction 5 with 23 rules applied. Total rules applied 3220 place count 649 transition count 1319
Performed 172 Post agglomeration using F-continuation condition with reduction of 8 identical transitions.
Deduced a syphon composed of 172 places in 1 ms
Reduce places removed 172 places and 0 transitions.
Iterating global reduction 6 with 344 rules applied. Total rules applied 3564 place count 477 transition count 1139
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 6 with 8 rules applied. Total rules applied 3572 place count 477 transition count 1131
Performed 34 Post agglomeration using F-continuation condition.Transition count delta: -295
Deduced a syphon composed of 34 places in 1 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 7 with 68 rules applied. Total rules applied 3640 place count 443 transition count 1426
Drop transitions removed 13 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 7 with 17 rules applied. Total rules applied 3657 place count 443 transition count 1409
Discarding 17 places :
Symmetric choice reduction at 8 with 17 rule applications. Total rules 3674 place count 426 transition count 1054
Iterating global reduction 8 with 17 rules applied. Total rules applied 3691 place count 426 transition count 1054
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 8 with 16 rules applied. Total rules applied 3707 place count 426 transition count 1038
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -25
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 9 with 8 rules applied. Total rules applied 3715 place count 422 transition count 1063
Drop transitions removed 109 transitions
Redundant transition composition rules discarded 109 transitions
Iterating global reduction 9 with 109 rules applied. Total rules applied 3824 place count 422 transition count 954
Discarding 8 places :
Symmetric choice reduction at 9 with 8 rule applications. Total rules 3832 place count 414 transition count 865
Iterating global reduction 9 with 8 rules applied. Total rules applied 3840 place count 414 transition count 865
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 9 with 8 rules applied. Total rules applied 3848 place count 414 transition count 857
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -27
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 10 with 8 rules applied. Total rules applied 3856 place count 410 transition count 884
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 10 with 5 rules applied. Total rules applied 3861 place count 410 transition count 879
Renaming transitions due to excessive name length > 1024 char.
Drop transitions removed 22 transitions
Redundant transition composition rules discarded 22 transitions
Iterating global reduction 11 with 22 rules applied. Total rules applied 3883 place count 410 transition count 857
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -30
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 11 with 8 rules applied. Total rules applied 3891 place count 406 transition count 887
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 11 with 6 rules applied. Total rules applied 3897 place count 406 transition count 881
Drop transitions removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 12 with 21 rules applied. Total rules applied 3918 place count 406 transition count 860
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -29
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 12 with 8 rules applied. Total rules applied 3926 place count 402 transition count 889
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 12 with 6 rules applied. Total rules applied 3932 place count 402 transition count 883
Drop transitions removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 13 with 21 rules applied. Total rules applied 3953 place count 402 transition count 862
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -28
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 13 with 8 rules applied. Total rules applied 3961 place count 398 transition count 890
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 13 with 6 rules applied. Total rules applied 3967 place count 398 transition count 884
Drop transitions removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 14 with 21 rules applied. Total rules applied 3988 place count 398 transition count 863
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -27
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 14 with 8 rules applied. Total rules applied 3996 place count 394 transition count 890
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 14 with 6 rules applied. Total rules applied 4002 place count 394 transition count 884
Drop transitions removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 15 with 21 rules applied. Total rules applied 4023 place count 394 transition count 863
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -32
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 15 with 8 rules applied. Total rules applied 4031 place count 390 transition count 895
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 15 with 6 rules applied. Total rules applied 4037 place count 390 transition count 889
Drop transitions removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 16 with 21 rules applied. Total rules applied 4058 place count 390 transition count 868
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -31
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 16 with 8 rules applied. Total rules applied 4066 place count 386 transition count 899
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 16 with 6 rules applied. Total rules applied 4072 place count 386 transition count 893
Drop transitions removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 17 with 21 rules applied. Total rules applied 4093 place count 386 transition count 872
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -28
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 17 with 8 rules applied. Total rules applied 4101 place count 382 transition count 900
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 17 with 6 rules applied. Total rules applied 4107 place count 382 transition count 894
Drop transitions removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 18 with 21 rules applied. Total rules applied 4128 place count 382 transition count 873
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -27
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 18 with 8 rules applied. Total rules applied 4136 place count 378 transition count 900
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 18 with 6 rules applied. Total rules applied 4142 place count 378 transition count 894
Drop transitions removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 19 with 21 rules applied. Total rules applied 4163 place count 378 transition count 873
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -31
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 19 with 8 rules applied. Total rules applied 4171 place count 374 transition count 904
Drop transitions removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 19 with 7 rules applied. Total rules applied 4178 place count 374 transition count 897
Drop transitions removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 20 with 19 rules applied. Total rules applied 4197 place count 374 transition count 878
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -29
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 20 with 6 rules applied. Total rules applied 4203 place count 371 transition count 907
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 20 with 4 rules applied. Total rules applied 4207 place count 371 transition count 903
Drop transitions removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 21 with 19 rules applied. Total rules applied 4226 place count 371 transition count 884
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -27
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 21 with 6 rules applied. Total rules applied 4232 place count 368 transition count 911
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 21 with 4 rules applied. Total rules applied 4236 place count 368 transition count 907
Drop transitions removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 22 with 19 rules applied. Total rules applied 4255 place count 368 transition count 888
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -25
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 22 with 6 rules applied. Total rules applied 4261 place count 365 transition count 913
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 22 with 5 rules applied. Total rules applied 4266 place count 365 transition count 908
Drop transitions removed 18 transitions
Redundant transition composition rules discarded 18 transitions
Iterating global reduction 23 with 18 rules applied. Total rules applied 4284 place count 365 transition count 890
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -25
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 23 with 6 rules applied. Total rules applied 4290 place count 362 transition count 915
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 23 with 4 rules applied. Total rules applied 4294 place count 362 transition count 911
Drop transitions removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 24 with 19 rules applied. Total rules applied 4313 place count 362 transition count 892
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -24
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 24 with 6 rules applied. Total rules applied 4319 place count 359 transition count 916
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 24 with 5 rules applied. Total rules applied 4324 place count 359 transition count 911
Drop transitions removed 18 transitions
Redundant transition composition rules discarded 18 transitions
Iterating global reduction 25 with 18 rules applied. Total rules applied 4342 place count 359 transition count 893
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -23
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 25 with 6 rules applied. Total rules applied 4348 place count 356 transition count 916
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 25 with 4 rules applied. Total rules applied 4352 place count 356 transition count 912
Drop transitions removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 26 with 19 rules applied. Total rules applied 4371 place count 356 transition count 893
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -21
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 26 with 6 rules applied. Total rules applied 4377 place count 353 transition count 914
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 26 with 4 rules applied. Total rules applied 4381 place count 353 transition count 910
Drop transitions removed 18 transitions
Redundant transition composition rules discarded 18 transitions
Iterating global reduction 27 with 18 rules applied. Total rules applied 4399 place count 353 transition count 892
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -17
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 27 with 6 rules applied. Total rules applied 4405 place count 350 transition count 909
Drop transitions removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 27 with 3 rules applied. Total rules applied 4408 place count 350 transition count 906
Drop transitions removed 17 transitions
Redundant transition composition rules discarded 17 transitions
Iterating global reduction 28 with 17 rules applied. Total rules applied 4425 place count 350 transition count 889
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -17
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 28 with 6 rules applied. Total rules applied 4431 place count 347 transition count 906
Drop transitions removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 28 with 3 rules applied. Total rules applied 4434 place count 347 transition count 903
Drop transitions removed 17 transitions
Redundant transition composition rules discarded 17 transitions
Iterating global reduction 29 with 17 rules applied. Total rules applied 4451 place count 347 transition count 886
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -20
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 29 with 6 rules applied. Total rules applied 4457 place count 344 transition count 906
Drop transitions removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 29 with 3 rules applied. Total rules applied 4460 place count 344 transition count 903
Drop transitions removed 17 transitions
Redundant transition composition rules discarded 17 transitions
Iterating global reduction 30 with 17 rules applied. Total rules applied 4477 place count 344 transition count 886
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -20
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 30 with 6 rules applied. Total rules applied 4483 place count 341 transition count 906
Drop transitions removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 30 with 3 rules applied. Total rules applied 4486 place count 341 transition count 903
Drop transitions removed 17 transitions
Redundant transition composition rules discarded 17 transitions
Iterating global reduction 31 with 17 rules applied. Total rules applied 4503 place count 341 transition count 886
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -18
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 31 with 6 rules applied. Total rules applied 4509 place count 338 transition count 904
Drop transitions removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 31 with 3 rules applied. Total rules applied 4512 place count 338 transition count 901
Drop transitions removed 17 transitions
Redundant transition composition rules discarded 17 transitions
Iterating global reduction 32 with 17 rules applied. Total rules applied 4529 place count 338 transition count 884
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -17
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 32 with 6 rules applied. Total rules applied 4535 place count 335 transition count 901
Drop transitions removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 32 with 3 rules applied. Total rules applied 4538 place count 335 transition count 898
Drop transitions removed 17 transitions
Redundant transition composition rules discarded 17 transitions
Iterating global reduction 33 with 17 rules applied. Total rules applied 4555 place count 335 transition count 881
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -19
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 33 with 6 rules applied. Total rules applied 4561 place count 332 transition count 900
Drop transitions removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 33 with 3 rules applied. Total rules applied 4564 place count 332 transition count 897
Drop transitions removed 17 transitions
Redundant transition composition rules discarded 17 transitions
Iterating global reduction 34 with 17 rules applied. Total rules applied 4581 place count 332 transition count 880
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -23
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 34 with 6 rules applied. Total rules applied 4587 place count 329 transition count 903
Drop transitions removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 34 with 3 rules applied. Total rules applied 4590 place count 329 transition count 900
Drop transitions removed 17 transitions
Redundant transition composition rules discarded 17 transitions
Iterating global reduction 35 with 17 rules applied. Total rules applied 4607 place count 329 transition count 883
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -23
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 35 with 6 rules applied. Total rules applied 4613 place count 326 transition count 906
Drop transitions removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 35 with 3 rules applied. Total rules applied 4616 place count 326 transition count 903
Drop transitions removed 17 transitions
Redundant transition composition rules discarded 17 transitions
Iterating global reduction 36 with 17 rules applied. Total rules applied 4633 place count 326 transition count 886
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -17
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 36 with 6 rules applied. Total rules applied 4639 place count 323 transition count 903
Drop transitions removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 36 with 3 rules applied. Total rules applied 4642 place count 323 transition count 900
Drop transitions removed 17 transitions
Redundant transition composition rules discarded 17 transitions
Iterating global reduction 37 with 17 rules applied. Total rules applied 4659 place count 323 transition count 883
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -17
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 37 with 6 rules applied. Total rules applied 4665 place count 320 transition count 900
Drop transitions removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 37 with 3 rules applied. Total rules applied 4668 place count 320 transition count 897
Drop transitions removed 17 transitions
Redundant transition composition rules discarded 17 transitions
Iterating global reduction 38 with 17 rules applied. Total rules applied 4685 place count 320 transition count 880
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -23
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 38 with 6 rules applied. Total rules applied 4691 place count 317 transition count 903
Drop transitions removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 38 with 3 rules applied. Total rules applied 4694 place count 317 transition count 900
Drop transitions removed 17 transitions
Redundant transition composition rules discarded 17 transitions
Iterating global reduction 39 with 17 rules applied. Total rules applied 4711 place count 317 transition count 883
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -26
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 39 with 6 rules applied. Total rules applied 4717 place count 314 transition count 909
Drop transitions removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 39 with 3 rules applied. Total rules applied 4720 place count 314 transition count 906
Drop transitions removed 17 transitions
Redundant transition composition rules discarded 17 transitions
Iterating global reduction 40 with 17 rules applied. Total rules applied 4737 place count 314 transition count 889
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -24
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 40 with 6 rules applied. Total rules applied 4743 place count 311 transition count 913
Drop transitions removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 40 with 3 rules applied. Total rules applied 4746 place count 311 transition count 910
Drop transitions removed 17 transitions
Redundant transition composition rules discarded 17 transitions
Iterating global reduction 41 with 17 rules applied. Total rules applied 4763 place count 311 transition count 893
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -20
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 41 with 6 rules applied. Total rules applied 4769 place count 308 transition count 913
Drop transitions removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 41 with 3 rules applied. Total rules applied 4772 place count 308 transition count 910
Drop transitions removed 17 transitions
Redundant transition composition rules discarded 17 transitions
Iterating global reduction 42 with 17 rules applied. Total rules applied 4789 place count 308 transition count 893
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -20
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 42 with 6 rules applied. Total rules applied 4795 place count 305 transition count 913
Drop transitions removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 42 with 3 rules applied. Total rules applied 4798 place count 305 transition count 910
Drop transitions removed 17 transitions
Redundant transition composition rules discarded 17 transitions
Iterating global reduction 43 with 17 rules applied. Total rules applied 4815 place count 305 transition count 893
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -17
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 43 with 6 rules applied. Total rules applied 4821 place count 302 transition count 910
Drop transitions removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 43 with 3 rules applied. Total rules applied 4824 place count 302 transition count 907
Drop transitions removed 17 transitions
Redundant transition composition rules discarded 17 transitions
Iterating global reduction 44 with 17 rules applied. Total rules applied 4841 place count 302 transition count 890
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -17
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 44 with 6 rules applied. Total rules applied 4847 place count 299 transition count 907
Drop transitions removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 44 with 3 rules applied. Total rules applied 4850 place count 299 transition count 904
Drop transitions removed 17 transitions
Redundant transition composition rules discarded 17 transitions
Iterating global reduction 45 with 17 rules applied. Total rules applied 4867 place count 299 transition count 887
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 45 with 2 rules applied. Total rules applied 4869 place count 298 transition count 890
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 45 with 1 rules applied. Total rules applied 4870 place count 298 transition count 889
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 46 with 3 rules applied. Total rules applied 4873 place count 298 transition count 886
Free-agglomeration rule applied 31 times.
Iterating global reduction 46 with 31 rules applied. Total rules applied 4904 place count 298 transition count 855
Reduce places removed 31 places and 0 transitions.
Drop transitions removed 283 transitions
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 294 transitions.
Graph (complete) has 832 edges and 267 vertex of which 211 are kept as prefixes of interest. Removing 56 places using SCC suffix rule.1 ms
Discarding 56 places :
Also discarding 0 output transitions
Iterating post reduction 46 with 326 rules applied. Total rules applied 5230 place count 211 transition count 561
Drop transitions removed 56 transitions
Reduce isomorphic transitions removed 56 transitions.
Iterating post reduction 47 with 56 rules applied. Total rules applied 5286 place count 211 transition count 505
Drop transitions removed 51 transitions
Redundant transition composition rules discarded 51 transitions
Iterating global reduction 48 with 51 rules applied. Total rules applied 5337 place count 211 transition count 454
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 48 with 1 rules applied. Total rules applied 5338 place count 211 transition count 474
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 48 with 12 rules applied. Total rules applied 5350 place count 210 transition count 463
Drop transitions removed 11 transitions
Redundant transition composition rules discarded 11 transitions
Iterating global reduction 49 with 11 rules applied. Total rules applied 5361 place count 210 transition count 452
Applied a total of 5361 rules in 1936 ms. Remains 210 /2703 variables (removed 2493) and now considering 452/4071 (removed 3619) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1937 ms. Remains : 210/2703 places, 452/4071 transitions.
Normalized transition count is 286 out of 452 initially.
// Phase 1: matrix 286 rows 210 cols
[2023-03-09 11:38:59] [INFO ] Computed 104 place invariants in 15 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 5845 ms. (steps per millisecond=171 ) properties (out of 5) seen :5
FORMULA DLCround-PT-07b-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-07b-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-07b-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-07b-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-07b-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 48307 ms.
ITS solved all properties within timeout
BK_STOP 1678361946722
--------------------
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="DLCround-PT-07b"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="ltsminxred"
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 ltsminxred"
echo " Input is DLCround-PT-07b, 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 r105-tall-167814481500693"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/DLCround-PT-07b.tgz
mv DLCround-PT-07b execution
cd execution
if [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "UpperBounds" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] || [ "UpperBounds" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "UpperBounds" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "UpperBounds" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "UpperBounds.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property UpperBounds.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "UpperBounds.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] ; then
echo "FORMULA_NAME UpperBounds"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;