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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 364K
-rw-r--r-- 1 mcc users 7.6K Apr 30 01:43 CTLCardinality.txt
-rw-r--r-- 1 mcc users 88K Apr 30 01:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.9K Apr 30 01:42 CTLFireability.txt
-rw-r--r-- 1 mcc users 68K Apr 30 01:42 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.1K May 9 07:04 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K 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 113K 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-05b-UpperBounds-00
FORMULA_NAME AutoFlight-PT-05b-UpperBounds-01
FORMULA_NAME AutoFlight-PT-05b-UpperBounds-02
FORMULA_NAME AutoFlight-PT-05b-UpperBounds-03
FORMULA_NAME AutoFlight-PT-05b-UpperBounds-04
FORMULA_NAME AutoFlight-PT-05b-UpperBounds-05
FORMULA_NAME AutoFlight-PT-05b-UpperBounds-06
FORMULA_NAME AutoFlight-PT-05b-UpperBounds-07
FORMULA_NAME AutoFlight-PT-05b-UpperBounds-08
FORMULA_NAME AutoFlight-PT-05b-UpperBounds-09
FORMULA_NAME AutoFlight-PT-05b-UpperBounds-10
FORMULA_NAME AutoFlight-PT-05b-UpperBounds-11
FORMULA_NAME AutoFlight-PT-05b-UpperBounds-12
FORMULA_NAME AutoFlight-PT-05b-UpperBounds-13
FORMULA_NAME AutoFlight-PT-05b-UpperBounds-14
FORMULA_NAME AutoFlight-PT-05b-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1652727752309

