Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 692K
-rw-r--r-- 1 mcc users 8.6K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 95K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.3K May 19 07:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 19 15:30 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 22 14:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Apr 22 14:31 LTLFireability.xml
-rw-r--r-- 1 mcc users 16K Apr 11 16:32 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 171K Apr 11 16:32 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 10K Apr 11 16:31 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 90K Apr 11 16:31 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:31 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:31 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 159K May 18 16:42 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 BusinessProcesses-PT-16-UpperBounds-00
FORMULA_NAME BusinessProcesses-PT-16-UpperBounds-01
FORMULA_NAME BusinessProcesses-PT-16-UpperBounds-02
FORMULA_NAME BusinessProcesses-PT-16-UpperBounds-03
FORMULA_NAME BusinessProcesses-PT-16-UpperBounds-04
FORMULA_NAME BusinessProcesses-PT-16-UpperBounds-05
FORMULA_NAME BusinessProcesses-PT-16-UpperBounds-06
FORMULA_NAME BusinessProcesses-PT-16-UpperBounds-07
FORMULA_NAME BusinessProcesses-PT-16-UpperBounds-08
FORMULA_NAME BusinessProcesses-PT-16-UpperBounds-09
FORMULA_NAME BusinessProcesses-PT-16-UpperBounds-10
FORMULA_NAME BusinessProcesses-PT-16-UpperBounds-11
FORMULA_NAME BusinessProcesses-PT-16-UpperBounds-12
FORMULA_NAME BusinessProcesses-PT-16-UpperBounds-13
FORMULA_NAME BusinessProcesses-PT-16-UpperBounds-14
FORMULA_NAME BusinessProcesses-PT-16-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1717225980773

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BusinessProcesses-PT-16
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 07:13:02] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2024-06-01 07:13:02] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 07:13:03] [INFO ] Load time of PNML (sax parser for PT used): 169 ms
[2024-06-01 07:13:03] [INFO ] Transformed 638 places.
[2024-06-01 07:13:03] [INFO ] Transformed 578 transitions.
[2024-06-01 07:13:03] [INFO ] Found NUPN structural information;
[2024-06-01 07:13:03] [INFO ] Parsed PT model containing 638 places and 578 transitions and 1694 arcs in 365 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 19 ms.
Deduced a syphon composed of 8 places in 19 ms
Reduce places removed 8 places and 8 transitions.
Current structural bounds on expressions (Initiallly, because the net is safe) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
// Phase 1: matrix 570 rows 630 cols
[2024-06-01 07:13:03] [INFO ] Computed 100 invariants in 82 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
RANDOM walk for 10000 steps (67 resets) in 85 ms. (116 steps per ms)
FORMULA BusinessProcesses-PT-16-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-16-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-16-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-16-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-16-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-16-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-16-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-16-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 80008 steps (90 resets) in 153 ms. (519 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-01 07:13:03] [INFO ] Invariant cache hit.
[2024-06-01 07:13:04] [INFO ] [Real]Absence check using 62 positive place invariants in 28 ms returned sat
[2024-06-01 07:13:04] [INFO ] [Real]Absence check using 62 positive and 38 generalized place invariants in 36 ms returned sat
[2024-06-01 07:13:04] [INFO ] [Real]Absence check using state equation in 320 ms returned sat
[2024-06-01 07:13:05] [INFO ] Deduced a trap composed of 12 places in 829 ms of which 48 ms to minimize.
[2024-06-01 07:13:05] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 07:13:05] [INFO ] [Nat]Absence check using 62 positive place invariants in 58 ms returned sat
[2024-06-01 07:13:05] [INFO ] [Nat]Absence check using 62 positive and 38 generalized place invariants in 15 ms returned sat
[2024-06-01 07:13:06] [INFO ] [Nat]Absence check using state equation in 329 ms returned sat
[2024-06-01 07:13:06] [INFO ] Deduced a trap composed of 12 places in 233 ms of which 3 ms to minimize.
[2024-06-01 07:13:06] [INFO ] Deduced a trap composed of 8 places in 223 ms of which 4 ms to minimize.
[2024-06-01 07:13:07] [INFO ] Deduced a trap composed of 20 places in 152 ms of which 16 ms to minimize.
[2024-06-01 07:13:07] [INFO ] Deduced a trap composed of 8 places in 139 ms of which 3 ms to minimize.
[2024-06-01 07:13:07] [INFO ] Deduced a trap composed of 21 places in 119 ms of which 3 ms to minimize.
[2024-06-01 07:13:07] [INFO ] Deduced a trap composed of 36 places in 134 ms of which 2 ms to minimize.
[2024-06-01 07:13:07] [INFO ] Deduced a trap composed of 24 places in 149 ms of which 3 ms to minimize.
[2024-06-01 07:13:07] [INFO ] Deduced a trap composed of 21 places in 200 ms of which 2 ms to minimize.
[2024-06-01 07:13:08] [INFO ] Deduced a trap composed of 43 places in 103 ms of which 3 ms to minimize.
[2024-06-01 07:13:08] [INFO ] Deduced a trap composed of 32 places in 161 ms of which 2 ms to minimize.
[2024-06-01 07:13:08] [INFO ] Deduced a trap composed of 27 places in 136 ms of which 2 ms to minimize.
[2024-06-01 07:13:08] [INFO ] Deduced a trap composed of 39 places in 111 ms of which 2 ms to minimize.
[2024-06-01 07:13:08] [INFO ] Deduced a trap composed of 34 places in 147 ms of which 2 ms to minimize.
[2024-06-01 07:13:08] [INFO ] Deduced a trap composed of 34 places in 135 ms of which 4 ms to minimize.
[2024-06-01 07:13:09] [INFO ] Deduced a trap composed of 40 places in 149 ms of which 4 ms to minimize.
[2024-06-01 07:13:09] [INFO ] Deduced a trap composed of 36 places in 153 ms of which 5 ms to minimize.
[2024-06-01 07:13:09] [INFO ] Deduced a trap composed of 18 places in 189 ms of which 5 ms to minimize.
[2024-06-01 07:13:09] [INFO ] Deduced a trap composed of 26 places in 283 ms of which 3 ms to minimize.
[2024-06-01 07:13:11] [INFO ] Deduced a trap composed of 30 places in 2024 ms of which 33 ms to minimize.
[2024-06-01 07:13:11] [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:299)
at fr.lip6.move.gal.structural.smt.SMTTrapUtils.refineWithTraps(SMTTrapUtils.java:177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:868)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2251)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
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:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2024-06-01 07:13:12] [INFO ] [Real]Absence check using 62 positive place invariants in 34 ms returned sat
[2024-06-01 07:13:12] [INFO ] [Real]Absence check using 62 positive and 38 generalized place invariants in 45 ms returned sat
[2024-06-01 07:13:12] [INFO ] [Real]Absence check using state equation in 256 ms returned sat
[2024-06-01 07:13:12] [INFO ] Deduced a trap composed of 8 places in 380 ms of which 3 ms to minimize.
[2024-06-01 07:13:12] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 07:13:13] [INFO ] [Nat]Absence check using 62 positive place invariants in 47 ms returned sat
[2024-06-01 07:13:13] [INFO ] [Nat]Absence check using 62 positive and 38 generalized place invariants in 61 ms returned sat
[2024-06-01 07:13:13] [INFO ] [Nat]Absence check using state equation in 374 ms returned sat
[2024-06-01 07:13:13] [INFO ] Deduced a trap composed of 8 places in 358 ms of which 4 ms to minimize.
[2024-06-01 07:13:14] [INFO ] Deduced a trap composed of 13 places in 216 ms of which 18 ms to minimize.
[2024-06-01 07:13:14] [INFO ] Deduced a trap composed of 8 places in 261 ms of which 4 ms to minimize.
[2024-06-01 07:13:14] [INFO ] Deduced a trap composed of 125 places in 286 ms of which 20 ms to minimize.
[2024-06-01 07:13:15] [INFO ] Deduced a trap composed of 29 places in 421 ms of which 22 ms to minimize.
[2024-06-01 07:13:15] [INFO ] Deduced a trap composed of 15 places in 248 ms of which 4 ms to minimize.
[2024-06-01 07:13:15] [INFO ] Deduced a trap composed of 19 places in 204 ms of which 4 ms to minimize.
[2024-06-01 07:13:16] [INFO ] Deduced a trap composed of 23 places in 226 ms of which 5 ms to minimize.
[2024-06-01 07:13:16] [INFO ] Deduced a trap composed of 16 places in 235 ms of which 5 ms to minimize.
[2024-06-01 07:13:16] [INFO ] Deduced a trap composed of 16 places in 294 ms of which 8 ms to minimize.
[2024-06-01 07:13:16] [INFO ] Deduced a trap composed of 24 places in 258 ms of which 4 ms to minimize.
[2024-06-01 07:13:17] [INFO ] Deduced a trap composed of 38 places in 224 ms of which 4 ms to minimize.
[2024-06-01 07:13:17] [INFO ] Deduced a trap composed of 29 places in 219 ms of which 18 ms to minimize.
[2024-06-01 07:13:17] [INFO ] Deduced a trap composed of 12 places in 280 ms of which 9 ms to minimize.
[2024-06-01 07:13:18] [INFO ] Deduced a trap composed of 20 places in 200 ms of which 4 ms to minimize.
[2024-06-01 07:13:18] [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:299)
at fr.lip6.move.gal.structural.smt.SMTTrapUtils.refineWithTraps(SMTTrapUtils.java:177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:868)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2251)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
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:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2024-06-01 07:13:18] [INFO ] [Real]Absence check using 62 positive place invariants in 28 ms returned sat
[2024-06-01 07:13:18] [INFO ] [Real]Absence check using 62 positive and 38 generalized place invariants in 28 ms returned sat
[2024-06-01 07:13:18] [INFO ] [Real]Absence check using state equation in 237 ms returned sat
[2024-06-01 07:13:18] [INFO ] Deduced a trap composed of 8 places in 246 ms of which 4 ms to minimize.
[2024-06-01 07:13:18] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 07:13:19] [INFO ] [Nat]Absence check using 62 positive place invariants in 27 ms returned sat
[2024-06-01 07:13:19] [INFO ] [Nat]Absence check using 62 positive and 38 generalized place invariants in 14 ms returned sat
[2024-06-01 07:13:19] [INFO ] [Nat]Absence check using state equation in 220 ms returned sat
[2024-06-01 07:13:19] [INFO ] Deduced a trap composed of 8 places in 314 ms of which 7 ms to minimize.
[2024-06-01 07:13:19] [INFO ] Deduced a trap composed of 11 places in 191 ms of which 4 ms to minimize.
[2024-06-01 07:13:20] [INFO ] Deduced a trap composed of 23 places in 211 ms of which 4 ms to minimize.
[2024-06-01 07:13:20] [INFO ] Deduced a trap composed of 15 places in 196 ms of which 4 ms to minimize.
[2024-06-01 07:13:20] [INFO ] Deduced a trap composed of 20 places in 194 ms of which 4 ms to minimize.
[2024-06-01 07:13:20] [INFO ] Deduced a trap composed of 8 places in 258 ms of which 18 ms to minimize.
[2024-06-01 07:13:21] [INFO ] Deduced a trap composed of 17 places in 295 ms of which 17 ms to minimize.
[2024-06-01 07:13:21] [INFO ] Deduced a trap composed of 32 places in 256 ms of which 3 ms to minimize.
[2024-06-01 07:13:21] [INFO ] Deduced a trap composed of 15 places in 237 ms of which 3 ms to minimize.
[2024-06-01 07:13:21] [INFO ] Deduced a trap composed of 21 places in 276 ms of which 4 ms to minimize.
[2024-06-01 07:13:22] [INFO ] Deduced a trap composed of 43 places in 250 ms of which 4 ms to minimize.
[2024-06-01 07:13:22] [INFO ] Deduced a trap composed of 152 places in 244 ms of which 3 ms to minimize.
[2024-06-01 07:13:25] [INFO ] Deduced a trap composed of 159 places in 3270 ms of which 4 ms to minimize.
[2024-06-01 07:13:25] [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:299)
at fr.lip6.move.gal.structural.smt.SMTTrapUtils.refineWithTraps(SMTTrapUtils.java:177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:868)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2251)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
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:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2024-06-01 07:13:25] [INFO ] [Real]Absence check using 62 positive place invariants in 25 ms returned sat
[2024-06-01 07:13:25] [INFO ] [Real]Absence check using 62 positive and 38 generalized place invariants in 14 ms returned sat
[2024-06-01 07:13:26] [INFO ] [Real]Absence check using state equation in 258 ms returned sat
[2024-06-01 07:13:26] [INFO ] Deduced a trap composed of 8 places in 237 ms of which 5 ms to minimize.
[2024-06-01 07:13:26] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 07:13:26] [INFO ] [Nat]Absence check using 62 positive place invariants in 43 ms returned sat
[2024-06-01 07:13:26] [INFO ] [Nat]Absence check using 62 positive and 38 generalized place invariants in 15 ms returned sat
[2024-06-01 07:13:26] [INFO ] [Nat]Absence check using state equation in 202 ms returned sat
[2024-06-01 07:13:27] [INFO ] Deduced a trap composed of 8 places in 336 ms of which 20 ms to minimize.
[2024-06-01 07:13:27] [INFO ] Deduced a trap composed of 29 places in 348 ms of which 36 ms to minimize.
[2024-06-01 07:13:28] [INFO ] Deduced a trap composed of 8 places in 277 ms of which 8 ms to minimize.
[2024-06-01 07:13:28] [INFO ] Deduced a trap composed of 14 places in 271 ms of which 7 ms to minimize.
[2024-06-01 07:13:28] [INFO ] Deduced a trap composed of 32 places in 249 ms of which 3 ms to minimize.
[2024-06-01 07:13:28] [INFO ] Deduced a trap composed of 13 places in 238 ms of which 4 ms to minimize.
[2024-06-01 07:13:29] [INFO ] Deduced a trap composed of 22 places in 238 ms of which 4 ms to minimize.
[2024-06-01 07:13:29] [INFO ] Deduced a trap composed of 23 places in 206 ms of which 4 ms to minimize.
[2024-06-01 07:13:29] [INFO ] Deduced a trap composed of 11 places in 204 ms of which 4 ms to minimize.
[2024-06-01 07:13:29] [INFO ] Deduced a trap composed of 25 places in 249 ms of which 3 ms to minimize.
[2024-06-01 07:13:30] [INFO ] Deduced a trap composed of 18 places in 242 ms of which 3 ms to minimize.
[2024-06-01 07:13:30] [INFO ] Deduced a trap composed of 17 places in 242 ms of which 4 ms to minimize.
[2024-06-01 07:13:30] [INFO ] Deduced a trap composed of 15 places in 256 ms of which 4 ms to minimize.
[2024-06-01 07:13:30] [INFO ] Deduced a trap composed of 29 places in 152 ms of which 2 ms to minimize.
[2024-06-01 07:13:31] [INFO ] Deduced a trap composed of 43 places in 104 ms of which 2 ms to minimize.
[2024-06-01 07:13:31] [INFO ] Deduced a trap composed of 25 places in 176 ms of which 3 ms to minimize.
[2024-06-01 07:13:31] [INFO ] Deduced a trap composed of 20 places in 147 ms of which 2 ms to minimize.
[2024-06-01 07:13:31] [INFO ] Trap strengthening (SAT) tested/added 17/17 trap constraints in 4583 ms
[2024-06-01 07:13:31] [INFO ] [Real]Absence check using 62 positive place invariants in 21 ms returned sat
[2024-06-01 07:13:31] [INFO ] [Real]Absence check using 62 positive and 38 generalized place invariants in 13 ms returned sat
[2024-06-01 07:13:31] [INFO ] [Real]Absence check using state equation in 199 ms returned sat
[2024-06-01 07:13:32] [INFO ] Deduced a trap composed of 8 places in 196 ms of which 3 ms to minimize.
[2024-06-01 07:13:32] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 07:13:32] [INFO ] [Nat]Absence check using 62 positive place invariants in 145 ms returned sat
[2024-06-01 07:13:32] [INFO ] [Nat]Absence check using 62 positive and 38 generalized place invariants in 266 ms returned sat
[2024-06-01 07:13:37] [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: Broken pipe ... 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: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:299)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:851)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2251)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
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:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2024-06-01 07:13:37] [INFO ] [Real]Absence check using 62 positive place invariants in 34 ms returned sat
[2024-06-01 07:13:37] [INFO ] [Real]Absence check using 62 positive and 38 generalized place invariants in 24 ms returned sat
[2024-06-01 07:13:37] [INFO ] [Real]Absence check using state equation in 300 ms returned sat
[2024-06-01 07:13:38] [INFO ] Deduced a trap composed of 11 places in 327 ms of which 4 ms to minimize.
[2024-06-01 07:13:38] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 07:13:38] [INFO ] [Nat]Absence check using 62 positive place invariants in 47 ms returned sat
[2024-06-01 07:13:38] [INFO ] [Nat]Absence check using 62 positive and 38 generalized place invariants in 23 ms returned sat
[2024-06-01 07:13:38] [INFO ] [Nat]Absence check using state equation in 198 ms returned sat
[2024-06-01 07:13:39] [INFO ] Deduced a trap composed of 11 places in 405 ms of which 32 ms to minimize.
[2024-06-01 07:13:39] [INFO ] Deduced a trap composed of 8 places in 287 ms of which 6 ms to minimize.
[2024-06-01 07:13:39] [INFO ] Deduced a trap composed of 8 places in 290 ms of which 8 ms to minimize.
[2024-06-01 07:13:40] [INFO ] Deduced a trap composed of 39 places in 735 ms of which 5 ms to minimize.
[2024-06-01 07:13:40] [INFO ] Deduced a trap composed of 15 places in 278 ms of which 4 ms to minimize.
[2024-06-01 07:13:41] [INFO ] Deduced a trap composed of 15 places in 401 ms of which 133 ms to minimize.
[2024-06-01 07:13:41] [INFO ] Deduced a trap composed of 29 places in 311 ms of which 4 ms to minimize.
[2024-06-01 07:13:41] [INFO ] Deduced a trap composed of 36 places in 281 ms of which 19 ms to minimize.
[2024-06-01 07:13:42] [INFO ] Deduced a trap composed of 17 places in 279 ms of which 5 ms to minimize.
[2024-06-01 07:13:42] [INFO ] Deduced a trap composed of 30 places in 549 ms of which 5 ms to minimize.
[2024-06-01 07:13:43] [INFO ] Deduced a trap composed of 28 places in 282 ms of which 5 ms to minimize.
[2024-06-01 07:13:43] [INFO ] Deduced a trap composed of 16 places in 211 ms of which 2 ms to minimize.
[2024-06-01 07:13:43] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 5
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:299)
at fr.lip6.move.gal.structural.smt.SMTTrapUtils.refineWithTraps(SMTTrapUtils.java:177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:868)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2251)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
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:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2024-06-01 07:13:43] [INFO ] [Real]Absence check using 62 positive place invariants in 26 ms returned sat
[2024-06-01 07:13:43] [INFO ] [Real]Absence check using 62 positive and 38 generalized place invariants in 16 ms returned sat
[2024-06-01 07:13:43] [INFO ] [Real]Absence check using state equation in 225 ms returned sat
[2024-06-01 07:13:44] [INFO ] Deduced a trap composed of 8 places in 224 ms of which 3 ms to minimize.
[2024-06-01 07:13:44] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 07:13:44] [INFO ] [Nat]Absence check using 62 positive place invariants in 22 ms returned sat
[2024-06-01 07:13:44] [INFO ] [Nat]Absence check using 62 positive and 38 generalized place invariants in 14 ms returned sat
[2024-06-01 07:13:44] [INFO ] [Nat]Absence check using state equation in 185 ms returned sat
[2024-06-01 07:13:44] [INFO ] Deduced a trap composed of 8 places in 357 ms of which 6 ms to minimize.
[2024-06-01 07:13:45] [INFO ] Deduced a trap composed of 8 places in 375 ms of which 19 ms to minimize.
[2024-06-01 07:13:45] [INFO ] Deduced a trap composed of 11 places in 371 ms of which 20 ms to minimize.
[2024-06-01 07:13:46] [INFO ] Deduced a trap composed of 14 places in 251 ms of which 3 ms to minimize.
[2024-06-01 07:13:46] [INFO ] Deduced a trap composed of 119 places in 256 ms of which 3 ms to minimize.
[2024-06-01 07:13:46] [INFO ] Deduced a trap composed of 14 places in 188 ms of which 3 ms to minimize.
[2024-06-01 07:13:46] [INFO ] Deduced a trap composed of 22 places in 193 ms of which 11 ms to minimize.
[2024-06-01 07:13:47] [INFO ] Deduced a trap composed of 16 places in 295 ms of which 8 ms to minimize.
[2024-06-01 07:13:47] [INFO ] Deduced a trap composed of 22 places in 256 ms of which 7 ms to minimize.
[2024-06-01 07:13:47] [INFO ] Deduced a trap composed of 21 places in 256 ms of which 30 ms to minimize.
[2024-06-01 07:13:47] [INFO ] Deduced a trap composed of 25 places in 202 ms of which 2 ms to minimize.
[2024-06-01 07:13:48] [INFO ] Deduced a trap composed of 129 places in 181 ms of which 3 ms to minimize.
[2024-06-01 07:13:48] [INFO ] Deduced a trap composed of 30 places in 232 ms of which 5 ms to minimize.
[2024-06-01 07:13:48] [INFO ] Deduced a trap composed of 37 places in 195 ms of which 2 ms to minimize.
[2024-06-01 07:13:48] [INFO ] Deduced a trap composed of 42 places in 284 ms of which 5 ms to minimize.
[2024-06-01 07:13:48] [INFO ] Deduced a trap composed of 39 places in 90 ms of which 2 ms to minimize.
[2024-06-01 07:13:49] [INFO ] Deduced a trap composed of 49 places in 94 ms of which 2 ms to minimize.
[2024-06-01 07:13:49] [INFO ] Deduced a trap composed of 40 places in 158 ms of which 2 ms to minimize.
[2024-06-01 07:13:49] [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:299)
at fr.lip6.move.gal.structural.smt.SMTTrapUtils.refineWithTraps(SMTTrapUtils.java:177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:868)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2251)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
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:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2024-06-01 07:13:49] [INFO ] [Real]Absence check using 62 positive place invariants in 20 ms returned sat
[2024-06-01 07:13:49] [INFO ] [Real]Absence check using 62 positive and 38 generalized place invariants in 13 ms returned sat
[2024-06-01 07:13:49] [INFO ] [Real]Absence check using state equation in 189 ms returned sat
[2024-06-01 07:13:49] [INFO ] Deduced a trap composed of 8 places in 175 ms of which 3 ms to minimize.
[2024-06-01 07:13:49] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 07:13:50] [INFO ] [Nat]Absence check using 62 positive place invariants in 22 ms returned sat
[2024-06-01 07:13:50] [INFO ] [Nat]Absence check using 62 positive and 38 generalized place invariants in 12 ms returned sat
[2024-06-01 07:13:50] [INFO ] [Nat]Absence check using state equation in 208 ms returned sat
[2024-06-01 07:13:50] [INFO ] Deduced a trap composed of 8 places in 289 ms of which 3 ms to minimize.
[2024-06-01 07:13:50] [INFO ] Deduced a trap composed of 15 places in 248 ms of which 3 ms to minimize.
[2024-06-01 07:13:51] [INFO ] Deduced a trap composed of 11 places in 272 ms of which 6 ms to minimize.
[2024-06-01 07:13:51] [INFO ] Deduced a trap composed of 21 places in 252 ms of which 6 ms to minimize.
[2024-06-01 07:13:51] [INFO ] Deduced a trap composed of 15 places in 294 ms of which 32 ms to minimize.
[2024-06-01 07:13:52] [INFO ] Deduced a trap composed of 8 places in 352 ms of which 5 ms to minimize.
[2024-06-01 07:13:52] [INFO ] Deduced a trap composed of 15 places in 281 ms of which 10 ms to minimize.
[2024-06-01 07:14:00] [INFO ] Deduced a trap composed of 23 places in 7604 ms of which 10 ms to minimize.
[2024-06-01 07:14:00] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 7
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:299)
at fr.lip6.move.gal.structural.smt.SMTTrapUtils.refineWithTraps(SMTTrapUtils.java:177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:868)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2251)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
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:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1]
Support contains 8 out of 630 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 630/630 places, 570/570 transitions.
Graph (trivial) has 361 edges and 630 vertex of which 7 / 630 are part of one of the 1 SCC in 5 ms
Free SCC test removed 6 places
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 1283 edges and 624 vertex of which 618 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.2 ms
Discarding 6 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 142 transitions
Trivial Post-agglo rules discarded 142 transitions
Performed 142 trivial Post agglomeration. Transition count delta: 142
Iterating post reduction 0 with 142 rules applied. Total rules applied 144 place count 618 transition count 419
Reduce places removed 142 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 143 rules applied. Total rules applied 287 place count 476 transition count 418
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 288 place count 475 transition count 418
Performed 88 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 88 Pre rules applied. Total rules applied 288 place count 475 transition count 330
Deduced a syphon composed of 88 places in 1 ms
Ensure Unique test removed 16 places
Reduce places removed 104 places and 0 transitions.
Iterating global reduction 3 with 192 rules applied. Total rules applied 480 place count 371 transition count 330
Discarding 86 places :
Symmetric choice reduction at 3 with 86 rule applications. Total rules 566 place count 285 transition count 244
Iterating global reduction 3 with 86 rules applied. Total rules applied 652 place count 285 transition count 244
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 9 Pre rules applied. Total rules applied 652 place count 285 transition count 235
Deduced a syphon composed of 9 places in 1 ms
Ensure Unique test removed 3 places
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 3 with 21 rules applied. Total rules applied 673 place count 273 transition count 235
Performed 93 Post agglomeration using F-continuation condition.Transition count delta: 93
Deduced a syphon composed of 93 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 95 places and 0 transitions.
Iterating global reduction 3 with 188 rules applied. Total rules applied 861 place count 178 transition count 142
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 863 place count 177 transition count 146
Free-agglomeration rule applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 865 place count 177 transition count 144
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 867 place count 175 transition count 144
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 4 with 3 rules applied. Total rules applied 870 place count 175 transition count 144
Applied a total of 870 rules in 323 ms. Remains 175 /630 variables (removed 455) and now considering 144/570 (removed 426) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 355 ms. Remains : 175/630 places, 144/570 transitions.
// Phase 1: matrix 144 rows 175 cols
[2024-06-01 07:14:00] [INFO ] Computed 74 invariants in 3 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1]
RANDOM walk for 1000000 steps (39723 resets) in 3559 ms. (280 steps per ms)
FORMULA BusinessProcesses-PT-16-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-16-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-16-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-16-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-16-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-16-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-16-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-16-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 1000001 steps (19673 resets) in 2139 ms. (467 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[] Max Struct:[]
RANDOM walk for 0 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/0 properties
Finished probabilistic random walk after 0 steps, run visited all 0 properties in 0 ms. (steps per millisecond=0 )
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[] Max Struct:[]
All properties solved without resorting to model-checking.
Total runtime 63666 ms.
ITS solved all properties within timeout

BK_STOP 1717226046554

--------------------
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.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /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="BusinessProcesses-PT-16"
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-5568"
echo " Executing tool ltsminxred"
echo " Input is BusinessProcesses-PT-16, 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 r472-tajo-171620399800573"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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