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.r006-tajo-165245689400517.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 itstools
Input is AutoFlight-PT-96a, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r006-tajo-165245689400517
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 868K
-rw-r--r-- 1 mcc users 7.3K Apr 30 04:30 CTLCardinality.txt
-rw-r--r-- 1 mcc users 81K Apr 30 04:30 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K Apr 30 03:24 CTLFireability.txt
-rw-r--r-- 1 mcc users 43K Apr 30 03:24 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 4.1K May 9 07:05 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K May 9 07:05 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 9 07:05 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 9 07:05 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 9 07:05 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 9 07:05 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 629K 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-96a-UpperBounds-00
FORMULA_NAME AutoFlight-PT-96a-UpperBounds-01
FORMULA_NAME AutoFlight-PT-96a-UpperBounds-02
FORMULA_NAME AutoFlight-PT-96a-UpperBounds-03
FORMULA_NAME AutoFlight-PT-96a-UpperBounds-04
FORMULA_NAME AutoFlight-PT-96a-UpperBounds-05
FORMULA_NAME AutoFlight-PT-96a-UpperBounds-06
FORMULA_NAME AutoFlight-PT-96a-UpperBounds-07
FORMULA_NAME AutoFlight-PT-96a-UpperBounds-08
FORMULA_NAME AutoFlight-PT-96a-UpperBounds-09
FORMULA_NAME AutoFlight-PT-96a-UpperBounds-10
FORMULA_NAME AutoFlight-PT-96a-UpperBounds-11
FORMULA_NAME AutoFlight-PT-96a-UpperBounds-12
FORMULA_NAME AutoFlight-PT-96a-UpperBounds-13
FORMULA_NAME AutoFlight-PT-96a-UpperBounds-14
FORMULA_NAME AutoFlight-PT-96a-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1652665036708

