Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2022-input.r010-tajo-165245701800172.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2022-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
....................
=====================================================================
Generated by BenchKit 2-4028
Executing tool gold2021
Input is AutoFlight-PT-06b, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r010-tajo-165245701800172
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 380K
-rw-r--r-- 1 mcc users 7.4K Apr 30 01:41 CTLCardinality.txt
-rw-r--r-- 1 mcc users 86K Apr 30 01:41 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K Apr 30 01:40 CTLFireability.txt
-rw-r--r-- 1 mcc users 58K Apr 30 01:40 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.4K May 9 07:04 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K May 9 07:04 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 9 07:04 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 9 07:04 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 9 07:04 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 9 07:04 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:33 equiv_col
-rw-r--r-- 1 mcc users 4 May 10 09:33 instance
-rw-r--r-- 1 mcc users 6 May 10 09:33 iscolored
-rw-r--r-- 1 mcc users 134K May 10 09:33 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 AutoFlight-PT-06b-UpperBounds-00
FORMULA_NAME AutoFlight-PT-06b-UpperBounds-01
FORMULA_NAME AutoFlight-PT-06b-UpperBounds-02
FORMULA_NAME AutoFlight-PT-06b-UpperBounds-03
FORMULA_NAME AutoFlight-PT-06b-UpperBounds-04
FORMULA_NAME AutoFlight-PT-06b-UpperBounds-05
FORMULA_NAME AutoFlight-PT-06b-UpperBounds-06
FORMULA_NAME AutoFlight-PT-06b-UpperBounds-07
FORMULA_NAME AutoFlight-PT-06b-UpperBounds-08
FORMULA_NAME AutoFlight-PT-06b-UpperBounds-09
FORMULA_NAME AutoFlight-PT-06b-UpperBounds-10
FORMULA_NAME AutoFlight-PT-06b-UpperBounds-11
FORMULA_NAME AutoFlight-PT-06b-UpperBounds-12
FORMULA_NAME AutoFlight-PT-06b-UpperBounds-13
FORMULA_NAME AutoFlight-PT-06b-UpperBounds-14
FORMULA_NAME AutoFlight-PT-06b-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1652727771484

