Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2023-input.r041-tajo-167813695000645.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2023-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
.....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool ltsminxred
Input is CANConstruction-PT-040, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r041-tajo-167813695000645
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.9M
-rw-r--r-- 1 mcc users 11K Feb 25 21:25 CTLCardinality.txt
-rw-r--r-- 1 mcc users 94K Feb 25 21:25 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.3K Feb 25 21:20 CTLFireability.txt
-rw-r--r-- 1 mcc users 63K Feb 25 21:20 CTLFireability.xml
-rw-r--r-- 1 mcc users 5.1K Feb 25 15:40 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 15:40 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.1K Feb 25 15:40 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 15:40 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 25 21:27 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 79K Feb 25 21:27 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Feb 25 21:26 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 72K Feb 25 21:26 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Feb 25 15:40 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Feb 25 15:40 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 2.5M 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 CANConstruction-PT-040-UpperBounds-00
FORMULA_NAME CANConstruction-PT-040-UpperBounds-01
FORMULA_NAME CANConstruction-PT-040-UpperBounds-02
FORMULA_NAME CANConstruction-PT-040-UpperBounds-03
FORMULA_NAME CANConstruction-PT-040-UpperBounds-04
FORMULA_NAME CANConstruction-PT-040-UpperBounds-05
FORMULA_NAME CANConstruction-PT-040-UpperBounds-06
FORMULA_NAME CANConstruction-PT-040-UpperBounds-07
FORMULA_NAME CANConstruction-PT-040-UpperBounds-08
FORMULA_NAME CANConstruction-PT-040-UpperBounds-09
FORMULA_NAME CANConstruction-PT-040-UpperBounds-10
FORMULA_NAME CANConstruction-PT-040-UpperBounds-11
FORMULA_NAME CANConstruction-PT-040-UpperBounds-12
FORMULA_NAME CANConstruction-PT-040-UpperBounds-13
FORMULA_NAME CANConstruction-PT-040-UpperBounds-14
FORMULA_NAME CANConstruction-PT-040-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1678652681302

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=CANConstruction-PT-040
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-12 20:24:43] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-12 20:24:43] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-12 20:24:44] [INFO ] Load time of PNML (sax parser for PT used): 334 ms
[2023-03-12 20:24:44] [INFO ] Transformed 3682 places.
[2023-03-12 20:24:44] [INFO ] Transformed 6720 transitions.
[2023-03-12 20:24:44] [INFO ] Parsed PT model containing 3682 places and 6720 transitions and 20000 arcs in 572 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 18 ms.
// Phase 1: matrix 6720 rows 3682 cols
[2023-03-12 20:24:44] [INFO ] Computed 81 place invariants in 204 ms
Incomplete random walk after 10000 steps, including 14 resets, run finished after 201 ms. (steps per millisecond=49 ) properties (out of 16) seen :9
FORMULA CANConstruction-PT-040-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-040-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-040-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-040-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-040-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-040-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-040-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-040-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-040-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 7) seen :0
[2023-03-12 20:24:44] [INFO ] Invariant cache hit.
[2023-03-12 20:24:45] [INFO ] [Real]Absence check using 41 positive place invariants in 104 ms returned sat
[2023-03-12 20:24:45] [INFO ] [Real]Absence check using 41 positive and 40 generalized place invariants in 19 ms returned sat
[2023-03-12 20:24:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 20:24:48] [INFO ] [Real]Absence check using state equation in 2254 ms returned sat
[2023-03-12 20:24:48] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 20:24:49] [INFO ] [Nat]Absence check using 41 positive place invariants in 75 ms returned sat
[2023-03-12 20:24:49] [INFO ] [Nat]Absence check using 41 positive and 40 generalized place invariants in 15 ms returned sat
[2023-03-12 20:24:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 20:24:51] [INFO ] [Nat]Absence check using state equation in 2119 ms returned sat
[2023-03-12 20:24:51] [INFO ] State equation strengthened by 3160 read => feed constraints.
[2023-03-12 20:24:51] [INFO ] [Nat]Added 3160 Read/Feed constraints in 364 ms returned sat
[2023-03-12 20:24:52] [INFO ] Computed and/alt/rep : 6560/12840/6560 causal constraints (skipped 120 transitions) in 457 ms.
[2023-03-12 20:24:57] [INFO ] Deduced a trap composed of 5 places in 3657 ms of which 17 ms to minimize.
[2023-03-12 20:24: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 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-12 20:24:57] [INFO ] [Real]Absence check using 41 positive place invariants in 60 ms returned sat
[2023-03-12 20:24:57] [INFO ] [Real]Absence check using 41 positive and 40 generalized place invariants in 15 ms returned sat
[2023-03-12 20:24:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 20:24:59] [INFO ] [Real]Absence check using state equation in 1961 ms returned sat
[2023-03-12 20:24:59] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 20:25:00] [INFO ] [Nat]Absence check using 41 positive place invariants in 64 ms returned sat
[2023-03-12 20:25:00] [INFO ] [Nat]Absence check using 41 positive and 40 generalized place invariants in 15 ms returned sat
[2023-03-12 20:25:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 20:25:02] [INFO ] [Nat]Absence check using state equation in 2028 ms returned sat
[2023-03-12 20:25:02] [INFO ] [Nat]Added 3160 Read/Feed constraints in 235 ms returned sat
[2023-03-12 20:25:03] [INFO ] Computed and/alt/rep : 6560/12840/6560 causal constraints (skipped 120 transitions) in 502 ms.
[2023-03-12 20:25:09] [INFO ] Deduced a trap composed of 5 places in 4053 ms of which 3 ms to minimize.
[2023-03-12 20:25:09] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: 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-12 20:25:09] [INFO ] [Real]Absence check using 41 positive place invariants in 66 ms returned sat
[2023-03-12 20:25:09] [INFO ] [Real]Absence check using 41 positive and 40 generalized place invariants in 42 ms returned sat
[2023-03-12 20:25:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 20:25:11] [INFO ] [Real]Absence check using state equation in 2023 ms returned sat
[2023-03-12 20:25:11] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 20:25:12] [INFO ] [Nat]Absence check using 41 positive place invariants in 112 ms returned sat
[2023-03-12 20:25:12] [INFO ] [Nat]Absence check using 41 positive and 40 generalized place invariants in 33 ms returned sat
[2023-03-12 20:25:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 20:25:14] [INFO ] [Nat]Absence check using state equation in 2056 ms returned sat
[2023-03-12 20:25:14] [INFO ] [Nat]Added 3160 Read/Feed constraints in 258 ms returned sat
[2023-03-12 20:25:14] [INFO ] Computed and/alt/rep : 6560/12840/6560 causal constraints (skipped 120 transitions) in 294 ms.
[2023-03-12 20:25:16] [INFO ] Added : 11 causal constraints over 3 iterations in 1578 ms. Result :sat
[2023-03-12 20:25:16] [INFO ] [Real]Absence check using 41 positive place invariants in 125 ms returned sat
[2023-03-12 20:25:16] [INFO ] [Real]Absence check using 41 positive and 40 generalized place invariants in 35 ms returned sat
[2023-03-12 20:25:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 20:25:19] [INFO ] [Real]Absence check using state equation in 2097 ms returned sat
[2023-03-12 20:25:19] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 20:25:19] [INFO ] [Nat]Absence check using 41 positive place invariants in 64 ms returned sat
[2023-03-12 20:25:19] [INFO ] [Nat]Absence check using 41 positive and 40 generalized place invariants in 15 ms returned sat
[2023-03-12 20:25:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 20:25:21] [INFO ] [Nat]Absence check using state equation in 1986 ms returned sat
[2023-03-12 20:25:21] [INFO ] [Nat]Added 3160 Read/Feed constraints in 263 ms returned sat
[2023-03-12 20:25:22] [INFO ] Computed and/alt/rep : 6560/12840/6560 causal constraints (skipped 120 transitions) in 370 ms.
[2023-03-12 20:25:24] [INFO ] Added : 11 causal constraints over 3 iterations in 1932 ms. Result :sat
[2023-03-12 20:25:24] [INFO ] [Real]Absence check using 41 positive place invariants in 80 ms returned sat
[2023-03-12 20:25:24] [INFO ] [Real]Absence check using 41 positive and 40 generalized place invariants in 30 ms returned sat
[2023-03-12 20:25:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 20:25:26] [INFO ] [Real]Absence check using state equation in 2024 ms returned sat
[2023-03-12 20:25:27] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 20:25:27] [INFO ] [Nat]Absence check using 41 positive place invariants in 62 ms returned sat
[2023-03-12 20:25:27] [INFO ] [Nat]Absence check using 41 positive and 40 generalized place invariants in 14 ms returned sat
[2023-03-12 20:25:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 20:25:29] [INFO ] [Nat]Absence check using state equation in 1931 ms returned sat
[2023-03-12 20:25:29] [INFO ] [Nat]Added 3160 Read/Feed constraints in 242 ms returned sat
[2023-03-12 20:25:30] [INFO ] Computed and/alt/rep : 6560/12840/6560 causal constraints (skipped 120 transitions) in 284 ms.
[2023-03-12 20:25:31] [INFO ] Added : 11 causal constraints over 3 iterations in 1679 ms. Result :sat
[2023-03-12 20:25:32] [INFO ] [Real]Absence check using 41 positive place invariants in 76 ms returned sat
[2023-03-12 20:25:32] [INFO ] [Real]Absence check using 41 positive and 40 generalized place invariants in 31 ms returned sat
[2023-03-12 20:25:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 20:25:34] [INFO ] [Real]Absence check using state equation in 2025 ms returned sat
[2023-03-12 20:25:34] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 20:25:34] [INFO ] [Nat]Absence check using 41 positive place invariants in 63 ms returned sat
[2023-03-12 20:25:34] [INFO ] [Nat]Absence check using 41 positive and 40 generalized place invariants in 15 ms returned sat
[2023-03-12 20:25:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 20:25:36] [INFO ] [Nat]Absence check using state equation in 1917 ms returned sat
[2023-03-12 20:25:36] [INFO ] [Nat]Added 3160 Read/Feed constraints in 246 ms returned sat
[2023-03-12 20:25:37] [INFO ] Computed and/alt/rep : 6560/12840/6560 causal constraints (skipped 120 transitions) in 307 ms.
[2023-03-12 20:25:39] [INFO ] Added : 11 causal constraints over 3 iterations in 1986 ms. Result :sat
[2023-03-12 20:25:39] [INFO ] [Real]Absence check using 41 positive place invariants in 63 ms returned sat
[2023-03-12 20:25:39] [INFO ] [Real]Absence check using 41 positive and 40 generalized place invariants in 41 ms returned sat
[2023-03-12 20:25:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 20:25:41] [INFO ] [Real]Absence check using state equation in 2047 ms returned sat
[2023-03-12 20:25:42] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 20:25:42] [INFO ] [Nat]Absence check using 41 positive place invariants in 100 ms returned sat
[2023-03-12 20:25:42] [INFO ] [Nat]Absence check using 41 positive and 40 generalized place invariants in 15 ms returned sat
[2023-03-12 20:25:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 20:25:44] [INFO ] [Nat]Absence check using state equation in 1978 ms returned sat
[2023-03-12 20:25:44] [INFO ] [Nat]Added 3160 Read/Feed constraints in 215 ms returned sat
[2023-03-12 20:25:45] [INFO ] Computed and/alt/rep : 6560/12840/6560 causal constraints (skipped 120 transitions) in 361 ms.
[2023-03-12 20:25:50] [INFO ] Deduced a trap composed of 5 places in 3559 ms of which 4 ms to minimize.
[2023-03-12 20:25:50] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 6
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.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)
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 1, 1, 1] Max seen :[0, 0, 0, 0, 0, 0, 0]
FORMULA CANConstruction-PT-040-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA CANConstruction-PT-040-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA CANConstruction-PT-040-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 4 out of 3682 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3682/3682 places, 6720/6720 transitions.
Drop transitions removed 280 transitions
Trivial Post-agglo rules discarded 280 transitions
Performed 280 trivial Post agglomeration. Transition count delta: 280
Iterating post reduction 0 with 280 rules applied. Total rules applied 280 place count 3682 transition count 6440
Reduce places removed 280 places and 0 transitions.
Iterating post reduction 1 with 280 rules applied. Total rules applied 560 place count 3402 transition count 6440
Discarding 1519 places :
Symmetric choice reduction at 2 with 1519 rule applications. Total rules 2079 place count 1883 transition count 3402
Iterating global reduction 2 with 1519 rules applied. Total rules applied 3598 place count 1883 transition count 3402
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: 40
Deduced a syphon composed of 40 places in 2 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 2 with 80 rules applied. Total rules applied 3678 place count 1843 transition count 3362
Free-agglomeration rule applied 78 times.
Iterating global reduction 2 with 78 rules applied. Total rules applied 3756 place count 1843 transition count 3284
Reduce places removed 78 places and 0 transitions.
Iterating post reduction 2 with 78 rules applied. Total rules applied 3834 place count 1765 transition count 3284
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 3836 place count 1765 transition count 3284
Applied a total of 3836 rules in 1748 ms. Remains 1765 /3682 variables (removed 1917) and now considering 3284/6720 (removed 3436) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1762 ms. Remains : 1765/3682 places, 3284/6720 transitions.
// Phase 1: matrix 3284 rows 1765 cols
[2023-03-12 20:25:52] [INFO ] Computed 81 place invariants in 19 ms
Incomplete random walk after 1000000 steps, including 3635 resets, run finished after 8871 ms. (steps per millisecond=112 ) properties (out of 4) seen :4
FORMULA CANConstruction-PT-040-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-040-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-040-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-040-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 77977 ms.
ITS solved all properties within timeout

BK_STOP 1678652761675

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
++ perl -pe 's/.*\.//g'
+ 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="CANConstruction-PT-040"
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 CANConstruction-PT-040, 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 r041-tajo-167813695000645"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/CANConstruction-PT-040.tgz
mv CANConstruction-PT-040 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 ;