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-167813599200511.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-48b, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r010-oct2-167813599200511
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.4M
-rw-r--r-- 1 mcc users 8.2K Feb 25 18:04 CTLCardinality.txt
-rw-r--r-- 1 mcc users 90K Feb 25 18:04 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K Feb 25 18:04 CTLFireability.txt
-rw-r--r-- 1 mcc users 55K Feb 25 18:04 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.7K Feb 25 15:33 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 15:33 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 15:33 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 15:33 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.8K Feb 25 18:05 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 74K Feb 25 18:05 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Feb 25 18:05 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 40K Feb 25 18:05 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 956K 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-48b-ReachabilityFireability-00
FORMULA_NAME AutoFlight-PT-48b-ReachabilityFireability-01
FORMULA_NAME AutoFlight-PT-48b-ReachabilityFireability-02
FORMULA_NAME AutoFlight-PT-48b-ReachabilityFireability-03
FORMULA_NAME AutoFlight-PT-48b-ReachabilityFireability-04
FORMULA_NAME AutoFlight-PT-48b-ReachabilityFireability-05
FORMULA_NAME AutoFlight-PT-48b-ReachabilityFireability-06
FORMULA_NAME AutoFlight-PT-48b-ReachabilityFireability-07
FORMULA_NAME AutoFlight-PT-48b-ReachabilityFireability-08
FORMULA_NAME AutoFlight-PT-48b-ReachabilityFireability-09
FORMULA_NAME AutoFlight-PT-48b-ReachabilityFireability-10
FORMULA_NAME AutoFlight-PT-48b-ReachabilityFireability-11
FORMULA_NAME AutoFlight-PT-48b-ReachabilityFireability-12
FORMULA_NAME AutoFlight-PT-48b-ReachabilityFireability-13
FORMULA_NAME AutoFlight-PT-48b-ReachabilityFireability-14
FORMULA_NAME AutoFlight-PT-48b-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1678696147435

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=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=AutoFlight-PT-48b
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-13 08:29:09] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-03-13 08:29:09] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-13 08:29:10] [INFO ] Load time of PNML (sax parser for PT used): 228 ms
[2023-03-13 08:29:10] [INFO ] Transformed 3950 places.
[2023-03-13 08:29:10] [INFO ] Transformed 3936 transitions.
[2023-03-13 08:29:10] [INFO ] Found NUPN structural information;
[2023-03-13 08:29:10] [INFO ] Parsed PT model containing 3950 places and 3936 transitions and 9104 arcs in 492 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 8 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 5 resets, run finished after 614 ms. (steps per millisecond=16 ) properties (out of 16) seen :10
FORMULA AutoFlight-PT-48b-ReachabilityFireability-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-48b-ReachabilityFireability-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-48b-ReachabilityFireability-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-48b-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-48b-ReachabilityFireability-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-48b-ReachabilityFireability-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-48b-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-48b-ReachabilityFireability-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-48b-ReachabilityFireability-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-48b-ReachabilityFireability-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 6) 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 6) 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 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 3936 rows 3950 cols
[2023-03-13 08:29:11] [INFO ] Computed 258 place invariants in 87 ms
[2023-03-13 08:29:13] [INFO ] After 1397ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-13 08:29:14] [INFO ] [Nat]Absence check using 257 positive place invariants in 257 ms returned sat
[2023-03-13 08:29:14] [INFO ] [Nat]Absence check using 257 positive and 1 generalized place invariants in 15 ms returned sat
[2023-03-13 08:29:20] [INFO ] After 5204ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-13 08:29:23] [INFO ] Deduced a trap composed of 21 places in 2001 ms of which 9 ms to minimize.
[2023-03-13 08:29:25] [INFO ] Deduced a trap composed of 42 places in 2055 ms of which 15 ms to minimize.
[2023-03-13 08:29:27] [INFO ] Deduced a trap composed of 144 places in 1912 ms of which 40 ms to minimize.
[2023-03-13 08:29:29] [INFO ] Deduced a trap composed of 454 places in 1792 ms of which 6 ms to minimize.
[2023-03-13 08:29:31] [INFO ] Deduced a trap composed of 159 places in 1751 ms of which 2 ms to minimize.
[2023-03-13 08:29:33] [INFO ] Deduced a trap composed of 158 places in 1711 ms of which 3 ms to minimize.
[2023-03-13 08:29:35] [INFO ] Deduced a trap composed of 158 places in 2053 ms of which 6 ms to minimize.
[2023-03-13 08:29:37] [INFO ] Deduced a trap composed of 154 places in 1715 ms of which 2 ms to minimize.
[2023-03-13 08:29:39] [INFO ] Deduced a trap composed of 162 places in 1638 ms of which 3 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 08:29:39] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-13 08:29:39] [INFO ] After 26666ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:6
Parikh walk visited 0 properties in 556 ms.
Support contains 93 out of 3950 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3950/3950 places, 3936/3936 transitions.
Drop transitions removed 1598 transitions
Trivial Post-agglo rules discarded 1598 transitions
Performed 1598 trivial Post agglomeration. Transition count delta: 1598
Iterating post reduction 0 with 1598 rules applied. Total rules applied 1598 place count 3950 transition count 2338
Reduce places removed 1598 places and 0 transitions.
Ensure Unique test removed 172 transitions
Reduce isomorphic transitions removed 172 transitions.
Drop transitions removed 76 transitions
Trivial Post-agglo rules discarded 76 transitions
Performed 76 trivial Post agglomeration. Transition count delta: 76
Iterating post reduction 1 with 1846 rules applied. Total rules applied 3444 place count 2352 transition count 2090
Reduce places removed 76 places and 0 transitions.
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: 40
Iterating post reduction 2 with 116 rules applied. Total rules applied 3560 place count 2276 transition count 2050
Reduce places removed 40 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 46 rules applied. Total rules applied 3606 place count 2236 transition count 2044
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 3607 place count 2235 transition count 2044
Performed 481 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 481 Pre rules applied. Total rules applied 3607 place count 2235 transition count 1563
Deduced a syphon composed of 481 places in 12 ms
Reduce places removed 481 places and 0 transitions.
Iterating global reduction 5 with 962 rules applied. Total rules applied 4569 place count 1754 transition count 1563
Discarding 322 places :
Symmetric choice reduction at 5 with 322 rule applications. Total rules 4891 place count 1432 transition count 1241
Iterating global reduction 5 with 322 rules applied. Total rules applied 5213 place count 1432 transition count 1241
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 5 with 7 rules applied. Total rules applied 5220 place count 1432 transition count 1234
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 5222 place count 1430 transition count 1234
Performed 96 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 96 Pre rules applied. Total rules applied 5222 place count 1430 transition count 1138
Deduced a syphon composed of 96 places in 17 ms
Reduce places removed 96 places and 0 transitions.
Iterating global reduction 7 with 192 rules applied. Total rules applied 5414 place count 1334 transition count 1138
Performed 327 Post agglomeration using F-continuation condition.Transition count delta: 327
Deduced a syphon composed of 327 places in 3 ms
Reduce places removed 327 places and 0 transitions.
Iterating global reduction 7 with 654 rules applied. Total rules applied 6068 place count 1007 transition count 811
Drop transitions removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 7 with 9 rules applied. Total rules applied 6077 place count 1007 transition count 802
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 7 with 6 rules applied. Total rules applied 6083 place count 1004 transition count 799
Free-agglomeration rule applied 131 times.
Iterating global reduction 7 with 131 rules applied. Total rules applied 6214 place count 1004 transition count 668
Reduce places removed 131 places and 0 transitions.
Iterating post reduction 7 with 131 rules applied. Total rules applied 6345 place count 873 transition count 668
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 6346 place count 872 transition count 667
Reduce places removed 19 places and 0 transitions.
Iterating post reduction 8 with 19 rules applied. Total rules applied 6365 place count 853 transition count 667
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 17 Pre rules applied. Total rules applied 6365 place count 853 transition count 650
Deduced a syphon composed of 17 places in 1 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 9 with 34 rules applied. Total rules applied 6399 place count 836 transition count 650
Applied a total of 6399 rules in 984 ms. Remains 836 /3950 variables (removed 3114) and now considering 650/3936 (removed 3286) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 985 ms. Remains : 836/3950 places, 650/3936 transitions.
Incomplete random walk after 10000 steps, including 55 resets, run finished after 274 ms. (steps per millisecond=36 ) properties (out of 6) seen :1
FORMULA AutoFlight-PT-48b-ReachabilityFireability-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 650 rows 836 cols
[2023-03-13 08:29:41] [INFO ] Computed 239 place invariants in 11 ms
[2023-03-13 08:29:42] [INFO ] After 159ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-13 08:29:42] [INFO ] [Nat]Absence check using 237 positive place invariants in 71 ms returned sat
[2023-03-13 08:29:42] [INFO ] [Nat]Absence check using 237 positive and 2 generalized place invariants in 9 ms returned sat
[2023-03-13 08:29:43] [INFO ] After 902ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-13 08:29:43] [INFO ] State equation strengthened by 294 read => feed constraints.
[2023-03-13 08:29:44] [INFO ] After 721ms SMT Verify possible using 294 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2023-03-13 08:29:44] [INFO ] Deduced a trap composed of 31 places in 250 ms of which 1 ms to minimize.
[2023-03-13 08:29:45] [INFO ] Deduced a trap composed of 7 places in 296 ms of which 0 ms to minimize.
[2023-03-13 08:29:45] [INFO ] Deduced a trap composed of 9 places in 240 ms of which 1 ms to minimize.
[2023-03-13 08:29:46] [INFO ] Deduced a trap composed of 13 places in 248 ms of which 1 ms to minimize.
[2023-03-13 08:29:46] [INFO ] Deduced a trap composed of 11 places in 156 ms of which 0 ms to minimize.
[2023-03-13 08:29:46] [INFO ] Deduced a trap composed of 11 places in 168 ms of which 1 ms to minimize.
[2023-03-13 08:29:46] [INFO ] Deduced a trap composed of 11 places in 166 ms of which 1 ms to minimize.
[2023-03-13 08:29:47] [INFO ] Deduced a trap composed of 11 places in 196 ms of which 1 ms to minimize.
[2023-03-13 08:29:47] [INFO ] Deduced a trap composed of 20 places in 203 ms of which 0 ms to minimize.
[2023-03-13 08:29:47] [INFO ] Deduced a trap composed of 24 places in 167 ms of which 1 ms to minimize.
[2023-03-13 08:29:47] [INFO ] Deduced a trap composed of 43 places in 134 ms of which 1 ms to minimize.
[2023-03-13 08:29:47] [INFO ] Deduced a trap composed of 37 places in 108 ms of which 1 ms to minimize.
[2023-03-13 08:29:48] [INFO ] Deduced a trap composed of 280 places in 187 ms of which 1 ms to minimize.
[2023-03-13 08:29:48] [INFO ] Deduced a trap composed of 213 places in 184 ms of which 1 ms to minimize.
[2023-03-13 08:29:48] [INFO ] Deduced a trap composed of 225 places in 180 ms of which 0 ms to minimize.
[2023-03-13 08:29:48] [INFO ] Deduced a trap composed of 221 places in 164 ms of which 0 ms to minimize.
[2023-03-13 08:29:49] [INFO ] Deduced a trap composed of 225 places in 152 ms of which 1 ms to minimize.
[2023-03-13 08:29:49] [INFO ] Deduced a trap composed of 223 places in 181 ms of which 1 ms to minimize.
[2023-03-13 08:29:49] [INFO ] Deduced a trap composed of 220 places in 249 ms of which 2 ms to minimize.
[2023-03-13 08:29:49] [INFO ] Deduced a trap composed of 225 places in 218 ms of which 0 ms to minimize.
[2023-03-13 08:29:50] [INFO ] Deduced a trap composed of 225 places in 189 ms of which 1 ms to minimize.
[2023-03-13 08:29:50] [INFO ] Deduced a trap composed of 231 places in 260 ms of which 2 ms to minimize.
[2023-03-13 08:29:50] [INFO ] Deduced a trap composed of 221 places in 254 ms of which 1 ms to minimize.
[2023-03-13 08:29:51] [INFO ] Deduced a trap composed of 221 places in 140 ms of which 9 ms to minimize.
[2023-03-13 08:29:51] [INFO ] Deduced a trap composed of 220 places in 223 ms of which 12 ms to minimize.
[2023-03-13 08:29:51] [INFO ] Deduced a trap composed of 224 places in 220 ms of which 0 ms to minimize.
[2023-03-13 08:29:51] [INFO ] Deduced a trap composed of 224 places in 218 ms of which 1 ms to minimize.
[2023-03-13 08:29:52] [INFO ] Deduced a trap composed of 230 places in 188 ms of which 0 ms to minimize.
[2023-03-13 08:29:52] [INFO ] Deduced a trap composed of 225 places in 170 ms of which 1 ms to minimize.
[2023-03-13 08:29:52] [INFO ] Deduced a trap composed of 227 places in 232 ms of which 1 ms to minimize.
[2023-03-13 08:29:52] [INFO ] Deduced a trap composed of 227 places in 280 ms of which 2 ms to minimize.
[2023-03-13 08:29:53] [INFO ] Deduced a trap composed of 225 places in 230 ms of which 0 ms to minimize.
[2023-03-13 08:29:53] [INFO ] Deduced a trap composed of 229 places in 234 ms of which 1 ms to minimize.
[2023-03-13 08:29:53] [INFO ] Deduced a trap composed of 231 places in 233 ms of which 26 ms to minimize.
[2023-03-13 08:29:54] [INFO ] Deduced a trap composed of 228 places in 240 ms of which 0 ms to minimize.
[2023-03-13 08:29:54] [INFO ] Deduced a trap composed of 233 places in 176 ms of which 1 ms to minimize.
[2023-03-13 08:29:54] [INFO ] Deduced a trap composed of 239 places in 184 ms of which 1 ms to minimize.
[2023-03-13 08:29:54] [INFO ] Deduced a trap composed of 242 places in 186 ms of which 0 ms to minimize.
[2023-03-13 08:29:55] [INFO ] Deduced a trap composed of 239 places in 148 ms of which 1 ms to minimize.
[2023-03-13 08:29:55] [INFO ] Deduced a trap composed of 238 places in 126 ms of which 0 ms to minimize.
[2023-03-13 08:29:55] [INFO ] Deduced a trap composed of 237 places in 143 ms of which 1 ms to minimize.
[2023-03-13 08:29:55] [INFO ] Deduced a trap composed of 242 places in 175 ms of which 0 ms to minimize.
[2023-03-13 08:29:55] [INFO ] Deduced a trap composed of 243 places in 206 ms of which 1 ms to minimize.
[2023-03-13 08:29:56] [INFO ] Deduced a trap composed of 245 places in 219 ms of which 1 ms to minimize.
[2023-03-13 08:29:56] [INFO ] Deduced a trap composed of 243 places in 218 ms of which 0 ms to minimize.
[2023-03-13 08:29:56] [INFO ] Deduced a trap composed of 247 places in 205 ms of which 0 ms to minimize.
[2023-03-13 08:29:57] [INFO ] Deduced a trap composed of 252 places in 204 ms of which 0 ms to minimize.
[2023-03-13 08:29:57] [INFO ] Deduced a trap composed of 249 places in 183 ms of which 0 ms to minimize.
[2023-03-13 08:29:57] [INFO ] Deduced a trap composed of 312 places in 323 ms of which 0 ms to minimize.
[2023-03-13 08:29:57] [INFO ] Deduced a trap composed of 256 places in 182 ms of which 0 ms to minimize.
[2023-03-13 08:29:58] [INFO ] Deduced a trap composed of 299 places in 171 ms of which 0 ms to minimize.
[2023-03-13 08:29:58] [INFO ] Deduced a trap composed of 361 places in 188 ms of which 1 ms to minimize.
[2023-03-13 08:29:58] [INFO ] Deduced a trap composed of 362 places in 176 ms of which 1 ms to minimize.
[2023-03-13 08:29:58] [INFO ] Trap strengthening (SAT) tested/added 54/53 trap constraints in 14222 ms
[2023-03-13 08:29:59] [INFO ] After 15874ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 923 ms.
[2023-03-13 08:30:00] [INFO ] After 18180ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
FORMULA AutoFlight-PT-48b-ReachabilityFireability-08 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA AutoFlight-PT-48b-ReachabilityFireability-12 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 2 properties in 131 ms.
Support contains 50 out of 836 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 836/836 places, 650/650 transitions.
Drop transitions removed 20 transitions
Trivial Post-agglo rules discarded 20 transitions
Performed 20 trivial Post agglomeration. Transition count delta: 20
Iterating post reduction 0 with 20 rules applied. Total rules applied 20 place count 836 transition count 630
Reduce places removed 20 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 1 with 24 rules applied. Total rules applied 44 place count 816 transition count 626
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 48 place count 812 transition count 626
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 14 Pre rules applied. Total rules applied 48 place count 812 transition count 612
Deduced a syphon composed of 14 places in 1 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 3 with 30 rules applied. Total rules applied 78 place count 796 transition count 612
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 78 place count 796 transition count 610
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 82 place count 794 transition count 610
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 3 with 32 rules applied. Total rules applied 114 place count 778 transition count 594
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
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 116 place count 777 transition count 594
Free-agglomeration rule applied 9 times.
Iterating global reduction 3 with 9 rules applied. Total rules applied 125 place count 777 transition count 585
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 3 with 9 rules applied. Total rules applied 134 place count 768 transition count 585
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 4 with 3 rules applied. Total rules applied 137 place count 768 transition count 585
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 140 place count 765 transition count 582
Iterating global reduction 4 with 3 rules applied. Total rules applied 143 place count 765 transition count 582
Applied a total of 143 rules in 122 ms. Remains 765 /836 variables (removed 71) and now considering 582/650 (removed 68) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 122 ms. Remains : 765/836 places, 582/650 transitions.
Incomplete random walk after 10000 steps, including 25 resets, run finished after 128 ms. (steps per millisecond=78 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 3) seen :1
FORMULA AutoFlight-PT-48b-ReachabilityFireability-14 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Running SMT prover for 2 properties.
// Phase 1: matrix 582 rows 765 cols
[2023-03-13 08:30:00] [INFO ] Computed 237 place invariants in 5 ms
[2023-03-13 08:30:00] [INFO ] After 82ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-13 08:30:00] [INFO ] [Nat]Absence check using 235 positive place invariants in 39 ms returned sat
[2023-03-13 08:30:00] [INFO ] [Nat]Absence check using 235 positive and 2 generalized place invariants in 6 ms returned sat
[2023-03-13 08:30:01] [INFO ] After 950ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-13 08:30:01] [INFO ] State equation strengthened by 323 read => feed constraints.
[2023-03-13 08:30:02] [INFO ] After 426ms SMT Verify possible using 323 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-13 08:30:02] [INFO ] Deduced a trap composed of 9 places in 263 ms of which 14 ms to minimize.
[2023-03-13 08:30:03] [INFO ] Deduced a trap composed of 17 places in 193 ms of which 0 ms to minimize.
[2023-03-13 08:30:03] [INFO ] Deduced a trap composed of 251 places in 191 ms of which 1 ms to minimize.
[2023-03-13 08:30:03] [INFO ] Deduced a trap composed of 275 places in 148 ms of which 1 ms to minimize.
[2023-03-13 08:30:03] [INFO ] Deduced a trap composed of 255 places in 210 ms of which 14 ms to minimize.
[2023-03-13 08:30:04] [INFO ] Deduced a trap composed of 267 places in 205 ms of which 0 ms to minimize.
[2023-03-13 08:30:04] [INFO ] Deduced a trap composed of 259 places in 205 ms of which 1 ms to minimize.
[2023-03-13 08:30:04] [INFO ] Deduced a trap composed of 19 places in 209 ms of which 0 ms to minimize.
[2023-03-13 08:30:04] [INFO ] Deduced a trap composed of 16 places in 195 ms of which 1 ms to minimize.
[2023-03-13 08:30:05] [INFO ] Deduced a trap composed of 34 places in 206 ms of which 1 ms to minimize.
[2023-03-13 08:30:05] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 2781 ms
[2023-03-13 08:30:05] [INFO ] After 3555ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 637 ms.
[2023-03-13 08:30:06] [INFO ] After 5350ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 51 ms.
Support contains 43 out of 765 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 765/765 places, 582/582 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 765 transition count 581
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 2 rules applied. Total rules applied 3 place count 764 transition count 580
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 4 place count 763 transition count 580
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 4 place count 763 transition count 577
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 7 rules applied. Total rules applied 11 place count 759 transition count 577
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 11 place count 759 transition count 576
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 13 place count 758 transition count 576
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 19 place count 755 transition count 573
Free-agglomeration rule applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 21 place count 755 transition count 571
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 23 place count 753 transition count 571
Applied a total of 23 rules in 110 ms. Remains 753 /765 variables (removed 12) and now considering 571/582 (removed 11) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 110 ms. Remains : 753/765 places, 571/582 transitions.
Incomplete random walk after 10000 steps, including 36 resets, run finished after 122 ms. (steps per millisecond=81 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 179731 steps, run timeout after 3001 ms. (steps per millisecond=59 ) properties seen :{}
Probabilistic random walk after 179731 steps, saw 56479 distinct states, run finished after 3003 ms. (steps per millisecond=59 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 571 rows 753 cols
[2023-03-13 08:30:09] [INFO ] Computed 236 place invariants in 5 ms
[2023-03-13 08:30:09] [INFO ] After 82ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-13 08:30:09] [INFO ] [Nat]Absence check using 234 positive place invariants in 72 ms returned sat
[2023-03-13 08:30:09] [INFO ] [Nat]Absence check using 234 positive and 2 generalized place invariants in 9 ms returned sat
[2023-03-13 08:30:10] [INFO ] After 488ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-13 08:30:10] [INFO ] State equation strengthened by 330 read => feed constraints.
[2023-03-13 08:30:11] [INFO ] After 724ms SMT Verify possible using 330 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-13 08:30:11] [INFO ] Deduced a trap composed of 9 places in 173 ms of which 0 ms to minimize.
[2023-03-13 08:30:11] [INFO ] Deduced a trap composed of 33 places in 182 ms of which 1 ms to minimize.
[2023-03-13 08:30:12] [INFO ] Deduced a trap composed of 296 places in 158 ms of which 1 ms to minimize.
[2023-03-13 08:30:12] [INFO ] Deduced a trap composed of 33 places in 184 ms of which 0 ms to minimize.
[2023-03-13 08:30:12] [INFO ] Deduced a trap composed of 297 places in 174 ms of which 0 ms to minimize.
[2023-03-13 08:30:12] [INFO ] Deduced a trap composed of 299 places in 179 ms of which 1 ms to minimize.
[2023-03-13 08:30:13] [INFO ] Deduced a trap composed of 293 places in 194 ms of which 1 ms to minimize.
[2023-03-13 08:30:13] [INFO ] Deduced a trap composed of 295 places in 233 ms of which 1 ms to minimize.
[2023-03-13 08:30:13] [INFO ] Deduced a trap composed of 289 places in 207 ms of which 0 ms to minimize.
[2023-03-13 08:30:13] [INFO ] Deduced a trap composed of 294 places in 153 ms of which 0 ms to minimize.
[2023-03-13 08:30:14] [INFO ] Deduced a trap composed of 300 places in 185 ms of which 0 ms to minimize.
[2023-03-13 08:30:14] [INFO ] Deduced a trap composed of 293 places in 196 ms of which 1 ms to minimize.
[2023-03-13 08:30:14] [INFO ] Deduced a trap composed of 304 places in 224 ms of which 0 ms to minimize.
[2023-03-13 08:30:14] [INFO ] Deduced a trap composed of 299 places in 194 ms of which 0 ms to minimize.
[2023-03-13 08:30:15] [INFO ] Deduced a trap composed of 301 places in 188 ms of which 0 ms to minimize.
[2023-03-13 08:30:15] [INFO ] Trap strengthening (SAT) tested/added 16/15 trap constraints in 3947 ms
[2023-03-13 08:30:15] [INFO ] After 5051ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 512 ms.
[2023-03-13 08:30:15] [INFO ] After 6328ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 19 ms.
Support contains 43 out of 753 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 753/753 places, 571/571 transitions.
Applied a total of 0 rules in 33 ms. Remains 753 /753 variables (removed 0) and now considering 571/571 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 33 ms. Remains : 753/753 places, 571/571 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 753/753 places, 571/571 transitions.
Applied a total of 0 rules in 20 ms. Remains 753 /753 variables (removed 0) and now considering 571/571 (removed 0) transitions.
[2023-03-13 08:30:16] [INFO ] Invariant cache hit.
[2023-03-13 08:30:16] [INFO ] Implicit Places using invariants in 615 ms returned [581, 595, 601, 607, 613, 619, 633, 639, 645, 651, 655, 659, 663, 667, 671, 674, 676, 683, 685, 687, 690, 695, 700, 709, 710, 715, 720, 725, 734, 735, 740, 745]
Discarding 32 places :
Implicit Place search using SMT only with invariants took 619 ms to find 32 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 721/753 places, 571/571 transitions.
Discarding 31 places :
Symmetric choice reduction at 0 with 31 rule applications. Total rules 31 place count 690 transition count 540
Iterating global reduction 0 with 31 rules applied. Total rules applied 62 place count 690 transition count 540
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 64 place count 690 transition count 538
Applied a total of 64 rules in 73 ms. Remains 690 /721 variables (removed 31) and now considering 538/571 (removed 33) transitions.
// Phase 1: matrix 538 rows 690 cols
[2023-03-13 08:30:16] [INFO ] Computed 204 place invariants in 5 ms
[2023-03-13 08:30:17] [INFO ] Implicit Places using invariants in 563 ms returned []
[2023-03-13 08:30:17] [INFO ] Invariant cache hit.
[2023-03-13 08:30:17] [INFO ] State equation strengthened by 330 read => feed constraints.
[2023-03-13 08:30:20] [INFO ] Implicit Places using invariants and state equation in 3107 ms returned [6, 8, 9, 13, 15, 20, 27, 29, 30, 32, 36, 37, 39, 40, 42, 43, 47, 48, 54, 56, 57, 59, 60, 62, 72, 75, 76, 78, 83, 84, 86, 87, 89, 90, 92, 98, 100, 101, 103, 104, 106, 107, 109, 110, 112, 113, 115, 116, 118, 119, 121, 125, 130, 131, 140, 186, 191, 206, 217]
Discarding 59 places :
Implicit Place search using SMT with State Equation took 3683 ms to find 59 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 631/753 places, 538/571 transitions.
Drop transitions removed 110 transitions
Trivial Post-agglo rules discarded 110 transitions
Performed 110 trivial Post agglomeration. Transition count delta: 110
Iterating post reduction 0 with 110 rules applied. Total rules applied 110 place count 631 transition count 428
Reduce places removed 110 places and 0 transitions.
Iterating post reduction 1 with 110 rules applied. Total rules applied 220 place count 521 transition count 428
Performed 46 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 46 Pre rules applied. Total rules applied 220 place count 521 transition count 382
Deduced a syphon composed of 46 places in 2 ms
Reduce places removed 46 places and 0 transitions.
Iterating global reduction 2 with 92 rules applied. Total rules applied 312 place count 475 transition count 382
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 325 place count 462 transition count 369
Iterating global reduction 2 with 13 rules applied. Total rules applied 338 place count 462 transition count 369
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 2 with 2 rules applied. Total rules applied 340 place count 461 transition count 368
Applied a total of 340 rules in 88 ms. Remains 461 /631 variables (removed 170) and now considering 368/538 (removed 170) transitions.
// Phase 1: matrix 368 rows 461 cols
[2023-03-13 08:30:20] [INFO ] Computed 145 place invariants in 6 ms
[2023-03-13 08:30:20] [INFO ] Implicit Places using invariants in 380 ms returned []
[2023-03-13 08:30:20] [INFO ] Invariant cache hit.
[2023-03-13 08:30:21] [INFO ] State equation strengthened by 156 read => feed constraints.
[2023-03-13 08:30:21] [INFO ] Implicit Places using invariants and state equation in 967 ms returned []
Implicit Place search using SMT with State Equation took 1350 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 461/753 places, 368/571 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 5833 ms. Remains : 461/753 places, 368/571 transitions.
Incomplete random walk after 10000 steps, including 42 resets, run finished after 161 ms. (steps per millisecond=62 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 2) seen :1
FORMULA AutoFlight-PT-48b-ReachabilityFireability-13 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Running SMT prover for 1 properties.
[2023-03-13 08:30:22] [INFO ] Invariant cache hit.
[2023-03-13 08:30:22] [INFO ] After 91ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-13 08:30:22] [INFO ] [Nat]Absence check using 145 positive place invariants in 37 ms returned sat
[2023-03-13 08:30:22] [INFO ] After 481ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-13 08:30:22] [INFO ] State equation strengthened by 156 read => feed constraints.
[2023-03-13 08:30:23] [INFO ] After 160ms SMT Verify possible using 156 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-13 08:30:23] [INFO ] Deduced a trap composed of 14 places in 129 ms of which 1 ms to minimize.
[2023-03-13 08:30:23] [INFO ] Deduced a trap composed of 8 places in 79 ms of which 1 ms to minimize.
[2023-03-13 08:30:23] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 298 ms
[2023-03-13 08:30:23] [INFO ] After 554ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 159 ms.
[2023-03-13 08:30:23] [INFO ] After 1337ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 5 ms.
Support contains 39 out of 461 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 461/461 places, 368/368 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 461 transition count 367
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 460 transition count 367
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 6 place count 458 transition count 365
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 7 place count 458 transition count 364
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 8 place count 457 transition count 364
Applied a total of 8 rules in 70 ms. Remains 457 /461 variables (removed 4) and now considering 364/368 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 70 ms. Remains : 457/461 places, 364/368 transitions.
Incomplete random walk after 10000 steps, including 32 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 481947 steps, run timeout after 3001 ms. (steps per millisecond=160 ) properties seen :{}
Probabilistic random walk after 481947 steps, saw 121923 distinct states, run finished after 3001 ms. (steps per millisecond=160 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 364 rows 457 cols
[2023-03-13 08:30:26] [INFO ] Computed 145 place invariants in 5 ms
[2023-03-13 08:30:26] [INFO ] After 112ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-13 08:30:26] [INFO ] [Nat]Absence check using 145 positive place invariants in 33 ms returned sat
[2023-03-13 08:30:27] [INFO ] After 271ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-13 08:30:27] [INFO ] State equation strengthened by 159 read => feed constraints.
[2023-03-13 08:30:27] [INFO ] After 180ms SMT Verify possible using 159 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-13 08:30:27] [INFO ] Deduced a trap composed of 8 places in 142 ms of which 0 ms to minimize.
[2023-03-13 08:30:27] [INFO ] Deduced a trap composed of 190 places in 146 ms of which 1 ms to minimize.
[2023-03-13 08:30:28] [INFO ] Deduced a trap composed of 189 places in 158 ms of which 0 ms to minimize.
[2023-03-13 08:30:28] [INFO ] Deduced a trap composed of 187 places in 134 ms of which 1 ms to minimize.
[2023-03-13 08:30:28] [INFO ] Deduced a trap composed of 188 places in 173 ms of which 0 ms to minimize.
[2023-03-13 08:30:28] [INFO ] Deduced a trap composed of 190 places in 168 ms of which 1 ms to minimize.
[2023-03-13 08:30:28] [INFO ] Deduced a trap composed of 190 places in 145 ms of which 1 ms to minimize.
[2023-03-13 08:30:29] [INFO ] Deduced a trap composed of 189 places in 145 ms of which 0 ms to minimize.
[2023-03-13 08:30:29] [INFO ] Deduced a trap composed of 190 places in 117 ms of which 0 ms to minimize.
[2023-03-13 08:30:29] [INFO ] Deduced a trap composed of 190 places in 136 ms of which 0 ms to minimize.
[2023-03-13 08:30:29] [INFO ] Deduced a trap composed of 181 places in 139 ms of which 1 ms to minimize.
[2023-03-13 08:30:29] [INFO ] Deduced a trap composed of 191 places in 123 ms of which 1 ms to minimize.
[2023-03-13 08:30:29] [INFO ] Deduced a trap composed of 191 places in 134 ms of which 0 ms to minimize.
[2023-03-13 08:30:29] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 2310 ms
[2023-03-13 08:30:29] [INFO ] After 2583ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 134 ms.
[2023-03-13 08:30:30] [INFO ] After 3141ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 7 ms.
Support contains 39 out of 457 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 457/457 places, 364/364 transitions.
Applied a total of 0 rules in 20 ms. Remains 457 /457 variables (removed 0) and now considering 364/364 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20 ms. Remains : 457/457 places, 364/364 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 457/457 places, 364/364 transitions.
Applied a total of 0 rules in 16 ms. Remains 457 /457 variables (removed 0) and now considering 364/364 (removed 0) transitions.
[2023-03-13 08:30:30] [INFO ] Invariant cache hit.
[2023-03-13 08:30:30] [INFO ] Implicit Places using invariants in 501 ms returned []
[2023-03-13 08:30:30] [INFO ] Invariant cache hit.
[2023-03-13 08:30:30] [INFO ] State equation strengthened by 159 read => feed constraints.
[2023-03-13 08:30:31] [INFO ] Implicit Places using invariants and state equation in 980 ms returned [19, 22, 84]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 1484 ms to find 3 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 454/457 places, 364/364 transitions.
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 7 Pre rules applied. Total rules applied 0 place count 454 transition count 357
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 0 with 14 rules applied. Total rules applied 14 place count 447 transition count 357
Applied a total of 14 rules in 24 ms. Remains 447 /454 variables (removed 7) and now considering 357/364 (removed 7) transitions.
// Phase 1: matrix 357 rows 447 cols
[2023-03-13 08:30:31] [INFO ] Computed 142 place invariants in 5 ms
[2023-03-13 08:30:31] [INFO ] Implicit Places using invariants in 315 ms returned []
[2023-03-13 08:30:31] [INFO ] Invariant cache hit.
[2023-03-13 08:30:32] [INFO ] State equation strengthened by 152 read => feed constraints.
[2023-03-13 08:30:32] [INFO ] Implicit Places using invariants and state equation in 882 ms returned []
Implicit Place search using SMT with State Equation took 1199 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 447/457 places, 357/364 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 2723 ms. Remains : 447/457 places, 357/364 transitions.
Incomplete random walk after 10000 steps, including 42 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 517659 steps, run timeout after 3001 ms. (steps per millisecond=172 ) properties seen :{}
Probabilistic random walk after 517659 steps, saw 129456 distinct states, run finished after 3001 ms. (steps per millisecond=172 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-13 08:30:35] [INFO ] Invariant cache hit.
[2023-03-13 08:30:35] [INFO ] After 94ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-13 08:30:36] [INFO ] [Nat]Absence check using 142 positive place invariants in 51 ms returned sat
[2023-03-13 08:30:36] [INFO ] After 330ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-13 08:30:36] [INFO ] State equation strengthened by 152 read => feed constraints.
[2023-03-13 08:30:36] [INFO ] After 196ms SMT Verify possible using 152 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-13 08:30:36] [INFO ] Deduced a trap composed of 13 places in 158 ms of which 0 ms to minimize.
[2023-03-13 08:30:37] [INFO ] Deduced a trap composed of 13 places in 67 ms of which 0 ms to minimize.
[2023-03-13 08:30:37] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 303 ms
[2023-03-13 08:30:37] [INFO ] After 566ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 128 ms.
[2023-03-13 08:30:37] [INFO ] After 1231ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 5 ms.
Support contains 39 out of 447 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 447/447 places, 357/357 transitions.
Applied a total of 0 rules in 19 ms. Remains 447 /447 variables (removed 0) and now considering 357/357 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19 ms. Remains : 447/447 places, 357/357 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 447/447 places, 357/357 transitions.
Applied a total of 0 rules in 18 ms. Remains 447 /447 variables (removed 0) and now considering 357/357 (removed 0) transitions.
[2023-03-13 08:30:37] [INFO ] Invariant cache hit.
[2023-03-13 08:30:37] [INFO ] Implicit Places using invariants in 269 ms returned []
[2023-03-13 08:30:37] [INFO ] Invariant cache hit.
[2023-03-13 08:30:37] [INFO ] State equation strengthened by 152 read => feed constraints.
[2023-03-13 08:30:38] [INFO ] Implicit Places using invariants and state equation in 999 ms returned []
Implicit Place search using SMT with State Equation took 1271 ms to find 0 implicit places.
[2023-03-13 08:30:38] [INFO ] Redundant transitions in 31 ms returned []
[2023-03-13 08:30:38] [INFO ] Invariant cache hit.
[2023-03-13 08:30:39] [INFO ] Dead Transitions using invariants and state equation in 465 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1818 ms. Remains : 447/447 places, 357/357 transitions.
Graph (complete) has 706 edges and 447 vertex of which 344 are kept as prefixes of interest. Removing 103 places using SCC suffix rule.2 ms
Discarding 103 places :
Also discarding 0 output transitions
Drop transitions removed 45 transitions
Trivial Post-agglo rules discarded 45 transitions
Performed 45 trivial Post agglomeration. Transition count delta: 45
Iterating post reduction 0 with 45 rules applied. Total rules applied 46 place count 344 transition count 312
Reduce places removed 45 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 46 rules applied. Total rules applied 92 place count 299 transition count 311
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 93 place count 298 transition count 311
Performed 51 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 51 Pre rules applied. Total rules applied 93 place count 298 transition count 260
Renaming transitions due to excessive name length > 1024 char.
Deduced a syphon composed of 51 places in 1 ms
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 3 with 102 rules applied. Total rules applied 195 place count 247 transition count 260
Discarding 19 places :
Symmetric choice reduction at 3 with 19 rule applications. Total rules 214 place count 228 transition count 241
Iterating global reduction 3 with 19 rules applied. Total rules applied 233 place count 228 transition count 241
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 235 place count 228 transition count 239
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 4 with 2 rules applied. Total rules applied 237 place count 227 transition count 238
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 238 place count 227 transition count 237
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 239 place count 227 transition count 236
Free-agglomeration rule (complex) applied 14 times.
Iterating global reduction 5 with 14 rules applied. Total rules applied 253 place count 227 transition count 222
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 5 with 14 rules applied. Total rules applied 267 place count 213 transition count 222
Partial Free-agglomeration rule applied 41 times.
Drop transitions removed 41 transitions
Iterating global reduction 6 with 41 rules applied. Total rules applied 308 place count 213 transition count 222
Applied a total of 308 rules in 55 ms. Remains 213 /447 variables (removed 234) and now considering 222/357 (removed 135) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 222 rows 213 cols
[2023-03-13 08:30:39] [INFO ] Computed 39 place invariants in 1 ms
[2023-03-13 08:30:39] [INFO ] After 65ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-13 08:30:39] [INFO ] [Nat]Absence check using 39 positive place invariants in 7 ms returned sat
[2023-03-13 08:30:39] [INFO ] After 136ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-13 08:30:39] [INFO ] Deduced a trap composed of 5 places in 95 ms of which 0 ms to minimize.
[2023-03-13 08:30:39] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 124 ms
[2023-03-13 08:30:39] [INFO ] After 302ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 84 ms.
[2023-03-13 08:30:39] [INFO ] After 453ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2023-03-13 08:30:39] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 10 ms.
[2023-03-13 08:30:39] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 447 places, 357 transitions and 1431 arcs took 5 ms.
[2023-03-13 08:30:40] [INFO ] Flatten gal took : 93 ms
Total runtime 90139 ms.
There are residual formulas that ITS could not solve within timeout
timeout --kill-after=10s --signal=SIGINT 1m for testing only

