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.r048-tajo-171620399700533.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 itstools
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 r048-tajo-171620399700533
=====================================================================

--------------------
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 1716334838568

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BusinessProcesses-PT-11
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202405141337
[2024-05-21 23:40:39] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-21 23:40:39] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 23:40:40] [INFO ] Load time of PNML (sax parser for PT used): 86 ms
[2024-05-21 23:40:40] [INFO ] Transformed 567 places.
[2024-05-21 23:40:40] [INFO ] Transformed 508 transitions.
[2024-05-21 23:40:40] [INFO ] Found NUPN structural information;
[2024-05-21 23:40:40] [INFO ] Parsed PT model containing 567 places and 508 transitions and 1512 arcs in 204 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 8 ms.
Deduced a syphon composed of 7 places in 6 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 23:40:40] [INFO ] Computed 95 invariants in 44 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 (73 resets) in 52 ms. (188 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
FORMULA BusinessProcesses-PT-11-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 70007 steps (94 resets) in 98 ms. (707 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1]
[2024-05-21 23:40:40] [INFO ] Invariant cache hit.
[2024-05-21 23:40:40] [INFO ] [Real]Absence check using 53 positive place invariants in 23 ms returned sat
[2024-05-21 23:40:40] [INFO ] [Real]Absence check using 53 positive and 42 generalized place invariants in 14 ms returned sat
[2024-05-21 23:40:40] [INFO ] [Real]Absence check using state equation in 248 ms returned sat
[2024-05-21 23:40:41] [INFO ] Deduced a trap composed of 12 places in 210 ms of which 30 ms to minimize.
[2024-05-21 23:40:41] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 23:40:41] [INFO ] [Nat]Absence check using 53 positive place invariants in 63 ms returned sat
[2024-05-21 23:40:41] [INFO ] [Nat]Absence check using 53 positive and 42 generalized place invariants in 20 ms returned sat
[2024-05-21 23:40:41] [INFO ] [Nat]Absence check using state equation in 242 ms returned sat
[2024-05-21 23:40:42] [INFO ] Deduced a trap composed of 8 places in 166 ms of which 3 ms to minimize.
[2024-05-21 23:40:42] [INFO ] Deduced a trap composed of 25 places in 144 ms of which 10 ms to minimize.
[2024-05-21 23:40:42] [INFO ] Deduced a trap composed of 110 places in 168 ms of which 6 ms to minimize.
[2024-05-21 23:40:42] [INFO ] Deduced a trap composed of 43 places in 127 ms of which 2 ms to minimize.
[2024-05-21 23:40:42] [INFO ] Deduced a trap composed of 11 places in 143 ms of which 4 ms to minimize.
[2024-05-21 23:40:42] [INFO ] Deduced a trap composed of 19 places in 157 ms of which 14 ms to minimize.
[2024-05-21 23:40:43] [INFO ] Deduced a trap composed of 36 places in 148 ms of which 3 ms to minimize.
[2024-05-21 23:40:43] [INFO ] Deduced a trap composed of 36 places in 160 ms of which 5 ms to minimize.
[2024-05-21 23:40:43] [INFO ] Deduced a trap composed of 37 places in 169 ms of which 2 ms to minimize.
[2024-05-21 23:40:43] [INFO ] Deduced a trap composed of 27 places in 138 ms of which 2 ms to minimize.
[2024-05-21 23:40:43] [INFO ] Deduced a trap composed of 23 places in 126 ms of which 2 ms to minimize.
[2024-05-21 23:40:43] [INFO ] Deduced a trap composed of 109 places in 197 ms of which 3 ms to minimize.
[2024-05-21 23:40:44] [INFO ] Deduced a trap composed of 34 places in 177 ms of which 5 ms to minimize.
[2024-05-21 23:40:44] [INFO ] Deduced a trap composed of 24 places in 213 ms of which 2 ms to minimize.
[2024-05-21 23:40:44] [INFO ] Deduced a trap composed of 110 places in 214 ms of which 3 ms to minimize.
[2024-05-21 23:40:44] [INFO ] Deduced a trap composed of 100 places in 228 ms of which 3 ms to minimize.
[2024-05-21 23:40:44] [INFO ] Deduced a trap composed of 29 places in 97 ms of which 2 ms to minimize.
[2024-05-21 23:40:45] [INFO ] Deduced a trap composed of 26 places in 146 ms of which 4 ms to minimize.
[2024-05-21 23:40:45] [INFO ] Deduced a trap composed of 24 places in 126 ms of which 2 ms to minimize.
[2024-05-21 23:40:45] [INFO ] Deduced a trap composed of 25 places in 149 ms of which 4 ms to minimize.
[2024-05-21 23:40:45] [INFO ] Deduced a trap composed of 34 places in 137 ms of which 4 ms to minimize.
[2024-05-21 23:40:45] [INFO ] Deduced a trap composed of 38 places in 135 ms of which 2 ms to minimize.
[2024-05-21 23:40:45] [INFO ] Deduced a trap composed of 23 places in 138 ms of which 3 ms to minimize.
[2024-05-21 23:40:46] [INFO ] Deduced a trap composed of 103 places in 154 ms of which 3 ms to minimize.
[2024-05-21 23:40:46] [INFO ] Deduced a trap composed of 36 places in 91 ms of which 2 ms to minimize.
[2024-05-21 23:40:46] [INFO ] Deduced a trap composed of 27 places in 91 ms of which 2 ms to minimize.
[2024-05-21 23:40:46] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:299)
at fr.lip6.move.gal.structural.smt.SMTTrapUtils.refineWithTraps(SMTTrapUtils.java:177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:868)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2251)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2024-05-21 23:40:46] [INFO ] [Real]Absence check using 53 positive place invariants in 21 ms returned sat
[2024-05-21 23:40:46] [INFO ] [Real]Absence check using 53 positive and 42 generalized place invariants in 13 ms returned sat
[2024-05-21 23:40:46] [INFO ] [Real]Absence check using state equation in 190 ms returned sat
[2024-05-21 23:40:46] [INFO ] Deduced a trap composed of 21 places in 143 ms of which 3 ms to minimize.
[2024-05-21 23:40:46] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 23:40:46] [INFO ] [Nat]Absence check using 53 positive place invariants in 20 ms returned sat
[2024-05-21 23:40:47] [INFO ] [Nat]Absence check using 53 positive and 42 generalized place invariants in 11 ms returned sat
[2024-05-21 23:40:47] [INFO ] [Nat]Absence check using state equation in 172 ms returned sat
[2024-05-21 23:40:47] [INFO ] Deduced a trap composed of 21 places in 135 ms of which 4 ms to minimize.
[2024-05-21 23:40:47] [INFO ] Deduced a trap composed of 22 places in 181 ms of which 3 ms to minimize.
[2024-05-21 23:40:47] [INFO ] Deduced a trap composed of 18 places in 145 ms of which 3 ms to minimize.
[2024-05-21 23:40:47] [INFO ] Deduced a trap composed of 15 places in 163 ms of which 3 ms to minimize.
[2024-05-21 23:40:48] [INFO ] Deduced a trap composed of 106 places in 161 ms of which 3 ms to minimize.
[2024-05-21 23:40:48] [INFO ] Deduced a trap composed of 41 places in 92 ms of which 2 ms to minimize.
[2024-05-21 23:40:48] [INFO ] Deduced a trap composed of 37 places in 133 ms of which 7 ms to minimize.
[2024-05-21 23:40:48] [INFO ] Deduced a trap composed of 17 places in 75 ms of which 2 ms to minimize.
[2024-05-21 23:40:48] [INFO ] Deduced a trap composed of 27 places in 93 ms of which 2 ms to minimize.
[2024-05-21 23:40:48] [INFO ] Deduced a trap composed of 25 places in 71 ms of which 1 ms to minimize.
[2024-05-21 23:40:48] [INFO ] Deduced a trap composed of 28 places in 79 ms of which 1 ms to minimize.
[2024-05-21 23:40:48] [INFO ] Deduced a trap composed of 20 places in 77 ms of which 2 ms to minimize.
[2024-05-21 23:40:48] [INFO ] Deduced a trap composed of 25 places in 82 ms of which 2 ms to minimize.
[2024-05-21 23:40:49] [INFO ] Deduced a trap composed of 25 places in 78 ms of which 1 ms to minimize.
[2024-05-21 23:40:49] [INFO ] Deduced a trap composed of 29 places in 126 ms of which 3 ms to minimize.
[2024-05-21 23:40:49] [INFO ] Deduced a trap composed of 19 places in 119 ms of which 2 ms to minimize.
[2024-05-21 23:40:49] [INFO ] Deduced a trap composed of 37 places in 111 ms of which 2 ms to minimize.
[2024-05-21 23:40:49] [INFO ] Deduced a trap composed of 22 places in 128 ms of which 2 ms to minimize.
[2024-05-21 23:40:49] [INFO ] Deduced a trap composed of 36 places in 115 ms of which 3 ms to minimize.
[2024-05-21 23:40:49] [INFO ] Deduced a trap composed of 29 places in 156 ms of which 3 ms to minimize.
[2024-05-21 23:40:50] [INFO ] Deduced a trap composed of 102 places in 143 ms of which 3 ms to minimize.
[2024-05-21 23:40:50] [INFO ] Deduced a trap composed of 33 places in 129 ms of which 3 ms to minimize.
[2024-05-21 23:40:50] [INFO ] Deduced a trap composed of 35 places in 160 ms of which 3 ms to minimize.
[2024-05-21 23:40:50] [INFO ] Deduced a trap composed of 23 places in 131 ms of which 2 ms to minimize.
[2024-05-21 23:40:50] [INFO ] Deduced a trap composed of 102 places in 110 ms of which 2 ms to minimize.
[2024-05-21 23:40:50] [INFO ] Deduced a trap composed of 26 places in 148 ms of which 2 ms to minimize.
[2024-05-21 23:40:51] [INFO ] Deduced a trap composed of 31 places in 120 ms of which 2 ms to minimize.
[2024-05-21 23:40:51] [INFO ] Deduced a trap composed of 17 places in 120 ms of which 3 ms to minimize.
[2024-05-21 23:40:51] [INFO ] Deduced a trap composed of 28 places in 136 ms of which 10 ms to minimize.
[2024-05-21 23:40:51] [INFO ] Deduced a trap composed of 25 places in 108 ms of which 2 ms to minimize.
[2024-05-21 23:40:51] [INFO ] Deduced a trap composed of 24 places in 135 ms of which 2 ms to minimize.
[2024-05-21 23:40:51] [INFO ] Deduced a trap composed of 102 places in 157 ms of which 3 ms to minimize.
[2024-05-21 23:40:51] [INFO ] Deduced a trap composed of 27 places in 136 ms of which 3 ms to minimize.
[2024-05-21 23:40:51] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 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 23:40:52] [INFO ] [Real]Absence check using 53 positive place invariants in 17 ms returned sat
[2024-05-21 23:40:52] [INFO ] [Real]Absence check using 53 positive and 42 generalized place invariants in 9 ms returned sat
[2024-05-21 23:40:52] [INFO ] [Real]Absence check using state equation in 149 ms returned sat
[2024-05-21 23:40:52] [INFO ] Deduced a trap composed of 8 places in 160 ms of which 3 ms to minimize.
[2024-05-21 23:40:52] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 23:40:52] [INFO ] [Nat]Absence check using 53 positive place invariants in 17 ms returned sat
[2024-05-21 23:40:52] [INFO ] [Nat]Absence check using 53 positive and 42 generalized place invariants in 8 ms returned sat
[2024-05-21 23:40:52] [INFO ] [Nat]Absence check using state equation in 134 ms returned sat
[2024-05-21 23:40:52] [INFO ] Deduced a trap composed of 8 places in 165 ms of which 4 ms to minimize.
[2024-05-21 23:40:53] [INFO ] Deduced a trap composed of 24 places in 129 ms of which 3 ms to minimize.
[2024-05-21 23:40:53] [INFO ] Deduced a trap composed of 100 places in 127 ms of which 2 ms to minimize.
[2024-05-21 23:40:53] [INFO ] Deduced a trap composed of 11 places in 131 ms of which 3 ms to minimize.
[2024-05-21 23:40:53] [INFO ] Deduced a trap composed of 18 places in 126 ms of which 2 ms to minimize.
[2024-05-21 23:40:53] [INFO ] Deduced a trap composed of 38 places in 169 ms of which 3 ms to minimize.
[2024-05-21 23:40:53] [INFO ] Deduced a trap composed of 24 places in 144 ms of which 3 ms to minimize.
[2024-05-21 23:40:54] [INFO ] Deduced a trap composed of 34 places in 168 ms of which 2 ms to minimize.
[2024-05-21 23:40:54] [INFO ] Deduced a trap composed of 98 places in 203 ms of which 3 ms to minimize.
[2024-05-21 23:40:54] [INFO ] Deduced a trap composed of 31 places in 143 ms of which 3 ms to minimize.
[2024-05-21 23:40:54] [INFO ] Deduced a trap composed of 18 places in 159 ms of which 4 ms to minimize.
[2024-05-21 23:40:54] [INFO ] Deduced a trap composed of 23 places in 172 ms of which 3 ms to minimize.
[2024-05-21 23:40:54] [INFO ] Deduced a trap composed of 26 places in 125 ms of which 2 ms to minimize.
[2024-05-21 23:40:55] [INFO ] Deduced a trap composed of 28 places in 127 ms of which 2 ms to minimize.
[2024-05-21 23:40:55] [INFO ] Deduced a trap composed of 34 places in 170 ms of which 2 ms to minimize.
[2024-05-21 23:40:55] [INFO ] Deduced a trap composed of 23 places in 123 ms of which 2 ms to minimize.
[2024-05-21 23:40:55] [INFO ] Deduced a trap composed of 119 places in 116 ms of which 2 ms to minimize.
[2024-05-21 23:40:55] [INFO ] Deduced a trap composed of 115 places in 143 ms of which 2 ms to minimize.
[2024-05-21 23:40:55] [INFO ] Deduced a trap composed of 107 places in 118 ms of which 2 ms to minimize.
[2024-05-21 23:40:55] [INFO ] Deduced a trap composed of 105 places in 117 ms of which 3 ms to minimize.
[2024-05-21 23:40:56] [INFO ] Trap strengthening (SAT) tested/added 21/20 trap constraints in 3289 ms
[2024-05-21 23:40:56] [INFO ] Computed and/alt/rep : 471/791/471 causal constraints (skipped 29 transitions) in 28 ms.
[2024-05-21 23:40:57] [INFO ] Added : 201 causal constraints over 41 iterations in 1050 ms. Result :sat
Minimization took 388 ms.
[2024-05-21 23:40:57] [INFO ] [Real]Absence check using 53 positive place invariants in 18 ms returned sat
[2024-05-21 23:40:57] [INFO ] [Real]Absence check using 53 positive and 42 generalized place invariants in 10 ms returned sat
[2024-05-21 23:40:57] [INFO ] [Real]Absence check using state equation in 149 ms returned sat
[2024-05-21 23:40:57] [INFO ] Deduced a trap composed of 21 places in 147 ms of which 3 ms to minimize.
[2024-05-21 23:40:57] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 23:40:58] [INFO ] [Nat]Absence check using 53 positive place invariants in 20 ms returned sat
[2024-05-21 23:40:58] [INFO ] [Nat]Absence check using 53 positive and 42 generalized place invariants in 12 ms returned sat
[2024-05-21 23:40:58] [INFO ] [Nat]Absence check using state equation in 147 ms returned sat
[2024-05-21 23:40:58] [INFO ] Deduced a trap composed of 21 places in 183 ms of which 3 ms to minimize.
[2024-05-21 23:40:58] [INFO ] Deduced a trap composed of 15 places in 164 ms of which 3 ms to minimize.
[2024-05-21 23:40:58] [INFO ] Deduced a trap composed of 19 places in 116 ms of which 2 ms to minimize.
[2024-05-21 23:40:58] [INFO ] Deduced a trap composed of 105 places in 114 ms of which 2 ms to minimize.
[2024-05-21 23:40:58] [INFO ] Deduced a trap composed of 24 places in 77 ms of which 2 ms to minimize.
[2024-05-21 23:40:59] [INFO ] Deduced a trap composed of 21 places in 64 ms of which 2 ms to minimize.
[2024-05-21 23:40:59] [INFO ] Deduced a trap composed of 16 places in 110 ms of which 2 ms to minimize.
[2024-05-21 23:40:59] [INFO ] Deduced a trap composed of 25 places in 93 ms of which 2 ms to minimize.
[2024-05-21 23:40:59] [INFO ] Deduced a trap composed of 16 places in 80 ms of which 2 ms to minimize.
[2024-05-21 23:40:59] [INFO ] Deduced a trap composed of 25 places in 73 ms of which 1 ms to minimize.
[2024-05-21 23:40:59] [INFO ] Deduced a trap composed of 18 places in 76 ms of which 2 ms to minimize.
[2024-05-21 23:40:59] [INFO ] Deduced a trap composed of 27 places in 106 ms of which 3 ms to minimize.
[2024-05-21 23:40:59] [INFO ] Deduced a trap composed of 29 places in 71 ms of which 2 ms to minimize.
[2024-05-21 23:40:59] [INFO ] Deduced a trap composed of 101 places in 110 ms of which 2 ms to minimize.
[2024-05-21 23:40:59] [INFO ] Deduced a trap composed of 29 places in 72 ms of which 2 ms to minimize.
[2024-05-21 23:41:00] [INFO ] Deduced a trap composed of 18 places in 126 ms of which 3 ms to minimize.
[2024-05-21 23:41:00] [INFO ] Deduced a trap composed of 28 places in 92 ms of which 2 ms to minimize.
[2024-05-21 23:41:00] [INFO ] Deduced a trap composed of 19 places in 141 ms of which 2 ms to minimize.
[2024-05-21 23:41:00] [INFO ] Deduced a trap composed of 106 places in 128 ms of which 3 ms to minimize.
[2024-05-21 23:41:00] [INFO ] Deduced a trap composed of 96 places in 123 ms of which 3 ms to minimize.
[2024-05-21 23:41:00] [INFO ] Deduced a trap composed of 27 places in 160 ms of which 4 ms to minimize.
[2024-05-21 23:41:01] [INFO ] Deduced a trap composed of 25 places in 70 ms of which 2 ms to minimize.
[2024-05-21 23:41:01] [INFO ] Deduced a trap composed of 30 places in 94 ms of which 2 ms to minimize.
[2024-05-21 23:41:01] [INFO ] Deduced a trap composed of 34 places in 73 ms of which 2 ms to minimize.
[2024-05-21 23:41:01] [INFO ] Deduced a trap composed of 35 places in 106 ms of which 2 ms to minimize.
[2024-05-21 23:41:01] [INFO ] Deduced a trap composed of 24 places in 100 ms of which 2 ms to minimize.
[2024-05-21 23:41:01] [INFO ] Deduced a trap composed of 30 places in 104 ms of which 2 ms to minimize.
[2024-05-21 23:41:01] [INFO ] Deduced a trap composed of 44 places in 102 ms of which 2 ms to minimize.
[2024-05-21 23:41:01] [INFO ] Deduced a trap composed of 41 places in 87 ms of which 2 ms to minimize.
[2024-05-21 23:41:01] [INFO ] Deduced a trap composed of 24 places in 74 ms of which 2 ms to minimize.
[2024-05-21 23:41:01] [INFO ] Deduced a trap composed of 29 places in 72 ms of which 2 ms to minimize.
[2024-05-21 23:41:02] [INFO ] Deduced a trap composed of 22 places in 83 ms of which 2 ms to minimize.
[2024-05-21 23:41:02] [INFO ] Deduced a trap composed of 30 places in 71 ms of which 1 ms to minimize.
[2024-05-21 23:41:02] [INFO ] Deduced a trap composed of 27 places in 79 ms of which 2 ms to minimize.
[2024-05-21 23:41:02] [INFO ] Deduced a trap composed of 35 places in 84 ms of which 2 ms to minimize.
[2024-05-21 23:41:02] [INFO ] Deduced a trap composed of 34 places in 70 ms of which 1 ms to minimize.
[2024-05-21 23:41:02] [INFO ] Deduced a trap composed of 31 places in 76 ms of which 2 ms to minimize.
[2024-05-21 23:41:02] [INFO ] Deduced a trap composed of 40 places in 104 ms of which 2 ms to minimize.
[2024-05-21 23:41:02] [INFO ] Deduced a trap composed of 47 places in 86 ms of which 2 ms to minimize.
[2024-05-21 23:41:02] [INFO ] Deduced a trap composed of 37 places in 71 ms of which 14 ms to minimize.
[2024-05-21 23:41:02] [INFO ] Deduced a trap composed of 44 places in 69 ms of which 2 ms to minimize.
[2024-05-21 23:41:02] [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-05-21 23:41:03] [INFO ] [Real]Absence check using 53 positive place invariants in 41 ms returned sat
[2024-05-21 23:41:03] [INFO ] [Real]Absence check using 53 positive and 42 generalized place invariants in 24 ms returned sat
[2024-05-21 23:41:03] [INFO ] [Real]Absence check using state equation in 225 ms returned sat
[2024-05-21 23:41:03] [INFO ] Deduced a trap composed of 18 places in 168 ms of which 3 ms to minimize.
[2024-05-21 23:41:03] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 23:41:03] [INFO ] [Nat]Absence check using 53 positive place invariants in 22 ms returned sat
[2024-05-21 23:41:03] [INFO ] [Nat]Absence check using 53 positive and 42 generalized place invariants in 12 ms returned sat
[2024-05-21 23:41:04] [INFO ] [Nat]Absence check using state equation in 211 ms returned sat
[2024-05-21 23:41:04] [INFO ] Deduced a trap composed of 18 places in 161 ms of which 3 ms to minimize.
[2024-05-21 23:41:04] [INFO ] Deduced a trap composed of 21 places in 175 ms of which 4 ms to minimize.
[2024-05-21 23:41:04] [INFO ] Deduced a trap composed of 11 places in 151 ms of which 3 ms to minimize.
[2024-05-21 23:41:04] [INFO ] Deduced a trap composed of 113 places in 129 ms of which 2 ms to minimize.
[2024-05-21 23:41:04] [INFO ] Deduced a trap composed of 23 places in 102 ms of which 2 ms to minimize.
[2024-05-21 23:41:05] [INFO ] Deduced a trap composed of 107 places in 186 ms of which 3 ms to minimize.
[2024-05-21 23:41:05] [INFO ] Deduced a trap composed of 28 places in 145 ms of which 3 ms to minimize.
[2024-05-21 23:41:05] [INFO ] Deduced a trap composed of 31 places in 114 ms of which 3 ms to minimize.
[2024-05-21 23:41:05] [INFO ] Deduced a trap composed of 19 places in 146 ms of which 3 ms to minimize.
[2024-05-21 23:41:05] [INFO ] Deduced a trap composed of 37 places in 105 ms of which 2 ms to minimize.
[2024-05-21 23:41:05] [INFO ] Deduced a trap composed of 32 places in 99 ms of which 2 ms to minimize.
[2024-05-21 23:41:05] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 1733 ms
[2024-05-21 23:41:05] [INFO ] Computed and/alt/rep : 471/791/471 causal constraints (skipped 29 transitions) in 31 ms.
[2024-05-21 23:41:06] [INFO ] Added : 160 causal constraints over 32 iterations in 687 ms. Result :sat
Minimization took 501 ms.
[2024-05-21 23:41:07] [INFO ] [Real]Absence check using 53 positive place invariants in 16 ms returned sat
[2024-05-21 23:41:07] [INFO ] [Real]Absence check using 53 positive and 42 generalized place invariants in 10 ms returned sat
[2024-05-21 23:41:07] [INFO ] [Real]Absence check using state equation in 153 ms returned sat
[2024-05-21 23:41:07] [INFO ] Deduced a trap composed of 26 places in 72 ms of which 2 ms to minimize.
[2024-05-21 23:41:07] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 23:41:07] [INFO ] [Nat]Absence check using 53 positive place invariants in 25 ms returned sat
[2024-05-21 23:41:07] [INFO ] [Nat]Absence check using 53 positive and 42 generalized place invariants in 14 ms returned sat
[2024-05-21 23:41:07] [INFO ] [Nat]Absence check using state equation in 205 ms returned sat
[2024-05-21 23:41:07] [INFO ] Deduced a trap composed of 26 places in 90 ms of which 2 ms to minimize.
[2024-05-21 23:41:07] [INFO ] Deduced a trap composed of 28 places in 105 ms of which 1 ms to minimize.
[2024-05-21 23:41:08] [INFO ] Deduced a trap composed of 11 places in 74 ms of which 2 ms to minimize.
[2024-05-21 23:41:08] [INFO ] Deduced a trap composed of 32 places in 81 ms of which 1 ms to minimize.
[2024-05-21 23:41:08] [INFO ] Deduced a trap composed of 26 places in 58 ms of which 3 ms to minimize.
[2024-05-21 23:41:08] [INFO ] Deduced a trap composed of 25 places in 72 ms of which 1 ms to minimize.
[2024-05-21 23:41:08] [INFO ] Deduced a trap composed of 30 places in 68 ms of which 2 ms to minimize.
[2024-05-21 23:41:08] [INFO ] Deduced a trap composed of 40 places in 66 ms of which 2 ms to minimize.
[2024-05-21 23:41:08] [INFO ] Deduced a trap composed of 33 places in 83 ms of which 1 ms to minimize.
[2024-05-21 23:41:08] [INFO ] Deduced a trap composed of 20 places in 74 ms of which 1 ms to minimize.
[2024-05-21 23:41:08] [INFO ] Deduced a trap composed of 25 places in 66 ms of which 1 ms to minimize.
[2024-05-21 23:41:08] [INFO ] Deduced a trap composed of 35 places in 69 ms of which 1 ms to minimize.
[2024-05-21 23:41:08] [INFO ] Deduced a trap composed of 29 places in 67 ms of which 1 ms to minimize.
[2024-05-21 23:41:08] [INFO ] Deduced a trap composed of 34 places in 64 ms of which 1 ms to minimize.
[2024-05-21 23:41:09] [INFO ] Deduced a trap composed of 37 places in 70 ms of which 1 ms to minimize.
[2024-05-21 23:41:09] [INFO ] Deduced a trap composed of 38 places in 64 ms of which 1 ms to minimize.
[2024-05-21 23:41:09] [INFO ] Trap strengthening (SAT) tested/added 17/16 trap constraints in 1470 ms
[2024-05-21 23:41:09] [INFO ] Computed and/alt/rep : 471/791/471 causal constraints (skipped 29 transitions) in 23 ms.
[2024-05-21 23:41:10] [INFO ] Added : 231 causal constraints over 47 iterations in 981 ms. Result :sat
Minimization took 502 ms.
[2024-05-21 23:41:10] [INFO ] [Real]Absence check using 53 positive place invariants in 15 ms returned sat
[2024-05-21 23:41:10] [INFO ] [Real]Absence check using 53 positive and 42 generalized place invariants in 9 ms returned sat
[2024-05-21 23:41:10] [INFO ] [Real]Absence check using state equation in 138 ms returned sat
[2024-05-21 23:41:11] [INFO ] Deduced a trap composed of 23 places in 157 ms of which 3 ms to minimize.
[2024-05-21 23:41:11] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 23:41:11] [INFO ] [Nat]Absence check using 53 positive place invariants in 16 ms returned sat
[2024-05-21 23:41:11] [INFO ] [Nat]Absence check using 53 positive and 42 generalized place invariants in 9 ms returned sat
[2024-05-21 23:41:11] [INFO ] [Nat]Absence check using state equation in 135 ms returned sat
[2024-05-21 23:41:11] [INFO ] Deduced a trap composed of 23 places in 134 ms of which 3 ms to minimize.
[2024-05-21 23:41:11] [INFO ] Deduced a trap composed of 105 places in 120 ms of which 2 ms to minimize.
[2024-05-21 23:41:11] [INFO ] Deduced a trap composed of 22 places in 134 ms of which 3 ms to minimize.
[2024-05-21 23:41:12] [INFO ] Deduced a trap composed of 19 places in 136 ms of which 2 ms to minimize.
[2024-05-21 23:41:12] [INFO ] Deduced a trap composed of 31 places in 121 ms of which 2 ms to minimize.
[2024-05-21 23:41:12] [INFO ] Deduced a trap composed of 33 places in 124 ms of which 3 ms to minimize.
[2024-05-21 23:41:12] [INFO ] Deduced a trap composed of 25 places in 127 ms of which 2 ms to minimize.
[2024-05-21 23:41:12] [INFO ] Deduced a trap composed of 17 places in 149 ms of which 2 ms to minimize.
[2024-05-21 23:41:12] [INFO ] Deduced a trap composed of 28 places in 120 ms of which 3 ms to minimize.
[2024-05-21 23:41:12] [INFO ] Deduced a trap composed of 8 places in 128 ms of which 2 ms to minimize.
[2024-05-21 23:41:13] [INFO ] Deduced a trap composed of 26 places in 153 ms of which 3 ms to minimize.
[2024-05-21 23:41:13] [INFO ] Deduced a trap composed of 118 places in 118 ms of which 3 ms to minimize.
[2024-05-21 23:41:13] [INFO ] Deduced a trap composed of 17 places in 115 ms of which 2 ms to minimize.
[2024-05-21 23:41:13] [INFO ] Deduced a trap composed of 27 places in 125 ms of which 3 ms to minimize.
[2024-05-21 23:41:13] [INFO ] Deduced a trap composed of 18 places in 119 ms of which 2 ms to minimize.
[2024-05-21 23:41:13] [INFO ] Deduced a trap composed of 39 places in 120 ms of which 2 ms to minimize.
[2024-05-21 23:41:13] [INFO ] Deduced a trap composed of 24 places in 129 ms of which 2 ms to minimize.
[2024-05-21 23:41:14] [INFO ] Deduced a trap composed of 34 places in 122 ms of which 2 ms to minimize.
[2024-05-21 23:41:14] [INFO ] Deduced a trap composed of 122 places in 120 ms of which 2 ms to minimize.
[2024-05-21 23:41:14] [INFO ] Deduced a trap composed of 35 places in 115 ms of which 2 ms to minimize.
[2024-05-21 23:41:14] [INFO ] Deduced a trap composed of 27 places in 135 ms of which 3 ms to minimize.
[2024-05-21 23:41:14] [INFO ] Deduced a trap composed of 25 places in 111 ms of which 2 ms to minimize.
[2024-05-21 23:41:14] [INFO ] Deduced a trap composed of 23 places in 87 ms of which 2 ms to minimize.
[2024-05-21 23:41:14] [INFO ] Deduced a trap composed of 25 places in 97 ms of which 2 ms to minimize.
[2024-05-21 23:41:14] [INFO ] Deduced a trap composed of 30 places in 98 ms of which 2 ms to minimize.
[2024-05-21 23:41:15] [INFO ] Deduced a trap composed of 22 places in 78 ms of which 1 ms to minimize.
[2024-05-21 23:41:15] [INFO ] Deduced a trap composed of 32 places in 68 ms of which 2 ms to minimize.
[2024-05-21 23:41:15] [INFO ] Deduced a trap composed of 23 places in 79 ms of which 2 ms to minimize.
[2024-05-21 23:41:15] [INFO ] Deduced a trap composed of 29 places in 79 ms of which 2 ms to minimize.
[2024-05-21 23:41:15] [INFO ] Deduced a trap composed of 39 places in 66 ms of which 1 ms to minimize.
[2024-05-21 23:41:15] [INFO ] Deduced a trap composed of 34 places in 76 ms of which 1 ms to minimize.
[2024-05-21 23:41:15] [INFO ] Deduced a trap composed of 38 places in 88 ms of which 2 ms to minimize.
[2024-05-21 23:41:15] [INFO ] Deduced a trap composed of 30 places in 81 ms of which 2 ms to minimize.
[2024-05-21 23:41:15] [INFO ] Deduced a trap composed of 25 places in 80 ms of which 1 ms to minimize.
[2024-05-21 23:41:15] [INFO ] Deduced a trap composed of 28 places in 82 ms of which 2 ms to minimize.
[2024-05-21 23:41:15] [INFO ] Trap strengthening (SAT) tested/added 36/35 trap constraints in 4546 ms
[2024-05-21 23:41:15] [INFO ] Computed and/alt/rep : 471/791/471 causal constraints (skipped 29 transitions) in 29 ms.
0timeout
^^^^^^^^
(error "Invalid token: 0timeout")
Minimization took 1 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0, 0, 0] Max Struct:[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] Max Struct:[1, 1, 1, 1, 1, 1, 1]
Support contains 7 out of 560 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 560/560 places, 501/501 transitions.
Graph (trivial) has 307 edges and 560 vertex of which 7 / 560 are part of one of the 1 SCC in 3 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 117 transitions
Trivial Post-agglo rules discarded 117 transitions
Performed 117 trivial Post agglomeration. Transition count delta: 117
Iterating post reduction 0 with 117 rules applied. Total rules applied 119 place count 549 transition count 375
Reduce places removed 117 places and 0 transitions.
Iterating post reduction 1 with 117 rules applied. Total rules applied 236 place count 432 transition count 375
Performed 90 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 90 Pre rules applied. Total rules applied 236 place count 432 transition count 285
Deduced a syphon composed of 90 places in 1 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 432 place count 326 transition count 285
Discarding 65 places :
Symmetric choice reduction at 2 with 65 rule applications. Total rules 497 place count 261 transition count 220
Iterating global reduction 2 with 65 rules applied. Total rules applied 562 place count 261 transition count 220
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 562 place count 261 transition count 217
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 568 place count 258 transition count 217
Performed 87 Post agglomeration using F-continuation condition.Transition count delta: 87
Deduced a syphon composed of 87 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 90 places and 0 transitions.
Iterating global reduction 2 with 177 rules applied. Total rules applied 745 place count 168 transition count 130
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 747 place count 167 transition count 134
Free-agglomeration rule applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 749 place count 167 transition count 132
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 751 place count 165 transition count 132
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 752 place count 165 transition count 132
Applied a total of 752 rules in 185 ms. Remains 165 /560 variables (removed 395) and now considering 132/501 (removed 369) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 194 ms. Remains : 165/560 places, 132/501 transitions.
// Phase 1: matrix 132 rows 165 cols
[2024-05-21 23:41:16] [INFO ] Computed 72 invariants in 8 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1]
RANDOM walk for 1000000 steps (53124 resets) in 3370 ms. (296 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
BEST_FIRST walk for 1000001 steps (27671 resets) in 2090 ms. (478 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-05-21 23:41:21] [INFO ] Invariant cache hit.
[2024-05-21 23:41:21] [INFO ] [Real]Absence check using 48 positive place invariants in 14 ms returned sat
[2024-05-21 23:41:21] [INFO ] [Real]Absence check using 48 positive and 24 generalized place invariants in 5 ms returned sat
[2024-05-21 23:41:22] [INFO ] [Real]Absence check using state equation in 54 ms returned sat
[2024-05-21 23:41:22] [INFO ] State equation strengthened by 13 read => feed constraints.
[2024-05-21 23:41:22] [INFO ] [Real]Added 13 Read/Feed constraints in 3 ms returned sat
[2024-05-21 23:41:22] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 23:41:22] [INFO ] [Nat]Absence check using 48 positive place invariants in 6 ms returned sat
[2024-05-21 23:41:22] [INFO ] [Nat]Absence check using 48 positive and 24 generalized place invariants in 3 ms returned sat
[2024-05-21 23:41:22] [INFO ] [Nat]Absence check using state equation in 36 ms returned sat
[2024-05-21 23:41:22] [INFO ] [Nat]Added 13 Read/Feed constraints in 2 ms returned sat
[2024-05-21 23:41:22] [INFO ] Computed and/alt/rep : 86/408/86 causal constraints (skipped 44 transitions) in 16 ms.
[2024-05-21 23:41:22] [INFO ] Added : 20 causal constraints over 4 iterations in 111 ms. Result :sat
Minimization took 135 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 165 places. Attempting structural reductions.
Drop transitions (Removing consumers from one bounded place p40) removed 2 transitions
Starting structural reductions in REACHABILITY mode, iteration 0 : 165/165 places, 130/130 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 165 transition count 128
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 163 transition count 128
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 4 place count 163 transition count 126
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 10 place count 159 transition count 126
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 16 place count 156 transition count 123
Applied a total of 16 rules in 32 ms. Remains 156 /165 variables (removed 9) and now considering 123/130 (removed 7) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 33 ms. Remains : 156/165 places, 123/130 transitions.
// Phase 1: matrix 123 rows 156 cols
[2024-05-21 23:41:22] [INFO ] Computed 70 invariants in 2 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 (57263 resets) in 2541 ms. (393 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 5 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 )
[2024-05-21 23:41:25] [INFO ] Flatten gal took : 69 ms
[2024-05-21 23:41:25] [INFO ] Flatten gal took : 23 ms
[2024-05-21 23:41:25] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality5462940174208572948.gal : 13 ms
[2024-05-21 23:41:25] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality16105159111114847696.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality5462940174208572948.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality16105159111114847696.prop' '--nowitness' '--gen-order' 'FOLLOW'

ITS runner timed out or was interrupted.
its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
ITS tools runner thread asked to quit. Dying gracefully.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[] Max Struct:[]
All properties solved without resorting to model-checking.
Total runtime 45541 ms.

BK_STOP 1716334885500

--------------------
content from stderr:

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ 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//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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="itstools"
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 itstools"
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 r048-tajo-171620399700533"
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 ;