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

About the Execution of Smart+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
8274.319 3600000.00 3674097.00 170.90 FTFFTTTFTFFTTTTF 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-167813600300495.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-24b, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r011-oct2-167813600300495
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 892K
-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 6.6K Jan 29 11:40 GenericPropertiesVerdict.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 booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME AutoFlight-PT-24b-ReachabilityFireability-00
FORMULA_NAME AutoFlight-PT-24b-ReachabilityFireability-01
FORMULA_NAME AutoFlight-PT-24b-ReachabilityFireability-02
FORMULA_NAME AutoFlight-PT-24b-ReachabilityFireability-03
FORMULA_NAME AutoFlight-PT-24b-ReachabilityFireability-04
FORMULA_NAME AutoFlight-PT-24b-ReachabilityFireability-05
FORMULA_NAME AutoFlight-PT-24b-ReachabilityFireability-06
FORMULA_NAME AutoFlight-PT-24b-ReachabilityFireability-07
FORMULA_NAME AutoFlight-PT-24b-ReachabilityFireability-08
FORMULA_NAME AutoFlight-PT-24b-ReachabilityFireability-09
FORMULA_NAME AutoFlight-PT-24b-ReachabilityFireability-10
FORMULA_NAME AutoFlight-PT-24b-ReachabilityFireability-11
FORMULA_NAME AutoFlight-PT-24b-ReachabilityFireability-12
FORMULA_NAME AutoFlight-PT-24b-ReachabilityFireability-13
FORMULA_NAME AutoFlight-PT-24b-ReachabilityFireability-14
FORMULA_NAME AutoFlight-PT-24b-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1678736602213

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=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=AutoFlight-PT-24b
Applying reductions before tool smart
Invoking reducer
Running Version 202303021504
[2023-03-13 19:43:24] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-03-13 19:43:24] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-13 19:43:24] [INFO ] Load time of PNML (sax parser for PT used): 124 ms
[2023-03-13 19:43:24] [INFO ] Transformed 2230 places.
[2023-03-13 19:43:24] [INFO ] Transformed 2228 transitions.
[2023-03-13 19:43:24] [INFO ] Found NUPN structural information;
[2023-03-13 19:43:24] [INFO ] Parsed PT model containing 2230 places and 2228 transitions and 5186 arcs in 308 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 9 resets, run finished after 498 ms. (steps per millisecond=20 ) properties (out of 16) seen :8
FORMULA AutoFlight-PT-24b-ReachabilityFireability-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-24b-ReachabilityFireability-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-24b-ReachabilityFireability-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-24b-ReachabilityFireability-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-24b-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-24b-ReachabilityFireability-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-24b-ReachabilityFireability-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-24b-ReachabilityFireability-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 8) seen :1
FORMULA AutoFlight-PT-24b-ReachabilityFireability-09 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
// Phase 1: matrix 2228 rows 2230 cols
[2023-03-13 19:43:25] [INFO ] Computed 148 place invariants in 40 ms
[2023-03-13 19:43:26] [INFO ] After 1105ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-13 19:43:27] [INFO ] [Nat]Absence check using 147 positive place invariants in 212 ms returned sat
[2023-03-13 19:43:27] [INFO ] [Nat]Absence check using 147 positive and 1 generalized place invariants in 6 ms returned sat
[2023-03-13 19:43:31] [INFO ] After 3317ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2023-03-13 19:43:32] [INFO ] Deduced a trap composed of 19 places in 948 ms of which 13 ms to minimize.
[2023-03-13 19:43:33] [INFO ] Deduced a trap composed of 42 places in 912 ms of which 3 ms to minimize.
[2023-03-13 19:43:34] [INFO ] Deduced a trap composed of 247 places in 972 ms of which 13 ms to minimize.
[2023-03-13 19:43:35] [INFO ] Deduced a trap composed of 72 places in 887 ms of which 15 ms to minimize.
[2023-03-13 19:43:36] [INFO ] Deduced a trap composed of 69 places in 612 ms of which 2 ms to minimize.
[2023-03-13 19:43:37] [INFO ] Deduced a trap composed of 73 places in 893 ms of which 2 ms to minimize.
[2023-03-13 19:43:38] [INFO ] Deduced a trap composed of 250 places in 1114 ms of which 2 ms to minimize.
[2023-03-13 19:43:39] [INFO ] Deduced a trap composed of 258 places in 845 ms of which 1 ms to minimize.
[2023-03-13 19:43:40] [INFO ] Deduced a trap composed of 220 places in 808 ms of which 1 ms to minimize.
[2023-03-13 19:43:41] [INFO ] Deduced a trap composed of 232 places in 793 ms of which 5 ms to minimize.
[2023-03-13 19:43:42] [INFO ] Deduced a trap composed of 84 places in 825 ms of which 2 ms to minimize.
[2023-03-13 19:43:43] [INFO ] Deduced a trap composed of 78 places in 801 ms of which 2 ms to minimize.
[2023-03-13 19:43:44] [INFO ] Deduced a trap composed of 247 places in 807 ms of which 2 ms to minimize.
[2023-03-13 19:43:45] [INFO ] Deduced a trap composed of 256 places in 1084 ms of which 1 ms to minimize.
[2023-03-13 19:43:46] [INFO ] Deduced a trap composed of 239 places in 604 ms of which 1 ms to minimize.
[2023-03-13 19:43:47] [INFO ] Deduced a trap composed of 86 places in 597 ms of which 1 ms to minimize.
[2023-03-13 19:43:48] [INFO ] Deduced a trap composed of 82 places in 599 ms of which 2 ms to minimize.
[2023-03-13 19:43:48] [INFO ] Deduced a trap composed of 88 places in 640 ms of which 3 ms to minimize.
[2023-03-13 19:43:49] [INFO ] Deduced a trap composed of 236 places in 664 ms of which 1 ms to minimize.
[2023-03-13 19:43:50] [INFO ] Deduced a trap composed of 252 places in 734 ms of which 1 ms to minimize.
[2023-03-13 19:43:51] [INFO ] Deduced a trap composed of 230 places in 570 ms of which 2 ms to minimize.
[2023-03-13 19:43:52] [INFO ] Deduced a trap composed of 96 places in 848 ms of which 12 ms to minimize.
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.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:902)
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 19:43:52] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-13 19:43:52] [INFO ] After 25422ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:7
FORMULA AutoFlight-PT-24b-ReachabilityFireability-04 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 1 properties in 298 ms.
Support contains 56 out of 2230 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2230/2230 places, 2228/2228 transitions.
Drop transitions removed 824 transitions
Trivial Post-agglo rules discarded 824 transitions
Performed 824 trivial Post agglomeration. Transition count delta: 824
Iterating post reduction 0 with 824 rules applied. Total rules applied 824 place count 2230 transition count 1404
Reduce places removed 824 places and 0 transitions.
Ensure Unique test removed 103 transitions
Reduce isomorphic transitions removed 103 transitions.
Drop transitions removed 40 transitions
Trivial Post-agglo rules discarded 40 transitions
Performed 40 trivial Post agglomeration. Transition count delta: 40
Iterating post reduction 1 with 967 rules applied. Total rules applied 1791 place count 1406 transition count 1261
Reduce places removed 40 places and 0 transitions.
Performed 36 Post agglomeration using F-continuation condition.Transition count delta: 36
Iterating post reduction 2 with 76 rules applied. Total rules applied 1867 place count 1366 transition count 1225
Reduce places removed 36 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 49 rules applied. Total rules applied 1916 place count 1330 transition count 1212
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1917 place count 1329 transition count 1212
Performed 276 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 276 Pre rules applied. Total rules applied 1917 place count 1329 transition count 936
Deduced a syphon composed of 276 places in 5 ms
Reduce places removed 276 places and 0 transitions.
Iterating global reduction 5 with 552 rules applied. Total rules applied 2469 place count 1053 transition count 936
Discarding 203 places :
Symmetric choice reduction at 5 with 203 rule applications. Total rules 2672 place count 850 transition count 733
Iterating global reduction 5 with 203 rules applied. Total rules applied 2875 place count 850 transition count 733
Performed 62 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 62 Pre rules applied. Total rules applied 2875 place count 850 transition count 671
Deduced a syphon composed of 62 places in 4 ms
Reduce places removed 62 places and 0 transitions.
Iterating global reduction 5 with 124 rules applied. Total rules applied 2999 place count 788 transition count 671
Performed 184 Post agglomeration using F-continuation condition.Transition count delta: 184
Deduced a syphon composed of 184 places in 0 ms
Reduce places removed 184 places and 0 transitions.
Iterating global reduction 5 with 368 rules applied. Total rules applied 3367 place count 604 transition count 487
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 3371 place count 602 transition count 488
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 5 with 3 rules applied. Total rules applied 3374 place count 602 transition count 485
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 5 with 2 rules applied. Total rules applied 3376 place count 601 transition count 484
Free-agglomeration rule applied 82 times.
Iterating global reduction 5 with 82 rules applied. Total rules applied 3458 place count 601 transition count 402
Reduce places removed 82 places and 0 transitions.
Iterating post reduction 5 with 82 rules applied. Total rules applied 3540 place count 519 transition count 402
Applied a total of 3540 rules in 433 ms. Remains 519 /2230 variables (removed 1711) and now considering 402/2228 (removed 1826) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 434 ms. Remains : 519/2230 places, 402/2228 transitions.
Incomplete random walk after 10000 steps, including 110 resets, run finished after 136 ms. (steps per millisecond=73 ) properties (out of 6) seen :4
FORMULA AutoFlight-PT-24b-ReachabilityFireability-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-24b-ReachabilityFireability-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-24b-ReachabilityFireability-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-24b-ReachabilityFireability-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 7 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 2) seen :1
FORMULA AutoFlight-PT-24b-ReachabilityFireability-03 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 402 rows 519 cols
[2023-03-13 19:43:53] [INFO ] Computed 148 place invariants in 9 ms
[2023-03-13 19:43:53] [INFO ] After 87ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-13 19:43:53] [INFO ] [Nat]Absence check using 146 positive place invariants in 68 ms returned sat
[2023-03-13 19:43:53] [INFO ] [Nat]Absence check using 146 positive and 2 generalized place invariants in 5 ms returned sat
[2023-03-13 19:43:53] [INFO ] After 435ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-13 19:43:53] [INFO ] State equation strengthened by 196 read => feed constraints.
[2023-03-13 19:43:53] [INFO ] After 75ms SMT Verify possible using 196 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-13 19:43:53] [INFO ] After 148ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 31 ms.
[2023-03-13 19:43:54] [INFO ] After 797ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 16 ms.
Support contains 3 out of 519 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 519/519 places, 402/402 transitions.
Drop transitions removed 23 transitions
Trivial Post-agglo rules discarded 23 transitions
Performed 23 trivial Post agglomeration. Transition count delta: 23
Iterating post reduction 0 with 23 rules applied. Total rules applied 23 place count 519 transition count 379
Reduce places removed 23 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 24 rules applied. Total rules applied 47 place count 496 transition count 378
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 48 place count 495 transition count 378
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 13 Pre rules applied. Total rules applied 48 place count 495 transition count 365
Deduced a syphon composed of 13 places in 1 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 3 with 26 rules applied. Total rules applied 74 place count 482 transition count 365
Performed 34 Post agglomeration using F-continuation condition with reduction of 3 identical transitions.
Deduced a syphon composed of 34 places in 0 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 3 with 68 rules applied. Total rules applied 142 place count 448 transition count 328
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 144 place count 448 transition count 326
Renaming transitions due to excessive name length > 1024 char.
Free-agglomeration rule applied 13 times.
Iterating global reduction 4 with 13 rules applied. Total rules applied 157 place count 448 transition count 313
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 4 with 13 rules applied. Total rules applied 170 place count 435 transition count 313
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 171 place count 434 transition count 312
Reduce places removed 102 places and 0 transitions.
Drop transitions removed 170 transitions
Trivial Post-agglo rules discarded 170 transitions
Performed 170 trivial Post agglomeration. Transition count delta: 170
Iterating post reduction 5 with 272 rules applied. Total rules applied 443 place count 332 transition count 142
Reduce places removed 170 places and 0 transitions.
Iterating post reduction 6 with 170 rules applied. Total rules applied 613 place count 162 transition count 142
Performed 47 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 47 Pre rules applied. Total rules applied 613 place count 162 transition count 95
Deduced a syphon composed of 47 places in 0 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 7 with 94 rules applied. Total rules applied 707 place count 115 transition count 95
Applied a total of 707 rules in 121 ms. Remains 115 /519 variables (removed 404) and now considering 95/402 (removed 307) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 133 ms. Remains : 115/519 places, 95/402 transitions.
Finished random walk after 1463 steps, including 41 resets, run visited all 1 properties in 6 ms. (steps per millisecond=243 )
FORMULA AutoFlight-PT-24b-ReachabilityFireability-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 29806 ms.
======================================================
========== this is Smart for the MCC'2018 ============
======================================================
Running AutoFlight (PT), instance 24b
Examination ReachabilityFireability
Parser /home/mcc/BenchKit/bin//../reducer/bin//../../smart/bin//parser/Fireability.jar
Model checker /home/mcc/BenchKit/bin//../reducer/bin//../../smart/bin//rem_exec//smart

GOT IT HERE. BS
Petri model created: 2230 places, 2228 transitions, 5186 arcs.
Final Score: 286890.095
Took : 59 seconds
Reachability Fireability file is: ReachabilityFireability.xml
READY TO PARSE. BS
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393236 kB
MemFree: 7877368 kB
After kill :
MemTotal: 16393236 kB
MemFree: 16104920 kB

BK_TIME_CONFINEMENT_REACHED

--------------------
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 ReachabilityFireability -timeout 360 -rebuildPNML
Caught signal 15, terminating.

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="ReachabilityFireability"
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-24b, examination is ReachabilityFireability"
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-167813600300495"
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 [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "UpperBounds" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] || [ "ReachabilityFireability" = "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 [ "ReachabilityFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityFireability" != "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 "ReachabilityFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityFireability.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 '' ReachabilityFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityFireability"
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 ;