Marcie built on Linux at 2019-11-18.
A model checker for Generalized Stochastic Petri nets

authors: Alex Tovchigrechko (IDD package and CTL model checking)

Martin Schwarick (Symbolic numerical analysis and CSL model checking)

Christian Rohr (Simulative and approximative numerical model checking)

marcie@informatik.tu-cottbus.de

called as: /home/mcc/BenchKit/bin//../reducer/bin//../../marcie/bin/marcie --net-file=model.pnml --mcc-file=ReachabilityFireability.xml --memory=6 --mcc-mode

parse successfull
net created successfully

Net: AutoFlight_PT_48b
(NrP: 447 NrTr: 357 NrArc: 1431)

parse formulas
formulas created successfully
place and transition orderings generation:0m 0.013sec

net check time: 0m 0.000sec

init dd package: 0m 2.874sec

TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393236 kB
MemFree: 6225836 kB
After kill :
MemTotal: 16393236 kB
MemFree: 16095808 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
check for maximal unmarked siphon
ok
check for constant places
ok
check if there are places and transitions
ok
check if there are transitions without pre-places
ok
check if at least one transition is enabled in m0
ok
check if there are transitions that can never fire
ok


initing FirstDep: 0m 0.000sec

335112 560763

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-48b"
export BK_EXAMINATION="ReachabilityFireability"
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-48b, 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 r010-oct2-167813599200511"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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