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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 480K
-rw-r--r-- 1 mcc users 6.8K Apr 30 01:56 CTLCardinality.txt
-rw-r--r-- 1 mcc users 75K Apr 30 01:56 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.6K Apr 30 01:55 CTLFireability.txt
-rw-r--r-- 1 mcc users 38K Apr 30 01:55 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 22K 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 18K 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 266K 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-12b-UpperBounds-00
FORMULA_NAME AutoFlight-PT-12b-UpperBounds-01
FORMULA_NAME AutoFlight-PT-12b-UpperBounds-02
FORMULA_NAME AutoFlight-PT-12b-UpperBounds-03
FORMULA_NAME AutoFlight-PT-12b-UpperBounds-04
FORMULA_NAME AutoFlight-PT-12b-UpperBounds-05
FORMULA_NAME AutoFlight-PT-12b-UpperBounds-06
FORMULA_NAME AutoFlight-PT-12b-UpperBounds-07
FORMULA_NAME AutoFlight-PT-12b-UpperBounds-08
FORMULA_NAME AutoFlight-PT-12b-UpperBounds-09
FORMULA_NAME AutoFlight-PT-12b-UpperBounds-10
FORMULA_NAME AutoFlight-PT-12b-UpperBounds-11
FORMULA_NAME AutoFlight-PT-12b-UpperBounds-12
FORMULA_NAME AutoFlight-PT-12b-UpperBounds-13
FORMULA_NAME AutoFlight-PT-12b-UpperBounds-14
FORMULA_NAME AutoFlight-PT-12b-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1652663160480