Running Version 0
[2022-05-16 19:02:53] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-16 19:02:53] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-16 19:02:53] [INFO ] Load time of PNML (sax parser for PT used): 78 ms
[2022-05-16 19:02:53] [INFO ] Transformed 574 places.
[2022-05-16 19:02:53] [INFO ] Transformed 572 transitions.
[2022-05-16 19:02:53] [INFO ] Found NUPN structural information;
[2022-05-16 19:02:53] [INFO ] Parsed PT model containing 574 places and 572 transitions in 121 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 6 ms.
// Phase 1: matrix 572 rows 574 cols
[2022-05-16 19:02:53] [INFO ] Computed 40 place invariants in 15 ms
Incomplete random walk after 10000 steps, including 34 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 16) seen :8
FORMULA AutoFlight-PT-06b-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-06b-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-06b-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-06b-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-06b-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-06b-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-06b-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-06b-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 8) seen :0
// Phase 1: matrix 572 rows 574 cols
[2022-05-16 19:02:53] [INFO ] Computed 40 place invariants in 10 ms
[2022-05-16 19:02:53] [INFO ] [Real]Absence check using 39 positive place invariants in 18 ms returned sat
[2022-05-16 19:02:53] [INFO ] [Real]Absence check using 39 positive and 1 generalized place invariants in 1 ms returned sat
[2022-05-16 19:02:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 19:02:53] [INFO ] [Real]Absence check using state equation in 152 ms returned sat
[2022-05-16 19:02:53] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 19:02:54] [INFO ] [Nat]Absence check using 39 positive place invariants in 17 ms returned sat
[2022-05-16 19:02:54] [INFO ] [Nat]Absence check using 39 positive and 1 generalized place invariants in 1 ms returned sat
[2022-05-16 19:02:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 19:02:54] [INFO ] [Nat]Absence check using state equation in 161 ms returned sat
[2022-05-16 19:02:54] [INFO ] Deduced a trap composed of 29 places in 183 ms of which 3 ms to minimize.
[2022-05-16 19:02:54] [INFO ] Deduced a trap composed of 28 places in 132 ms of which 1 ms to minimize.
[2022-05-16 19:02:54] [INFO ] Deduced a trap composed of 43 places in 101 ms of which 1 ms to minimize.
[2022-05-16 19:02:54] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 530 ms
[2022-05-16 19:02:54] [INFO ] Computed and/alt/rep : 571/767/571 causal constraints (skipped 0 transitions) in 40 ms.
[2022-05-16 19:02:58] [INFO ] Added : 564 causal constraints over 114 iterations in 3761 ms. Result :sat
Minimization took 231 ms.
[2022-05-16 19:02:58] [INFO ] [Real]Absence check using 39 positive place invariants in 19 ms returned sat
[2022-05-16 19:02:58] [INFO ] [Real]Absence check using 39 positive and 1 generalized place invariants in 1 ms returned sat
[2022-05-16 19:02:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 19:02:59] [INFO ] [Real]Absence check using state equation in 187 ms returned sat
[2022-05-16 19:02:59] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 19:02:59] [INFO ] [Nat]Absence check using 39 positive place invariants in 33 ms returned sat
[2022-05-16 19:02:59] [INFO ] [Nat]Absence check using 39 positive and 1 generalized place invariants in 3 ms returned sat
[2022-05-16 19:02:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 19:02:59] [INFO ] [Nat]Absence check using state equation in 192 ms returned sat
[2022-05-16 19:02:59] [INFO ] Deduced a trap composed of 22 places in 157 ms of which 1 ms to minimize.
[2022-05-16 19:02:59] [INFO ] Deduced a trap composed of 43 places in 157 ms of which 2 ms to minimize.
[2022-05-16 19:02:59] [INFO ] Deduced a trap composed of 49 places in 121 ms of which 0 ms to minimize.
[2022-05-16 19:03:00] [INFO ] Deduced a trap composed of 19 places in 138 ms of which 0 ms to minimize.
[2022-05-16 19:03:00] [INFO ] Deduced a trap composed of 48 places in 143 ms of which 1 ms to minimize.
[2022-05-16 19:03:00] [INFO ] Deduced a trap composed of 53 places in 116 ms of which 0 ms to minimize.
[2022-05-16 19:03:00] [INFO ] Deduced a trap composed of 71 places in 144 ms of which 1 ms to minimize.
[2022-05-16 19:03:00] [INFO ] Deduced a trap composed of 53 places in 115 ms of which 0 ms to minimize.
[2022-05-16 19:03:00] [INFO ] Deduced a trap composed of 69 places in 106 ms of which 1 ms to minimize.
[2022-05-16 19:03:01] [INFO ] Deduced a trap composed of 46 places in 102 ms of which 0 ms to minimize.
[2022-05-16 19:03:01] [INFO ] Deduced a trap composed of 65 places in 94 ms of which 1 ms to minimize.
[2022-05-16 19:03:01] [INFO ] Deduced a trap composed of 54 places in 93 ms of which 1 ms to minimize.
[2022-05-16 19:03:01] [INFO ] Deduced a trap composed of 118 places in 91 ms of which 0 ms to minimize.
[2022-05-16 19:03:01] [INFO ] Deduced a trap composed of 55 places in 98 ms of which 1 ms to minimize.
[2022-05-16 19:03:01] [INFO ] Deduced a trap composed of 74 places in 96 ms of which 1 ms to minimize.
[2022-05-16 19:03:01] [INFO ] Deduced a trap composed of 84 places in 101 ms of which 1 ms to minimize.
[2022-05-16 19:03:01] [INFO ] Deduced a trap composed of 55 places in 117 ms of which 1 ms to minimize.
[2022-05-16 19:03:02] [INFO ] Deduced a trap composed of 68 places in 136 ms of which 1 ms to minimize.
[2022-05-16 19:03:02] [INFO ] Deduced a trap composed of 56 places in 92 ms of which 0 ms to minimize.
[2022-05-16 19:03:02] [INFO ] Deduced a trap composed of 48 places in 111 ms of which 0 ms to minimize.
[2022-05-16 19:03:02] [INFO ] Deduced a trap composed of 57 places in 95 ms of which 1 ms to minimize.
[2022-05-16 19:03:02] [INFO ] Deduced a trap composed of 88 places in 116 ms of which 1 ms to minimize.
[2022-05-16 19:03:02] [INFO ] Trap strengthening (SAT) tested/added 23/22 trap constraints in 3172 ms
[2022-05-16 19:03:02] [INFO ] Computed and/alt/rep : 571/767/571 causal constraints (skipped 0 transitions) in 31 ms.
[2022-05-16 19:03:04] [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:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:858)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:595)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:428)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
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:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
[2022-05-16 19:03:04] [INFO ] [Real]Absence check using 39 positive place invariants in 19 ms returned sat
[2022-05-16 19:03:04] [INFO ] [Real]Absence check using 39 positive and 1 generalized place invariants in 1 ms returned sat
[2022-05-16 19:03:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 19:03:04] [INFO ] [Real]Absence check using state equation in 169 ms returned sat
[2022-05-16 19:03:04] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 19:03:04] [INFO ] [Nat]Absence check using 39 positive place invariants in 19 ms returned sat
[2022-05-16 19:03:04] [INFO ] [Nat]Absence check using 39 positive and 1 generalized place invariants in 3 ms returned sat
[2022-05-16 19:03:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 19:03:04] [INFO ] [Nat]Absence check using state equation in 211 ms returned sat
[2022-05-16 19:03:04] [INFO ] Deduced a trap composed of 19 places in 144 ms of which 0 ms to minimize.
[2022-05-16 19:03:05] [INFO ] Deduced a trap composed of 24 places in 109 ms of which 1 ms to minimize.
[2022-05-16 19:03:05] [INFO ] Deduced a trap composed of 21 places in 107 ms of which 0 ms to minimize.
[2022-05-16 19:03:05] [INFO ] Deduced a trap composed of 22 places in 105 ms of which 0 ms to minimize.
[2022-05-16 19:03:05] [INFO ] Deduced a trap composed of 64 places in 119 ms of which 0 ms to minimize.
[2022-05-16 19:03:05] [INFO ] Deduced a trap composed of 75 places in 123 ms of which 1 ms to minimize.
[2022-05-16 19:03:05] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 869 ms
[2022-05-16 19:03:05] [INFO ] Computed and/alt/rep : 571/767/571 causal constraints (skipped 0 transitions) in 30 ms.
[2022-05-16 19:03:09] [INFO ] Deduced a trap composed of 8 places in 208 ms of which 0 ms to minimize.
[2022-05-16 19:03:09] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 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:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:906)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:849)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:595)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:428)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
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:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
[2022-05-16 19:03:09] [INFO ] [Real]Absence check using 39 positive place invariants in 20 ms returned sat
[2022-05-16 19:03:09] [INFO ] [Real]Absence check using 39 positive and 1 generalized place invariants in 1 ms returned sat
[2022-05-16 19:03:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 19:03:10] [INFO ] [Real]Absence check using state equation in 200 ms returned sat
[2022-05-16 19:03:10] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 19:03:10] [INFO ] [Nat]Absence check using 39 positive place invariants in 20 ms returned sat
[2022-05-16 19:03:10] [INFO ] [Nat]Absence check using 39 positive and 1 generalized place invariants in 2 ms returned sat
[2022-05-16 19:03:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 19:03:10] [INFO ] [Nat]Absence check using state equation in 177 ms returned sat
[2022-05-16 19:03:10] [INFO ] Deduced a trap composed of 19 places in 129 ms of which 0 ms to minimize.
[2022-05-16 19:03:10] [INFO ] Deduced a trap composed of 22 places in 154 ms of which 0 ms to minimize.
[2022-05-16 19:03:10] [INFO ] Deduced a trap composed of 61 places in 148 ms of which 0 ms to minimize.
[2022-05-16 19:03:11] [INFO ] Deduced a trap composed of 85 places in 108 ms of which 1 ms to minimize.
[2022-05-16 19:03:11] [INFO ] Deduced a trap composed of 21 places in 117 ms of which 0 ms to minimize.
[2022-05-16 19:03:11] [INFO ] Deduced a trap composed of 25 places in 124 ms of which 1 ms to minimize.
[2022-05-16 19:03:11] [INFO ] Deduced a trap composed of 47 places in 125 ms of which 1 ms to minimize.
[2022-05-16 19:03:11] [INFO ] Deduced a trap composed of 24 places in 125 ms of which 0 ms to minimize.
[2022-05-16 19:03:11] [INFO ] Deduced a trap composed of 32 places in 117 ms of which 0 ms to minimize.
[2022-05-16 19:03:11] [INFO ] Deduced a trap composed of 49 places in 104 ms of which 0 ms to minimize.
[2022-05-16 19:03:11] [INFO ] Deduced a trap composed of 46 places in 98 ms of which 0 ms to minimize.
[2022-05-16 19:03:12] [INFO ] Deduced a trap composed of 48 places in 95 ms of which 0 ms to minimize.
[2022-05-16 19:03:12] [INFO ] Deduced a trap composed of 60 places in 90 ms of which 0 ms to minimize.
[2022-05-16 19:03:12] [INFO ] Deduced a trap composed of 101 places in 95 ms of which 0 ms to minimize.
[2022-05-16 19:03:12] [INFO ] Deduced a trap composed of 70 places in 87 ms of which 13 ms to minimize.
[2022-05-16 19:03:12] [INFO ] Deduced a trap composed of 48 places in 89 ms of which 0 ms to minimize.
[2022-05-16 19:03:12] [INFO ] Deduced a trap composed of 95 places in 90 ms of which 1 ms to minimize.
[2022-05-16 19:03:12] [INFO ] Deduced a trap composed of 101 places in 88 ms of which 0 ms to minimize.
[2022-05-16 19:03:12] [INFO ] Deduced a trap composed of 96 places in 84 ms of which 1 ms to minimize.
[2022-05-16 19:03:12] [INFO ] Deduced a trap composed of 98 places in 86 ms of which 0 ms to minimize.
[2022-05-16 19:03:13] [INFO ] Deduced a trap composed of 109 places in 96 ms of which 0 ms to minimize.
[2022-05-16 19:03:13] [INFO ] Deduced a trap composed of 94 places in 86 ms of which 0 ms to minimize.
[2022-05-16 19:03:13] [INFO ] Deduced a trap composed of 88 places in 86 ms of which 1 ms to minimize.
[2022-05-16 19:03:13] [INFO ] Deduced a trap composed of 120 places in 86 ms of which 0 ms to minimize.
[2022-05-16 19:03:13] [INFO ] Deduced a trap composed of 131 places in 94 ms of which 8 ms to minimize.
[2022-05-16 19:03:13] [INFO ] Deduced a trap composed of 119 places in 108 ms of which 0 ms to minimize.
[2022-05-16 19:03:13] [INFO ] Deduced a trap composed of 114 places in 106 ms of which 0 ms to minimize.
[2022-05-16 19:03:13] [INFO ] Deduced a trap composed of 113 places in 86 ms of which 1 ms to minimize.
[2022-05-16 19:03:13] [INFO ] Trap strengthening (SAT) tested/added 29/28 trap constraints in 3463 ms
[2022-05-16 19:03:13] [INFO ] Computed and/alt/rep : 571/767/571 causal constraints (skipped 0 transitions) in 22 ms.
[2022-05-16 19:03:15] [INFO ] Deduced a trap composed of 8 places in 200 ms of which 1 ms to minimize.
[2022-05-16 19:03:15] [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:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:906)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:849)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:595)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:428)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
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:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
[2022-05-16 19:03:15] [INFO ] [Real]Absence check using 39 positive place invariants in 14 ms returned sat
[2022-05-16 19:03:15] [INFO ] [Real]Absence check using 39 positive and 1 generalized place invariants in 0 ms returned sat
[2022-05-16 19:03:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 19:03:15] [INFO ] [Real]Absence check using state equation in 129 ms returned sat
[2022-05-16 19:03:15] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 19:03:15] [INFO ] [Nat]Absence check using 39 positive place invariants in 16 ms returned sat
[2022-05-16 19:03:15] [INFO ] [Nat]Absence check using 39 positive and 1 generalized place invariants in 1 ms returned sat
[2022-05-16 19:03:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 19:03:15] [INFO ] [Nat]Absence check using state equation in 137 ms returned sat
[2022-05-16 19:03:15] [INFO ] Deduced a trap composed of 31 places in 131 ms of which 0 ms to minimize.
[2022-05-16 19:03:16] [INFO ] Deduced a trap composed of 24 places in 114 ms of which 0 ms to minimize.
[2022-05-16 19:03:16] [INFO ] Deduced a trap composed of 58 places in 110 ms of which 1 ms to minimize.
[2022-05-16 19:03:16] [INFO ] Deduced a trap composed of 37 places in 108 ms of which 0 ms to minimize.
[2022-05-16 19:03:16] [INFO ] Deduced a trap composed of 61 places in 93 ms of which 2 ms to minimize.
[2022-05-16 19:03:16] [INFO ] Deduced a trap composed of 58 places in 87 ms of which 0 ms to minimize.
[2022-05-16 19:03:16] [INFO ] Deduced a trap composed of 19 places in 108 ms of which 0 ms to minimize.
[2022-05-16 19:03:16] [INFO ] Deduced a trap composed of 34 places in 93 ms of which 0 ms to minimize.
[2022-05-16 19:03:16] [INFO ] Deduced a trap composed of 66 places in 89 ms of which 0 ms to minimize.
[2022-05-16 19:03:16] [INFO ] Deduced a trap composed of 85 places in 86 ms of which 1 ms to minimize.
[2022-05-16 19:03:17] [INFO ] Deduced a trap composed of 45 places in 90 ms of which 0 ms to minimize.
[2022-05-16 19:03:17] [INFO ] Deduced a trap composed of 89 places in 92 ms of which 0 ms to minimize.
[2022-05-16 19:03:17] [INFO ] Deduced a trap composed of 69 places in 105 ms of which 0 ms to minimize.
[2022-05-16 19:03:17] [INFO ] Deduced a trap composed of 111 places in 108 ms of which 0 ms to minimize.
[2022-05-16 19:03:17] [INFO ] Deduced a trap composed of 84 places in 114 ms of which 1 ms to minimize.
[2022-05-16 19:03:17] [INFO ] Deduced a trap composed of 35 places in 103 ms of which 0 ms to minimize.
[2022-05-16 19:03:17] [INFO ] Deduced a trap composed of 54 places in 104 ms of which 1 ms to minimize.
[2022-05-16 19:03:17] [INFO ] Deduced a trap composed of 82 places in 100 ms of which 0 ms to minimize.
[2022-05-16 19:03:18] [INFO ] Deduced a trap composed of 75 places in 118 ms of which 1 ms to minimize.
[2022-05-16 19:03:18] [INFO ] Deduced a trap composed of 77 places in 87 ms of which 1 ms to minimize.
[2022-05-16 19:03:18] [INFO ] Deduced a trap composed of 48 places in 88 ms of which 3 ms to minimize.
[2022-05-16 19:03:18] [INFO ] Deduced a trap composed of 45 places in 88 ms of which 0 ms to minimize.
[2022-05-16 19:03:18] [INFO ] Trap strengthening (SAT) tested/added 23/22 trap constraints in 2689 ms
[2022-05-16 19:03:18] [INFO ] Computed and/alt/rep : 571/767/571 causal constraints (skipped 0 transitions) in 34 ms.
[2022-05-16 19:03:20] [INFO ] Deduced a trap composed of 8 places in 180 ms of which 1 ms to minimize.
[2022-05-16 19:03:20] [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:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:906)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:849)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:595)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:428)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
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:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
[2022-05-16 19:03:20] [INFO ] [Real]Absence check using 39 positive place invariants in 19 ms returned sat
[2022-05-16 19:03:20] [INFO ] [Real]Absence check using 39 positive and 1 generalized place invariants in 1 ms returned sat
[2022-05-16 19:03:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 19:03:21] [INFO ] [Real]Absence check using state equation in 168 ms returned sat
[2022-05-16 19:03:21] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 19:03:21] [INFO ] [Nat]Absence check using 39 positive place invariants in 16 ms returned sat
[2022-05-16 19:03:21] [INFO ] [Nat]Absence check using 39 positive and 1 generalized place invariants in 1 ms returned sat
[2022-05-16 19:03:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 19:03:21] [INFO ] [Nat]Absence check using state equation in 161 ms returned sat
[2022-05-16 19:03:21] [INFO ] Deduced a trap composed of 22 places in 111 ms of which 0 ms to minimize.
[2022-05-16 19:03:21] [INFO ] Deduced a trap composed of 24 places in 117 ms of which 1 ms to minimize.
[2022-05-16 19:03:21] [INFO ] Deduced a trap composed of 58 places in 111 ms of which 0 ms to minimize.
[2022-05-16 19:03:21] [INFO ] Deduced a trap composed of 19 places in 90 ms of which 1 ms to minimize.
[2022-05-16 19:03:21] [INFO ] Deduced a trap composed of 93 places in 105 ms of which 1 ms to minimize.
[2022-05-16 19:03:22] [INFO ] Deduced a trap composed of 64 places in 86 ms of which 0 ms to minimize.
[2022-05-16 19:03:22] [INFO ] Deduced a trap composed of 81 places in 111 ms of which 1 ms to minimize.
[2022-05-16 19:03:22] [INFO ] Deduced a trap composed of 43 places in 107 ms of which 0 ms to minimize.
[2022-05-16 19:03:22] [INFO ] Deduced a trap composed of 79 places in 152 ms of which 0 ms to minimize.
[2022-05-16 19:03:22] [INFO ] Deduced a trap composed of 58 places in 91 ms of which 1 ms to minimize.
[2022-05-16 19:03:22] [INFO ] Deduced a trap composed of 53 places in 83 ms of which 1 ms to minimize.
[2022-05-16 19:03:22] [INFO ] Deduced a trap composed of 48 places in 167 ms of which 1 ms to minimize.
[2022-05-16 19:03:23] [INFO ] Deduced a trap composed of 48 places in 128 ms of which 1 ms to minimize.
[2022-05-16 19:03:23] [INFO ] Deduced a trap composed of 45 places in 97 ms of which 0 ms to minimize.
[2022-05-16 19:03:23] [INFO ] Deduced a trap composed of 44 places in 134 ms of which 0 ms to minimize.
[2022-05-16 19:03:23] [INFO ] Deduced a trap composed of 46 places in 201 ms of which 1 ms to minimize.
[2022-05-16 19:03:23] [INFO ] Deduced a trap composed of 98 places in 135 ms of which 0 ms to minimize.
[2022-05-16 19:03:24] [INFO ] Deduced a trap composed of 73 places in 213 ms of which 0 ms to minimize.
[2022-05-16 19:03:24] [INFO ] Deduced a trap composed of 75 places in 107 ms of which 0 ms to minimize.
[2022-05-16 19:03:24] [INFO ] Deduced a trap composed of 72 places in 135 ms of which 0 ms to minimize.
[2022-05-16 19:03:24] [INFO ] Deduced a trap composed of 78 places in 154 ms of which 1 ms to minimize.
[2022-05-16 19:03:24] [INFO ] Deduced a trap composed of 115 places in 153 ms of which 0 ms to minimize.
[2022-05-16 19:03:24] [INFO ] Deduced a trap composed of 58 places in 105 ms of which 1 ms to minimize.
[2022-05-16 19:03:24] [INFO ] Trap strengthening (SAT) tested/added 24/23 trap constraints in 3611 ms
[2022-05-16 19:03:25] [INFO ] Computed and/alt/rep : 571/767/571 causal constraints (skipped 0 transitions) in 35 ms.
[2022-05-16 19:03:26] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 5
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:858)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:595)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:428)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
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:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
[2022-05-16 19:03:26] [INFO ] [Real]Absence check using 39 positive place invariants in 16 ms returned sat
[2022-05-16 19:03:26] [INFO ] [Real]Absence check using 39 positive and 1 generalized place invariants in 1 ms returned sat
[2022-05-16 19:03:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 19:03:26] [INFO ] [Real]Absence check using state equation in 160 ms returned sat
[2022-05-16 19:03:26] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 19:03:26] [INFO ] [Nat]Absence check using 39 positive place invariants in 16 ms returned sat
[2022-05-16 19:03:26] [INFO ] [Nat]Absence check using 39 positive and 1 generalized place invariants in 1 ms returned sat
[2022-05-16 19:03:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 19:03:26] [INFO ] [Nat]Absence check using state equation in 162 ms returned sat
[2022-05-16 19:03:26] [INFO ] Deduced a trap composed of 26 places in 123 ms of which 0 ms to minimize.
[2022-05-16 19:03:27] [INFO ] Deduced a trap composed of 23 places in 127 ms of which 0 ms to minimize.
[2022-05-16 19:03:27] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 346 ms
[2022-05-16 19:03:27] [INFO ] Computed and/alt/rep : 571/767/571 causal constraints (skipped 0 transitions) in 42 ms.
[2022-05-16 19:03:31] [INFO ] Added : 531 causal constraints over 107 iterations in 4084 ms. Result :sat
Minimization took 134 ms.
[2022-05-16 19:03:31] [INFO ] [Real]Absence check using 39 positive place invariants in 18 ms returned sat
[2022-05-16 19:03:31] [INFO ] [Real]Absence check using 39 positive and 1 generalized place invariants in 1 ms returned sat
[2022-05-16 19:03:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 19:03:31] [INFO ] [Real]Absence check using state equation in 158 ms returned sat
[2022-05-16 19:03:31] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 19:03:31] [INFO ] [Nat]Absence check using 39 positive place invariants in 17 ms returned sat
[2022-05-16 19:03:31] [INFO ] [Nat]Absence check using 39 positive and 1 generalized place invariants in 1 ms returned sat
[2022-05-16 19:03:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 19:03:31] [INFO ] [Nat]Absence check using state equation in 212 ms returned sat
[2022-05-16 19:03:32] [INFO ] Deduced a trap composed of 22 places in 126 ms of which 0 ms to minimize.
[2022-05-16 19:03:32] [INFO ] Deduced a trap composed of 19 places in 128 ms of which 1 ms to minimize.
[2022-05-16 19:03:32] [INFO ] Deduced a trap composed of 66 places in 117 ms of which 1 ms to minimize.
[2022-05-16 19:03:32] [INFO ] Deduced a trap composed of 83 places in 134 ms of which 0 ms to minimize.
[2022-05-16 19:03:32] [INFO ] Deduced a trap composed of 80 places in 107 ms of which 1 ms to minimize.
[2022-05-16 19:03:32] [INFO ] Deduced a trap composed of 81 places in 106 ms of which 1 ms to minimize.
[2022-05-16 19:03:32] [INFO ] Deduced a trap composed of 74 places in 101 ms of which 1 ms to minimize.
[2022-05-16 19:03:33] [INFO ] Deduced a trap composed of 46 places in 105 ms of which 0 ms to minimize.
[2022-05-16 19:03:33] [INFO ] Deduced a trap composed of 55 places in 112 ms of which 1 ms to minimize.
[2022-05-16 19:03:33] [INFO ] Deduced a trap composed of 79 places in 120 ms of which 1 ms to minimize.
[2022-05-16 19:03:33] [INFO ] Deduced a trap composed of 104 places in 100 ms of which 1 ms to minimize.
[2022-05-16 19:03:33] [INFO ] Deduced a trap composed of 58 places in 91 ms of which 0 ms to minimize.
[2022-05-16 19:03:33] [INFO ] Deduced a trap composed of 68 places in 91 ms of which 1 ms to minimize.
[2022-05-16 19:03:33] [INFO ] Deduced a trap composed of 92 places in 106 ms of which 0 ms to minimize.
[2022-05-16 19:03:33] [INFO ] Deduced a trap composed of 57 places in 82 ms of which 0 ms to minimize.
[2022-05-16 19:03:33] [INFO ] Deduced a trap composed of 68 places in 91 ms of which 0 ms to minimize.
[2022-05-16 19:03:34] [INFO ] Deduced a trap composed of 81 places in 101 ms of which 0 ms to minimize.
[2022-05-16 19:03:34] [INFO ] Deduced a trap composed of 54 places in 94 ms of which 1 ms to minimize.
[2022-05-16 19:03:34] [INFO ] Deduced a trap composed of 87 places in 84 ms of which 0 ms to minimize.
[2022-05-16 19:03:34] [INFO ] Deduced a trap composed of 53 places in 107 ms of which 1 ms to minimize.
[2022-05-16 19:03:34] [INFO ] Deduced a trap composed of 47 places in 111 ms of which 1 ms to minimize.
[2022-05-16 19:03:34] [INFO ] Deduced a trap composed of 33 places in 105 ms of which 0 ms to minimize.
[2022-05-16 19:03:34] [INFO ] Deduced a trap composed of 59 places in 93 ms of which 0 ms to minimize.
[2022-05-16 19:03:34] [INFO ] Deduced a trap composed of 91 places in 92 ms of which 0 ms to minimize.
[2022-05-16 19:03:35] [INFO ] Deduced a trap composed of 85 places in 124 ms of which 0 ms to minimize.
[2022-05-16 19:03:35] [INFO ] Deduced a trap composed of 86 places in 106 ms of which 0 ms to minimize.
[2022-05-16 19:03:35] [INFO ] Deduced a trap composed of 91 places in 93 ms of which 0 ms to minimize.
[2022-05-16 19:03:35] [INFO ] Deduced a trap composed of 75 places in 91 ms of which 0 ms to minimize.
[2022-05-16 19:03:35] [INFO ] Deduced a trap composed of 80 places in 111 ms of which 0 ms to minimize.
[2022-05-16 19:03:35] [INFO ] Trap strengthening (SAT) tested/added 30/29 trap constraints in 3624 ms
[2022-05-16 19:03:35] [INFO ] Computed and/alt/rep : 571/767/571 causal constraints (skipped 0 transitions) in 24 ms.
[2022-05-16 19:03:36] [INFO ] Deduced a trap composed of 8 places in 147 ms of which 1 ms to minimize.
[2022-05-16 19:03:36] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 7
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:906)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:849)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:595)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:428)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
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:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 1, 1, 1, 1] Max seen :[0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Parikh walk after 26100 steps, including 100 resets, run finished after 82 ms. (steps per millisecond=318 ) properties (out of 8) seen :1 could not realise parikh vector
FORMULA AutoFlight-PT-06b-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 36400 steps, including 127 resets, run finished after 85 ms. (steps per millisecond=428 ) properties (out of 7) seen :2 could not realise parikh vector
FORMULA AutoFlight-PT-06b-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA AutoFlight-PT-06b-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 5 out of 574 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 574/574 places, 572/572 transitions.
Drop transitions removed 224 transitions
Trivial Post-agglo rules discarded 224 transitions
Performed 224 trivial Post agglomeration. Transition count delta: 224
Iterating post reduction 0 with 224 rules applied. Total rules applied 224 place count 574 transition count 348
Reduce places removed 224 places and 0 transitions.
Ensure Unique test removed 30 transitions
Reduce isomorphic transitions removed 30 transitions.
Drop transitions removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 1 with 266 rules applied. Total rules applied 490 place count 350 transition count 306
Reduce places removed 12 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 13 rules applied. Total rules applied 503 place count 338 transition count 305
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 504 place count 337 transition count 305
Performed 76 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 76 Pre rules applied. Total rules applied 504 place count 337 transition count 229
Deduced a syphon composed of 76 places in 0 ms
Reduce places removed 76 places and 0 transitions.
Iterating global reduction 4 with 152 rules applied. Total rules applied 656 place count 261 transition count 229
Discarding 54 places :
Symmetric choice reduction at 4 with 54 rule applications. Total rules 710 place count 207 transition count 175
Iterating global reduction 4 with 54 rules applied. Total rules applied 764 place count 207 transition count 175
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 18 Pre rules applied. Total rules applied 764 place count 207 transition count 157
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 4 with 36 rules applied. Total rules applied 800 place count 189 transition count 157
Performed 46 Post agglomeration using F-continuation condition.Transition count delta: 46
Deduced a syphon composed of 46 places in 0 ms
Reduce places removed 46 places and 0 transitions.
Iterating global reduction 4 with 92 rules applied. Total rules applied 892 place count 143 transition count 111
Free-agglomeration rule applied 24 times.
Iterating global reduction 4 with 24 rules applied. Total rules applied 916 place count 143 transition count 87
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 4 with 24 rules applied. Total rules applied 940 place count 119 transition count 87
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 941 place count 118 transition count 86
Reduce places removed 22 places and 0 transitions.
Drop transitions removed 27 transitions
Trivial Post-agglo rules discarded 27 transitions
Performed 27 trivial Post agglomeration. Transition count delta: 27
Iterating post reduction 5 with 49 rules applied. Total rules applied 990 place count 96 transition count 59
Reduce places removed 27 places and 0 transitions.
Iterating post reduction 6 with 27 rules applied. Total rules applied 1017 place count 69 transition count 59
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 16 Pre rules applied. Total rules applied 1017 place count 69 transition count 43
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 7 with 32 rules applied. Total rules applied 1049 place count 53 transition count 43
Applied a total of 1049 rules in 142 ms. Remains 53 /574 variables (removed 521) and now considering 43/572 (removed 529) transitions.
Finished structural reductions, in 1 iterations. Remains : 53/574 places, 43/572 transitions.
// Phase 1: matrix 43 rows 53 cols
[2022-05-16 19:03:37] [INFO ] Computed 18 place invariants in 0 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 973 ms. (steps per millisecond=1027 ) properties (out of 5) seen :5
FORMULA AutoFlight-PT-06b-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-06b-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-06b-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-06b-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-06b-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.

BK_STOP 1652727818456

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

+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ cut -d . -f 9
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
+ VERSION=0
+ echo 'Running Version 0'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination UpperBounds -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m

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="AutoFlight-PT-06b"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2021"
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-4028"
echo " Executing tool gold2021"
echo " Input is AutoFlight-PT-06b, 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 r010-tajo-165245701800172"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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