Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r005-oct2-167813593100445.qcow2', fmt=qcow2 cluster_size=65536 extended_l2=off compression_type=zlib size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 backing_fmt=qcow2 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool itstools
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 r005-oct2-167813593100445
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 548K
-rw-r--r-- 1 mcc users 6.0K Feb 25 18:08 CTLCardinality.txt
-rw-r--r-- 1 mcc users 63K Feb 25 18:08 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Feb 25 18:08 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K Feb 25 18:08 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.6K Feb 25 15:32 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 15:32 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 15:32 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 15:32 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Feb 25 18:09 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 147K Feb 25 18:09 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Feb 25 18:09 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 42K Feb 25 18:09 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 15:32 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 15:32 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 113K Mar 5 18:22 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 1678513439318

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=AutoFlight-PT-05b
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202303021504
[2023-03-11 05:44:02] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-11 05:44:02] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-11 05:44:02] [INFO ] Load time of PNML (sax parser for PT used): 73 ms
[2023-03-11 05:44:02] [INFO ] Transformed 482 places.
[2023-03-11 05:44:02] [INFO ] Transformed 480 transitions.
[2023-03-11 05:44:02] [INFO ] Found NUPN structural information;
[2023-03-11 05:44:02] [INFO ] Parsed PT model containing 482 places and 480 transitions and 1120 arcs in 145 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 5 ms.
// Phase 1: matrix 480 rows 482 cols
[2023-03-11 05:44:02] [INFO ] Computed 34 place invariants in 17 ms
Incomplete random walk after 10000 steps, including 41 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 16) seen :11
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-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-05b-UpperBounds-05 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
FORMULA AutoFlight-PT-05b-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 5) seen :0
[2023-03-11 05:44:02] [INFO ] Invariant cache hit.
[2023-03-11 05:44:02] [INFO ] [Real]Absence check using 33 positive place invariants in 29 ms returned sat
[2023-03-11 05:44:02] [INFO ] [Real]Absence check using 33 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-11 05:44:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 05:44:03] [INFO ] [Real]Absence check using state equation in 315 ms returned sat
[2023-03-11 05:44:03] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 05:44:03] [INFO ] [Nat]Absence check using 33 positive place invariants in 21 ms returned sat
[2023-03-11 05:44:03] [INFO ] [Nat]Absence check using 33 positive and 1 generalized place invariants in 16 ms returned sat
[2023-03-11 05:44:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 05:44:04] [INFO ] [Nat]Absence check using state equation in 517 ms returned sat
[2023-03-11 05:44:04] [INFO ] Deduced a trap composed of 39 places in 169 ms of which 3 ms to minimize.
[2023-03-11 05:44:04] [INFO ] Deduced a trap composed of 43 places in 111 ms of which 1 ms to minimize.
[2023-03-11 05:44:04] [INFO ] Deduced a trap composed of 50 places in 133 ms of which 14 ms to minimize.
[2023-03-11 05:44:04] [INFO ] Deduced a trap composed of 20 places in 268 ms of which 40 ms to minimize.
[2023-03-11 05:44:05] [INFO ] Deduced a trap composed of 17 places in 232 ms of which 1 ms to minimize.
[2023-03-11 05:44:05] [INFO ] Deduced a trap composed of 37 places in 227 ms of which 1 ms to minimize.
[2023-03-11 05:44:05] [INFO ] Deduced a trap composed of 49 places in 279 ms of which 1 ms to minimize.
[2023-03-11 05:44:05] [INFO ] Deduced a trap composed of 40 places in 154 ms of which 0 ms to minimize.
[2023-03-11 05:44:06] [INFO ] Deduced a trap composed of 32 places in 123 ms of which 0 ms to minimize.
[2023-03-11 05:44:06] [INFO ] Deduced a trap composed of 38 places in 223 ms of which 1 ms to minimize.
[2023-03-11 05:44:06] [INFO ] Deduced a trap composed of 66 places in 139 ms of which 1 ms to minimize.
[2023-03-11 05:44:06] [INFO ] Deduced a trap composed of 44 places in 338 ms of which 1 ms to minimize.
[2023-03-11 05:44:07] [INFO ] Deduced a trap composed of 50 places in 134 ms of which 0 ms to minimize.
[2023-03-11 05:44:07] [INFO ] Deduced a trap composed of 47 places in 155 ms of which 14 ms to minimize.
[2023-03-11 05:44:07] [INFO ] Deduced a trap composed of 48 places in 201 ms of which 1 ms to minimize.
[2023-03-11 05:44:07] [INFO ] Deduced a trap composed of 53 places in 557 ms of which 1 ms to minimize.
[2023-03-11 05:44:08] [INFO ] Deduced a trap composed of 46 places in 158 ms of which 1 ms to minimize.
[2023-03-11 05:44:08] [INFO ] Deduced a trap composed of 60 places in 277 ms of which 1 ms to minimize.
[2023-03-11 05:44: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:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:916)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
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:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java: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)
[2023-03-11 05:44:08] [INFO ] [Real]Absence check using 33 positive place invariants in 33 ms returned sat
[2023-03-11 05:44:08] [INFO ] [Real]Absence check using 33 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-11 05:44:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 05:44:08] [INFO ] [Real]Absence check using state equation in 211 ms returned sat
[2023-03-11 05:44:08] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 05:44:09] [INFO ] [Nat]Absence check using 33 positive place invariants in 46 ms returned sat
[2023-03-11 05:44:09] [INFO ] [Nat]Absence check using 33 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-11 05:44:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 05:44:09] [INFO ] [Nat]Absence check using state equation in 253 ms returned sat
[2023-03-11 05:44:09] [INFO ] Deduced a trap composed of 67 places in 325 ms of which 23 ms to minimize.
[2023-03-11 05:44:09] [INFO ] Deduced a trap composed of 20 places in 164 ms of which 0 ms to minimize.
[2023-03-11 05:44:10] [INFO ] Deduced a trap composed of 65 places in 137 ms of which 0 ms to minimize.
[2023-03-11 05:44:10] [INFO ] Deduced a trap composed of 74 places in 110 ms of which 1 ms to minimize.
[2023-03-11 05:44:10] [INFO ] Deduced a trap composed of 84 places in 195 ms of which 1 ms to minimize.
[2023-03-11 05:44:10] [INFO ] Deduced a trap composed of 43 places in 269 ms of which 1 ms to minimize.
[2023-03-11 05:44:10] [INFO ] Deduced a trap composed of 23 places in 164 ms of which 1 ms to minimize.
[2023-03-11 05:44:11] [INFO ] Deduced a trap composed of 70 places in 151 ms of which 1 ms to minimize.
[2023-03-11 05:44:11] [INFO ] Deduced a trap composed of 68 places in 214 ms of which 1 ms to minimize.
[2023-03-11 05:44:11] [INFO ] Deduced a trap composed of 26 places in 202 ms of which 0 ms to minimize.
[2023-03-11 05:44:11] [INFO ] Deduced a trap composed of 73 places in 376 ms of which 1 ms to minimize.
[2023-03-11 05:44:12] [INFO ] Deduced a trap composed of 70 places in 154 ms of which 1 ms to minimize.
[2023-03-11 05:44:12] [INFO ] Deduced a trap composed of 80 places in 415 ms of which 3 ms to minimize.
[2023-03-11 05:44:12] [INFO ] Deduced a trap composed of 86 places in 112 ms of which 1 ms to minimize.
[2023-03-11 05:44:12] [INFO ] Deduced a trap composed of 48 places in 233 ms of which 1 ms to minimize.
[2023-03-11 05:44:13] [INFO ] Deduced a trap composed of 41 places in 156 ms of which 3 ms to minimize.
[2023-03-11 05:44:13] [INFO ] Deduced a trap composed of 52 places in 139 ms of which 1 ms to minimize.
[2023-03-11 05:44:13] [INFO ] Deduced a trap composed of 61 places in 129 ms of which 1 ms to minimize.
[2023-03-11 05:44:13] [INFO ] Deduced a trap composed of 68 places in 176 ms of which 1 ms to minimize.
[2023-03-11 05:44:13] [INFO ] Deduced a trap composed of 74 places in 200 ms of which 1 ms to minimize.
[2023-03-11 05:44:13] [INFO ] Trap strengthening (SAT) tested/added 21/20 trap constraints in 4513 ms
[2023-03-11 05:44:13] [INFO ] Computed and/alt/rep : 479/644/479 causal constraints (skipped 0 transitions) in 67 ms.
[2023-03-11 05:44:13] [INFO ] Added : 0 causal constraints over 0 iterations in 81 ms. Result :unknown
[2023-03-11 05:44:14] [INFO ] [Real]Absence check using 33 positive place invariants in 123 ms returned sat
[2023-03-11 05:44:14] [INFO ] [Real]Absence check using 33 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-11 05:44:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 05:44:14] [INFO ] [Real]Absence check using state equation in 148 ms returned sat
[2023-03-11 05:44:14] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 05:44:14] [INFO ] [Nat]Absence check using 33 positive place invariants in 96 ms returned sat
[2023-03-11 05:44:14] [INFO ] [Nat]Absence check using 33 positive and 1 generalized place invariants in 25 ms returned sat
[2023-03-11 05:44:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 05:44:14] [INFO ] [Nat]Absence check using state equation in 402 ms returned sat
[2023-03-11 05:44:15] [INFO ] Deduced a trap composed of 62 places in 247 ms of which 1 ms to minimize.
[2023-03-11 05:44:15] [INFO ] Deduced a trap composed of 55 places in 171 ms of which 0 ms to minimize.
[2023-03-11 05:44:16] [INFO ] Deduced a trap composed of 39 places in 562 ms of which 0 ms to minimize.
[2023-03-11 05:44:16] [INFO ] Deduced a trap composed of 47 places in 239 ms of which 1 ms to minimize.
[2023-03-11 05:44:16] [INFO ] Deduced a trap composed of 65 places in 179 ms of which 2 ms to minimize.
[2023-03-11 05:44:16] [INFO ] Deduced a trap composed of 74 places in 353 ms of which 1 ms to minimize.
[2023-03-11 05:44:17] [INFO ] Deduced a trap composed of 62 places in 147 ms of which 1 ms to minimize.
[2023-03-11 05:44:17] [INFO ] Deduced a trap composed of 79 places in 134 ms of which 0 ms to minimize.
[2023-03-11 05:44:17] [INFO ] Deduced a trap composed of 31 places in 153 ms of which 1 ms to minimize.
[2023-03-11 05:44:17] [INFO ] Deduced a trap composed of 37 places in 175 ms of which 0 ms to minimize.
[2023-03-11 05:44:17] [INFO ] Deduced a trap composed of 28 places in 147 ms of which 0 ms to minimize.
[2023-03-11 05:44:17] [INFO ] Deduced a trap composed of 39 places in 176 ms of which 0 ms to minimize.
[2023-03-11 05:44:18] [INFO ] Deduced a trap composed of 51 places in 118 ms of which 13 ms to minimize.
[2023-03-11 05:44:18] [INFO ] Deduced a trap composed of 52 places in 135 ms of which 1 ms to minimize.
[2023-03-11 05:44:18] [INFO ] Deduced a trap composed of 17 places in 160 ms of which 0 ms to minimize.
[2023-03-11 05:44:18] [INFO ] Deduced a trap composed of 80 places in 105 ms of which 0 ms to minimize.
[2023-03-11 05:44:18] [INFO ] Deduced a trap composed of 95 places in 129 ms of which 4 ms to minimize.
[2023-03-11 05:44:18] [INFO ] Deduced a trap composed of 78 places in 102 ms of which 1 ms to minimize.
[2023-03-11 05:44:19] [INFO ] Deduced a trap composed of 36 places in 170 ms of which 14 ms to minimize.
[2023-03-11 05:44:19] [INFO ] Deduced a trap composed of 58 places in 151 ms of which 0 ms to minimize.
[2023-03-11 05:44:19] [INFO ] Deduced a trap composed of 94 places in 122 ms of which 3 ms to minimize.
[2023-03-11 05:44:19] [INFO ] Trap strengthening (SAT) tested/added 21/21 trap constraints in 4391 ms
[2023-03-11 05:44:19] [INFO ] [Real]Absence check using 33 positive place invariants in 28 ms returned sat
[2023-03-11 05:44:19] [INFO ] [Real]Absence check using 33 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-11 05:44:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 05:44:19] [INFO ] [Real]Absence check using state equation in 239 ms returned sat
[2023-03-11 05:44:19] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 05:44:20] [INFO ] [Nat]Absence check using 33 positive place invariants in 30 ms returned sat
[2023-03-11 05:44:20] [INFO ] [Nat]Absence check using 33 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-11 05:44:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 05:44:20] [INFO ] [Nat]Absence check using state equation in 395 ms returned sat
[2023-03-11 05:44:20] [INFO ] Deduced a trap composed of 49 places in 147 ms of which 1 ms to minimize.
[2023-03-11 05:44:20] [INFO ] Deduced a trap composed of 39 places in 124 ms of which 1 ms to minimize.
[2023-03-11 05:44:20] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 348 ms
[2023-03-11 05:44:20] [INFO ] Computed and/alt/rep : 479/644/479 causal constraints (skipped 0 transitions) in 42 ms.
[2023-03-11 05:44:24] [INFO ] Added : 390 causal constraints over 78 iterations in 4085 ms. Result :unknown
[2023-03-11 05:44:25] [INFO ] [Real]Absence check using 33 positive place invariants in 55 ms returned sat
[2023-03-11 05:44:25] [INFO ] [Real]Absence check using 33 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-11 05:44:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 05:44:25] [INFO ] [Real]Absence check using state equation in 233 ms returned sat
[2023-03-11 05:44:25] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 05:44:25] [INFO ] [Nat]Absence check using 33 positive place invariants in 13 ms returned sat
[2023-03-11 05:44:25] [INFO ] [Nat]Absence check using 33 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-11 05:44:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 05:44:25] [INFO ] [Nat]Absence check using state equation in 192 ms returned sat
[2023-03-11 05:44:25] [INFO ] Deduced a trap composed of 26 places in 126 ms of which 1 ms to minimize.
[2023-03-11 05:44:26] [INFO ] Deduced a trap composed of 56 places in 114 ms of which 1 ms to minimize.
[2023-03-11 05:44:26] [INFO ] Deduced a trap composed of 46 places in 223 ms of which 1 ms to minimize.
[2023-03-11 05:44:26] [INFO ] Deduced a trap composed of 19 places in 152 ms of which 2 ms to minimize.
[2023-03-11 05:44:26] [INFO ] Deduced a trap composed of 62 places in 134 ms of which 1 ms to minimize.
[2023-03-11 05:44:27] [INFO ] Deduced a trap composed of 39 places in 349 ms of which 1 ms to minimize.
[2023-03-11 05:44:27] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1290 ms
[2023-03-11 05:44:27] [INFO ] Computed and/alt/rep : 479/644/479 causal constraints (skipped 0 transitions) in 51 ms.
[2023-03-11 05:44:30] [INFO ] Deduced a trap composed of 8 places in 253 ms of which 1 ms to minimize.
[2023-03-11 05:44:30] [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:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
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:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java: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] Max seen :[0, 0, 0, 0, 0]
FORMULA AutoFlight-PT-05b-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA AutoFlight-PT-05b-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA AutoFlight-PT-05b-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA AutoFlight-PT-05b-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA AutoFlight-PT-05b-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
All properties solved without resorting to model-checking.
Total runtime 28872 ms.

BK_STOP 1678513471232

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="AutoFlight-PT-05b"
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-5348"
echo " Executing tool itstools"
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 r005-oct2-167813593100445"
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 ;