Running Version 202205111006
[2022-05-16 01:06:01] [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:06:01] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-16 01:06:02] [INFO ] Load time of PNML (sax parser for PT used): 152 ms
[2022-05-16 01:06:02] [INFO ] Transformed 1126 places.
[2022-05-16 01:06:02] [INFO ] Transformed 1124 transitions.
[2022-05-16 01:06:02] [INFO ] Found NUPN structural information;
[2022-05-16 01:06:02] [INFO ] Parsed PT model containing 1126 places and 1124 transitions in 291 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 6 ms.
// Phase 1: matrix 1124 rows 1126 cols
[2022-05-16 01:06:02] [INFO ] Computed 76 place invariants in 30 ms
Incomplete random walk after 10000 steps, including 18 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 16) seen :12
FORMULA AutoFlight-PT-12b-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-12b-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-12b-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-12b-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-12b-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-12b-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-12b-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-12b-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-12b-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-12b-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-12b-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-12b-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 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 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 4) seen :0
// Phase 1: matrix 1124 rows 1126 cols
[2022-05-16 01:06:02] [INFO ] Computed 76 place invariants in 14 ms
[2022-05-16 01:06:02] [INFO ] [Real]Absence check using 75 positive place invariants in 56 ms returned sat
[2022-05-16 01:06:02] [INFO ] [Real]Absence check using 75 positive and 1 generalized place invariants in 3 ms returned sat
[2022-05-16 01:06:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 01:06:02] [INFO ] [Real]Absence check using state equation in 334 ms returned sat
[2022-05-16 01:06:03] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 01:06:03] [INFO ] [Nat]Absence check using 75 positive place invariants in 46 ms returned sat
[2022-05-16 01:06:03] [INFO ] [Nat]Absence check using 75 positive and 1 generalized place invariants in 2 ms returned sat
[2022-05-16 01:06:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 01:06:03] [INFO ] [Nat]Absence check using state equation in 420 ms returned sat
[2022-05-16 01:06:04] [INFO ] Deduced a trap composed of 22 places in 382 ms of which 9 ms to minimize.
[2022-05-16 01:06:04] [INFO ] Deduced a trap composed of 32 places in 384 ms of which 2 ms to minimize.
[2022-05-16 01:06:05] [INFO ] Deduced a trap composed of 36 places in 414 ms of which 1 ms to minimize.
[2022-05-16 01:06:05] [INFO ] Deduced a trap composed of 21 places in 307 ms of which 2 ms to minimize.
[2022-05-16 01:06:05] [INFO ] Deduced a trap composed of 19 places in 296 ms of which 1 ms to minimize.
[2022-05-16 01:06:06] [INFO ] Deduced a trap composed of 18 places in 223 ms of which 1 ms to minimize.
[2022-05-16 01:06:06] [INFO ] Deduced a trap composed of 15 places in 221 ms of which 0 ms to minimize.
[2022-05-16 01:06:06] [INFO ] Deduced a trap composed of 31 places in 260 ms of which 1 ms to minimize.
[2022-05-16 01:06:06] [INFO ] Deduced a trap composed of 19 places in 252 ms of which 1 ms to minimize.
[2022-05-16 01:06:07] [INFO ] Deduced a trap composed of 28 places in 229 ms of which 1 ms to minimize.
[2022-05-16 01:06:07] [INFO ] Deduced a trap composed of 34 places in 232 ms of which 0 ms to minimize.
[2022-05-16 01:06:07] [INFO ] Deduced a trap composed of 25 places in 226 ms of which 1 ms to minimize.
[2022-05-16 01:06:07] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 4030 ms
[2022-05-16 01:06:07] [INFO ] Computed and/alt/rep : 1121/1477/1121 causal constraints (skipped 2 transitions) in 64 ms.
[2022-05-16 01:06:08] [INFO ] Deduced a trap composed of 25 places in 442 ms of which 1 ms to minimize.
[2022-05-16 01:06:08] [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:06:09] [INFO ] [Real]Absence check using 75 positive place invariants in 42 ms returned sat
[2022-05-16 01:06:09] [INFO ] [Real]Absence check using 75 positive and 1 generalized place invariants in 3 ms returned sat
[2022-05-16 01:06:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 01:06:09] [INFO ] [Real]Absence check using state equation in 412 ms returned sat
[2022-05-16 01:06:09] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 01:06:09] [INFO ] [Nat]Absence check using 75 positive place invariants in 41 ms returned sat
[2022-05-16 01:06:09] [INFO ] [Nat]Absence check using 75 positive and 1 generalized place invariants in 2 ms returned sat
[2022-05-16 01:06:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 01:06:10] [INFO ] [Nat]Absence check using state equation in 346 ms returned sat
[2022-05-16 01:06:10] [INFO ] Deduced a trap composed of 21 places in 321 ms of which 1 ms to minimize.
[2022-05-16 01:06:10] [INFO ] Deduced a trap composed of 28 places in 318 ms of which 1 ms to minimize.
[2022-05-16 01:06:11] [INFO ] Deduced a trap composed of 25 places in 306 ms of which 0 ms to minimize.
[2022-05-16 01:06:11] [INFO ] Deduced a trap composed of 78 places in 265 ms of which 1 ms to minimize.
[2022-05-16 01:06:11] [INFO ] Deduced a trap composed of 33 places in 332 ms of which 1 ms to minimize.
[2022-05-16 01:06:12] [INFO ] Deduced a trap composed of 36 places in 280 ms of which 1 ms to minimize.
[2022-05-16 01:06:12] [INFO ] Deduced a trap composed of 99 places in 332 ms of which 1 ms to minimize.
[2022-05-16 01:06:12] [INFO ] Deduced a trap composed of 77 places in 297 ms of which 1 ms to minimize.
[2022-05-16 01:06:13] [INFO ] Deduced a trap composed of 74 places in 288 ms of which 1 ms to minimize.
[2022-05-16 01:06:13] [INFO ] Deduced a trap composed of 77 places in 285 ms of which 1 ms to minimize.
[2022-05-16 01:06:13] [INFO ] Deduced a trap composed of 130 places in 282 ms of which 1 ms to minimize.
[2022-05-16 01:06:14] [INFO ] Deduced a trap composed of 102 places in 257 ms of which 0 ms to minimize.
[2022-05-16 01:06:14] [INFO ] Deduced a trap composed of 78 places in 262 ms of which 0 ms to minimize.
[2022-05-16 01:06:15] [INFO ] Deduced a trap composed of 25 places in 478 ms of which 1 ms to minimize.
[2022-05-16 01:06: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 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:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1257)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:918)
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:06:15] [INFO ] [Real]Absence check using 75 positive place invariants in 45 ms returned sat
[2022-05-16 01:06:15] [INFO ] [Real]Absence check using 75 positive and 1 generalized place invariants in 2 ms returned sat
[2022-05-16 01:06:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 01:06:15] [INFO ] [Real]Absence check using state equation in 407 ms returned sat
[2022-05-16 01:06:15] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 01:06:16] [INFO ] [Nat]Absence check using 75 positive place invariants in 41 ms returned sat
[2022-05-16 01:06:16] [INFO ] [Nat]Absence check using 75 positive and 1 generalized place invariants in 1 ms returned sat
[2022-05-16 01:06:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 01:06:16] [INFO ] [Nat]Absence check using state equation in 366 ms returned sat
[2022-05-16 01:06:16] [INFO ] Deduced a trap composed of 18 places in 279 ms of which 1 ms to minimize.
[2022-05-16 01:06:17] [INFO ] Deduced a trap composed of 31 places in 295 ms of which 1 ms to minimize.
[2022-05-16 01:06:17] [INFO ] Deduced a trap composed of 15 places in 269 ms of which 1 ms to minimize.
[2022-05-16 01:06:17] [INFO ] Deduced a trap composed of 75 places in 287 ms of which 1 ms to minimize.
[2022-05-16 01:06:17] [INFO ] Deduced a trap composed of 19 places in 242 ms of which 0 ms to minimize.
[2022-05-16 01:06:18] [INFO ] Deduced a trap composed of 25 places in 276 ms of which 1 ms to minimize.
[2022-05-16 01:06:18] [INFO ] Deduced a trap composed of 71 places in 255 ms of which 0 ms to minimize.
[2022-05-16 01:06:18] [INFO ] Deduced a trap composed of 71 places in 223 ms of which 3 ms to minimize.
[2022-05-16 01:06:19] [INFO ] Deduced a trap composed of 79 places in 237 ms of which 1 ms to minimize.
[2022-05-16 01:06:19] [INFO ] Deduced a trap composed of 60 places in 214 ms of which 1 ms to minimize.
[2022-05-16 01:06:19] [INFO ] Deduced a trap composed of 100 places in 231 ms of which 1 ms to minimize.
[2022-05-16 01:06:19] [INFO ] Deduced a trap composed of 59 places in 208 ms of which 1 ms to minimize.
[2022-05-16 01:06:20] [INFO ] Deduced a trap composed of 66 places in 213 ms of which 0 ms to minimize.
[2022-05-16 01:06:20] [INFO ] Deduced a trap composed of 62 places in 216 ms of which 0 ms to minimize.
[2022-05-16 01:06:20] [INFO ] Deduced a trap composed of 88 places in 242 ms of which 1 ms to minimize.
[2022-05-16 01:06:20] [INFO ] Deduced a trap composed of 74 places in 193 ms of which 1 ms to minimize.
[2022-05-16 01:06: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 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:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1257)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:918)
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:06:21] [INFO ] [Real]Absence check using 75 positive place invariants in 34 ms returned sat
[2022-05-16 01:06:21] [INFO ] [Real]Absence check using 75 positive and 1 generalized place invariants in 2 ms returned sat
[2022-05-16 01:06:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 01:06:21] [INFO ] [Real]Absence check using state equation in 359 ms returned sat
[2022-05-16 01:06:21] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 01:06:21] [INFO ] [Nat]Absence check using 75 positive place invariants in 41 ms returned sat
[2022-05-16 01:06:21] [INFO ] [Nat]Absence check using 75 positive and 1 generalized place invariants in 2 ms returned sat
[2022-05-16 01:06:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 01:06:22] [INFO ] [Nat]Absence check using state equation in 331 ms returned sat
[2022-05-16 01:06:22] [INFO ] Deduced a trap composed of 25 places in 250 ms of which 0 ms to minimize.
[2022-05-16 01:06:22] [INFO ] Deduced a trap composed of 22 places in 183 ms of which 1 ms to minimize.
[2022-05-16 01:06:22] [INFO ] Deduced a trap composed of 18 places in 265 ms of which 1 ms to minimize.
[2022-05-16 01:06:23] [INFO ] Deduced a trap composed of 21 places in 274 ms of which 1 ms to minimize.
[2022-05-16 01:06:23] [INFO ] Deduced a trap composed of 31 places in 257 ms of which 1 ms to minimize.
[2022-05-16 01:06:23] [INFO ] Deduced a trap composed of 22 places in 245 ms of which 1 ms to minimize.
[2022-05-16 01:06:24] [INFO ] Deduced a trap composed of 15 places in 252 ms of which 0 ms to minimize.
[2022-05-16 01:06:24] [INFO ] Deduced a trap composed of 19 places in 242 ms of which 1 ms to minimize.
[2022-05-16 01:06:24] [INFO ] Deduced a trap composed of 28 places in 227 ms of which 1 ms to minimize.
[2022-05-16 01:06:24] [INFO ] Deduced a trap composed of 27 places in 194 ms of which 0 ms to minimize.
[2022-05-16 01:06:25] [INFO ] Deduced a trap composed of 30 places in 221 ms of which 0 ms to minimize.
[2022-05-16 01:06:25] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 3055 ms
[2022-05-16 01:06:25] [INFO ] Computed and/alt/rep : 1121/1477/1121 causal constraints (skipped 2 transitions) in 71 ms.
[2022-05-16 01:06:26] [INFO ] Deduced a trap composed of 25 places in 467 ms of which 1 ms to minimize.
[2022-05-16 01:06: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 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: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] Max seen :[0, 0, 0, 0]
Support contains 4 out of 1126 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1126/1126 places, 1124/1124 transitions.
Drop transitions removed 447 transitions
Trivial Post-agglo rules discarded 447 transitions
Performed 447 trivial Post agglomeration. Transition count delta: 447
Iterating post reduction 0 with 447 rules applied. Total rules applied 447 place count 1126 transition count 677
Reduce places removed 447 places and 0 transitions.
Ensure Unique test removed 60 transitions
Reduce isomorphic transitions removed 60 transitions.
Drop transitions removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 1 with 531 rules applied. Total rules applied 978 place count 679 transition count 593
Reduce places removed 24 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 25 rules applied. Total rules applied 1003 place count 655 transition count 592
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1004 place count 654 transition count 592
Performed 148 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 148 Pre rules applied. Total rules applied 1004 place count 654 transition count 444
Deduced a syphon composed of 148 places in 1 ms
Reduce places removed 148 places and 0 transitions.
Iterating global reduction 4 with 296 rules applied. Total rules applied 1300 place count 506 transition count 444
Discarding 108 places :
Symmetric choice reduction at 4 with 108 rule applications. Total rules 1408 place count 398 transition count 336
Iterating global reduction 4 with 108 rules applied. Total rules applied 1516 place count 398 transition count 336
Performed 36 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 36 Pre rules applied. Total rules applied 1516 place count 398 transition count 300
Deduced a syphon composed of 36 places in 1 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 4 with 72 rules applied. Total rules applied 1588 place count 362 transition count 300
Performed 87 Post agglomeration using F-continuation condition.Transition count delta: 87
Deduced a syphon composed of 87 places in 0 ms
Reduce places removed 87 places and 0 transitions.
Iterating global reduction 4 with 174 rules applied. Total rules applied 1762 place count 275 transition count 213
Free-agglomeration rule applied 48 times.
Iterating global reduction 4 with 48 rules applied. Total rules applied 1810 place count 275 transition count 165
Reduce places removed 48 places and 0 transitions.
Iterating post reduction 4 with 48 rules applied. Total rules applied 1858 place count 227 transition count 165
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 1859 place count 226 transition count 164
Reduce places removed 45 places and 0 transitions.
Drop transitions removed 71 transitions
Trivial Post-agglo rules discarded 71 transitions
Performed 71 trivial Post agglomeration. Transition count delta: 71
Iterating post reduction 5 with 116 rules applied. Total rules applied 1975 place count 181 transition count 93
Reduce places removed 71 places and 0 transitions.
Iterating post reduction 6 with 71 rules applied. Total rules applied 2046 place count 110 transition count 93
Performed 30 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 30 Pre rules applied. Total rules applied 2046 place count 110 transition count 63
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 7 with 60 rules applied. Total rules applied 2106 place count 80 transition count 63
Applied a total of 2106 rules in 154 ms. Remains 80 /1126 variables (removed 1046) and now considering 63/1124 (removed 1061) transitions.
Finished structural reductions, in 1 iterations. Remains : 80/1126 places, 63/1124 transitions.
// Phase 1: matrix 63 rows 80 cols
[2022-05-16 01:06:27] [INFO ] Computed 31 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 1479 ms. (steps per millisecond=676 ) properties (out of 4) seen :4
FORMULA AutoFlight-PT-12b-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-12b-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-12b-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-12b-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 26913 ms.

BK_STOP 1652663188731

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

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