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.r047-tajo-171620398400533.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 greatspnxred
Input is BusinessProcesses-PT-11, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r047-tajo-171620398400533
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 552K
-rw-r--r-- 1 mcc users 7.7K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 84K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K 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.6K Apr 22 14:31 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 22 14:31 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K 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 11K Apr 11 16:36 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 109K Apr 11 16:36 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Apr 11 16:36 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 43K Apr 11 16:36 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 141K 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-11-UpperBounds-00
FORMULA_NAME BusinessProcesses-PT-11-UpperBounds-01
FORMULA_NAME BusinessProcesses-PT-11-UpperBounds-02
FORMULA_NAME BusinessProcesses-PT-11-UpperBounds-03
FORMULA_NAME BusinessProcesses-PT-11-UpperBounds-04
FORMULA_NAME BusinessProcesses-PT-11-UpperBounds-05
FORMULA_NAME BusinessProcesses-PT-11-UpperBounds-06
FORMULA_NAME BusinessProcesses-PT-11-UpperBounds-07
FORMULA_NAME BusinessProcesses-PT-11-UpperBounds-08
FORMULA_NAME BusinessProcesses-PT-11-UpperBounds-09
FORMULA_NAME BusinessProcesses-PT-11-UpperBounds-10
FORMULA_NAME BusinessProcesses-PT-11-UpperBounds-11
FORMULA_NAME BusinessProcesses-PT-11-UpperBounds-12
FORMULA_NAME BusinessProcesses-PT-11-UpperBounds-13
FORMULA_NAME BusinessProcesses-PT-11-UpperBounds-14
FORMULA_NAME BusinessProcesses-PT-11-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1716305590006

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BusinessProcesses-PT-11
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-21 15:33:11] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2024-05-21 15:33:11] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 15:33:11] [INFO ] Load time of PNML (sax parser for PT used): 133 ms
[2024-05-21 15:33:11] [INFO ] Transformed 567 places.
[2024-05-21 15:33:12] [INFO ] Transformed 508 transitions.
[2024-05-21 15:33:12] [INFO ] Found NUPN structural information;
[2024-05-21 15:33:12] [INFO ] Parsed PT model containing 567 places and 508 transitions and 1512 arcs in 277 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 9 ms.
Deduced a syphon composed of 7 places in 10 ms
Reduce places removed 7 places and 7 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 501 rows 560 cols
[2024-05-21 15:33:12] [INFO ] Computed 95 invariants in 34 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 (75 resets) in 45 ms. (217 steps per ms)
FORMULA BusinessProcesses-PT-11-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-11-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-11-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-11-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-11-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-11-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-11-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-11-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 80007 steps (106 resets) in 174 ms. (457 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-05-21 15:33:12] [INFO ] Invariant cache hit.
[2024-05-21 15:33:12] [INFO ] [Real]Absence check using 53 positive place invariants in 24 ms returned sat
[2024-05-21 15:33:12] [INFO ] [Real]Absence check using 53 positive and 42 generalized place invariants in 13 ms returned sat
[2024-05-21 15:33:12] [INFO ] [Real]Absence check using state equation in 182 ms returned sat
[2024-05-21 15:33:13] [INFO ] Deduced a trap composed of 12 places in 268 ms of which 57 ms to minimize.
[2024-05-21 15:33:13] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 15:33:13] [INFO ] [Nat]Absence check using 53 positive place invariants in 24 ms returned sat
[2024-05-21 15:33:13] [INFO ] [Nat]Absence check using 53 positive and 42 generalized place invariants in 13 ms returned sat
[2024-05-21 15:33:13] [INFO ] [Nat]Absence check using state equation in 177 ms returned sat
[2024-05-21 15:33:13] [INFO ] Deduced a trap composed of 8 places in 161 ms of which 4 ms to minimize.
[2024-05-21 15:33:13] [INFO ] Deduced a trap composed of 25 places in 159 ms of which 4 ms to minimize.
[2024-05-21 15:33:14] [INFO ] Deduced a trap composed of 110 places in 179 ms of which 4 ms to minimize.
[2024-05-21 15:33:14] [INFO ] Deduced a trap composed of 43 places in 133 ms of which 2 ms to minimize.
[2024-05-21 15:33:14] [INFO ] Deduced a trap composed of 11 places in 164 ms of which 3 ms to minimize.
[2024-05-21 15:33:14] [INFO ] Deduced a trap composed of 19 places in 179 ms of which 3 ms to minimize.
[2024-05-21 15:33:14] [INFO ] Deduced a trap composed of 36 places in 150 ms of which 3 ms to minimize.
[2024-05-21 15:33:15] [INFO ] Deduced a trap composed of 36 places in 157 ms of which 3 ms to minimize.
[2024-05-21 15:33:15] [INFO ] Deduced a trap composed of 37 places in 124 ms of which 2 ms to minimize.
[2024-05-21 15:33:15] [INFO ] Deduced a trap composed of 27 places in 125 ms of which 3 ms to minimize.
[2024-05-21 15:33:15] [INFO ] Deduced a trap composed of 23 places in 132 ms of which 3 ms to minimize.
[2024-05-21 15:33:15] [INFO ] Deduced a trap composed of 109 places in 123 ms of which 3 ms to minimize.
[2024-05-21 15:33:15] [INFO ] Deduced a trap composed of 34 places in 159 ms of which 2 ms to minimize.
[2024-05-21 15:33:15] [INFO ] Deduced a trap composed of 24 places in 132 ms of which 3 ms to minimize.
[2024-05-21 15:33:16] [INFO ] Deduced a trap composed of 110 places in 155 ms of which 3 ms to minimize.
[2024-05-21 15:33:16] [INFO ] Deduced a trap composed of 100 places in 154 ms of which 3 ms to minimize.
[2024-05-21 15:33:16] [INFO ] Deduced a trap composed of 29 places in 100 ms of which 7 ms to minimize.
[2024-05-21 15:33:16] [INFO ] Deduced a trap composed of 26 places in 118 ms of which 2 ms to minimize.
[2024-05-21 15:33:16] [INFO ] Deduced a trap composed of 24 places in 89 ms of which 2 ms to minimize.
[2024-05-21 15:33:16] [INFO ] Deduced a trap composed of 25 places in 116 ms of which 3 ms to minimize.
[2024-05-21 15:33:16] [INFO ] Deduced a trap composed of 34 places in 109 ms of which 3 ms to minimize.
[2024-05-21 15:33:17] [INFO ] Deduced a trap composed of 38 places in 112 ms of which 3 ms to minimize.
[2024-05-21 15:33:17] [INFO ] Deduced a trap composed of 23 places in 145 ms of which 3 ms to minimize.
[2024-05-21 15:33:17] [INFO ] Deduced a trap composed of 103 places in 112 ms of which 2 ms to minimize.
[2024-05-21 15:33:17] [INFO ] Deduced a trap composed of 36 places in 136 ms of which 3 ms to minimize.
[2024-05-21 15:33:17] [INFO ] Deduced a trap composed of 27 places in 107 ms of which 2 ms to minimize.
[2024-05-21 15:33:17] [INFO ] Deduced a trap composed of 23 places in 121 ms of which 2 ms to minimize.
[2024-05-21 15:33:17] [INFO ] Deduced a trap composed of 40 places in 111 ms of which 3 ms to minimize.
[2024-05-21 15:33:18] [INFO ] Deduced a trap composed of 46 places in 116 ms of which 3 ms to minimize.
[2024-05-21 15:33:18] [INFO ] Deduced a trap composed of 105 places in 183 ms of which 3 ms to minimize.
[2024-05-21 15:33:18] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Stream closed... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Stream closed...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:299)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:954)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:875)
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-05-21 15:33:18] [INFO ] [Real]Absence check using 53 positive place invariants in 22 ms returned sat
[2024-05-21 15:33:18] [INFO ] [Real]Absence check using 53 positive and 42 generalized place invariants in 11 ms returned sat
[2024-05-21 15:33:18] [INFO ] [Real]Absence check using state equation in 180 ms returned sat
[2024-05-21 15:33:18] [INFO ] Deduced a trap composed of 8 places in 167 ms of which 3 ms to minimize.
[2024-05-21 15:33:18] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 15:33:18] [INFO ] [Nat]Absence check using 53 positive place invariants in 19 ms returned sat
[2024-05-21 15:33:19] [INFO ] [Nat]Absence check using 53 positive and 42 generalized place invariants in 21 ms returned sat
[2024-05-21 15:33:19] [INFO ] [Nat]Absence check using state equation in 177 ms returned sat
[2024-05-21 15:33:19] [INFO ] Deduced a trap composed of 8 places in 205 ms of which 4 ms to minimize.
[2024-05-21 15:33:19] [INFO ] Deduced a trap composed of 19 places in 171 ms of which 7 ms to minimize.
[2024-05-21 15:33:19] [INFO ] Deduced a trap composed of 17 places in 177 ms of which 3 ms to minimize.
[2024-05-21 15:33:19] [INFO ] Deduced a trap composed of 100 places in 163 ms of which 4 ms to minimize.
[2024-05-21 15:33:20] [INFO ] Deduced a trap composed of 32 places in 127 ms of which 3 ms to minimize.
[2024-05-21 15:33:20] [INFO ] Deduced a trap composed of 32 places in 173 ms of which 3 ms to minimize.
[2024-05-21 15:33:20] [INFO ] Deduced a trap composed of 101 places in 153 ms of which 2 ms to minimize.
[2024-05-21 15:33:20] [INFO ] Deduced a trap composed of 22 places in 124 ms of which 3 ms to minimize.
[2024-05-21 15:33:20] [INFO ] Deduced a trap composed of 17 places in 241 ms of which 7 ms to minimize.
[2024-05-21 15:33:21] [INFO ] Deduced a trap composed of 11 places in 189 ms of which 4 ms to minimize.
[2024-05-21 15:33:21] [INFO ] Deduced a trap composed of 20 places in 163 ms of which 4 ms to minimize.
[2024-05-21 15:33:21] [INFO ] Deduced a trap composed of 18 places in 115 ms of which 2 ms to minimize.
[2024-05-21 15:33:21] [INFO ] Deduced a trap composed of 29 places in 125 ms of which 2 ms to minimize.
[2024-05-21 15:33:21] [INFO ] Deduced a trap composed of 20 places in 124 ms of which 2 ms to minimize.
[2024-05-21 15:33:21] [INFO ] Deduced a trap composed of 19 places in 119 ms of which 2 ms to minimize.
[2024-05-21 15:33:22] [INFO ] Deduced a trap composed of 42 places in 105 ms of which 2 ms to minimize.
[2024-05-21 15:33:22] [INFO ] Deduced a trap composed of 40 places in 122 ms of which 2 ms to minimize.
[2024-05-21 15:33:22] [INFO ] Deduced a trap composed of 110 places in 157 ms of which 4 ms to minimize.
[2024-05-21 15:33:22] [INFO ] Deduced a trap composed of 104 places in 159 ms of which 3 ms to minimize.
[2024-05-21 15:33:22] [INFO ] Deduced a trap composed of 99 places in 168 ms of which 3 ms to minimize.
[2024-05-21 15:33:22] [INFO ] Deduced a trap composed of 107 places in 167 ms of which 2 ms to minimize.
[2024-05-21 15:33:23] [INFO ] Deduced a trap composed of 111 places in 157 ms of which 3 ms to minimize.
[2024-05-21 15:33:23] [INFO ] Deduced a trap composed of 113 places in 139 ms of which 3 ms to minimize.
[2024-05-21 15:33:23] [INFO ] Deduced a trap composed of 116 places in 159 ms of which 3 ms to minimize.
[2024-05-21 15:33:23] [INFO ] Deduced a trap composed of 101 places in 158 ms of which 4 ms to minimize.
[2024-05-21 15:33:23] [INFO ] Deduced a trap composed of 108 places in 164 ms of which 4 ms to minimize.
[2024-05-21 15:33:23] [INFO ] Deduced a trap composed of 105 places in 135 ms of which 3 ms to minimize.
[2024-05-21 15:33:23] [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-05-21 15:33:24] [INFO ] [Real]Absence check using 53 positive place invariants in 22 ms returned sat
[2024-05-21 15:33:24] [INFO ] [Real]Absence check using 53 positive and 42 generalized place invariants in 13 ms returned sat
[2024-05-21 15:33:24] [INFO ] [Real]Absence check using state equation in 152 ms returned sat
[2024-05-21 15:33:24] [INFO ] Deduced a trap composed of 21 places in 160 ms of which 4 ms to minimize.
[2024-05-21 15:33:24] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 15:33:24] [INFO ] [Nat]Absence check using 53 positive place invariants in 19 ms returned sat
[2024-05-21 15:33:24] [INFO ] [Nat]Absence check using 53 positive and 42 generalized place invariants in 11 ms returned sat
[2024-05-21 15:33:24] [INFO ] [Nat]Absence check using state equation in 170 ms returned sat
[2024-05-21 15:33:24] [INFO ] Deduced a trap composed of 21 places in 153 ms of which 4 ms to minimize.
[2024-05-21 15:33:25] [INFO ] Deduced a trap composed of 22 places in 122 ms of which 2 ms to minimize.
[2024-05-21 15:33:25] [INFO ] Deduced a trap composed of 18 places in 125 ms of which 3 ms to minimize.
[2024-05-21 15:33:25] [INFO ] Deduced a trap composed of 15 places in 143 ms of which 4 ms to minimize.
[2024-05-21 15:33:25] [INFO ] Deduced a trap composed of 106 places in 140 ms of which 3 ms to minimize.
[2024-05-21 15:33:25] [INFO ] Deduced a trap composed of 41 places in 86 ms of which 2 ms to minimize.
[2024-05-21 15:33:25] [INFO ] Deduced a trap composed of 37 places in 81 ms of which 1 ms to minimize.
[2024-05-21 15:33:25] [INFO ] Deduced a trap composed of 17 places in 79 ms of which 2 ms to minimize.
[2024-05-21 15:33:25] [INFO ] Deduced a trap composed of 27 places in 83 ms of which 2 ms to minimize.
[2024-05-21 15:33:26] [INFO ] Deduced a trap composed of 25 places in 81 ms of which 2 ms to minimize.
[2024-05-21 15:33:26] [INFO ] Deduced a trap composed of 28 places in 84 ms of which 1 ms to minimize.
[2024-05-21 15:33:26] [INFO ] Deduced a trap composed of 20 places in 76 ms of which 2 ms to minimize.
[2024-05-21 15:33:26] [INFO ] Deduced a trap composed of 25 places in 79 ms of which 1 ms to minimize.
[2024-05-21 15:33:26] [INFO ] Deduced a trap composed of 25 places in 70 ms of which 2 ms to minimize.
[2024-05-21 15:33:26] [INFO ] Deduced a trap composed of 29 places in 163 ms of which 4 ms to minimize.
[2024-05-21 15:33:26] [INFO ] Deduced a trap composed of 19 places in 151 ms of which 3 ms to minimize.
[2024-05-21 15:33:26] [INFO ] Deduced a trap composed of 37 places in 149 ms of which 3 ms to minimize.
[2024-05-21 15:33:27] [INFO ] Deduced a trap composed of 22 places in 121 ms of which 2 ms to minimize.
[2024-05-21 15:33:27] [INFO ] Deduced a trap composed of 36 places in 124 ms of which 3 ms to minimize.
[2024-05-21 15:33:27] [INFO ] Deduced a trap composed of 29 places in 159 ms of which 4 ms to minimize.
[2024-05-21 15:33:27] [INFO ] Deduced a trap composed of 102 places in 144 ms of which 3 ms to minimize.
[2024-05-21 15:33:27] [INFO ] Deduced a trap composed of 33 places in 140 ms of which 3 ms to minimize.
[2024-05-21 15:33:27] [INFO ] Deduced a trap composed of 35 places in 140 ms of which 3 ms to minimize.
[2024-05-21 15:33:28] [INFO ] Deduced a trap composed of 23 places in 191 ms of which 3 ms to minimize.
[2024-05-21 15:33:28] [INFO ] Deduced a trap composed of 102 places in 150 ms of which 3 ms to minimize.
[2024-05-21 15:33:28] [INFO ] Deduced a trap composed of 26 places in 130 ms of which 3 ms to minimize.
[2024-05-21 15:33:28] [INFO ] Deduced a trap composed of 31 places in 179 ms of which 3 ms to minimize.
[2024-05-21 15:33:28] [INFO ] Deduced a trap composed of 17 places in 160 ms of which 3 ms to minimize.
[2024-05-21 15:33:29] [INFO ] Deduced a trap composed of 28 places in 156 ms of which 4 ms to minimize.
[2024-05-21 15:33:29] [INFO ] Deduced a trap composed of 25 places in 134 ms of which 3 ms to minimize.
[2024-05-21 15:33:29] [INFO ] Deduced a trap composed of 24 places in 127 ms of which 2 ms to minimize.
[2024-05-21 15:33:29] [INFO ] Deduced a trap composed of 102 places in 123 ms of which 3 ms to minimize.
[2024-05-21 15:33:29] [INFO ] Deduced a trap composed of 27 places in 119 ms of which 2 ms to minimize.
[2024-05-21 15:33:29] [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-05-21 15:33:29] [INFO ] [Real]Absence check using 53 positive place invariants in 22 ms returned sat
[2024-05-21 15:33:29] [INFO ] [Real]Absence check using 53 positive and 42 generalized place invariants in 24 ms returned sat
[2024-05-21 15:33:29] [INFO ] [Real]Absence check using state equation in 195 ms returned sat
[2024-05-21 15:33:30] [INFO ] Deduced a trap composed of 8 places in 198 ms of which 4 ms to minimize.
[2024-05-21 15:33:30] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 15:33:30] [INFO ] [Nat]Absence check using 53 positive place invariants in 23 ms returned sat
[2024-05-21 15:33:30] [INFO ] [Nat]Absence check using 53 positive and 42 generalized place invariants in 11 ms returned sat
[2024-05-21 15:33:30] [INFO ] [Nat]Absence check using state equation in 176 ms returned sat
[2024-05-21 15:33:30] [INFO ] Deduced a trap composed of 8 places in 188 ms of which 5 ms to minimize.
[2024-05-21 15:33:30] [INFO ] Deduced a trap composed of 24 places in 127 ms of which 3 ms to minimize.
[2024-05-21 15:33:31] [INFO ] Deduced a trap composed of 100 places in 198 ms of which 4 ms to minimize.
[2024-05-21 15:33:31] [INFO ] Deduced a trap composed of 11 places in 175 ms of which 4 ms to minimize.
[2024-05-21 15:33:31] [INFO ] Deduced a trap composed of 18 places in 179 ms of which 4 ms to minimize.
[2024-05-21 15:33:31] [INFO ] Deduced a trap composed of 38 places in 193 ms of which 4 ms to minimize.
[2024-05-21 15:33:31] [INFO ] Deduced a trap composed of 24 places in 191 ms of which 3 ms to minimize.
[2024-05-21 15:33:32] [INFO ] Deduced a trap composed of 34 places in 185 ms of which 3 ms to minimize.
[2024-05-21 15:33:32] [INFO ] Deduced a trap composed of 98 places in 196 ms of which 3 ms to minimize.
[2024-05-21 15:33:32] [INFO ] Deduced a trap composed of 31 places in 170 ms of which 4 ms to minimize.
[2024-05-21 15:33:32] [INFO ] Deduced a trap composed of 18 places in 164 ms of which 3 ms to minimize.
[2024-05-21 15:33:32] [INFO ] Deduced a trap composed of 23 places in 161 ms of which 3 ms to minimize.
[2024-05-21 15:33:33] [INFO ] Deduced a trap composed of 26 places in 192 ms of which 4 ms to minimize.
[2024-05-21 15:33:33] [INFO ] Deduced a trap composed of 28 places in 164 ms of which 4 ms to minimize.
[2024-05-21 15:33:33] [INFO ] Deduced a trap composed of 34 places in 163 ms of which 4 ms to minimize.
[2024-05-21 15:33:33] [INFO ] Deduced a trap composed of 23 places in 153 ms of which 4 ms to minimize.
[2024-05-21 15:33:33] [INFO ] Deduced a trap composed of 119 places in 178 ms of which 3 ms to minimize.
[2024-05-21 15:33:34] [INFO ] Deduced a trap composed of 115 places in 159 ms of which 3 ms to minimize.
[2024-05-21 15:33:34] [INFO ] Deduced a trap composed of 107 places in 167 ms of which 3 ms to minimize.
[2024-05-21 15:33:34] [INFO ] Deduced a trap composed of 105 places in 117 ms of which 2 ms to minimize.
[2024-05-21 15:33:34] [INFO ] Trap strengthening (SAT) tested/added 21/20 trap constraints in 3810 ms
[2024-05-21 15:33:34] [INFO ] Computed and/alt/rep : 471/791/471 causal constraints (skipped 29 transitions) in 51 ms.
Maximisation of solution failed !
Minimization took 1 ms.
[2024-05-21 15:33:35] [INFO ] [Real]Absence check using 53 positive place invariants in 21 ms returned sat
[2024-05-21 15:33:35] [INFO ] [Real]Absence check using 53 positive and 42 generalized place invariants in 13 ms returned sat
[2024-05-21 15:33:35] [INFO ] [Real]Absence check using state equation in 178 ms returned sat
[2024-05-21 15:33:35] [INFO ] Deduced a trap composed of 21 places in 289 ms of which 5 ms to minimize.
[2024-05-21 15:33:35] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 15:33:36] [INFO ] [Nat]Absence check using 53 positive place invariants in 34 ms returned sat
[2024-05-21 15:33:36] [INFO ] [Nat]Absence check using 53 positive and 42 generalized place invariants in 20 ms returned sat
[2024-05-21 15:33:36] [INFO ] [Nat]Absence check using state equation in 309 ms returned sat
[2024-05-21 15:33:36] [INFO ] Deduced a trap composed of 21 places in 198 ms of which 4 ms to minimize.
[2024-05-21 15:33:37] [INFO ] Deduced a trap composed of 15 places in 231 ms of which 3 ms to minimize.
[2024-05-21 15:33:37] [INFO ] Deduced a trap composed of 19 places in 177 ms of which 4 ms to minimize.
[2024-05-21 15:33:37] [INFO ] Deduced a trap composed of 105 places in 157 ms of which 3 ms to minimize.
[2024-05-21 15:33:37] [INFO ] Deduced a trap composed of 24 places in 113 ms of which 2 ms to minimize.
[2024-05-21 15:33:37] [INFO ] Deduced a trap composed of 21 places in 128 ms of which 2 ms to minimize.
[2024-05-21 15:33:37] [INFO ] Deduced a trap composed of 16 places in 94 ms of which 2 ms to minimize.
[2024-05-21 15:33:37] [INFO ] Deduced a trap composed of 25 places in 98 ms of which 3 ms to minimize.
[2024-05-21 15:33:38] [INFO ] Deduced a trap composed of 16 places in 102 ms of which 2 ms to minimize.
[2024-05-21 15:33:38] [INFO ] Deduced a trap composed of 25 places in 121 ms of which 2 ms to minimize.
[2024-05-21 15:33:38] [INFO ] Deduced a trap composed of 18 places in 83 ms of which 2 ms to minimize.
[2024-05-21 15:33:38] [INFO ] Deduced a trap composed of 27 places in 151 ms of which 2 ms to minimize.
[2024-05-21 15:33:38] [INFO ] Deduced a trap composed of 29 places in 110 ms of which 2 ms to minimize.
[2024-05-21 15:33:38] [INFO ] Deduced a trap composed of 101 places in 158 ms of which 3 ms to minimize.
[2024-05-21 15:33:38] [INFO ] Deduced a trap composed of 29 places in 125 ms of which 2 ms to minimize.
[2024-05-21 15:33:39] [INFO ] Deduced a trap composed of 18 places in 140 ms of which 2 ms to minimize.
[2024-05-21 15:33:39] [INFO ] Deduced a trap composed of 28 places in 150 ms of which 5 ms to minimize.
[2024-05-21 15:33:39] [INFO ] Deduced a trap composed of 19 places in 194 ms of which 3 ms to minimize.
[2024-05-21 15:33:39] [INFO ] Deduced a trap composed of 106 places in 186 ms of which 4 ms to minimize.
[2024-05-21 15:33:39] [INFO ] Deduced a trap composed of 96 places in 177 ms of which 3 ms to minimize.
[2024-05-21 15:33:40] [INFO ] Deduced a trap composed of 27 places in 189 ms of which 2 ms to minimize.
[2024-05-21 15:33:40] [INFO ] Deduced a trap composed of 25 places in 141 ms of which 2 ms to minimize.
[2024-05-21 15:33:40] [INFO ] Deduced a trap composed of 30 places in 89 ms of which 2 ms to minimize.
[2024-05-21 15:33:40] [INFO ] Deduced a trap composed of 34 places in 104 ms of which 2 ms to minimize.
[2024-05-21 15:33:40] [INFO ] Deduced a trap composed of 35 places in 98 ms of which 2 ms to minimize.
[2024-05-21 15:33:40] [INFO ] Deduced a trap composed of 24 places in 109 ms of which 2 ms to minimize.
[2024-05-21 15:33:40] [INFO ] Deduced a trap composed of 30 places in 129 ms of which 3 ms to minimize.
[2024-05-21 15:33:41] [INFO ] Deduced a trap composed of 44 places in 128 ms of which 1 ms to minimize.
[2024-05-21 15:33:41] [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: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-05-21 15:33:41] [INFO ] [Real]Absence check using 53 positive place invariants in 19 ms returned sat
[2024-05-21 15:33:41] [INFO ] [Real]Absence check using 53 positive and 42 generalized place invariants in 12 ms returned sat
[2024-05-21 15:33:41] [INFO ] [Real]Absence check using state equation in 230 ms returned sat
[2024-05-21 15:33:41] [INFO ] Deduced a trap composed of 18 places in 204 ms of which 4 ms to minimize.
[2024-05-21 15:33:41] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 15:33:41] [INFO ] [Nat]Absence check using 53 positive place invariants in 19 ms returned sat
[2024-05-21 15:33:41] [INFO ] [Nat]Absence check using 53 positive and 42 generalized place invariants in 11 ms returned sat
[2024-05-21 15:33:42] [INFO ] [Nat]Absence check using state equation in 198 ms returned sat
[2024-05-21 15:33:42] [INFO ] Deduced a trap composed of 18 places in 213 ms of which 3 ms to minimize.
[2024-05-21 15:33:42] [INFO ] Deduced a trap composed of 21 places in 260 ms of which 3 ms to minimize.
[2024-05-21 15:33:42] [INFO ] Deduced a trap composed of 11 places in 194 ms of which 3 ms to minimize.
[2024-05-21 15:33:42] [INFO ] Deduced a trap composed of 113 places in 152 ms of which 3 ms to minimize.
[2024-05-21 15:33:43] [INFO ] Deduced a trap composed of 23 places in 160 ms of which 3 ms to minimize.
[2024-05-21 15:33:43] [INFO ] Deduced a trap composed of 107 places in 224 ms of which 3 ms to minimize.
[2024-05-21 15:33:43] [INFO ] Deduced a trap composed of 28 places in 229 ms of which 3 ms to minimize.
[2024-05-21 15:33:43] [INFO ] Deduced a trap composed of 31 places in 229 ms of which 3 ms to minimize.
[2024-05-21 15:33:44] [INFO ] Deduced a trap composed of 19 places in 208 ms of which 3 ms to minimize.
[2024-05-21 15:33:44] [INFO ] Deduced a trap composed of 37 places in 172 ms of which 5 ms to minimize.
[2024-05-21 15:33:44] [INFO ] Deduced a trap composed of 32 places in 179 ms of which 5 ms to minimize.
[2024-05-21 15:33:44] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 2512 ms
[2024-05-21 15:33:44] [INFO ] Computed and/alt/rep : 471/791/471 causal constraints (skipped 29 transitions) in 62 ms.
[2024-05-21 15:33:45] [INFO ] Added : 160 causal constraints over 32 iterations in 1155 ms. Result :sat
Minimization took 637 ms.
[2024-05-21 15:33:46] [INFO ] [Real]Absence check using 53 positive place invariants in 29 ms returned sat
[2024-05-21 15:33:46] [INFO ] [Real]Absence check using 53 positive and 42 generalized place invariants in 20 ms returned sat
[2024-05-21 15:33:47] [INFO ] [Real]Absence check using state equation in 589 ms returned sat
[2024-05-21 15:33:47] [INFO ] Deduced a trap composed of 26 places in 122 ms of which 3 ms to minimize.
[2024-05-21 15:33:47] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 15:33:47] [INFO ] [Nat]Absence check using 53 positive place invariants in 18 ms returned sat
[2024-05-21 15:33:47] [INFO ] [Nat]Absence check using 53 positive and 42 generalized place invariants in 10 ms returned sat
[2024-05-21 15:33:47] [INFO ] [Nat]Absence check using state equation in 173 ms returned sat
[2024-05-21 15:33:47] [INFO ] Deduced a trap composed of 26 places in 120 ms of which 3 ms to minimize.
[2024-05-21 15:33:48] [INFO ] Deduced a trap composed of 28 places in 95 ms of which 2 ms to minimize.
[2024-05-21 15:33:48] [INFO ] Deduced a trap composed of 11 places in 99 ms of which 3 ms to minimize.
[2024-05-21 15:33:48] [INFO ] Deduced a trap composed of 32 places in 92 ms of which 2 ms to minimize.
[2024-05-21 15:33:48] [INFO ] Deduced a trap composed of 26 places in 84 ms of which 2 ms to minimize.
[2024-05-21 15:33:48] [INFO ] Deduced a trap composed of 25 places in 105 ms of which 2 ms to minimize.
[2024-05-21 15:33:48] [INFO ] Deduced a trap composed of 30 places in 86 ms of which 2 ms to minimize.
[2024-05-21 15:33:48] [INFO ] Deduced a trap composed of 40 places in 94 ms of which 2 ms to minimize.
[2024-05-21 15:33:48] [INFO ] Deduced a trap composed of 33 places in 92 ms of which 2 ms to minimize.
[2024-05-21 15:33:48] [INFO ] Deduced a trap composed of 20 places in 105 ms of which 2 ms to minimize.
[2024-05-21 15:33:49] [INFO ] Deduced a trap composed of 25 places in 99 ms of which 2 ms to minimize.
[2024-05-21 15:33:49] [INFO ] Deduced a trap composed of 35 places in 97 ms of which 2 ms to minimize.
[2024-05-21 15:33:49] [INFO ] Deduced a trap composed of 29 places in 88 ms of which 2 ms to minimize.
[2024-05-21 15:33:49] [INFO ] Deduced a trap composed of 34 places in 97 ms of which 3 ms to minimize.
[2024-05-21 15:33:49] [INFO ] Deduced a trap composed of 37 places in 98 ms of which 2 ms to minimize.
[2024-05-21 15:33:49] [INFO ] Deduced a trap composed of 38 places in 99 ms of which 3 ms to minimize.
[2024-05-21 15:33:49] [INFO ] Trap strengthening (SAT) tested/added 17/16 trap constraints in 1926 ms
[2024-05-21 15:33:49] [INFO ] Computed and/alt/rep : 471/791/471 causal constraints (skipped 29 transitions) in 42 ms.
[2024-05-21 15:33:51] [INFO ] Added : 231 causal constraints over 47 iterations in 1780 ms. Result :sat
Minimization took 642 ms.
[2024-05-21 15:33:52] [INFO ] [Real]Absence check using 53 positive place invariants in 22 ms returned sat
[2024-05-21 15:33:52] [INFO ] [Real]Absence check using 53 positive and 42 generalized place invariants in 13 ms returned sat
[2024-05-21 15:33:52] [INFO ] [Real]Absence check using state equation in 213 ms returned sat
[2024-05-21 15:33:52] [INFO ] Deduced a trap composed of 23 places in 187 ms of which 3 ms to minimize.
[2024-05-21 15:33:52] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 15:33:52] [INFO ] [Nat]Absence check using 53 positive place invariants in 24 ms returned sat
[2024-05-21 15:33:52] [INFO ] [Nat]Absence check using 53 positive and 42 generalized place invariants in 14 ms returned sat
[2024-05-21 15:33:53] [INFO ] [Nat]Absence check using state equation in 207 ms returned sat
[2024-05-21 15:33:53] [INFO ] Deduced a trap composed of 23 places in 204 ms of which 3 ms to minimize.
[2024-05-21 15:33:53] [INFO ] Deduced a trap composed of 105 places in 192 ms of which 4 ms to minimize.
[2024-05-21 15:33:53] [INFO ] Deduced a trap composed of 22 places in 195 ms of which 4 ms to minimize.
[2024-05-21 15:33:54] [INFO ] Deduced a trap composed of 19 places in 197 ms of which 3 ms to minimize.
[2024-05-21 15:33:54] [INFO ] Deduced a trap composed of 31 places in 190 ms of which 3 ms to minimize.
[2024-05-21 15:33:54] [INFO ] Deduced a trap composed of 33 places in 174 ms of which 3 ms to minimize.
[2024-05-21 15:33:54] [INFO ] Deduced a trap composed of 25 places in 174 ms of which 4 ms to minimize.
[2024-05-21 15:33:54] [INFO ] Deduced a trap composed of 17 places in 173 ms of which 4 ms to minimize.
[2024-05-21 15:33:55] [INFO ] Deduced a trap composed of 28 places in 165 ms of which 3 ms to minimize.
[2024-05-21 15:33:55] [INFO ] Deduced a trap composed of 8 places in 180 ms of which 4 ms to minimize.
[2024-05-21 15:33:55] [INFO ] Deduced a trap composed of 26 places in 178 ms of which 3 ms to minimize.
[2024-05-21 15:33:55] [INFO ] Deduced a trap composed of 118 places in 175 ms of which 3 ms to minimize.
[2024-05-21 15:33:55] [INFO ] Deduced a trap composed of 17 places in 185 ms of which 3 ms to minimize.
[2024-05-21 15:33:56] [INFO ] Deduced a trap composed of 27 places in 171 ms of which 3 ms to minimize.
[2024-05-21 15:33:56] [INFO ] Deduced a trap composed of 18 places in 174 ms of which 4 ms to minimize.
[2024-05-21 15:33:56] [INFO ] Deduced a trap composed of 39 places in 172 ms of which 3 ms to minimize.
[2024-05-21 15:33:56] [INFO ] Deduced a trap composed of 24 places in 174 ms of which 3 ms to minimize.
[2024-05-21 15:33:56] [INFO ] Deduced a trap composed of 34 places in 149 ms of which 3 ms to minimize.
[2024-05-21 15:33:56] [INFO ] Deduced a trap composed of 122 places in 171 ms of which 4 ms to minimize.
[2024-05-21 15:33:57] [INFO ] Deduced a trap composed of 35 places in 152 ms of which 3 ms to minimize.
[2024-05-21 15:33:57] [INFO ] Deduced a trap composed of 27 places in 178 ms of which 3 ms to minimize.
[2024-05-21 15:33:57] [INFO ] Deduced a trap composed of 25 places in 147 ms of which 3 ms to minimize.
[2024-05-21 15:33:57] [INFO ] Deduced a trap composed of 23 places in 108 ms of which 2 ms to minimize.
[2024-05-21 15:33:57] [INFO ] Deduced a trap composed of 25 places in 104 ms of which 2 ms to minimize.
[2024-05-21 15:33:57] [INFO ] Deduced a trap composed of 30 places in 112 ms of which 2 ms to minimize.
[2024-05-21 15:33: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 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 560 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 560/560 places, 501/501 transitions.
Graph (trivial) has 305 edges and 560 vertex of which 7 / 560 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 1132 edges and 554 vertex of which 549 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.2 ms
Discarding 5 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 116 transitions
Trivial Post-agglo rules discarded 116 transitions
Performed 116 trivial Post agglomeration. Transition count delta: 116
Iterating post reduction 0 with 116 rules applied. Total rules applied 118 place count 549 transition count 376
Reduce places removed 116 places and 0 transitions.
Iterating post reduction 1 with 116 rules applied. Total rules applied 234 place count 433 transition count 376
Performed 90 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 90 Pre rules applied. Total rules applied 234 place count 433 transition count 286
Deduced a syphon composed of 90 places in 3 ms
Ensure Unique test removed 16 places
Reduce places removed 106 places and 0 transitions.
Iterating global reduction 2 with 196 rules applied. Total rules applied 430 place count 327 transition count 286
Discarding 65 places :
Symmetric choice reduction at 2 with 65 rule applications. Total rules 495 place count 262 transition count 221
Iterating global reduction 2 with 65 rules applied. Total rules applied 560 place count 262 transition count 221
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 560 place count 262 transition count 218
Deduced a syphon composed of 3 places in 3 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 566 place count 259 transition count 218
Performed 86 Post agglomeration using F-continuation condition.Transition count delta: 86
Deduced a syphon composed of 86 places in 1 ms
Ensure Unique test removed 3 places
Reduce places removed 89 places and 0 transitions.
Iterating global reduction 2 with 175 rules applied. Total rules applied 741 place count 170 transition count 132
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 743 place count 169 transition count 136
Free-agglomeration rule applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 745 place count 169 transition count 134
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 747 place count 167 transition count 134
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 748 place count 167 transition count 134
Applied a total of 748 rules in 146 ms. Remains 167 /560 variables (removed 393) and now considering 134/501 (removed 367) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 158 ms. Remains : 167/560 places, 134/501 transitions.
// Phase 1: matrix 134 rows 167 cols
[2024-05-21 15:33:58] [INFO ] Computed 72 invariants in 7 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 (52014 resets) in 2930 ms. (341 steps per ms)
FORMULA BusinessProcesses-PT-11-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-11-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-11-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-11-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-11-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-11-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-11-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 1000001 steps (25218 resets) in 1736 ms. (575 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-05-21 15:34:02] [INFO ] Invariant cache hit.
[2024-05-21 15:34:02] [INFO ] [Real]Absence check using 49 positive place invariants in 8 ms returned sat
[2024-05-21 15:34:02] [INFO ] [Real]Absence check using 49 positive and 23 generalized place invariants in 4 ms returned sat
[2024-05-21 15:34:02] [INFO ] [Real]Absence check using state equation in 39 ms returned sat
[2024-05-21 15:34:02] [INFO ] State equation strengthened by 13 read => feed constraints.
[2024-05-21 15:34:02] [INFO ] [Real]Added 13 Read/Feed constraints in 6 ms returned sat
[2024-05-21 15:34:02] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 15:34:02] [INFO ] [Nat]Absence check using 49 positive place invariants in 12 ms returned sat
[2024-05-21 15:34:02] [INFO ] [Nat]Absence check using 49 positive and 23 generalized place invariants in 7 ms returned sat
[2024-05-21 15:34:03] [INFO ] [Nat]Absence check using state equation in 68 ms returned sat
[2024-05-21 15:34:03] [INFO ] [Nat]Added 13 Read/Feed constraints in 4 ms returned sat
[2024-05-21 15:34:03] [INFO ] Deduced a trap composed of 10 places in 37 ms of which 1 ms to minimize.
[2024-05-21 15:34:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 56 ms
[2024-05-21 15:34:03] [INFO ] Computed and/alt/rep : 88/410/88 causal constraints (skipped 44 transitions) in 18 ms.
[2024-05-21 15:34:03] [INFO ] Added : 23 causal constraints over 5 iterations in 105 ms. Result :sat
Minimization took 178 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[1]
Support contains 1 out of 167 places. Attempting structural reductions.
Drop transitions (Removing consumers from one bounded place p40) removed 2 transitions
Starting structural reductions in REACHABILITY mode, iteration 0 : 167/167 places, 132/132 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 167 transition count 129
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 164 transition count 129
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 6 place count 164 transition count 127
Deduced a syphon composed of 2 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 12 place count 160 transition count 127
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 20 place count 156 transition count 123
Applied a total of 20 rules in 30 ms. Remains 156 /167 variables (removed 11) and now considering 123/132 (removed 9) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 30 ms. Remains : 156/167 places, 123/132 transitions.
// Phase 1: matrix 123 rows 156 cols
[2024-05-21 15:34:03] [INFO ] Computed 70 invariants in 4 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[1]
FORMULA BusinessProcesses-PT-11-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 1000000 steps (56741 resets) in 2789 ms. (358 steps per ms)
BEST_FIRST walk for 0 steps (0 resets) in 0 ms. (0 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 54604 ms.
ITS solved all properties within timeout

BK_STOP 1716305646379

--------------------
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-11"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="greatspnxred"
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 greatspnxred"
echo " Input is BusinessProcesses-PT-11, 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 r047-tajo-171620398400533"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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