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-171620399900605.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-20, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r472-tajo-171620399900605
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 620K
-rw-r--r-- 1 mcc users 7.5K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 82K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.5K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 36K 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 May 19 07:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 19 15:31 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 19 07:13 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 19 17:56 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.6K Apr 11 16:29 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 99K Apr 11 16:29 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.3K Apr 11 16:29 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 81K Apr 11 16:29 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 192K 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-20-UpperBounds-00
FORMULA_NAME BusinessProcesses-PT-20-UpperBounds-01
FORMULA_NAME BusinessProcesses-PT-20-UpperBounds-02
FORMULA_NAME BusinessProcesses-PT-20-UpperBounds-03
FORMULA_NAME BusinessProcesses-PT-20-UpperBounds-04
FORMULA_NAME BusinessProcesses-PT-20-UpperBounds-05
FORMULA_NAME BusinessProcesses-PT-20-UpperBounds-06
FORMULA_NAME BusinessProcesses-PT-20-UpperBounds-07
FORMULA_NAME BusinessProcesses-PT-20-UpperBounds-08
FORMULA_NAME BusinessProcesses-PT-20-UpperBounds-09
FORMULA_NAME BusinessProcesses-PT-20-UpperBounds-10
FORMULA_NAME BusinessProcesses-PT-20-UpperBounds-11
FORMULA_NAME BusinessProcesses-PT-20-UpperBounds-12
FORMULA_NAME BusinessProcesses-PT-20-UpperBounds-13
FORMULA_NAME BusinessProcesses-PT-20-UpperBounds-14
FORMULA_NAME BusinessProcesses-PT-20-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1717226210588

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-20
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 07:16:52] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2024-06-01 07:16:52] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 07:16:52] [INFO ] Load time of PNML (sax parser for PT used): 102 ms
[2024-06-01 07:16:52] [INFO ] Transformed 782 places.
[2024-06-01 07:16:52] [INFO ] Transformed 697 transitions.
[2024-06-01 07:16:52] [INFO ] Found NUPN structural information;
[2024-06-01 07:16:52] [INFO ] Parsed PT model containing 782 places and 697 transitions and 2011 arcs in 242 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 11 ms.
Deduced a syphon composed of 63 places in 12 ms
Reduce places removed 63 places and 59 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 638 rows 719 cols
[2024-06-01 07:16:52] [INFO ] Computed 121 invariants in 64 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 (50 resets) in 73 ms. (135 steps per ms)
FORMULA BusinessProcesses-PT-20-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-20-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-20-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-20-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-20-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-20-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-20-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-20-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 80007 steps (71 resets) in 152 ms. (522 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:16:52] [INFO ] Invariant cache hit.
[2024-06-01 07:16:53] [INFO ] [Real]Absence check using 78 positive place invariants in 40 ms returned sat
[2024-06-01 07:16:53] [INFO ] [Real]Absence check using 78 positive and 43 generalized place invariants in 33 ms returned sat
[2024-06-01 07:16:53] [INFO ] [Real]Absence check using state equation in 401 ms returned sat
[2024-06-01 07:16:54] [INFO ] Deduced a trap composed of 18 places in 472 ms of which 58 ms to minimize.
[2024-06-01 07:16:54] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 07:16:54] [INFO ] [Nat]Absence check using 78 positive place invariants in 72 ms returned sat
[2024-06-01 07:16:54] [INFO ] [Nat]Absence check using 78 positive and 43 generalized place invariants in 24 ms returned sat
[2024-06-01 07:16:55] [INFO ] [Nat]Absence check using state equation in 348 ms returned sat
[2024-06-01 07:16:55] [INFO ] Deduced a trap composed of 18 places in 302 ms of which 25 ms to minimize.
[2024-06-01 07:16:55] [INFO ] Deduced a trap composed of 42 places in 312 ms of which 5 ms to minimize.
[2024-06-01 07:16:56] [INFO ] Deduced a trap composed of 155 places in 338 ms of which 4 ms to minimize.
[2024-06-01 07:16:56] [INFO ] Deduced a trap composed of 45 places in 267 ms of which 4 ms to minimize.
[2024-06-01 07:16:56] [INFO ] Deduced a trap composed of 22 places in 220 ms of which 4 ms to minimize.
[2024-06-01 07:16:57] [INFO ] Deduced a trap composed of 162 places in 186 ms of which 4 ms to minimize.
[2024-06-01 07:16:57] [INFO ] Deduced a trap composed of 168 places in 227 ms of which 4 ms to minimize.
[2024-06-01 07:16:57] [INFO ] Deduced a trap composed of 170 places in 318 ms of which 5 ms to minimize.
[2024-06-01 07:16:57] [INFO ] Deduced a trap composed of 25 places in 192 ms of which 3 ms to minimize.
[2024-06-01 07:16:58] [INFO ] Deduced a trap composed of 150 places in 225 ms of which 5 ms to minimize.
[2024-06-01 07:16:58] [INFO ] Deduced a trap composed of 163 places in 192 ms of which 4 ms to minimize.
[2024-06-01 07:16:58] [INFO ] Deduced a trap composed of 26 places in 196 ms of which 4 ms to minimize.
[2024-06-01 07:16:58] [INFO ] Deduced a trap composed of 40 places in 172 ms of which 3 ms to minimize.
[2024-06-01 07:16:58] [INFO ] Deduced a trap composed of 165 places in 164 ms of which 3 ms to minimize.
[2024-06-01 07:16:59] [INFO ] Deduced a trap composed of 154 places in 175 ms of which 4 ms to minimize.
[2024-06-01 07:16:59] [INFO ] Deduced a trap composed of 45 places in 153 ms of which 4 ms to minimize.
[2024-06-01 07:16:59] [INFO ] Deduced a trap composed of 19 places in 178 ms of which 3 ms to minimize.
[2024-06-01 07:16:59] [INFO ] Trap strengthening (SAT) tested/added 17/17 trap constraints in 4269 ms
[2024-06-01 07:16:59] [INFO ] [Real]Absence check using 78 positive place invariants in 61 ms returned sat
[2024-06-01 07:16:59] [INFO ] [Real]Absence check using 78 positive and 43 generalized place invariants in 21 ms returned sat
[2024-06-01 07:17:00] [INFO ] [Real]Absence check using state equation in 271 ms returned sat
[2024-06-01 07:17:00] [INFO ] Deduced a trap composed of 8 places in 289 ms of which 3 ms to minimize.
[2024-06-01 07:17:00] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 07:17:00] [INFO ] [Nat]Absence check using 78 positive place invariants in 29 ms returned sat
[2024-06-01 07:17:00] [INFO ] [Nat]Absence check using 78 positive and 43 generalized place invariants in 12 ms returned sat
[2024-06-01 07:17:00] [INFO ] [Nat]Absence check using state equation in 190 ms returned sat
[2024-06-01 07:17:00] [INFO ] Deduced a trap composed of 8 places in 144 ms of which 3 ms to minimize.
[2024-06-01 07:17:01] [INFO ] Deduced a trap composed of 22 places in 114 ms of which 3 ms to minimize.
[2024-06-01 07:17:01] [INFO ] Deduced a trap composed of 18 places in 133 ms of which 2 ms to minimize.
[2024-06-01 07:17:01] [INFO ] Deduced a trap composed of 28 places in 161 ms of which 3 ms to minimize.
[2024-06-01 07:17:01] [INFO ] Deduced a trap composed of 27 places in 121 ms of which 3 ms to minimize.
[2024-06-01 07:17:01] [INFO ] Deduced a trap composed of 14 places in 103 ms of which 2 ms to minimize.
[2024-06-01 07:17:01] [INFO ] Deduced a trap composed of 21 places in 147 ms of which 4 ms to minimize.
[2024-06-01 07:17:02] [INFO ] Deduced a trap composed of 41 places in 166 ms of which 4 ms to minimize.
[2024-06-01 07:17:02] [INFO ] Deduced a trap composed of 49 places in 93 ms of which 2 ms to minimize.
[2024-06-01 07:17:02] [INFO ] Deduced a trap composed of 22 places in 81 ms of which 3 ms to minimize.
[2024-06-01 07:17:02] [INFO ] Deduced a trap composed of 20 places in 78 ms of which 2 ms to minimize.
[2024-06-01 07:17:02] [INFO ] Deduced a trap composed of 29 places in 65 ms of which 1 ms to minimize.
[2024-06-01 07:17:02] [INFO ] Deduced a trap composed of 36 places in 78 ms of which 2 ms to minimize.
[2024-06-01 07:17:02] [INFO ] Deduced a trap composed of 39 places in 75 ms of which 2 ms to minimize.
[2024-06-01 07:17:02] [INFO ] Deduced a trap composed of 35 places in 102 ms of which 2 ms to minimize.
[2024-06-01 07:17:02] [INFO ] Deduced a trap composed of 39 places in 81 ms of which 2 ms to minimize.
[2024-06-01 07:17:02] [INFO ] Trap strengthening (SAT) tested/added 17/16 trap constraints in 2158 ms
[2024-06-01 07:17:03] [INFO ] Computed and/alt/rep : 600/951/600 causal constraints (skipped 37 transitions) in 53 ms.
[2024-06-01 07:17:05] [INFO ] Added : 305 causal constraints over 61 iterations in 2439 ms. Result :unknown
[2024-06-01 07:17:05] [INFO ] [Real]Absence check using 78 positive place invariants in 32 ms returned sat
[2024-06-01 07:17:05] [INFO ] [Real]Absence check using 78 positive and 43 generalized place invariants in 13 ms returned sat
[2024-06-01 07:17:05] [INFO ] [Real]Absence check using state equation in 270 ms returned sat
[2024-06-01 07:17:06] [INFO ] Deduced a trap composed of 8 places in 151 ms of which 3 ms to minimize.
[2024-06-01 07:17:06] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 07:17:06] [INFO ] [Nat]Absence check using 78 positive place invariants in 34 ms returned sat
[2024-06-01 07:17:06] [INFO ] [Nat]Absence check using 78 positive and 43 generalized place invariants in 11 ms returned sat
[2024-06-01 07:17:06] [INFO ] [Nat]Absence check using state equation in 197 ms returned sat
[2024-06-01 07:17:06] [INFO ] Deduced a trap composed of 8 places in 163 ms of which 2 ms to minimize.
[2024-06-01 07:17:06] [INFO ] Deduced a trap composed of 22 places in 128 ms of which 3 ms to minimize.
[2024-06-01 07:17:07] [INFO ] Deduced a trap composed of 14 places in 136 ms of which 3 ms to minimize.
[2024-06-01 07:17:07] [INFO ] Deduced a trap composed of 19 places in 125 ms of which 2 ms to minimize.
[2024-06-01 07:17:07] [INFO ] Deduced a trap composed of 20 places in 110 ms of which 2 ms to minimize.
[2024-06-01 07:17:07] [INFO ] Deduced a trap composed of 17 places in 133 ms of which 3 ms to minimize.
[2024-06-01 07:17:07] [INFO ] Deduced a trap composed of 18 places in 129 ms of which 3 ms to minimize.
[2024-06-01 07:17:07] [INFO ] Deduced a trap composed of 13 places in 156 ms of which 3 ms to minimize.
[2024-06-01 07:17:07] [INFO ] Deduced a trap composed of 50 places in 117 ms of which 2 ms to minimize.
[2024-06-01 07:17:08] [INFO ] Deduced a trap composed of 55 places in 127 ms of which 3 ms to minimize.
[2024-06-01 07:17:08] [INFO ] Deduced a trap composed of 48 places in 108 ms of which 3 ms to minimize.
[2024-06-01 07:17:08] [INFO ] Deduced a trap composed of 42 places in 149 ms of which 3 ms to minimize.
[2024-06-01 07:17:08] [INFO ] Deduced a trap composed of 20 places in 124 ms of which 3 ms to minimize.
[2024-06-01 07:17:08] [INFO ] Deduced a trap composed of 49 places in 131 ms of which 2 ms to minimize.
[2024-06-01 07:17:08] [INFO ] Deduced a trap composed of 41 places in 120 ms of which 3 ms to minimize.
[2024-06-01 07:17:08] [INFO ] Deduced a trap composed of 25 places in 108 ms of which 2 ms to minimize.
[2024-06-01 07:17:09] [INFO ] Deduced a trap composed of 49 places in 118 ms of which 2 ms to minimize.
[2024-06-01 07:17:09] [INFO ] Deduced a trap composed of 23 places in 110 ms of which 3 ms to minimize.
[2024-06-01 07:17:09] [INFO ] Deduced a trap composed of 43 places in 174 ms of which 2 ms to minimize.
[2024-06-01 07:17:09] [INFO ] Deduced a trap composed of 45 places in 160 ms of which 2 ms to minimize.
[2024-06-01 07:17:09] [INFO ] Deduced a trap composed of 19 places in 108 ms of which 6 ms to minimize.
[2024-06-01 07:17:09] [INFO ] Deduced a trap composed of 29 places in 115 ms of which 3 ms to minimize.
[2024-06-01 07:17:10] [INFO ] Deduced a trap composed of 30 places in 108 ms of which 2 ms to minimize.
[2024-06-01 07:17:10] [INFO ] Deduced a trap composed of 32 places in 108 ms of which 2 ms to minimize.
[2024-06-01 07:17:10] [INFO ] Deduced a trap composed of 27 places in 135 ms of which 3 ms to minimize.
[2024-06-01 07:17:10] [INFO ] Deduced a trap composed of 54 places in 101 ms of which 2 ms to minimize.
[2024-06-01 07:17:10] [INFO ] Deduced a trap composed of 61 places in 103 ms of which 2 ms to minimize.
[2024-06-01 07:17:10] [INFO ] Deduced a trap composed of 22 places in 86 ms of which 1 ms to minimize.
[2024-06-01 07:17:10] [INFO ] Deduced a trap composed of 26 places in 80 ms of which 2 ms to minimize.
[2024-06-01 07:17:10] [INFO ] Deduced a trap composed of 26 places in 71 ms of which 1 ms to minimize.
[2024-06-01 07:17:10] [INFO ] Deduced a trap composed of 33 places in 68 ms of which 2 ms to minimize.
[2024-06-01 07:17:11] [INFO ] Deduced a trap composed of 36 places in 66 ms of which 1 ms to minimize.
[2024-06-01 07:17:11] [INFO ] Deduced a trap composed of 38 places in 66 ms of which 1 ms to minimize.
[2024-06-01 07:17: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 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:17:11] [INFO ] [Real]Absence check using 78 positive place invariants in 32 ms returned sat
[2024-06-01 07:17:11] [INFO ] [Real]Absence check using 78 positive and 43 generalized place invariants in 14 ms returned sat
[2024-06-01 07:17:11] [INFO ] [Real]Absence check using state equation in 206 ms returned sat
[2024-06-01 07:17:11] [INFO ] Deduced a trap composed of 20 places in 115 ms of which 3 ms to minimize.
[2024-06-01 07:17:11] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 07:17:11] [INFO ] [Nat]Absence check using 78 positive place invariants in 26 ms returned sat
[2024-06-01 07:17:11] [INFO ] [Nat]Absence check using 78 positive and 43 generalized place invariants in 10 ms returned sat
[2024-06-01 07:17:12] [INFO ] [Nat]Absence check using state equation in 224 ms returned sat
[2024-06-01 07:17:12] [INFO ] Deduced a trap composed of 20 places in 121 ms of which 3 ms to minimize.
[2024-06-01 07:17:12] [INFO ] Deduced a trap composed of 8 places in 124 ms of which 3 ms to minimize.
[2024-06-01 07:17:12] [INFO ] Deduced a trap composed of 17 places in 130 ms of which 3 ms to minimize.
[2024-06-01 07:17:12] [INFO ] Deduced a trap composed of 31 places in 112 ms of which 2 ms to minimize.
[2024-06-01 07:17:12] [INFO ] Deduced a trap composed of 44 places in 111 ms of which 2 ms to minimize.
[2024-06-01 07:17:12] [INFO ] Deduced a trap composed of 38 places in 111 ms of which 2 ms to minimize.
[2024-06-01 07:17:13] [INFO ] Deduced a trap composed of 51 places in 108 ms of which 3 ms to minimize.
[2024-06-01 07:17:13] [INFO ] Deduced a trap composed of 61 places in 123 ms of which 3 ms to minimize.
[2024-06-01 07:17:13] [INFO ] Deduced a trap composed of 49 places in 87 ms of which 2 ms to minimize.
[2024-06-01 07:17:13] [INFO ] Deduced a trap composed of 33 places in 63 ms of which 2 ms to minimize.
[2024-06-01 07:17:13] [INFO ] Deduced a trap composed of 23 places in 105 ms of which 2 ms to minimize.
[2024-06-01 07:17:13] [INFO ] Deduced a trap composed of 20 places in 61 ms of which 2 ms to minimize.
[2024-06-01 07:17:13] [INFO ] Deduced a trap composed of 40 places in 69 ms of which 2 ms to minimize.
[2024-06-01 07:17:13] [INFO ] Deduced a trap composed of 39 places in 62 ms of which 1 ms to minimize.
[2024-06-01 07:17:13] [INFO ] Deduced a trap composed of 29 places in 61 ms of which 2 ms to minimize.
[2024-06-01 07:17:13] [INFO ] Deduced a trap composed of 35 places in 63 ms of which 1 ms to minimize.
[2024-06-01 07:17:13] [INFO ] Deduced a trap composed of 25 places in 59 ms of which 2 ms to minimize.
[2024-06-01 07:17:14] [INFO ] Deduced a trap composed of 156 places in 167 ms of which 4 ms to minimize.
[2024-06-01 07:17:14] [INFO ] Deduced a trap composed of 33 places in 195 ms of which 4 ms to minimize.
[2024-06-01 07:17:14] [INFO ] Deduced a trap composed of 29 places in 222 ms of which 4 ms to minimize.
[2024-06-01 07:17:14] [INFO ] Deduced a trap composed of 30 places in 170 ms of which 3 ms to minimize.
[2024-06-01 07:17:15] [INFO ] Deduced a trap composed of 28 places in 179 ms of which 3 ms to minimize.
[2024-06-01 07:17:15] [INFO ] Deduced a trap composed of 156 places in 162 ms of which 3 ms to minimize.
[2024-06-01 07:17:15] [INFO ] Deduced a trap composed of 153 places in 166 ms of which 3 ms to minimize.
[2024-06-01 07:17:15] [INFO ] Deduced a trap composed of 42 places in 72 ms of which 2 ms to minimize.
[2024-06-01 07:17:15] [INFO ] Deduced a trap composed of 39 places in 179 ms of which 4 ms to minimize.
[2024-06-01 07:17:15] [INFO ] Deduced a trap composed of 170 places in 150 ms of which 3 ms to minimize.
[2024-06-01 07:17:16] [INFO ] Deduced a trap composed of 173 places in 173 ms of which 3 ms to minimize.
[2024-06-01 07:17:16] [INFO ] Deduced a trap composed of 31 places in 170 ms of which 4 ms to minimize.
[2024-06-01 07:17:16] [INFO ] Deduced a trap composed of 161 places in 146 ms of which 3 ms to minimize.
[2024-06-01 07:17:16] [INFO ] Deduced a trap composed of 31 places in 158 ms of which 3 ms to minimize.
[2024-06-01 07:17:16] [INFO ] Deduced a trap composed of 50 places in 63 ms of which 1 ms to minimize.
[2024-06-01 07:17:16] [INFO ] Deduced a trap composed of 11 places in 226 ms of which 5 ms to minimize.
[2024-06-01 07:17:16] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 3
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java: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:17:17] [INFO ] [Real]Absence check using 78 positive place invariants in 30 ms returned sat
[2024-06-01 07:17:17] [INFO ] [Real]Absence check using 78 positive and 43 generalized place invariants in 13 ms returned sat
[2024-06-01 07:17:17] [INFO ] [Real]Absence check using state equation in 211 ms returned sat
[2024-06-01 07:17:17] [INFO ] Deduced a trap composed of 151 places in 180 ms of which 3 ms to minimize.
[2024-06-01 07:17:17] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 07:17:17] [INFO ] [Nat]Absence check using 78 positive place invariants in 24 ms returned sat
[2024-06-01 07:17:17] [INFO ] [Nat]Absence check using 78 positive and 43 generalized place invariants in 9 ms returned sat
[2024-06-01 07:17:17] [INFO ] [Nat]Absence check using state equation in 164 ms returned sat
[2024-06-01 07:17:18] [INFO ] Deduced a trap composed of 151 places in 188 ms of which 3 ms to minimize.
[2024-06-01 07:17:18] [INFO ] Deduced a trap composed of 159 places in 179 ms of which 3 ms to minimize.
[2024-06-01 07:17:18] [INFO ] Deduced a trap composed of 11 places in 172 ms of which 4 ms to minimize.
[2024-06-01 07:17:18] [INFO ] Deduced a trap composed of 8 places in 177 ms of which 3 ms to minimize.
[2024-06-01 07:17:18] [INFO ] Deduced a trap composed of 18 places in 174 ms of which 4 ms to minimize.
[2024-06-01 07:17:19] [INFO ] Deduced a trap composed of 13 places in 173 ms of which 4 ms to minimize.
[2024-06-01 07:17:19] [INFO ] Deduced a trap composed of 22 places in 247 ms of which 4 ms to minimize.
[2024-06-01 07:17:19] [INFO ] Deduced a trap composed of 20 places in 197 ms of which 5 ms to minimize.
[2024-06-01 07:17:19] [INFO ] Deduced a trap composed of 39 places in 196 ms of which 4 ms to minimize.
[2024-06-01 07:17:19] [INFO ] Deduced a trap composed of 32 places in 187 ms of which 4 ms to minimize.
[2024-06-01 07:17:20] [INFO ] Deduced a trap composed of 22 places in 190 ms of which 4 ms to minimize.
[2024-06-01 07:17:20] [INFO ] Deduced a trap composed of 151 places in 169 ms of which 4 ms to minimize.
[2024-06-01 07:17:20] [INFO ] Deduced a trap composed of 151 places in 171 ms of which 3 ms to minimize.
[2024-06-01 07:17:20] [INFO ] Deduced a trap composed of 156 places in 163 ms of which 3 ms to minimize.
[2024-06-01 07:17:20] [INFO ] Deduced a trap composed of 153 places in 164 ms of which 3 ms to minimize.
[2024-06-01 07:17:21] [INFO ] Deduced a trap composed of 28 places in 165 ms of which 4 ms to minimize.
[2024-06-01 07:17:21] [INFO ] Deduced a trap composed of 168 places in 172 ms of which 3 ms to minimize.
[2024-06-01 07:17:21] [INFO ] Deduced a trap composed of 31 places in 167 ms of which 3 ms to minimize.
[2024-06-01 07:17:21] [INFO ] Deduced a trap composed of 144 places in 172 ms of which 3 ms to minimize.
[2024-06-01 07:17:21] [INFO ] Deduced a trap composed of 36 places in 158 ms of which 4 ms to minimize.
[2024-06-01 07:17:22] [INFO ] Deduced a trap composed of 148 places in 164 ms of which 3 ms to minimize.
[2024-06-01 07:17:22] [INFO ] Deduced a trap composed of 154 places in 161 ms of which 3 ms to minimize.
[2024-06-01 07:17:22] [INFO ] Deduced a trap composed of 35 places in 172 ms of which 4 ms to minimize.
[2024-06-01 07:17:22] [INFO ] Deduced a trap composed of 151 places in 163 ms of which 3 ms to minimize.
[2024-06-01 07:17:22] [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-06-01 07:17:22] [INFO ] [Real]Absence check using 78 positive place invariants in 25 ms returned sat
[2024-06-01 07:17:22] [INFO ] [Real]Absence check using 78 positive and 43 generalized place invariants in 10 ms returned sat
[2024-06-01 07:17:22] [INFO ] [Real]Absence check using state equation in 190 ms returned sat
[2024-06-01 07:17:23] [INFO ] Deduced a trap composed of 20 places in 171 ms of which 4 ms to minimize.
[2024-06-01 07:17:23] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 07:17:23] [INFO ] [Nat]Absence check using 78 positive place invariants in 27 ms returned sat
[2024-06-01 07:17:23] [INFO ] [Nat]Absence check using 78 positive and 43 generalized place invariants in 11 ms returned sat
[2024-06-01 07:17:23] [INFO ] [Nat]Absence check using state equation in 196 ms returned sat
[2024-06-01 07:17:23] [INFO ] Deduced a trap composed of 20 places in 183 ms of which 3 ms to minimize.
[2024-06-01 07:17:23] [INFO ] Deduced a trap composed of 11 places in 165 ms of which 3 ms to minimize.
[2024-06-01 07:17:24] [INFO ] Deduced a trap composed of 13 places in 164 ms of which 3 ms to minimize.
[2024-06-01 07:17:24] [INFO ] Deduced a trap composed of 26 places in 164 ms of which 3 ms to minimize.
[2024-06-01 07:17:24] [INFO ] Deduced a trap composed of 8 places in 171 ms of which 3 ms to minimize.
[2024-06-01 07:17:24] [INFO ] Deduced a trap composed of 42 places in 166 ms of which 3 ms to minimize.
[2024-06-01 07:17:24] [INFO ] Deduced a trap composed of 144 places in 163 ms of which 3 ms to minimize.
[2024-06-01 07:17:25] [INFO ] Deduced a trap composed of 49 places in 99 ms of which 3 ms to minimize.
[2024-06-01 07:17:25] [INFO ] Deduced a trap composed of 24 places in 96 ms of which 3 ms to minimize.
[2024-06-01 07:17:25] [INFO ] Deduced a trap composed of 11 places in 109 ms of which 2 ms to minimize.
[2024-06-01 07:17:25] [INFO ] Deduced a trap composed of 20 places in 97 ms of which 2 ms to minimize.
[2024-06-01 07:17:25] [INFO ] Deduced a trap composed of 22 places in 98 ms of which 2 ms to minimize.
[2024-06-01 07:17:25] [INFO ] Deduced a trap composed of 22 places in 100 ms of which 4 ms to minimize.
[2024-06-01 07:17:25] [INFO ] Deduced a trap composed of 48 places in 115 ms of which 3 ms to minimize.
[2024-06-01 07:17:25] [INFO ] Deduced a trap composed of 155 places in 188 ms of which 3 ms to minimize.
[2024-06-01 07:17:26] [INFO ] Deduced a trap composed of 161 places in 167 ms of which 4 ms to minimize.
[2024-06-01 07:17:26] [INFO ] Deduced a trap composed of 23 places in 72 ms of which 1 ms to minimize.
[2024-06-01 07:17:26] [INFO ] Deduced a trap composed of 25 places in 70 ms of which 1 ms to minimize.
[2024-06-01 07:17:26] [INFO ] Deduced a trap composed of 26 places in 146 ms of which 3 ms to minimize.
[2024-06-01 07:17:26] [INFO ] Deduced a trap composed of 39 places in 66 ms of which 1 ms to minimize.
[2024-06-01 07:17:26] [INFO ] Deduced a trap composed of 38 places in 64 ms of which 2 ms to minimize.
[2024-06-01 07:17:26] [INFO ] Deduced a trap composed of 43 places in 63 ms of which 1 ms to minimize.
[2024-06-01 07:17:26] [INFO ] Deduced a trap composed of 58 places in 63 ms of which 1 ms to minimize.
[2024-06-01 07:17:26] [INFO ] Trap strengthening (SAT) tested/added 24/23 trap constraints in 3300 ms
[2024-06-01 07:17:26] [INFO ] Computed and/alt/rep : 600/951/600 causal constraints (skipped 37 transitions) in 54 ms.
Maximisation of solution failed !
Minimization took 1 ms.
[2024-06-01 07:17:28] [INFO ] [Real]Absence check using 78 positive place invariants in 42 ms returned sat
[2024-06-01 07:17:28] [INFO ] [Real]Absence check using 78 positive and 43 generalized place invariants in 20 ms returned sat
[2024-06-01 07:17:28] [INFO ] [Real]Absence check using state equation in 224 ms returned sat
[2024-06-01 07:17:29] [INFO ] Deduced a trap composed of 16 places in 292 ms of which 5 ms to minimize.
[2024-06-01 07:17:29] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 07:17:29] [INFO ] [Nat]Absence check using 78 positive place invariants in 37 ms returned sat
[2024-06-01 07:17:29] [INFO ] [Nat]Absence check using 78 positive and 43 generalized place invariants in 15 ms returned sat
[2024-06-01 07:17:29] [INFO ] [Nat]Absence check using state equation in 263 ms returned sat
[2024-06-01 07:17:29] [INFO ] Deduced a trap composed of 16 places in 233 ms of which 3 ms to minimize.
[2024-06-01 07:17:29] [INFO ] Deduced a trap composed of 19 places in 185 ms of which 3 ms to minimize.
[2024-06-01 07:17:30] [INFO ] Deduced a trap composed of 135 places in 189 ms of which 3 ms to minimize.
[2024-06-01 07:17:30] [INFO ] Deduced a trap composed of 21 places in 180 ms of which 4 ms to minimize.
[2024-06-01 07:17:30] [INFO ] Deduced a trap composed of 15 places in 183 ms of which 3 ms to minimize.
[2024-06-01 07:17:30] [INFO ] Deduced a trap composed of 18 places in 177 ms of which 4 ms to minimize.
[2024-06-01 07:17:31] [INFO ] Deduced a trap composed of 35 places in 201 ms of which 4 ms to minimize.
[2024-06-01 07:17:31] [INFO ] Deduced a trap composed of 19 places in 176 ms of which 3 ms to minimize.
[2024-06-01 07:17:31] [INFO ] Deduced a trap composed of 31 places in 195 ms of which 4 ms to minimize.
[2024-06-01 07:17:31] [INFO ] Deduced a trap composed of 159 places in 188 ms of which 4 ms to minimize.
[2024-06-01 07:17:31] [INFO ] Deduced a trap composed of 21 places in 196 ms of which 4 ms to minimize.
[2024-06-01 07:17:32] [INFO ] Deduced a trap composed of 22 places in 197 ms of which 6 ms to minimize.
[2024-06-01 07:17:32] [INFO ] Deduced a trap composed of 173 places in 169 ms of which 3 ms to minimize.
[2024-06-01 07:17:32] [INFO ] Deduced a trap composed of 18 places in 173 ms of which 4 ms to minimize.
[2024-06-01 07:17:32] [INFO ] Deduced a trap composed of 28 places in 169 ms of which 3 ms to minimize.
[2024-06-01 07:17:32] [INFO ] Deduced a trap composed of 155 places in 195 ms of which 3 ms to minimize.
[2024-06-01 07:17:33] [INFO ] Deduced a trap composed of 161 places in 167 ms of which 3 ms to minimize.
[2024-06-01 07:17:33] [INFO ] Deduced a trap composed of 158 places in 214 ms of which 3 ms to minimize.
[2024-06-01 07:17:33] [INFO ] Deduced a trap composed of 160 places in 183 ms of which 4 ms to minimize.
[2024-06-01 07:17:33] [INFO ] Deduced a trap composed of 152 places in 165 ms of which 4 ms to minimize.
[2024-06-01 07:17:33] [INFO ] Deduced a trap composed of 29 places in 165 ms of which 3 ms to minimize.
[2024-06-01 07:17:34] [INFO ] Deduced a trap composed of 159 places in 167 ms of which 3 ms to minimize.
[2024-06-01 07:17:34] [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:17:34] [INFO ] [Real]Absence check using 78 positive place invariants in 25 ms returned sat
[2024-06-01 07:17:34] [INFO ] [Real]Absence check using 78 positive and 43 generalized place invariants in 11 ms returned sat
[2024-06-01 07:17:34] [INFO ] [Real]Absence check using state equation in 173 ms returned sat
[2024-06-01 07:17:34] [INFO ] Deduced a trap composed of 8 places in 163 ms of which 3 ms to minimize.
[2024-06-01 07:17:34] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 07:17:34] [INFO ] [Nat]Absence check using 78 positive place invariants in 33 ms returned sat
[2024-06-01 07:17:34] [INFO ] [Nat]Absence check using 78 positive and 43 generalized place invariants in 12 ms returned sat
[2024-06-01 07:17:35] [INFO ] [Nat]Absence check using state equation in 213 ms returned sat
[2024-06-01 07:17:35] [INFO ] Deduced a trap composed of 8 places in 177 ms of which 4 ms to minimize.
[2024-06-01 07:17:35] [INFO ] Deduced a trap composed of 28 places in 174 ms of which 3 ms to minimize.
[2024-06-01 07:17:35] [INFO ] Deduced a trap composed of 19 places in 171 ms of which 3 ms to minimize.
[2024-06-01 07:17:35] [INFO ] Deduced a trap composed of 29 places in 190 ms of which 4 ms to minimize.
[2024-06-01 07:17:36] [INFO ] Deduced a trap composed of 20 places in 167 ms of which 3 ms to minimize.
[2024-06-01 07:17:36] [INFO ] Deduced a trap composed of 27 places in 169 ms of which 3 ms to minimize.
[2024-06-01 07:17:36] [INFO ] Deduced a trap composed of 148 places in 176 ms of which 4 ms to minimize.
[2024-06-01 07:17:36] [INFO ] Deduced a trap composed of 28 places in 162 ms of which 3 ms to minimize.
[2024-06-01 07:17:36] [INFO ] Deduced a trap composed of 29 places in 167 ms of which 4 ms to minimize.
[2024-06-01 07:17:37] [INFO ] Deduced a trap composed of 158 places in 168 ms of which 4 ms to minimize.
[2024-06-01 07:17:37] [INFO ] Deduced a trap composed of 174 places in 196 ms of which 3 ms to minimize.
[2024-06-01 07:17:37] [INFO ] Deduced a trap composed of 39 places in 173 ms of which 4 ms to minimize.
[2024-06-01 07:17:37] [INFO ] Deduced a trap composed of 152 places in 165 ms of which 3 ms to minimize.
[2024-06-01 07:17:37] [INFO ] Deduced a trap composed of 28 places in 227 ms of which 4 ms to minimize.
[2024-06-01 07:17:38] [INFO ] Deduced a trap composed of 150 places in 199 ms of which 5 ms to minimize.
[2024-06-01 07:17:38] [INFO ] Deduced a trap composed of 34 places in 196 ms of which 4 ms to minimize.
[2024-06-01 07:17:38] [INFO ] Deduced a trap composed of 180 places in 221 ms of which 4 ms to minimize.
[2024-06-01 07:17:38] [INFO ] Deduced a trap composed of 169 places in 210 ms of which 4 ms to minimize.
[2024-06-01 07:17:39] [INFO ] Deduced a trap composed of 32 places in 207 ms of which 4 ms to minimize.
[2024-06-01 07:17:39] [INFO ] Deduced a trap composed of 22 places in 96 ms of which 2 ms to minimize.
[2024-06-01 07:17:39] [INFO ] Deduced a trap composed of 23 places in 97 ms of which 2 ms to minimize.
[2024-06-01 07:17:39] [INFO ] Deduced a trap composed of 48 places in 95 ms of which 1 ms to minimize.
[2024-06-01 07:17:39] [INFO ] Deduced a trap composed of 40 places in 62 ms of which 1 ms to minimize.
[2024-06-01 07:17:39] [INFO ] Deduced a trap composed of 39 places in 64 ms of which 1 ms to minimize.
[2024-06-01 07:17:39] [INFO ] Trap strengthening (SAT) tested/added 25/24 trap constraints in 4609 ms
[2024-06-01 07:17:39] [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 7
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)
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 719 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 719/719 places, 638/638 transitions.
Graph (trivial) has 405 edges and 719 vertex of which 7 / 719 are part of one of the 1 SCC in 15 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 1410 edges and 713 vertex of which 686 are kept as prefixes of interest. Removing 27 places using SCC suffix rule.2 ms
Discarding 27 places :
Also discarding 13 output transitions
Drop transitions (Output transitions of discarded places.) removed 13 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 163 transitions
Trivial Post-agglo rules discarded 163 transitions
Performed 163 trivial Post agglomeration. Transition count delta: 163
Iterating post reduction 0 with 163 rules applied. Total rules applied 165 place count 686 transition count 454
Reduce places removed 163 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 166 rules applied. Total rules applied 331 place count 523 transition count 451
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 334 place count 520 transition count 451
Performed 103 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 103 Pre rules applied. Total rules applied 334 place count 520 transition count 348
Deduced a syphon composed of 103 places in 1 ms
Ensure Unique test removed 21 places
Reduce places removed 124 places and 0 transitions.
Iterating global reduction 3 with 227 rules applied. Total rules applied 561 place count 396 transition count 348
Discarding 89 places :
Symmetric choice reduction at 3 with 89 rule applications. Total rules 650 place count 307 transition count 259
Iterating global reduction 3 with 89 rules applied. Total rules applied 739 place count 307 transition count 259
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 739 place count 307 transition count 251
Deduced a syphon composed of 8 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 17 rules applied. Total rules applied 756 place count 298 transition count 251
Performed 103 Post agglomeration using F-continuation condition.Transition count delta: 103
Deduced a syphon composed of 103 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 105 places and 0 transitions.
Iterating global reduction 3 with 208 rules applied. Total rules applied 964 place count 193 transition count 148
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 968 place count 191 transition count 155
Free-agglomeration rule applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 970 place count 191 transition count 153
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 972 place count 189 transition count 153
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 973 place count 189 transition count 153
Applied a total of 973 rules in 287 ms. Remains 189 /719 variables (removed 530) and now considering 153/638 (removed 485) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 297 ms. Remains : 189/719 places, 153/638 transitions.
[2024-06-01 07:17:40] [INFO ] Flow matrix only has 152 transitions (discarded 1 similar events)
// Phase 1: matrix 152 rows 189 cols
[2024-06-01 07:17:40] [INFO ] Computed 83 invariants in 6 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 (50680 resets) in 3496 ms. (285 steps per ms)
FORMULA BusinessProcesses-PT-20-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-20-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-20-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-20-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-20-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-20-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-20-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-20-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 1000001 steps (18618 resets) in 1980 ms. (504 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 53692 ms.
ITS solved all properties within timeout

BK_STOP 1717226265945

--------------------
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-20"
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-20, 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-171620399900605"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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