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

About the Execution of Smart+red for AutoFlight-PT-96b

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
743.312 65114.00 89754.00 89.70 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.r011-oct2-167813600300525.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 smartxred
Input is AutoFlight-PT-96b, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r011-oct2-167813600300525
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.5M
-rw-r--r-- 1 mcc users 9.0K Feb 25 18:06 CTLCardinality.txt
-rw-r--r-- 1 mcc users 102K Feb 25 18:06 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.4K Feb 25 18:06 CTLFireability.txt
-rw-r--r-- 1 mcc users 72K Feb 25 18:06 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.7K Feb 25 15:33 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 15:33 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 15:33 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 15:33 LTLFireability.xml
-rw-r--r-- 1 mcc users 16K Feb 25 18:07 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 182K Feb 25 18:07 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.1K Feb 25 18:07 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 57K Feb 25 18:07 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 15:33 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 15:33 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 1.9M 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-96b-UpperBounds-00
FORMULA_NAME AutoFlight-PT-96b-UpperBounds-01
FORMULA_NAME AutoFlight-PT-96b-UpperBounds-02
FORMULA_NAME AutoFlight-PT-96b-UpperBounds-03
FORMULA_NAME AutoFlight-PT-96b-UpperBounds-04
FORMULA_NAME AutoFlight-PT-96b-UpperBounds-05
FORMULA_NAME AutoFlight-PT-96b-UpperBounds-06
FORMULA_NAME AutoFlight-PT-96b-UpperBounds-07
FORMULA_NAME AutoFlight-PT-96b-UpperBounds-08
FORMULA_NAME AutoFlight-PT-96b-UpperBounds-09
FORMULA_NAME AutoFlight-PT-96b-UpperBounds-10
FORMULA_NAME AutoFlight-PT-96b-UpperBounds-11
FORMULA_NAME AutoFlight-PT-96b-UpperBounds-12
FORMULA_NAME AutoFlight-PT-96b-UpperBounds-13
FORMULA_NAME AutoFlight-PT-96b-UpperBounds-14
FORMULA_NAME AutoFlight-PT-96b-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1678739491344

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=smartxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=AutoFlight-PT-96b
Applying reductions before tool smart
Invoking reducer
Running Version 202303021504
[2023-03-13 20:31:34] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-13 20:31:34] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-13 20:31:34] [INFO ] Load time of PNML (sax parser for PT used): 259 ms
[2023-03-13 20:31:35] [INFO ] Transformed 7894 places.
[2023-03-13 20:31:35] [INFO ] Transformed 7868 transitions.
[2023-03-13 20:31:35] [INFO ] Found NUPN structural information;
[2023-03-13 20:31:35] [INFO ] Parsed PT model containing 7894 places and 7868 transitions and 18200 arcs in 799 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 6 ms.
// Phase 1: matrix 7868 rows 7894 cols
[2023-03-13 20:31:35] [INFO ] Computed 514 place invariants in 157 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 151 ms. (steps per millisecond=66 ) properties (out of 16) seen :7
FORMULA AutoFlight-PT-96b-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-96b-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-96b-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-96b-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-96b-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-96b-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-96b-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 9) 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 9) 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 9) seen :0
[2023-03-13 20:31:36] [INFO ] Invariant cache hit.
[2023-03-13 20:31:39] [INFO ] [Real]Absence check using 513 positive place invariants in 1294 ms returned sat
[2023-03-13 20:31:39] [INFO ] [Real]Absence check using 513 positive and 1 generalized place invariants in 31 ms returned sat
[2023-03-13 20:31:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 20:31:41] [INFO ] [Real]Absence check using state equation in 1982 ms returned unknown
[2023-03-13 20:31:44] [INFO ] [Real]Absence check using 513 positive place invariants in 980 ms returned sat
[2023-03-13 20:31:44] [INFO ] [Real]Absence check using 513 positive and 1 generalized place invariants in 13 ms returned sat
[2023-03-13 20:31:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 20:31:46] [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 1
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.verifyPossible(DeadlockTester.java:899)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2618)
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 20:31:49] [INFO ] [Real]Absence check using 513 positive place invariants in 1141 ms returned sat
[2023-03-13 20:31:49] [INFO ] [Real]Absence check using 513 positive and 1 generalized place invariants in 38 ms returned sat
[2023-03-13 20:31:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 20:31:51] [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.verifyPossible(DeadlockTester.java:899)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2618)
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 20:31:53] [INFO ] [Real]Absence check using 513 positive place invariants in 947 ms returned sat
[2023-03-13 20:31:53] [INFO ] [Real]Absence check using 513 positive and 1 generalized place invariants in 16 ms returned sat
[2023-03-13 20:31:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 20:31:56] [INFO ] [Real]Absence check using state equation in 2757 ms returned unknown
[2023-03-13 20:31:58] [INFO ] [Real]Absence check using 513 positive place invariants in 856 ms returned sat
[2023-03-13 20:31:58] [INFO ] [Real]Absence check using 513 positive and 1 generalized place invariants in 15 ms returned sat
[2023-03-13 20:31:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 20:32:01] [INFO ] [Real]Absence check using state equation in 2996 ms returned unknown
[2023-03-13 20:32:03] [INFO ] [Real]Absence check using 513 positive place invariants in 991 ms returned sat
[2023-03-13 20:32:03] [INFO ] [Real]Absence check using 513 positive and 1 generalized place invariants in 16 ms returned sat
[2023-03-13 20:32:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 20:32:06] [INFO ] [Real]Absence check using state equation in 2553 ms returned unknown
[2023-03-13 20:32:09] [INFO ] [Real]Absence check using 513 positive place invariants in 918 ms returned sat
[2023-03-13 20:32:09] [INFO ] [Real]Absence check using 513 positive and 1 generalized place invariants in 11 ms returned sat
[2023-03-13 20:32:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 20:32:11] [INFO ] [Real]Absence check using state equation in 2494 ms returned unknown
[2023-03-13 20:32:13] [INFO ] [Real]Absence check using 513 positive place invariants in 817 ms returned sat
[2023-03-13 20:32:13] [INFO ] [Real]Absence check using 513 positive and 1 generalized place invariants in 13 ms returned sat
[2023-03-13 20:32:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 20:32:16] [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 7
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.verifyPossible(DeadlockTester.java:899)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2618)
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 20:32:18] [INFO ] [Real]Absence check using 513 positive place invariants in 1237 ms returned sat
[2023-03-13 20:32:18] [INFO ] [Real]Absence check using 513 positive and 1 generalized place invariants in 11 ms returned sat
[2023-03-13 20:32:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 20:32:21] [INFO ] [Real]Absence check using state equation in 2668 ms returned unknown
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 1, 1, 1, 1, 1] Max seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
Support contains 9 out of 7894 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 7894/7894 places, 7868/7868 transitions.
Drop transitions removed 3397 transitions
Trivial Post-agglo rules discarded 3397 transitions
Performed 3397 trivial Post agglomeration. Transition count delta: 3397
Iterating post reduction 0 with 3397 rules applied. Total rules applied 3397 place count 7894 transition count 4471
Reduce places removed 3397 places and 0 transitions.
Ensure Unique test removed 383 transitions
Reduce isomorphic transitions removed 383 transitions.
Drop transitions removed 190 transitions
Trivial Post-agglo rules discarded 190 transitions
Performed 190 trivial Post agglomeration. Transition count delta: 190
Iterating post reduction 1 with 3970 rules applied. Total rules applied 7367 place count 4497 transition count 3898
Reduce places removed 190 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 2 with 194 rules applied. Total rules applied 7561 place count 4307 transition count 3894
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 7565 place count 4303 transition count 3894
Performed 1013 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1013 Pre rules applied. Total rules applied 7565 place count 4303 transition count 2881
Deduced a syphon composed of 1013 places in 83 ms
Reduce places removed 1013 places and 0 transitions.
Iterating global reduction 4 with 2026 rules applied. Total rules applied 9591 place count 3290 transition count 2881
Discarding 680 places :
Symmetric choice reduction at 4 with 680 rule applications. Total rules 10271 place count 2610 transition count 2201
Iterating global reduction 4 with 680 rules applied. Total rules applied 10951 place count 2610 transition count 2201
Performed 216 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 216 Pre rules applied. Total rules applied 10951 place count 2610 transition count 1985
Deduced a syphon composed of 216 places in 22 ms
Reduce places removed 216 places and 0 transitions.
Iterating global reduction 4 with 432 rules applied. Total rules applied 11383 place count 2394 transition count 1985
Performed 607 Post agglomeration using F-continuation condition.Transition count delta: 607
Deduced a syphon composed of 607 places in 3 ms
Reduce places removed 607 places and 0 transitions.
Iterating global reduction 4 with 1214 rules applied. Total rules applied 12597 place count 1787 transition count 1378
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 12599 place count 1786 transition count 1378
Free-agglomeration rule applied 288 times.
Iterating global reduction 4 with 288 rules applied. Total rules applied 12887 place count 1786 transition count 1090
Reduce places removed 288 places and 0 transitions.
Iterating post reduction 4 with 288 rules applied. Total rules applied 13175 place count 1498 transition count 1090
Applied a total of 13175 rules in 2141 ms. Remains 1498 /7894 variables (removed 6396) and now considering 1090/7868 (removed 6778) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2141 ms. Remains : 1498/7894 places, 1090/7868 transitions.
// Phase 1: matrix 1090 rows 1498 cols
[2023-03-13 20:32:23] [INFO ] Computed 514 place invariants in 34 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 12374 ms. (steps per millisecond=80 ) properties (out of 9) seen :9
FORMULA AutoFlight-PT-96b-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-96b-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-96b-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-96b-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-96b-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-96b-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-96b-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-96b-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-96b-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 61887 ms.
ITS solved all properties within timeout

BK_STOP 1678739556458

--------------------
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:
++ 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
++ sed s/.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-96b"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="smartxred"
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 smartxred"
echo " Input is AutoFlight-PT-96b, 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 r011-oct2-167813600300525"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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