fond
Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r010-oct2-167813599100493
Last Updated
May 14, 2023

About the Execution of Marcie+red for AutoFlight-PT-24b

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
361.367 66557.00 85834.00 39.90 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 normal

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.r010-oct2-167813599100493.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 marciexred
Input is AutoFlight-PT-24b, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r010-oct2-167813599100493
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 884K
-rw-r--r-- 1 mcc users 6.1K Feb 25 18:17 CTLCardinality.txt
-rw-r--r-- 1 mcc users 60K Feb 25 18:17 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Feb 25 18:17 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K Feb 25 18:17 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.9K Feb 25 15:32 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 15:32 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Feb 25 15:32 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Feb 25 15:32 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.3K Feb 25 18:18 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 68K Feb 25 18:18 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.8K Feb 25 18:17 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 54K Feb 25 18:17 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 538K 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-24b-UpperBounds-00
FORMULA_NAME AutoFlight-PT-24b-UpperBounds-01
FORMULA_NAME AutoFlight-PT-24b-UpperBounds-02
FORMULA_NAME AutoFlight-PT-24b-UpperBounds-03
FORMULA_NAME AutoFlight-PT-24b-UpperBounds-04
FORMULA_NAME AutoFlight-PT-24b-UpperBounds-05
FORMULA_NAME AutoFlight-PT-24b-UpperBounds-06
FORMULA_NAME AutoFlight-PT-24b-UpperBounds-07
FORMULA_NAME AutoFlight-PT-24b-UpperBounds-08
FORMULA_NAME AutoFlight-PT-24b-UpperBounds-09
FORMULA_NAME AutoFlight-PT-24b-UpperBounds-10
FORMULA_NAME AutoFlight-PT-24b-UpperBounds-11
FORMULA_NAME AutoFlight-PT-24b-UpperBounds-12
FORMULA_NAME AutoFlight-PT-24b-UpperBounds-13
FORMULA_NAME AutoFlight-PT-24b-UpperBounds-14
FORMULA_NAME AutoFlight-PT-24b-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1678693463371

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=marciexred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=AutoFlight-PT-24b
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-13 07:44:25] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-13 07:44:25] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-13 07:44:25] [INFO ] Load time of PNML (sax parser for PT used): 156 ms
[2023-03-13 07:44:25] [INFO ] Transformed 2230 places.
[2023-03-13 07:44:26] [INFO ] Transformed 2228 transitions.
[2023-03-13 07:44:26] [INFO ] Found NUPN structural information;
[2023-03-13 07:44:26] [INFO ] Parsed PT model containing 2230 places and 2228 transitions and 5186 arcs in 306 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 6 ms.
// Phase 1: matrix 2228 rows 2230 cols
[2023-03-13 07:44:26] [INFO ] Computed 148 place invariants in 34 ms
Incomplete random walk after 10000 steps, including 9 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 16) seen :8
FORMULA AutoFlight-PT-24b-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-24b-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-24b-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-24b-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-24b-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-24b-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-24b-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-24b-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 8) 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 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 8) seen :0
[2023-03-13 07:44:26] [INFO ] Invariant cache hit.
[2023-03-13 07:44:27] [INFO ] [Real]Absence check using 147 positive place invariants in 110 ms returned sat
[2023-03-13 07:44:27] [INFO ] [Real]Absence check using 147 positive and 1 generalized place invariants in 4 ms returned sat
[2023-03-13 07:44:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 07:44:28] [INFO ] [Real]Absence check using state equation in 1182 ms returned sat
[2023-03-13 07:44:28] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 07:44:28] [INFO ] [Nat]Absence check using 147 positive place invariants in 85 ms returned sat
[2023-03-13 07:44:28] [INFO ] [Nat]Absence check using 147 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-13 07:44:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 07:44:29] [INFO ] [Nat]Absence check using state equation in 1004 ms returned sat
[2023-03-13 07:44:31] [INFO ] Deduced a trap composed of 59 places in 1418 ms of which 11 ms to minimize.
[2023-03-13 07:44:32] [INFO ] Deduced a trap composed of 31 places in 1135 ms of which 4 ms to minimize.
[2023-03-13 07:44:33] [INFO ] Deduced a trap composed of 43 places in 1097 ms of which 2 ms to minimize.
[2023-03-13 07:44: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 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-13 07:44:34] [INFO ] [Real]Absence check using 147 positive place invariants in 159 ms returned sat
[2023-03-13 07:44:34] [INFO ] [Real]Absence check using 147 positive and 1 generalized place invariants in 6 ms returned sat
[2023-03-13 07:44:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 07:44:36] [INFO ] [Real]Absence check using state equation in 1619 ms returned sat
[2023-03-13 07:44:36] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 07:44:36] [INFO ] [Nat]Absence check using 147 positive place invariants in 90 ms returned sat
[2023-03-13 07:44:36] [INFO ] [Nat]Absence check using 147 positive and 1 generalized place invariants in 4 ms returned sat
[2023-03-13 07:44:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 07:44:37] [INFO ] [Nat]Absence check using state equation in 1024 ms returned sat
[2023-03-13 07:44:38] [INFO ] Deduced a trap composed of 35 places in 955 ms of which 3 ms to minimize.
[2023-03-13 07:44:39] [INFO ] Deduced a trap composed of 28 places in 881 ms of which 5 ms to minimize.
[2023-03-13 07:44:40] [INFO ] Deduced a trap composed of 32 places in 941 ms of which 4 ms to minimize.
[2023-03-13 07:44:41] [INFO ] Deduced a trap composed of 25 places in 837 ms of which 2 ms to minimize.
[2023-03-13 07:44:41] [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.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-13 07:44:42] [INFO ] [Real]Absence check using 147 positive place invariants in 177 ms returned sat
[2023-03-13 07:44:42] [INFO ] [Real]Absence check using 147 positive and 1 generalized place invariants in 9 ms returned sat
[2023-03-13 07:44:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 07:44:43] [INFO ] [Real]Absence check using state equation in 1611 ms returned sat
[2023-03-13 07:44:44] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 07:44:44] [INFO ] [Nat]Absence check using 147 positive place invariants in 215 ms returned sat
[2023-03-13 07:44:44] [INFO ] [Nat]Absence check using 147 positive and 1 generalized place invariants in 10 ms returned sat
[2023-03-13 07:44:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 07:44:45] [INFO ] [Nat]Absence check using state equation in 1120 ms returned sat
[2023-03-13 07:44:46] [INFO ] Deduced a trap composed of 34 places in 969 ms of which 3 ms to minimize.
[2023-03-13 07:44:47] [INFO ] Deduced a trap composed of 34 places in 869 ms of which 3 ms to minimize.
[2023-03-13 07:44:48] [INFO ] Deduced a trap composed of 31 places in 805 ms of which 2 ms to minimize.
[2023-03-13 07:44:49] [INFO ] Deduced a trap composed of 28 places in 817 ms of which 2 ms to minimize.
[2023-03-13 07:44:49] [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: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-13 07:44:50] [INFO ] [Real]Absence check using 147 positive place invariants in 100 ms returned sat
[2023-03-13 07:44:50] [INFO ] [Real]Absence check using 147 positive and 1 generalized place invariants in 6 ms returned sat
[2023-03-13 07:44:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 07:44:51] [INFO ] [Real]Absence check using state equation in 1139 ms returned sat
[2023-03-13 07:44:51] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 07:44:52] [INFO ] [Nat]Absence check using 147 positive place invariants in 122 ms returned sat
[2023-03-13 07:44:52] [INFO ] [Nat]Absence check using 147 positive and 1 generalized place invariants in 7 ms returned sat
[2023-03-13 07:44:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 07:44:53] [INFO ] [Nat]Absence check using state equation in 977 ms returned sat
[2023-03-13 07:44:53] [INFO ] Deduced a trap composed of 34 places in 790 ms of which 1 ms to minimize.
[2023-03-13 07:44:54] [INFO ] Deduced a trap composed of 58 places in 899 ms of which 4 ms to minimize.
[2023-03-13 07:44:56] [INFO ] Deduced a trap composed of 55 places in 1102 ms of which 2 ms to minimize.
[2023-03-13 07:44:57] [INFO ] Deduced a trap composed of 94 places in 846 ms of which 2 ms to minimize.
[2023-03-13 07:44:57] [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.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-13 07:44:57] [INFO ] [Real]Absence check using 147 positive place invariants in 103 ms returned sat
[2023-03-13 07:44:57] [INFO ] [Real]Absence check using 147 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-13 07:44:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 07:44:58] [INFO ] [Real]Absence check using state equation in 1069 ms returned sat
[2023-03-13 07:44:58] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 07:44:59] [INFO ] [Nat]Absence check using 147 positive place invariants in 90 ms returned sat
[2023-03-13 07:44:59] [INFO ] [Nat]Absence check using 147 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-13 07:44:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 07:45:00] [INFO ] [Nat]Absence check using state equation in 1005 ms returned sat
[2023-03-13 07:45:01] [INFO ] Deduced a trap composed of 32 places in 900 ms of which 1 ms to minimize.
[2023-03-13 07:45:02] [INFO ] Deduced a trap composed of 34 places in 811 ms of which 2 ms to minimize.
[2023-03-13 07:45:03] [INFO ] Deduced a trap composed of 31 places in 853 ms of which 2 ms to minimize.
[2023-03-13 07:45:04] [INFO ] Deduced a trap composed of 46 places in 781 ms of which 2 ms to minimize.
[2023-03-13 07:45:04] [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.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-13 07:45:04] [INFO ] [Real]Absence check using 147 positive place invariants in 85 ms returned sat
[2023-03-13 07:45:04] [INFO ] [Real]Absence check using 147 positive and 1 generalized place invariants in 6 ms returned sat
[2023-03-13 07:45:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 07:45:05] [INFO ] [Real]Absence check using state equation in 961 ms returned sat
[2023-03-13 07:45:05] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 07:45:06] [INFO ] [Nat]Absence check using 147 positive place invariants in 86 ms returned sat
[2023-03-13 07:45:06] [INFO ] [Nat]Absence check using 147 positive and 1 generalized place invariants in 4 ms returned sat
[2023-03-13 07:45:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 07:45:07] [INFO ] [Nat]Absence check using state equation in 1144 ms returned sat
[2023-03-13 07:45:08] [INFO ] Deduced a trap composed of 25 places in 805 ms of which 1 ms to minimize.
[2023-03-13 07:45:09] [INFO ] Deduced a trap composed of 28 places in 811 ms of which 1 ms to minimize.
[2023-03-13 07:45:10] [INFO ] Deduced a trap composed of 34 places in 915 ms of which 2 ms to minimize.
[2023-03-13 07:45:11] [INFO ] Deduced a trap composed of 34 places in 971 ms of which 2 ms to minimize.
[2023-03-13 07:45:11] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 5
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java: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-13 07:45:11] [INFO ] [Real]Absence check using 147 positive place invariants in 92 ms returned sat
[2023-03-13 07:45:11] [INFO ] [Real]Absence check using 147 positive and 1 generalized place invariants in 3 ms returned sat
[2023-03-13 07:45:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 07:45:12] [INFO ] [Real]Absence check using state equation in 1018 ms returned sat
[2023-03-13 07:45:12] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 07:45:13] [INFO ] [Nat]Absence check using 147 positive place invariants in 89 ms returned sat
[2023-03-13 07:45:13] [INFO ] [Nat]Absence check using 147 positive and 1 generalized place invariants in 7 ms returned sat
[2023-03-13 07:45:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 07:45:14] [INFO ] [Nat]Absence check using state equation in 1301 ms returned sat
[2023-03-13 07:45:15] [INFO ] Deduced a trap composed of 31 places in 858 ms of which 2 ms to minimize.
[2023-03-13 07:45:16] [INFO ] Deduced a trap composed of 28 places in 869 ms of which 2 ms to minimize.
[2023-03-13 07:45:17] [INFO ] Deduced a trap composed of 25 places in 911 ms of which 2 ms to minimize.
[2023-03-13 07:45:18] [INFO ] Deduced a trap composed of 59 places in 907 ms of which 2 ms to minimize.
[2023-03-13 07:45:18] [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 6
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-13 07:45:19] [INFO ] [Real]Absence check using 147 positive place invariants in 92 ms returned sat
[2023-03-13 07:45:19] [INFO ] [Real]Absence check using 147 positive and 1 generalized place invariants in 4 ms returned sat
[2023-03-13 07:45:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 07:45:20] [INFO ] [Real]Absence check using state equation in 979 ms returned sat
[2023-03-13 07:45:20] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 07:45:20] [INFO ] [Nat]Absence check using 147 positive place invariants in 83 ms returned sat
[2023-03-13 07:45:20] [INFO ] [Nat]Absence check using 147 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-13 07:45:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 07:45:22] [INFO ] [Nat]Absence check using state equation in 1323 ms returned sat
[2023-03-13 07:45:23] [INFO ] Deduced a trap composed of 21 places in 922 ms of which 2 ms to minimize.
[2023-03-13 07:45:24] [INFO ] Deduced a trap composed of 47 places in 888 ms of which 2 ms to minimize.
[2023-03-13 07:45:25] [INFO ] Deduced a trap composed of 52 places in 868 ms of which 1 ms to minimize.
[2023-03-13 07:45:26] [INFO ] Deduced a trap composed of 49 places in 835 ms of which 1 ms to minimize.
[2023-03-13 07:45: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 7
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)
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 1, 1, 1, 1] Max seen :[0, 0, 0, 0, 0, 0, 0, 0]
Support contains 8 out of 2230 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2230/2230 places, 2228/2228 transitions.
Drop transitions removed 889 transitions
Trivial Post-agglo rules discarded 889 transitions
Performed 889 trivial Post agglomeration. Transition count delta: 889
Iterating post reduction 0 with 889 rules applied. Total rules applied 889 place count 2230 transition count 1339
Reduce places removed 889 places and 0 transitions.
Ensure Unique test removed 118 transitions
Reduce isomorphic transitions removed 118 transitions.
Drop transitions removed 48 transitions
Trivial Post-agglo rules discarded 48 transitions
Performed 48 trivial Post agglomeration. Transition count delta: 48
Iterating post reduction 1 with 1055 rules applied. Total rules applied 1944 place count 1341 transition count 1173
Reduce places removed 48 places and 0 transitions.
Iterating post reduction 2 with 48 rules applied. Total rules applied 1992 place count 1293 transition count 1173
Performed 290 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 290 Pre rules applied. Total rules applied 1992 place count 1293 transition count 883
Deduced a syphon composed of 290 places in 13 ms
Reduce places removed 290 places and 0 transitions.
Iterating global reduction 3 with 580 rules applied. Total rules applied 2572 place count 1003 transition count 883
Discarding 215 places :
Symmetric choice reduction at 3 with 215 rule applications. Total rules 2787 place count 788 transition count 668
Iterating global reduction 3 with 215 rules applied. Total rules applied 3002 place count 788 transition count 668
Performed 71 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 71 Pre rules applied. Total rules applied 3002 place count 788 transition count 597
Deduced a syphon composed of 71 places in 6 ms
Reduce places removed 71 places and 0 transitions.
Iterating global reduction 3 with 142 rules applied. Total rules applied 3144 place count 717 transition count 597
Performed 174 Post agglomeration using F-continuation condition.Transition count delta: 174
Deduced a syphon composed of 174 places in 1 ms
Reduce places removed 174 places and 0 transitions.
Iterating global reduction 3 with 348 rules applied. Total rules applied 3492 place count 543 transition count 423
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 3494 place count 543 transition count 421
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 3496 place count 542 transition count 420
Free-agglomeration rule applied 96 times.
Iterating global reduction 3 with 96 rules applied. Total rules applied 3592 place count 542 transition count 324
Reduce places removed 96 places and 0 transitions.
Iterating post reduction 3 with 96 rules applied. Total rules applied 3688 place count 446 transition count 324
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 3689 place count 445 transition count 323
Reduce places removed 93 places and 0 transitions.
Drop transitions removed 143 transitions
Trivial Post-agglo rules discarded 143 transitions
Performed 143 trivial Post agglomeration. Transition count delta: 143
Iterating post reduction 4 with 236 rules applied. Total rules applied 3925 place count 352 transition count 180
Reduce places removed 143 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 5 with 146 rules applied. Total rules applied 4071 place count 209 transition count 177
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 4074 place count 206 transition count 177
Performed 56 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 56 Pre rules applied. Total rules applied 4074 place count 206 transition count 121
Renaming transitions due to excessive name length > 1024 char.
Deduced a syphon composed of 56 places in 1 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 7 with 112 rules applied. Total rules applied 4186 place count 150 transition count 121
Applied a total of 4186 rules in 506 ms. Remains 150 /2230 variables (removed 2080) and now considering 121/2228 (removed 2107) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 507 ms. Remains : 150/2230 places, 121/2228 transitions.
// Phase 1: matrix 121 rows 150 cols
[2023-03-13 07:45:26] [INFO ] Computed 55 place invariants in 3 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 3100 ms. (steps per millisecond=322 ) properties (out of 8) seen :8
FORMULA AutoFlight-PT-24b-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-24b-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-24b-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-24b-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-24b-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-24b-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-24b-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-24b-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 64026 ms.
ITS solved all properties within timeout

BK_STOP 1678693529928

--------------------
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//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ 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-24b"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="marciexred"
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 marciexred"
echo " Input is AutoFlight-PT-24b, examination is UpperBounds"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r010-oct2-167813599100493"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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