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.r009-oct2-167813598000495.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 ltsminxred
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 r009-oct2-167813598000495
=====================================================================

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

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=ltsminxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=AutoFlight-PT-24b
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-12 14:51:01] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-03-12 14:51:01] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-12 14:51:01] [INFO ] Load time of PNML (sax parser for PT used): 182 ms
[2023-03-12 14:51:01] [INFO ] Transformed 2230 places.
[2023-03-12 14:51:01] [INFO ] Transformed 2228 transitions.
[2023-03-12 14:51:01] [INFO ] Found NUPN structural information;
[2023-03-12 14:51:01] [INFO ] Parsed PT model containing 2230 places and 2228 transitions and 5186 arcs in 419 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 11 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 9 resets, run finished after 540 ms. (steps per millisecond=18 ) properties (out of 16) seen :7
FORMULA AutoFlight-PT-24b-ReachabilityFireability-14 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 66 ms. (steps per millisecond=151 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 9) 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 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 9) seen :0
Running SMT prover for 9 properties.
// Phase 1: matrix 2228 rows 2230 cols
[2023-03-12 14:51:02] [INFO ] Computed 148 place invariants in 68 ms
[2023-03-12 14:51:04] [INFO ] After 1631ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2023-03-12 14:51:05] [INFO ] [Nat]Absence check using 147 positive place invariants in 260 ms returned sat
[2023-03-12 14:51:05] [INFO ] [Nat]Absence check using 147 positive and 1 generalized place invariants in 39 ms returned sat
[2023-03-12 14:51:10] [INFO ] After 4109ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :9
[2023-03-12 14:51:12] [INFO ] Deduced a trap composed of 99 places in 1114 ms of which 22 ms to minimize.
[2023-03-12 14:51:13] [INFO ] Deduced a trap composed of 122 places in 906 ms of which 2 ms to minimize.
[2023-03-12 14:51:13] [INFO ] Deduced a trap composed of 119 places in 775 ms of which 3 ms to minimize.
[2023-03-12 14:51:14] [INFO ] Deduced a trap composed of 257 places in 892 ms of which 17 ms to minimize.
[2023-03-12 14:51:15] [INFO ] Deduced a trap composed of 132 places in 708 ms of which 16 ms to minimize.
[2023-03-12 14:51:16] [INFO ] Deduced a trap composed of 244 places in 718 ms of which 2 ms to minimize.
[2023-03-12 14:51:17] [INFO ] Deduced a trap composed of 228 places in 643 ms of which 2 ms to minimize.
[2023-03-12 14:51:18] [INFO ] Deduced a trap composed of 223 places in 873 ms of which 1 ms to minimize.
[2023-03-12 14:51:19] [INFO ] Deduced a trap composed of 241 places in 652 ms of which 59 ms to minimize.
[2023-03-12 14:51:20] [INFO ] Deduced a trap composed of 115 places in 1066 ms of which 6 ms to minimize.
[2023-03-12 14:51:20] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 9559 ms
[2023-03-12 14:51:21] [INFO ] Deduced a trap composed of 58 places in 649 ms of which 2 ms to minimize.
[2023-03-12 14:51:22] [INFO ] Deduced a trap composed of 55 places in 1371 ms of which 2 ms to minimize.
[2023-03-12 14:51:23] [INFO ] Deduced a trap composed of 99 places in 853 ms of which 1 ms to minimize.
[2023-03-12 14:51:24] [INFO ] Deduced a trap composed of 91 places in 688 ms of which 1 ms to minimize.
[2023-03-12 14:51:25] [INFO ] Deduced a trap composed of 92 places in 731 ms of which 1 ms to minimize.
[2023-03-12 14:51:26] [INFO ] Deduced a trap composed of 86 places in 623 ms of which 1 ms to minimize.
[2023-03-12 14:51:26] [INFO ] Deduced a trap composed of 113 places in 552 ms of which 1 ms to minimize.
[2023-03-12 14:51:27] [INFO ] Deduced a trap composed of 117 places in 778 ms of which 1 ms to minimize.
[2023-03-12 14:51:28] [INFO ] Deduced a trap composed of 138 places in 690 ms of which 1 ms to minimize.
[2023-03-12 14:51:29] [INFO ] Deduced a trap composed of 119 places in 791 ms of which 5 ms to minimize.
[2023-03-12 14:51:30] [INFO ] Deduced a trap composed of 127 places in 843 ms of which 2 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-12 14:51:30] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-12 14:51:30] [INFO ] After 25714ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:9
FORMULA AutoFlight-PT-24b-ReachabilityFireability-13 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA AutoFlight-PT-24b-ReachabilityFireability-01 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA AutoFlight-PT-24b-ReachabilityFireability-04 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA AutoFlight-PT-24b-ReachabilityFireability-08 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 4 properties in 380 ms.
Support contains 60 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 105 transitions
Reduce isomorphic transitions removed 105 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 969 rules applied. Total rules applied 1793 place count 1406 transition count 1259
Reduce places removed 40 places and 0 transitions.
Performed 33 Post agglomeration using F-continuation condition.Transition count delta: 33
Iterating post reduction 2 with 73 rules applied. Total rules applied 1866 place count 1366 transition count 1226
Reduce places removed 33 places and 0 transitions.
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 3 with 46 rules applied. Total rules applied 1912 place count 1333 transition count 1213
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 1914 place count 1331 transition count 1213
Performed 278 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 278 Pre rules applied. Total rules applied 1914 place count 1331 transition count 935
Deduced a syphon composed of 278 places in 4 ms
Reduce places removed 278 places and 0 transitions.
Iterating global reduction 5 with 556 rules applied. Total rules applied 2470 place count 1053 transition count 935
Discarding 199 places :
Symmetric choice reduction at 5 with 199 rule applications. Total rules 2669 place count 854 transition count 736
Iterating global reduction 5 with 199 rules applied. Total rules applied 2868 place count 854 transition count 736
Performed 63 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 63 Pre rules applied. Total rules applied 2868 place count 854 transition count 673
Deduced a syphon composed of 63 places in 3 ms
Reduce places removed 63 places and 0 transitions.
Iterating global reduction 5 with 126 rules applied. Total rules applied 2994 place count 791 transition count 673
Performed 186 Post agglomeration using F-continuation condition.Transition count delta: 186
Deduced a syphon composed of 186 places in 0 ms
Reduce places removed 186 places and 0 transitions.
Iterating global reduction 5 with 372 rules applied. Total rules applied 3366 place count 605 transition count 487
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 5 with 2 rules applied. Total rules applied 3368 place count 604 transition count 487
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 5 with 3 rules applied. Total rules applied 3371 place count 604 transition count 484
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 3373 place count 603 transition count 483
Free-agglomeration rule applied 85 times.
Iterating global reduction 5 with 85 rules applied. Total rules applied 3458 place count 603 transition count 398
Reduce places removed 85 places and 0 transitions.
Iterating post reduction 5 with 85 rules applied. Total rules applied 3543 place count 518 transition count 398
Applied a total of 3543 rules in 550 ms. Remains 518 /2230 variables (removed 1712) and now considering 398/2228 (removed 1830) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 550 ms. Remains : 518/2230 places, 398/2228 transitions.
Incomplete random walk after 10000 steps, including 105 resets, run finished after 114 ms. (steps per millisecond=87 ) properties (out of 5) seen :3
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-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 7 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 398 rows 518 cols
[2023-03-12 14:51:31] [INFO ] Computed 148 place invariants in 5 ms
[2023-03-12 14:51:31] [INFO ] After 139ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-12 14:51:31] [INFO ] [Nat]Absence check using 146 positive place invariants in 28 ms returned sat
[2023-03-12 14:51:31] [INFO ] [Nat]Absence check using 146 positive and 2 generalized place invariants in 4 ms returned sat
[2023-03-12 14:51:32] [INFO ] After 470ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-12 14:51:32] [INFO ] State equation strengthened by 195 read => feed constraints.
[2023-03-12 14:51:32] [INFO ] After 246ms SMT Verify possible using 195 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-12 14:51:33] [INFO ] Deduced a trap composed of 150 places in 370 ms of which 22 ms to minimize.
[2023-03-12 14:51:33] [INFO ] Deduced a trap composed of 8 places in 491 ms of which 25 ms to minimize.
[2023-03-12 14:51:33] [INFO ] Deduced a trap composed of 123 places in 282 ms of which 0 ms to minimize.
[2023-03-12 14:51:34] [INFO ] Deduced a trap composed of 8 places in 175 ms of which 0 ms to minimize.
[2023-03-12 14:51:34] [INFO ] Deduced a trap composed of 115 places in 186 ms of which 0 ms to minimize.
[2023-03-12 14:51:41] [INFO ] Deduced a trap composed of 53 places in 6602 ms of which 26 ms to minimize.
[2023-03-12 14:51:41] [INFO ] Deduced a trap composed of 146 places in 362 ms of which 5 ms to minimize.
[2023-03-12 14:51:41] [INFO ] Deduced a trap composed of 118 places in 145 ms of which 1 ms to minimize.
[2023-03-12 14:51:41] [INFO ] Deduced a trap composed of 135 places in 188 ms of which 0 ms to minimize.
[2023-03-12 14:51:41] [INFO ] Deduced a trap composed of 149 places in 99 ms of which 1 ms to minimize.
[2023-03-12 14:51:42] [INFO ] Deduced a trap composed of 8 places in 241 ms of which 1 ms to minimize.
[2023-03-12 14:51:42] [INFO ] Deduced a trap composed of 150 places in 170 ms of which 1 ms to minimize.
[2023-03-12 14:51:43] [INFO ] Deduced a trap composed of 186 places in 688 ms of which 17 ms to minimize.
[2023-03-12 14:51:43] [INFO ] Deduced a trap composed of 204 places in 584 ms of which 1 ms to minimize.
[2023-03-12 14:51:43] [INFO ] Deduced a trap composed of 8 places in 119 ms of which 0 ms to minimize.
[2023-03-12 14:51:44] [INFO ] Deduced a trap composed of 156 places in 240 ms of which 1 ms to minimize.
[2023-03-12 14:51:44] [INFO ] Deduced a trap composed of 158 places in 458 ms of which 0 ms to minimize.
[2023-03-12 14:51:44] [INFO ] Deduced a trap composed of 8 places in 159 ms of which 0 ms to minimize.
[2023-03-12 14:51:45] [INFO ] Deduced a trap composed of 8 places in 169 ms of which 1 ms to minimize.
[2023-03-12 14:51:45] [INFO ] Deduced a trap composed of 157 places in 184 ms of which 0 ms to minimize.
[2023-03-12 14:51:45] [INFO ] Deduced a trap composed of 158 places in 161 ms of which 1 ms to minimize.
[2023-03-12 14:51:45] [INFO ] Deduced a trap composed of 158 places in 121 ms of which 13 ms to minimize.
[2023-03-12 14:51:45] [INFO ] Deduced a trap composed of 162 places in 156 ms of which 0 ms to minimize.
[2023-03-12 14:51:46] [INFO ] Deduced a trap composed of 213 places in 223 ms of which 1 ms to minimize.
[2023-03-12 14:51:46] [INFO ] Trap strengthening (SAT) tested/added 25/24 trap constraints in 13303 ms
[2023-03-12 14:51:46] [INFO ] Deduced a trap composed of 214 places in 316 ms of which 1 ms to minimize.
[2023-03-12 14:51:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 355 ms
[2023-03-12 14:51:46] [INFO ] After 14061ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 140 ms.
[2023-03-12 14:51:46] [INFO ] After 14949ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 12 ms.
Support contains 22 out of 518 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 518/518 places, 398/398 transitions.
Drop transitions removed 17 transitions
Trivial Post-agglo rules discarded 17 transitions
Performed 17 trivial Post agglomeration. Transition count delta: 17
Iterating post reduction 0 with 17 rules applied. Total rules applied 17 place count 518 transition count 381
Reduce places removed 17 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 18 rules applied. Total rules applied 35 place count 501 transition count 380
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 36 place count 500 transition count 380
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 36 place count 500 transition count 372
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 52 place count 492 transition count 372
Performed 22 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 22 places in 0 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 3 with 44 rules applied. Total rules applied 96 place count 470 transition count 349
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 97 place count 470 transition count 348
Free-agglomeration rule applied 8 times.
Iterating global reduction 4 with 8 rules applied. Total rules applied 105 place count 470 transition count 340
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 113 place count 462 transition count 340
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 114 place count 461 transition count 339
Reduce places removed 26 places and 0 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 5 with 29 rules applied. Total rules applied 143 place count 435 transition count 336
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 146 place count 432 transition count 336
Performed 22 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 22 Pre rules applied. Total rules applied 146 place count 432 transition count 314
Deduced a syphon composed of 22 places in 0 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 7 with 44 rules applied. Total rules applied 190 place count 410 transition count 314
Applied a total of 190 rules in 196 ms. Remains 410 /518 variables (removed 108) and now considering 314/398 (removed 84) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 196 ms. Remains : 410/518 places, 314/398 transitions.
Incomplete random walk after 10000 steps, including 119 resets, run finished after 217 ms. (steps per millisecond=46 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 41 ms. (steps per millisecond=243 ) 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 15 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 314 rows 410 cols
[2023-03-12 14:51:47] [INFO ] Computed 122 place invariants in 31 ms
[2023-03-12 14:51:47] [INFO ] After 134ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 14:51:47] [INFO ] [Nat]Absence check using 120 positive place invariants in 59 ms returned sat
[2023-03-12 14:51:47] [INFO ] [Nat]Absence check using 120 positive and 2 generalized place invariants in 21 ms returned sat
[2023-03-12 14:51:47] [INFO ] After 149ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 14:51:47] [INFO ] State equation strengthened by 199 read => feed constraints.
[2023-03-12 14:51:47] [INFO ] After 117ms SMT Verify possible using 199 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-12 14:51:47] [INFO ] After 187ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 29 ms.
[2023-03-12 14:51:47] [INFO ] After 636ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 3 out of 410 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 410/410 places, 314/314 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 410 transition count 308
Reduce places removed 6 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 7 rules applied. Total rules applied 13 place count 404 transition count 307
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 14 place count 403 transition count 307
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 14 place count 403 transition count 303
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 24 place count 397 transition count 303
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 24 place count 397 transition count 301
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 28 place count 395 transition count 301
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 40 place count 389 transition count 295
Free-agglomeration rule applied 3 times.
Iterating global reduction 3 with 3 rules applied. Total rules applied 43 place count 389 transition count 292
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 46 place count 386 transition count 292
Partial Free-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 4 with 4 rules applied. Total rules applied 50 place count 386 transition count 292
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 54 place count 382 transition count 288
Iterating global reduction 4 with 4 rules applied. Total rules applied 58 place count 382 transition count 288
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 60 place count 380 transition count 286
Reduce places removed 72 places and 0 transitions.
Drop transitions removed 155 transitions
Trivial Post-agglo rules discarded 155 transitions
Performed 155 trivial Post agglomeration. Transition count delta: 155
Iterating post reduction 4 with 227 rules applied. Total rules applied 287 place count 308 transition count 131
Reduce places removed 155 places and 0 transitions.
Iterating post reduction 5 with 155 rules applied. Total rules applied 442 place count 153 transition count 131
Performed 32 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 32 Pre rules applied. Total rules applied 442 place count 153 transition count 99
Renaming transitions due to excessive name length > 1024 char.
Deduced a syphon composed of 32 places in 0 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 6 with 64 rules applied. Total rules applied 506 place count 121 transition count 99
Applied a total of 506 rules in 107 ms. Remains 121 /410 variables (removed 289) and now considering 99/314 (removed 215) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 107 ms. Remains : 121/410 places, 99/314 transitions.
Incomplete random walk after 10000 steps, including 232 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 1) seen :0
Finished Best-First random walk after 4157 steps, including 6 resets, run visited all 1 properties in 5 ms. (steps per millisecond=831 )
FORMULA AutoFlight-PT-24b-ReachabilityFireability-07 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
All properties solved without resorting to model-checking.
Total runtime 47031 ms.
pnml2lts-sym model.pnml --lace-workers=4 --vset=lddmc --saturation=sat -rbs,w2W,ru,hf --sylvan-sizes=20,28,20,28 --inv-bin-par --invariant=/tmp/637/inv_0_ --invariant=/tmp/637/inv_1_ --invariant=/tmp/637/inv_2_ --invariant=/tmp/637/inv_3_ --invariant=/tmp/637/inv_4_ --invariant=/tmp/637/inv_5_ --invariant=/tmp/637/inv_6_ --invariant=/tmp/637/inv_7_ --invariant=/tmp/637/inv_8_ --invariant=/tmp/637/inv_9_ --invariant=/tmp/637/inv_10_ --invariant=/tmp/637/inv_11_ --invariant=/tmp/637/inv_12_ --invariant=/tmp/637/inv_13_ --invariant=/tmp/637/inv_14_ --invariant=/tmp/637/inv_15_ --inv-par
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393220 kB
MemFree: 8920108 kB
After kill :
MemTotal: 16393220 kB
MemFree: 16100096 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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ 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
mcc2023

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="ltsminxred"
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 ltsminxred"
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 r009-oct2-167813598000495"
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 ;