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.r007-oct2-167813595500445.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 lolaxred
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 r007-oct2-167813595500445
=====================================================================

--------------------
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 1678348879208

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=lolaxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=AutoFlight-PT-05b
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-09 08:01:21] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-09 08:01:21] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-09 08:01:21] [INFO ] Load time of PNML (sax parser for PT used): 59 ms
[2023-03-09 08:01:21] [INFO ] Transformed 482 places.
[2023-03-09 08:01:21] [INFO ] Transformed 480 transitions.
[2023-03-09 08:01:21] [INFO ] Found NUPN structural information;
[2023-03-09 08:01:21] [INFO ] Parsed PT model containing 482 places and 480 transitions and 1120 arcs in 138 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 4 ms.
// Phase 1: matrix 480 rows 482 cols
[2023-03-09 08:01:21] [INFO ] Computed 34 place invariants in 12 ms
Incomplete random walk after 10000 steps, including 40 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 16) seen :12
FORMULA AutoFlight-PT-05b-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-05b-UpperBounds-13 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 18 ms. (steps per millisecond=555 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 4) seen :0
[2023-03-09 08:01:21] [INFO ] Invariant cache hit.
[2023-03-09 08:01:22] [INFO ] [Real]Absence check using 33 positive place invariants in 33 ms returned sat
[2023-03-09 08:01:22] [INFO ] [Real]Absence check using 33 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-09 08:01:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 08:01:22] [INFO ] [Real]Absence check using state equation in 241 ms returned sat
[2023-03-09 08:01:22] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 08:01:22] [INFO ] [Nat]Absence check using 33 positive place invariants in 15 ms returned sat
[2023-03-09 08:01:22] [INFO ] [Nat]Absence check using 33 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-09 08:01:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 08:01:23] [INFO ] [Nat]Absence check using state equation in 336 ms returned sat
[2023-03-09 08:01:23] [INFO ] Deduced a trap composed of 39 places in 240 ms of which 5 ms to minimize.
[2023-03-09 08:01:23] [INFO ] Deduced a trap composed of 43 places in 162 ms of which 1 ms to minimize.
[2023-03-09 08:01:23] [INFO ] Deduced a trap composed of 50 places in 126 ms of which 2 ms to minimize.
[2023-03-09 08:01:23] [INFO ] Deduced a trap composed of 20 places in 118 ms of which 1 ms to minimize.
[2023-03-09 08:01:23] [INFO ] Deduced a trap composed of 17 places in 102 ms of which 1 ms to minimize.
[2023-03-09 08:01:24] [INFO ] Deduced a trap composed of 37 places in 130 ms of which 1 ms to minimize.
[2023-03-09 08:01:24] [INFO ] Deduced a trap composed of 49 places in 92 ms of which 1 ms to minimize.
[2023-03-09 08:01:24] [INFO ] Deduced a trap composed of 40 places in 121 ms of which 1 ms to minimize.
[2023-03-09 08:01:24] [INFO ] Deduced a trap composed of 32 places in 185 ms of which 0 ms to minimize.
[2023-03-09 08:01:24] [INFO ] Deduced a trap composed of 38 places in 137 ms of which 0 ms to minimize.
[2023-03-09 08:01:24] [INFO ] Deduced a trap composed of 66 places in 118 ms of which 0 ms to minimize.
[2023-03-09 08:01:24] [INFO ] Deduced a trap composed of 44 places in 105 ms of which 1 ms to minimize.
[2023-03-09 08:01:25] [INFO ] Deduced a trap composed of 50 places in 111 ms of which 1 ms to minimize.
[2023-03-09 08:01:25] [INFO ] Deduced a trap composed of 47 places in 134 ms of which 0 ms to minimize.
[2023-03-09 08:01:25] [INFO ] Deduced a trap composed of 48 places in 98 ms of which 1 ms to minimize.
[2023-03-09 08:01:25] [INFO ] Deduced a trap composed of 53 places in 177 ms of which 1 ms to minimize.
[2023-03-09 08:01:25] [INFO ] Deduced a trap composed of 46 places in 242 ms of which 0 ms to minimize.
[2023-03-09 08:01:25] [INFO ] Deduced a trap composed of 60 places in 120 ms of which 1 ms to minimize.
[2023-03-09 08:01:26] [INFO ] Deduced a trap composed of 59 places in 70 ms of which 0 ms to minimize.
[2023-03-09 08:01:26] [INFO ] Trap strengthening (SAT) tested/added 20/19 trap constraints in 2996 ms
[2023-03-09 08:01:26] [INFO ] Computed and/alt/rep : 479/644/479 causal constraints (skipped 0 transitions) in 30 ms.
[2023-03-09 08:01:27] [INFO ] Deduced a trap composed of 8 places in 230 ms of which 1 ms to minimize.
[2023-03-09 08:01:27] [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.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)
[2023-03-09 08:01:27] [INFO ] [Real]Absence check using 33 positive place invariants in 21 ms returned sat
[2023-03-09 08:01:27] [INFO ] [Real]Absence check using 33 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-09 08:01:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 08:01:28] [INFO ] [Real]Absence check using state equation in 174 ms returned sat
[2023-03-09 08:01:28] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 08:01:28] [INFO ] [Nat]Absence check using 33 positive place invariants in 13 ms returned sat
[2023-03-09 08:01:28] [INFO ] [Nat]Absence check using 33 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-09 08:01:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 08:01:28] [INFO ] [Nat]Absence check using state equation in 126 ms returned sat
[2023-03-09 08:01:28] [INFO ] Deduced a trap composed of 67 places in 170 ms of which 0 ms to minimize.
[2023-03-09 08:01:28] [INFO ] Deduced a trap composed of 20 places in 159 ms of which 5 ms to minimize.
[2023-03-09 08:01:28] [INFO ] Deduced a trap composed of 65 places in 102 ms of which 1 ms to minimize.
[2023-03-09 08:01:29] [INFO ] Deduced a trap composed of 74 places in 114 ms of which 1 ms to minimize.
[2023-03-09 08:01:29] [INFO ] Deduced a trap composed of 84 places in 112 ms of which 0 ms to minimize.
[2023-03-09 08:01:29] [INFO ] Deduced a trap composed of 43 places in 106 ms of which 1 ms to minimize.
[2023-03-09 08:01:29] [INFO ] Deduced a trap composed of 23 places in 98 ms of which 1 ms to minimize.
[2023-03-09 08:01:29] [INFO ] Deduced a trap composed of 70 places in 102 ms of which 1 ms to minimize.
[2023-03-09 08:01:29] [INFO ] Deduced a trap composed of 68 places in 96 ms of which 0 ms to minimize.
[2023-03-09 08:01:29] [INFO ] Deduced a trap composed of 26 places in 103 ms of which 0 ms to minimize.
[2023-03-09 08:01:29] [INFO ] Deduced a trap composed of 73 places in 89 ms of which 0 ms to minimize.
[2023-03-09 08:01:29] [INFO ] Deduced a trap composed of 70 places in 85 ms of which 0 ms to minimize.
[2023-03-09 08:01:30] [INFO ] Deduced a trap composed of 80 places in 115 ms of which 0 ms to minimize.
[2023-03-09 08:01:30] [INFO ] Deduced a trap composed of 86 places in 133 ms of which 20 ms to minimize.
[2023-03-09 08:01:30] [INFO ] Deduced a trap composed of 48 places in 126 ms of which 4 ms to minimize.
[2023-03-09 08:01:30] [INFO ] Deduced a trap composed of 41 places in 71 ms of which 1 ms to minimize.
[2023-03-09 08:01:30] [INFO ] Deduced a trap composed of 52 places in 185 ms of which 1 ms to minimize.
[2023-03-09 08:01:30] [INFO ] Deduced a trap composed of 61 places in 80 ms of which 0 ms to minimize.
[2023-03-09 08:01:30] [INFO ] Deduced a trap composed of 68 places in 80 ms of which 3 ms to minimize.
[2023-03-09 08:01:30] [INFO ] Deduced a trap composed of 74 places in 71 ms of which 0 ms to minimize.
[2023-03-09 08:01:30] [INFO ] Trap strengthening (SAT) tested/added 21/20 trap constraints in 2547 ms
[2023-03-09 08:01:30] [INFO ] Computed and/alt/rep : 479/644/479 causal constraints (skipped 0 transitions) in 30 ms.
[2023-03-09 08:01:33] [INFO ] Deduced a trap composed of 8 places in 290 ms of which 2 ms to minimize.
[2023-03-09 08:01:33] [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: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)
[2023-03-09 08:01:33] [INFO ] [Real]Absence check using 33 positive place invariants in 19 ms returned sat
[2023-03-09 08:01:33] [INFO ] [Real]Absence check using 33 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-09 08:01:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 08:01:33] [INFO ] [Real]Absence check using state equation in 164 ms returned sat
[2023-03-09 08:01:33] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 08:01:33] [INFO ] [Nat]Absence check using 33 positive place invariants in 15 ms returned sat
[2023-03-09 08:01:33] [INFO ] [Nat]Absence check using 33 positive and 1 generalized place invariants in 10 ms returned sat
[2023-03-09 08:01:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 08:01:34] [INFO ] [Nat]Absence check using state equation in 135 ms returned sat
[2023-03-09 08:01:34] [INFO ] Deduced a trap composed of 62 places in 155 ms of which 1 ms to minimize.
[2023-03-09 08:01:34] [INFO ] Deduced a trap composed of 55 places in 122 ms of which 1 ms to minimize.
[2023-03-09 08:01:34] [INFO ] Deduced a trap composed of 39 places in 176 ms of which 1 ms to minimize.
[2023-03-09 08:01:34] [INFO ] Deduced a trap composed of 47 places in 108 ms of which 1 ms to minimize.
[2023-03-09 08:01:34] [INFO ] Deduced a trap composed of 65 places in 104 ms of which 1 ms to minimize.
[2023-03-09 08:01:34] [INFO ] Deduced a trap composed of 74 places in 98 ms of which 1 ms to minimize.
[2023-03-09 08:01:35] [INFO ] Deduced a trap composed of 62 places in 127 ms of which 0 ms to minimize.
[2023-03-09 08:01:35] [INFO ] Deduced a trap composed of 79 places in 106 ms of which 0 ms to minimize.
[2023-03-09 08:01:35] [INFO ] Deduced a trap composed of 31 places in 91 ms of which 1 ms to minimize.
[2023-03-09 08:01:35] [INFO ] Deduced a trap composed of 37 places in 109 ms of which 5 ms to minimize.
[2023-03-09 08:01:35] [INFO ] Deduced a trap composed of 28 places in 108 ms of which 1 ms to minimize.
[2023-03-09 08:01:35] [INFO ] Deduced a trap composed of 39 places in 104 ms of which 1 ms to minimize.
[2023-03-09 08:01:35] [INFO ] Deduced a trap composed of 51 places in 74 ms of which 0 ms to minimize.
[2023-03-09 08:01:35] [INFO ] Deduced a trap composed of 52 places in 119 ms of which 1 ms to minimize.
[2023-03-09 08:01:36] [INFO ] Deduced a trap composed of 17 places in 101 ms of which 14 ms to minimize.
[2023-03-09 08:01:36] [INFO ] Deduced a trap composed of 80 places in 104 ms of which 1 ms to minimize.
[2023-03-09 08:01:36] [INFO ] Deduced a trap composed of 95 places in 110 ms of which 0 ms to minimize.
[2023-03-09 08:01:36] [INFO ] Deduced a trap composed of 78 places in 111 ms of which 1 ms to minimize.
[2023-03-09 08:01:36] [INFO ] Deduced a trap composed of 36 places in 119 ms of which 0 ms to minimize.
[2023-03-09 08:01:36] [INFO ] Deduced a trap composed of 58 places in 92 ms of which 4 ms to minimize.
[2023-03-09 08:01:36] [INFO ] Deduced a trap composed of 94 places in 83 ms of which 1 ms to minimize.
[2023-03-09 08:01:36] [INFO ] Deduced a trap composed of 59 places in 94 ms of which 1 ms to minimize.
[2023-03-09 08:01:36] [INFO ] Deduced a trap composed of 73 places in 91 ms of which 0 ms to minimize.
[2023-03-09 08:01:37] [INFO ] Deduced a trap composed of 85 places in 118 ms of which 0 ms to minimize.
[2023-03-09 08:01:37] [INFO ] Deduced a trap composed of 79 places in 109 ms of which 1 ms to minimize.
[2023-03-09 08:01:37] [INFO ] Deduced a trap composed of 49 places in 174 ms of which 1 ms to minimize.
[2023-03-09 08:01:37] [INFO ] Trap strengthening (SAT) tested/added 27/26 trap constraints in 3366 ms
[2023-03-09 08:01:37] [INFO ] Computed and/alt/rep : 479/644/479 causal constraints (skipped 0 transitions) in 23 ms.
[2023-03-09 08:01:38] [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: Broken pipe ... 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: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1186)
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)
[2023-03-09 08:01:39] [INFO ] [Real]Absence check using 33 positive place invariants in 56 ms returned sat
[2023-03-09 08:01:39] [INFO ] [Real]Absence check using 33 positive and 1 generalized place invariants in 10 ms returned sat
[2023-03-09 08:01:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 08:01:39] [INFO ] [Real]Absence check using state equation in 171 ms returned sat
[2023-03-09 08:01:39] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 08:01:39] [INFO ] [Nat]Absence check using 33 positive place invariants in 17 ms returned sat
[2023-03-09 08:01:39] [INFO ] [Nat]Absence check using 33 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-09 08:01:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 08:01:39] [INFO ] [Nat]Absence check using state equation in 147 ms returned sat
[2023-03-09 08:01:39] [INFO ] Deduced a trap composed of 26 places in 109 ms of which 1 ms to minimize.
[2023-03-09 08:01:39] [INFO ] Deduced a trap composed of 56 places in 101 ms of which 4 ms to minimize.
[2023-03-09 08:01:39] [INFO ] Deduced a trap composed of 46 places in 139 ms of which 5 ms to minimize.
[2023-03-09 08:01:40] [INFO ] Deduced a trap composed of 19 places in 106 ms of which 0 ms to minimize.
[2023-03-09 08:01:40] [INFO ] Deduced a trap composed of 62 places in 94 ms of which 0 ms to minimize.
[2023-03-09 08:01:40] [INFO ] Deduced a trap composed of 39 places in 89 ms of which 0 ms to minimize.
[2023-03-09 08:01:40] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 763 ms
[2023-03-09 08:01:40] [INFO ] Computed and/alt/rep : 479/644/479 causal constraints (skipped 0 transitions) in 27 ms.
[2023-03-09 08:01:44] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 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:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1186)
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] Max seen :[0, 0, 0, 0]
Support contains 4 out of 482 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 482/482 places, 480/480 transitions.
Drop transitions removed 187 transitions
Trivial Post-agglo rules discarded 187 transitions
Performed 187 trivial Post agglomeration. Transition count delta: 187
Iterating post reduction 0 with 187 rules applied. Total rules applied 187 place count 482 transition count 293
Reduce places removed 187 places and 0 transitions.
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Drop transitions removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 1 with 221 rules applied. Total rules applied 408 place count 295 transition count 259
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 418 place count 285 transition count 259
Performed 64 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 64 Pre rules applied. Total rules applied 418 place count 285 transition count 195
Deduced a syphon composed of 64 places in 1 ms
Reduce places removed 64 places and 0 transitions.
Iterating global reduction 3 with 128 rules applied. Total rules applied 546 place count 221 transition count 195
Discarding 44 places :
Symmetric choice reduction at 3 with 44 rule applications. Total rules 590 place count 177 transition count 151
Iterating global reduction 3 with 44 rules applied. Total rules applied 634 place count 177 transition count 151
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 14 Pre rules applied. Total rules applied 634 place count 177 transition count 137
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 3 with 28 rules applied. Total rules applied 662 place count 163 transition count 137
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: 40
Deduced a syphon composed of 40 places in 0 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 3 with 80 rules applied. Total rules applied 742 place count 123 transition count 97
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 743 place count 123 transition count 96
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 745 place count 122 transition count 95
Free-agglomeration rule applied 20 times.
Iterating global reduction 3 with 20 rules applied. Total rules applied 765 place count 122 transition count 75
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 3 with 20 rules applied. Total rules applied 785 place count 102 transition count 75
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 786 place count 101 transition count 74
Reduce places removed 17 places and 0 transitions.
Drop transitions removed 17 transitions
Trivial Post-agglo rules discarded 17 transitions
Performed 17 trivial Post agglomeration. Transition count delta: 17
Iterating post reduction 4 with 34 rules applied. Total rules applied 820 place count 84 transition count 57
Reduce places removed 17 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 5 with 18 rules applied. Total rules applied 838 place count 67 transition count 56
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 839 place count 66 transition count 56
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 18 Pre rules applied. Total rules applied 839 place count 66 transition count 38
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 7 with 36 rules applied. Total rules applied 875 place count 48 transition count 38
Applied a total of 875 rules in 219 ms. Remains 48 /482 variables (removed 434) and now considering 38/480 (removed 442) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 219 ms. Remains : 48/482 places, 38/480 transitions.
// Phase 1: matrix 38 rows 48 cols
[2023-03-09 08:01:44] [INFO ] Computed 17 place invariants in 2 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 1021 ms. (steps per millisecond=979 ) properties (out of 4) seen :4
FORMULA AutoFlight-PT-05b-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-05b-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-05b-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-05b-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 23975 ms.
ITS solved all properties within timeout

BK_STOP 1678348905830

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

+ 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:
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -timeout 360 -rebuildPNML

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="lolaxred"
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 lolaxred"
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 r007-oct2-167813595500445"
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 ;