Running Version 0
[2022-05-16 19:02:33] [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:33] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-16 19:02:33] [INFO ] Load time of PNML (sax parser for PT used): 64 ms
[2022-05-16 19:02:33] [INFO ] Transformed 482 places.
[2022-05-16 19:02:33] [INFO ] Transformed 480 transitions.
[2022-05-16 19:02:34] [INFO ] Found NUPN structural information;
[2022-05-16 19:02:34] [INFO ] Parsed PT model containing 482 places and 480 transitions in 106 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
// Phase 1: matrix 480 rows 482 cols
[2022-05-16 19:02:34] [INFO ] Computed 34 place invariants in 22 ms
Incomplete random walk after 10000 steps, including 41 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 16) seen :12
FORMULA AutoFlight-PT-05b-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-05b-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-05b-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-05b-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-05b-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-05b-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-05b-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-05b-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-05b-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-05b-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-05b-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-05b-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 4) 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 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 4) seen :0
// Phase 1: matrix 480 rows 482 cols
[2022-05-16 19:02:34] [INFO ] Computed 34 place invariants in 4 ms
[2022-05-16 19:02:34] [INFO ] [Real]Absence check using 33 positive place invariants in 19 ms returned sat
[2022-05-16 19:02:34] [INFO ] [Real]Absence check using 33 positive and 1 generalized place invariants in 1 ms returned sat
[2022-05-16 19:02:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 19:02:34] [INFO ] [Real]Absence check using state equation in 121 ms returned sat
[2022-05-16 19:02:34] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 19:02:34] [INFO ] [Nat]Absence check using 33 positive place invariants in 13 ms returned sat
[2022-05-16 19:02:34] [INFO ] [Nat]Absence check using 33 positive and 1 generalized place invariants in 1 ms returned sat
[2022-05-16 19:02:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 19:02:34] [INFO ] [Nat]Absence check using state equation in 124 ms returned sat
[2022-05-16 19:02:34] [INFO ] Deduced a trap composed of 23 places in 157 ms of which 4 ms to minimize.
[2022-05-16 19:02:35] [INFO ] Deduced a trap composed of 26 places in 100 ms of which 1 ms to minimize.
[2022-05-16 19:02:35] [INFO ] Deduced a trap composed of 44 places in 85 ms of which 1 ms to minimize.
[2022-05-16 19:02:35] [INFO ] Deduced a trap composed of 47 places in 85 ms of which 2 ms to minimize.
[2022-05-16 19:02:35] [INFO ] Deduced a trap composed of 20 places in 84 ms of which 1 ms to minimize.
[2022-05-16 19:02:35] [INFO ] Deduced a trap composed of 26 places in 76 ms of which 0 ms to minimize.
[2022-05-16 19:02:35] [INFO ] Deduced a trap composed of 65 places in 68 ms of which 0 ms to minimize.
[2022-05-16 19:02:35] [INFO ] Deduced a trap composed of 49 places in 69 ms of which 1 ms to minimize.
[2022-05-16 19:02:35] [INFO ] Deduced a trap composed of 60 places in 56 ms of which 0 ms to minimize.
[2022-05-16 19:02:35] [INFO ] Deduced a trap composed of 49 places in 82 ms of which 0 ms to minimize.
[2022-05-16 19:02:36] [INFO ] Deduced a trap composed of 65 places in 99 ms of which 0 ms to minimize.
[2022-05-16 19:02:36] [INFO ] Deduced a trap composed of 64 places in 64 ms of which 1 ms to minimize.
[2022-05-16 19:02:36] [INFO ] Deduced a trap composed of 63 places in 56 ms of which 0 ms to minimize.
[2022-05-16 19:02:36] [INFO ] Deduced a trap composed of 63 places in 55 ms of which 1 ms to minimize.
[2022-05-16 19:02:36] [INFO ] Deduced a trap composed of 54 places in 52 ms of which 1 ms to minimize.
[2022-05-16 19:02:36] [INFO ] Deduced a trap composed of 17 places in 50 ms of which 0 ms to minimize.
[2022-05-16 19:02:36] [INFO ] Trap strengthening (SAT) tested/added 17/16 trap constraints in 1630 ms
[2022-05-16 19:02:36] [INFO ] Computed and/alt/rep : 479/644/479 causal constraints (skipped 0 transitions) in 34 ms.
[2022-05-16 19:02:39] [INFO ] Deduced a trap composed of 83 places in 98 ms of which 1 ms to minimize.
[2022-05-16 19:02:39] [INFO ] Deduced a trap composed of 75 places in 55 ms of which 1 ms to minimize.
[2022-05-16 19:02:39] [INFO ] Deduced a trap composed of 57 places in 59 ms of which 1 ms to minimize.
[2022-05-16 19:02:39] [INFO ] Deduced a trap composed of 70 places in 64 ms of which 1 ms to minimize.
[2022-05-16 19:02:39] [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: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:02:39] [INFO ] [Real]Absence check using 33 positive place invariants in 22 ms returned sat
[2022-05-16 19:02:39] [INFO ] [Real]Absence check using 33 positive and 1 generalized place invariants in 1 ms returned sat
[2022-05-16 19:02:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 19:02:39] [INFO ] [Real]Absence check using state equation in 132 ms returned sat
[2022-05-16 19:02:39] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 19:02:39] [INFO ] [Nat]Absence check using 33 positive place invariants in 18 ms returned sat
[2022-05-16 19:02:39] [INFO ] [Nat]Absence check using 33 positive and 1 generalized place invariants in 1 ms returned sat
[2022-05-16 19:02:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 19:02:40] [INFO ] [Nat]Absence check using state equation in 165 ms returned sat
[2022-05-16 19:02:40] [INFO ] Deduced a trap composed of 28 places in 136 ms of which 1 ms to minimize.
[2022-05-16 19:02:40] [INFO ] Deduced a trap composed of 63 places in 111 ms of which 1 ms to minimize.
[2022-05-16 19:02:40] [INFO ] Deduced a trap composed of 77 places in 130 ms of which 1 ms to minimize.
[2022-05-16 19:02:40] [INFO ] Deduced a trap composed of 36 places in 103 ms of which 0 ms to minimize.
[2022-05-16 19:02:40] [INFO ] Deduced a trap composed of 34 places in 94 ms of which 0 ms to minimize.
[2022-05-16 19:02:40] [INFO ] Deduced a trap composed of 40 places in 95 ms of which 0 ms to minimize.
[2022-05-16 19:02:41] [INFO ] Deduced a trap composed of 41 places in 85 ms of which 0 ms to minimize.
[2022-05-16 19:02:41] [INFO ] Deduced a trap composed of 67 places in 87 ms of which 1 ms to minimize.
[2022-05-16 19:02:41] [INFO ] Deduced a trap composed of 51 places in 85 ms of which 0 ms to minimize.
[2022-05-16 19:02:41] [INFO ] Deduced a trap composed of 61 places in 101 ms of which 1 ms to minimize.
[2022-05-16 19:02:41] [INFO ] Deduced a trap composed of 38 places in 81 ms of which 1 ms to minimize.
[2022-05-16 19:02:41] [INFO ] Deduced a trap composed of 55 places in 90 ms of which 0 ms to minimize.
[2022-05-16 19:02:41] [INFO ] Deduced a trap composed of 47 places in 76 ms of which 0 ms to minimize.
[2022-05-16 19:02:41] [INFO ] Deduced a trap composed of 50 places in 78 ms of which 1 ms to minimize.
[2022-05-16 19:02:41] [INFO ] Deduced a trap composed of 61 places in 77 ms of which 5 ms to minimize.
[2022-05-16 19:02:42] [INFO ] Deduced a trap composed of 95 places in 68 ms of which 0 ms to minimize.
[2022-05-16 19:02:42] [INFO ] Deduced a trap composed of 49 places in 75 ms of which 1 ms to minimize.
[2022-05-16 19:02:42] [INFO ] Deduced a trap composed of 79 places in 70 ms of which 0 ms to minimize.
[2022-05-16 19:02:42] [INFO ] Deduced a trap composed of 102 places in 71 ms of which 1 ms to minimize.
[2022-05-16 19:02:42] [INFO ] Deduced a trap composed of 71 places in 74 ms of which 1 ms to minimize.
[2022-05-16 19:02:42] [INFO ] Deduced a trap composed of 91 places in 70 ms of which 1 ms to minimize.
[2022-05-16 19:02:42] [INFO ] Deduced a trap composed of 85 places in 66 ms of which 0 ms to minimize.
[2022-05-16 19:02:42] [INFO ] Deduced a trap composed of 71 places in 60 ms of which 0 ms to minimize.
[2022-05-16 19:02:42] [INFO ] Deduced a trap composed of 79 places in 80 ms of which 1 ms to minimize.
[2022-05-16 19:02:42] [INFO ] Trap strengthening (SAT) tested/added 25/24 trap constraints in 2692 ms
[2022-05-16 19:02:42] [INFO ] Computed and/alt/rep : 479/644/479 causal constraints (skipped 0 transitions) in 27 ms.
[2022-05-16 19:02:44] [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:02:45] [INFO ] [Real]Absence check using 33 positive place invariants in 17 ms returned sat
[2022-05-16 19:02:45] [INFO ] [Real]Absence check using 33 positive and 1 generalized place invariants in 1 ms returned sat
[2022-05-16 19:02:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 19:02:45] [INFO ] [Real]Absence check using state equation in 139 ms returned sat
[2022-05-16 19:02:45] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 19:02:45] [INFO ] [Nat]Absence check using 33 positive place invariants in 14 ms returned sat
[2022-05-16 19:02:45] [INFO ] [Nat]Absence check using 33 positive and 1 generalized place invariants in 1 ms returned sat
[2022-05-16 19:02:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 19:02:45] [INFO ] [Nat]Absence check using state equation in 135 ms returned sat
[2022-05-16 19:02:45] [INFO ] Deduced a trap composed of 26 places in 132 ms of which 0 ms to minimize.
[2022-05-16 19:02:45] [INFO ] Deduced a trap composed of 27 places in 98 ms of which 1 ms to minimize.
[2022-05-16 19:02:45] [INFO ] Deduced a trap composed of 56 places in 98 ms of which 0 ms to minimize.
[2022-05-16 19:02:45] [INFO ] Deduced a trap composed of 23 places in 93 ms of which 1 ms to minimize.
[2022-05-16 19:02:46] [INFO ] Deduced a trap composed of 26 places in 84 ms of which 1 ms to minimize.
[2022-05-16 19:02:46] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 598 ms
[2022-05-16 19:02:46] [INFO ] Computed and/alt/rep : 479/644/479 causal constraints (skipped 0 transitions) in 33 ms.
[2022-05-16 19:02:48] [INFO ] Deduced a trap composed of 57 places in 96 ms of which 0 ms to minimize.
[2022-05-16 19:02:48] [INFO ] Deduced a trap composed of 47 places in 114 ms of which 2 ms to minimize.
[2022-05-16 19:02:48] [INFO ] Deduced a trap composed of 54 places in 99 ms of which 1 ms to minimize.
[2022-05-16 19:02:48] [INFO ] Deduced a trap composed of 41 places in 100 ms of which 0 ms to minimize.
[2022-05-16 19:02:49] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 580 ms
[2022-05-16 19:02:49] [INFO ] Added : 439 causal constraints over 89 iterations in 3033 ms. Result :sat
Minimization took 122 ms.
[2022-05-16 19:02:49] [INFO ] [Real]Absence check using 33 positive place invariants in 18 ms returned sat
[2022-05-16 19:02:49] [INFO ] [Real]Absence check using 33 positive and 1 generalized place invariants in 1 ms returned sat
[2022-05-16 19:02:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 19:02:49] [INFO ] [Real]Absence check using state equation in 166 ms returned sat
[2022-05-16 19:02:49] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 19:02:49] [INFO ] [Nat]Absence check using 33 positive place invariants in 19 ms returned sat
[2022-05-16 19:02:49] [INFO ] [Nat]Absence check using 33 positive and 1 generalized place invariants in 1 ms returned sat
[2022-05-16 19:02:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 19:02:49] [INFO ] [Nat]Absence check using state equation in 141 ms returned sat
[2022-05-16 19:02:49] [INFO ] Deduced a trap composed of 47 places in 108 ms of which 1 ms to minimize.
[2022-05-16 19:02:50] [INFO ] Deduced a trap composed of 19 places in 109 ms of which 1 ms to minimize.
[2022-05-16 19:02:50] [INFO ] Deduced a trap composed of 38 places in 109 ms of which 1 ms to minimize.
[2022-05-16 19:02:50] [INFO ] Deduced a trap composed of 23 places in 112 ms of which 0 ms to minimize.
[2022-05-16 19:02:50] [INFO ] Deduced a trap composed of 45 places in 118 ms of which 0 ms to minimize.
[2022-05-16 19:02:50] [INFO ] Deduced a trap composed of 43 places in 127 ms of which 1 ms to minimize.
[2022-05-16 19:02:50] [INFO ] Deduced a trap composed of 35 places in 125 ms of which 0 ms to minimize.
[2022-05-16 19:02:50] [INFO ] Deduced a trap composed of 31 places in 113 ms of which 1 ms to minimize.
[2022-05-16 19:02:51] [INFO ] Deduced a trap composed of 26 places in 116 ms of which 0 ms to minimize.
[2022-05-16 19:02:51] [INFO ] Deduced a trap composed of 28 places in 89 ms of which 1 ms to minimize.
[2022-05-16 19:02:51] [INFO ] Deduced a trap composed of 44 places in 117 ms of which 1 ms to minimize.
[2022-05-16 19:02:51] [INFO ] Deduced a trap composed of 79 places in 110 ms of which 0 ms to minimize.
[2022-05-16 19:02:51] [INFO ] Deduced a trap composed of 27 places in 105 ms of which 0 ms to minimize.
[2022-05-16 19:02:51] [INFO ] Deduced a trap composed of 81 places in 86 ms of which 2 ms to minimize.
[2022-05-16 19:02:51] [INFO ] Deduced a trap composed of 40 places in 84 ms of which 3 ms to minimize.
[2022-05-16 19:02:51] [INFO ] Deduced a trap composed of 37 places in 86 ms of which 8 ms to minimize.
[2022-05-16 19:02:51] [INFO ] Trap strengthening (SAT) tested/added 17/16 trap constraints in 2120 ms
[2022-05-16 19:02:51] [INFO ] Computed and/alt/rep : 479/644/479 causal constraints (skipped 0 transitions) in 36 ms.
[2022-05-16 19:02:54] [INFO ] Deduced a trap composed of 8 places in 149 ms of which 1 ms to minimize.
[2022-05-16 19:02:54] [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)
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1] Max seen :[0, 0, 0, 0]
Incomplete Parikh walk after 20300 steps, including 99 resets, run finished after 82 ms. (steps per millisecond=247 ) properties (out of 4) seen :1 could not realise parikh vector
FORMULA AutoFlight-PT-05b-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 3 out of 482 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 482/482 places, 480/480 transitions.
Drop transitions removed 186 transitions
Trivial Post-agglo rules discarded 186 transitions
Performed 186 trivial Post agglomeration. Transition count delta: 186
Iterating post reduction 0 with 186 rules applied. Total rules applied 186 place count 482 transition count 294
Reduce places removed 186 places and 0 transitions.
Ensure Unique test removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Drop transitions removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 1 with 221 rules applied. Total rules applied 407 place count 296 transition count 259
Reduce places removed 10 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 11 rules applied. Total rules applied 418 place count 286 transition count 258
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 419 place count 285 transition count 258
Performed 67 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 67 Pre rules applied. Total rules applied 419 place count 285 transition count 191
Deduced a syphon composed of 67 places in 1 ms
Reduce places removed 67 places and 0 transitions.
Iterating global reduction 4 with 134 rules applied. Total rules applied 553 place count 218 transition count 191
Discarding 45 places :
Symmetric choice reduction at 4 with 45 rule applications. Total rules 598 place count 173 transition count 146
Iterating global reduction 4 with 45 rules applied. Total rules applied 643 place count 173 transition count 146
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 14 Pre rules applied. Total rules applied 643 place count 173 transition count 132
Deduced a syphon composed of 14 places in 1 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 4 with 28 rules applied. Total rules applied 671 place count 159 transition count 132
Performed 39 Post agglomeration using F-continuation condition.Transition count delta: 39
Deduced a syphon composed of 39 places in 0 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 4 with 78 rules applied. Total rules applied 749 place count 120 transition count 93
Free-agglomeration rule applied 20 times.
Iterating global reduction 4 with 20 rules applied. Total rules applied 769 place count 120 transition count 73
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 4 with 20 rules applied. Total rules applied 789 place count 100 transition count 73
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 790 place count 99 transition count 72
Reduce places removed 18 places and 0 transitions.
Drop transitions removed 19 transitions
Trivial Post-agglo rules discarded 19 transitions
Performed 19 trivial Post agglomeration. Transition count delta: 19
Iterating post reduction 5 with 37 rules applied. Total rules applied 827 place count 81 transition count 53
Reduce places removed 19 places and 0 transitions.
Iterating post reduction 6 with 19 rules applied. Total rules applied 846 place count 62 transition count 53
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 17 Pre rules applied. Total rules applied 846 place count 62 transition count 36
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 7 with 34 rules applied. Total rules applied 880 place count 45 transition count 36
Applied a total of 880 rules in 106 ms. Remains 45 /482 variables (removed 437) and now considering 36/480 (removed 444) transitions.
Finished structural reductions, in 1 iterations. Remains : 45/482 places, 36/480 transitions.
// Phase 1: matrix 36 rows 45 cols
[2022-05-16 19:02:54] [INFO ] Computed 16 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 1282 ms. (steps per millisecond=780 ) properties (out of 3) seen :3
FORMULA AutoFlight-PT-05b-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-05b-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-05b-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.

BK_STOP 1652727776439

--------------------
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
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
++ cut -d . -f 9
+ 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-05b"
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-05b, 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-165245701700166"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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