Running Version 202205111006
[2022-05-16 01:37:17] [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 01:37:17] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-16 01:37:18] [INFO ] Load time of PNML (sax parser for PT used): 143 ms
[2022-05-16 01:37:18] [INFO ] Transformed 2251 places.
[2022-05-16 01:37:18] [INFO ] Transformed 2225 transitions.
[2022-05-16 01:37:18] [INFO ] Found NUPN structural information;
[2022-05-16 01:37:18] [INFO ] Parsed PT model containing 2251 places and 2225 transitions in 258 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 6 ms.
Ensure Unique test removed 384 transitions
Reduce redundant transitions removed 384 transitions.
// Phase 1: matrix 1841 rows 2251 cols
[2022-05-16 01:37:18] [INFO ] Computed 514 place invariants in 53 ms
Incomplete random walk after 10000 steps, including 37 resets, run finished after 165 ms. (steps per millisecond=60 ) properties (out of 16) seen :10
FORMULA AutoFlight-PT-96a-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-96a-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-96a-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-96a-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-96a-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-96a-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-96a-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-96a-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-96a-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-96a-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 6) seen :0
// Phase 1: matrix 1841 rows 2251 cols
[2022-05-16 01:37:18] [INFO ] Computed 514 place invariants in 15 ms
[2022-05-16 01:37:19] [INFO ] [Real]Absence check using 513 positive place invariants in 110 ms returned sat
[2022-05-16 01:37:19] [INFO ] [Real]Absence check using 513 positive and 1 generalized place invariants in 3 ms returned sat
[2022-05-16 01:37:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 01:37:20] [INFO ] [Real]Absence check using state equation in 605 ms returned sat
[2022-05-16 01:37:20] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 01:37:20] [INFO ] [Nat]Absence check using 513 positive place invariants in 148 ms returned sat
[2022-05-16 01:37:20] [INFO ] [Nat]Absence check using 513 positive and 1 generalized place invariants in 2 ms returned sat
[2022-05-16 01:37:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 01:37:21] [INFO ] [Nat]Absence check using state equation in 839 ms returned sat
[2022-05-16 01:37:21] [INFO ] State equation strengthened by 384 read => feed constraints.
[2022-05-16 01:37:21] [INFO ] [Nat]Added 384 Read/Feed constraints in 50 ms returned sat
[2022-05-16 01:37:21] [INFO ] Computed and/alt/rep : 1632/3072/1632 causal constraints (skipped 208 transitions) in 106 ms.
[2022-05-16 01:37:26] [INFO ] Deduced a trap composed of 2 places in 1415 ms of which 6 ms to minimize.
[2022-05-16 01:37: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 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:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1257)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1179)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:925)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2622)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:639)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
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:136)
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:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2022-05-16 01:37:27] [INFO ] [Real]Absence check using 513 positive place invariants in 184 ms returned sat
[2022-05-16 01:37:27] [INFO ] [Real]Absence check using 513 positive and 1 generalized place invariants in 3 ms returned sat
[2022-05-16 01:37:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 01:37:27] [INFO ] [Real]Absence check using state equation in 819 ms returned sat
[2022-05-16 01:37:28] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 01:37:28] [INFO ] [Nat]Absence check using 513 positive place invariants in 152 ms returned sat
[2022-05-16 01:37:28] [INFO ] [Nat]Absence check using 513 positive and 1 generalized place invariants in 4 ms returned sat
[2022-05-16 01:37:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 01:37:29] [INFO ] [Nat]Absence check using state equation in 949 ms returned sat
[2022-05-16 01:37:29] [INFO ] [Nat]Added 384 Read/Feed constraints in 36 ms returned sat
[2022-05-16 01:37:29] [INFO ] Computed and/alt/rep : 1632/3072/1632 causal constraints (skipped 208 transitions) in 181 ms.
[2022-05-16 01:37:33] [INFO ] Added : 95 causal constraints over 19 iterations in 3457 ms. Result :unknown
[2022-05-16 01:37:33] [INFO ] [Real]Absence check using 513 positive place invariants in 159 ms returned sat
[2022-05-16 01:37:33] [INFO ] [Real]Absence check using 513 positive and 1 generalized place invariants in 2 ms returned sat
[2022-05-16 01:37:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 01:37:34] [INFO ] [Real]Absence check using state equation in 880 ms returned sat
[2022-05-16 01:37:34] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 01:37:35] [INFO ] [Nat]Absence check using 513 positive place invariants in 160 ms returned sat
[2022-05-16 01:37:35] [INFO ] [Nat]Absence check using 513 positive and 1 generalized place invariants in 2 ms returned sat
[2022-05-16 01:37:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 01:37:35] [INFO ] [Nat]Absence check using state equation in 723 ms returned sat
[2022-05-16 01:37:35] [INFO ] [Nat]Added 384 Read/Feed constraints in 38 ms returned sat
[2022-05-16 01:37:36] [INFO ] Computed and/alt/rep : 1632/3072/1632 causal constraints (skipped 208 transitions) in 112 ms.
[2022-05-16 01:37:39] [INFO ] Added : 110 causal constraints over 22 iterations in 3606 ms. Result :unknown
[2022-05-16 01:37:40] [INFO ] [Real]Absence check using 513 positive place invariants in 160 ms returned sat
[2022-05-16 01:37:40] [INFO ] [Real]Absence check using 513 positive and 1 generalized place invariants in 4 ms returned sat
[2022-05-16 01:37:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 01:37:40] [INFO ] [Real]Absence check using state equation in 729 ms returned sat
[2022-05-16 01:37:40] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 01:37:41] [INFO ] [Nat]Absence check using 513 positive place invariants in 162 ms returned sat
[2022-05-16 01:37:41] [INFO ] [Nat]Absence check using 513 positive and 1 generalized place invariants in 5 ms returned sat
[2022-05-16 01:37:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 01:37:42] [INFO ] [Nat]Absence check using state equation in 831 ms returned sat
[2022-05-16 01:37:42] [INFO ] [Nat]Added 384 Read/Feed constraints in 39 ms returned sat
[2022-05-16 01:37:42] [INFO ] Computed and/alt/rep : 1632/3072/1632 causal constraints (skipped 208 transitions) in 132 ms.
[2022-05-16 01:37:45] [INFO ] Added : 100 causal constraints over 20 iterations in 3472 ms. Result :unknown
[2022-05-16 01:37:46] [INFO ] [Real]Absence check using 513 positive place invariants in 192 ms returned sat
[2022-05-16 01:37:46] [INFO ] [Real]Absence check using 513 positive and 1 generalized place invariants in 2 ms returned sat
[2022-05-16 01:37:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 01:37:47] [INFO ] [Real]Absence check using state equation in 798 ms returned sat
[2022-05-16 01:37:47] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 01:37:47] [INFO ] [Nat]Absence check using 513 positive place invariants in 106 ms returned sat
[2022-05-16 01:37:47] [INFO ] [Nat]Absence check using 513 positive and 1 generalized place invariants in 1 ms returned sat
[2022-05-16 01:37:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 01:37:48] [INFO ] [Nat]Absence check using state equation in 720 ms returned sat
[2022-05-16 01:37:48] [INFO ] [Nat]Added 384 Read/Feed constraints in 31 ms returned sat
[2022-05-16 01:37:48] [INFO ] Computed and/alt/rep : 1632/3072/1632 causal constraints (skipped 208 transitions) in 108 ms.
[2022-05-16 01:37:52] [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:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1188)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:925)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2622)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:639)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
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:136)
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:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2022-05-16 01:37:52] [INFO ] [Real]Absence check using 513 positive place invariants in 154 ms returned sat
[2022-05-16 01:37:52] [INFO ] [Real]Absence check using 513 positive and 1 generalized place invariants in 3 ms returned sat
[2022-05-16 01:37:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 01:37:53] [INFO ] [Real]Absence check using state equation in 750 ms returned sat
[2022-05-16 01:37:53] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 01:37:54] [INFO ] [Nat]Absence check using 513 positive place invariants in 156 ms returned sat
[2022-05-16 01:37:54] [INFO ] [Nat]Absence check using 513 positive and 1 generalized place invariants in 2 ms returned sat
[2022-05-16 01:37:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 01:37:54] [INFO ] [Nat]Absence check using state equation in 703 ms returned sat
[2022-05-16 01:37:55] [INFO ] [Nat]Added 384 Read/Feed constraints in 30 ms returned sat
[2022-05-16 01:37:55] [INFO ] Computed and/alt/rep : 1632/3072/1632 causal constraints (skipped 208 transitions) in 123 ms.
[2022-05-16 01:38:00] [INFO ] Deduced a trap composed of 2 places in 1329 ms of which 3 ms to minimize.
[2022-05-16 01:38:00] [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:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1257)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1179)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:925)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2622)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:639)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
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:136)
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:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 1, 1] Max seen :[0, 0, 0, 0, 0, 0]
FORMULA AutoFlight-PT-96a-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA AutoFlight-PT-96a-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA AutoFlight-PT-96a-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA AutoFlight-PT-96a-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 2 out of 2251 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 2251/2251 places, 1841/1841 transitions.
Drop transitions removed 437 transitions
Trivial Post-agglo rules discarded 437 transitions
Performed 437 trivial Post agglomeration. Transition count delta: 437
Iterating post reduction 0 with 437 rules applied. Total rules applied 437 place count 2251 transition count 1404
Reduce places removed 437 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 438 rules applied. Total rules applied 875 place count 1814 transition count 1403
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 876 place count 1813 transition count 1403
Performed 136 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 136 Pre rules applied. Total rules applied 876 place count 1813 transition count 1267
Deduced a syphon composed of 136 places in 3 ms
Reduce places removed 136 places and 0 transitions.
Iterating global reduction 3 with 272 rules applied. Total rules applied 1148 place count 1677 transition count 1267
Performed 144 Post agglomeration using F-continuation condition.Transition count delta: 144
Deduced a syphon composed of 144 places in 1 ms
Reduce places removed 144 places and 0 transitions.
Iterating global reduction 3 with 288 rules applied. Total rules applied 1436 place count 1533 transition count 1123
Free-agglomeration rule applied 144 times.
Iterating global reduction 3 with 144 rules applied. Total rules applied 1580 place count 1533 transition count 979
Reduce places removed 144 places and 0 transitions.
Iterating post reduction 3 with 144 rules applied. Total rules applied 1724 place count 1389 transition count 979
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 1725 place count 1388 transition count 978
Reduce places removed 408 places and 0 transitions.
Drop transitions removed 660 transitions
Trivial Post-agglo rules discarded 660 transitions
Performed 660 trivial Post agglomeration. Transition count delta: 660
Iterating post reduction 4 with 1068 rules applied. Total rules applied 2793 place count 980 transition count 318
Reduce places removed 660 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 5 with 662 rules applied. Total rules applied 3455 place count 320 transition count 316
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 3457 place count 318 transition count 316
Performed 104 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 104 Pre rules applied. Total rules applied 3457 place count 318 transition count 212
Deduced a syphon composed of 104 places in 0 ms
Reduce places removed 104 places and 0 transitions.
Iterating global reduction 7 with 208 rules applied. Total rules applied 3665 place count 214 transition count 212
Applied a total of 3665 rules in 677 ms. Remains 214 /2251 variables (removed 2037) and now considering 212/1841 (removed 1629) transitions.
Finished structural reductions, in 1 iterations. Remains : 214/2251 places, 212/1841 transitions.
// Phase 1: matrix 212 rows 214 cols
[2022-05-16 01:38:03] [INFO ] Computed 106 place invariants in 2 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 15261 ms. (steps per millisecond=65 ) properties (out of 2) seen :2
FORMULA AutoFlight-PT-96a-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-96a-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 60604 ms.

BK_STOP 1652665098638

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

+ export LANG=C
+ LANG=C
+ 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
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -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=@none -Xss128m -Xms40m -Xmx8192m

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-96a"
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-4028"
echo " Executing tool itstools"
echo " Input is AutoFlight-PT-96a, 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 r006-tajo-165245689400517"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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