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.r021-oct2-167813608900288.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 lolaxred
Input is AutoFlight-PT-06b, examination is StableMarking
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r021-oct2-167813608900288
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 560K
-rw-r--r-- 1 mcc users 6.2K Feb 25 18:09 CTLCardinality.txt
-rw-r--r-- 1 mcc users 63K Feb 25 18:09 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.4K Feb 25 18:08 CTLFireability.txt
-rw-r--r-- 1 mcc users 62K Feb 25 18:08 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.3K Feb 25 15:32 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Feb 25 15:32 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 15:32 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 15:32 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.3K Feb 25 18:10 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 83K Feb 25 18:10 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Feb 25 18:09 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 93K Feb 25 18:09 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 134K 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

FORMULA_NAME StableMarking

=== Now, execution of the tool begins

BK_START 1678932208280

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=lolaxred
BK_EXAMINATION=StableMarking
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=AutoFlight-PT-06b
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-16 02:03:31] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, StableMarking, -timeout, 180, -rebuildPNML]
[2023-03-16 02:03:31] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-16 02:03:31] [INFO ] Load time of PNML (sax parser for PT used): 82 ms
[2023-03-16 02:03:31] [INFO ] Transformed 574 places.
[2023-03-16 02:03:31] [INFO ] Transformed 572 transitions.
[2023-03-16 02:03:31] [INFO ] Found NUPN structural information;
[2023-03-16 02:03:31] [INFO ] Parsed PT model containing 574 places and 572 transitions and 1334 arcs in 256 ms.
Structural test allowed to assert that 341 places are NOT stable. Took 10 ms.
Incomplete random walk after 10000 steps, including 34 resets, run finished after 371 ms. (steps per millisecond=26 ) properties (out of 233) seen :100
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 133) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 133) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 1 ms. (steps per millisecond=100 ) properties (out of 133) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 133) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 133) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 133) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 133) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 1 ms. (steps per millisecond=101 ) properties (out of 133) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 133) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 133) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 133) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=8 ) properties (out of 133) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 133) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=25 ) properties (out of 133) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 133) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 133) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=8 ) properties (out of 133) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 133) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=25 ) properties (out of 133) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 133) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=16 ) properties (out of 133) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 133) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 133) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 133) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 133) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 133) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 133) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 133) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 133) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 133) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 133) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 133) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 133) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 1 ms. (steps per millisecond=101 ) properties (out of 133) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 133) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 133) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 133) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 133) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 133) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 133) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 133) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 133) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 133) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 133) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 133) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 133) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 133) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 1 ms. (steps per millisecond=101 ) properties (out of 133) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 133) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 1 ms. (steps per millisecond=101 ) properties (out of 133) seen :0
Running SMT prover for 133 properties.
// Phase 1: matrix 572 rows 574 cols
[2023-03-16 02:03:32] [INFO ] Computed 40 place invariants in 26 ms
[2023-03-16 02:03:36] [INFO ] After 3742ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:133
[2023-03-16 02:03:39] [INFO ] [Nat]Absence check using 39 positive place invariants in 64 ms returned sat
[2023-03-16 02:03:39] [INFO ] [Nat]Absence check using 39 positive and 1 generalized place invariants in 39 ms returned sat
[2023-03-16 02:03:46] [INFO ] After 5300ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :133
[2023-03-16 02:03:47] [INFO ] Deduced a trap composed of 15 places in 538 ms of which 11 ms to minimize.
[2023-03-16 02:03:47] [INFO ] Deduced a trap composed of 55 places in 416 ms of which 2 ms to minimize.
[2023-03-16 02:03:48] [INFO ] Deduced a trap composed of 26 places in 453 ms of which 1 ms to minimize.
[2023-03-16 02:03:48] [INFO ] Deduced a trap composed of 78 places in 299 ms of which 14 ms to minimize.
[2023-03-16 02:03:49] [INFO ] Deduced a trap composed of 46 places in 575 ms of which 0 ms to minimize.
[2023-03-16 02:03:49] [INFO ] Deduced a trap composed of 36 places in 153 ms of which 0 ms to minimize.
[2023-03-16 02:03:49] [INFO ] Deduced a trap composed of 28 places in 166 ms of which 1 ms to minimize.
[2023-03-16 02:03:49] [INFO ] Deduced a trap composed of 29 places in 44 ms of which 1 ms to minimize.
[2023-03-16 02:03:49] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 2890 ms
[2023-03-16 02:03:50] [INFO ] Deduced a trap composed of 68 places in 254 ms of which 1 ms to minimize.
[2023-03-16 02:03:50] [INFO ] Deduced a trap composed of 68 places in 328 ms of which 0 ms to minimize.
[2023-03-16 02:03:50] [INFO ] Deduced a trap composed of 70 places in 152 ms of which 0 ms to minimize.
[2023-03-16 02:03:50] [INFO ] Deduced a trap composed of 80 places in 115 ms of which 1 ms to minimize.
[2023-03-16 02:03:51] [INFO ] Deduced a trap composed of 87 places in 165 ms of which 1 ms to minimize.
[2023-03-16 02:03:51] [INFO ] Deduced a trap composed of 82 places in 142 ms of which 0 ms to minimize.
[2023-03-16 02:03:51] [INFO ] Deduced a trap composed of 69 places in 161 ms of which 1 ms to minimize.
[2023-03-16 02:03:51] [INFO ] Deduced a trap composed of 66 places in 229 ms of which 1 ms to minimize.
[2023-03-16 02:03:51] [INFO ] Deduced a trap composed of 67 places in 253 ms of which 1 ms to minimize.
[2023-03-16 02:03:52] [INFO ] Deduced a trap composed of 82 places in 136 ms of which 1 ms to minimize.
[2023-03-16 02:03:52] [INFO ] Deduced a trap composed of 65 places in 152 ms of which 1 ms to minimize.
[2023-03-16 02:03:52] [INFO ] Deduced a trap composed of 31 places in 150 ms of which 0 ms to minimize.
[2023-03-16 02:03:52] [INFO ] Deduced a trap composed of 96 places in 138 ms of which 1 ms to minimize.
[2023-03-16 02:03:53] [INFO ] Deduced a trap composed of 90 places in 711 ms of which 13 ms to minimize.
[2023-03-16 02:03:54] [INFO ] Deduced a trap composed of 81 places in 825 ms of which 1 ms to minimize.
[2023-03-16 02:03:54] [INFO ] Deduced a trap composed of 90 places in 191 ms of which 1 ms to minimize.
[2023-03-16 02:03:54] [INFO ] Deduced a trap composed of 91 places in 225 ms of which 0 ms to minimize.
[2023-03-16 02:03:55] [INFO ] Deduced a trap composed of 87 places in 249 ms of which 17 ms to minimize.
[2023-03-16 02:03:55] [INFO ] Deduced a trap composed of 72 places in 167 ms of which 0 ms to minimize.
[2023-03-16 02:03:55] [INFO ] Deduced a trap composed of 71 places in 127 ms of which 0 ms to minimize.
[2023-03-16 02:03:55] [INFO ] Deduced a trap composed of 95 places in 112 ms of which 1 ms to minimize.
[2023-03-16 02:03:55] [INFO ] Deduced a trap composed of 80 places in 131 ms of which 0 ms to minimize.
[2023-03-16 02:03:55] [INFO ] Deduced a trap composed of 74 places in 118 ms of which 0 ms to minimize.
[2023-03-16 02:03:55] [INFO ] Deduced a trap composed of 108 places in 173 ms of which 1 ms to minimize.
[2023-03-16 02:03:56] [INFO ] Deduced a trap composed of 101 places in 131 ms of which 0 ms to minimize.
[2023-03-16 02:03:56] [INFO ] Deduced a trap composed of 76 places in 116 ms of which 12 ms to minimize.
[2023-03-16 02:03:56] [INFO ] Deduced a trap composed of 69 places in 126 ms of which 1 ms to minimize.
[2023-03-16 02:03:56] [INFO ] Deduced a trap composed of 83 places in 225 ms of which 1 ms to minimize.
[2023-03-16 02:03:56] [INFO ] Deduced a trap composed of 91 places in 200 ms of which 1 ms to minimize.
[2023-03-16 02:03:57] [INFO ] Deduced a trap composed of 124 places in 121 ms of which 0 ms to minimize.
[2023-03-16 02:03:57] [INFO ] Deduced a trap composed of 82 places in 149 ms of which 15 ms to minimize.
[2023-03-16 02:03:57] [INFO ] Deduced a trap composed of 33 places in 176 ms of which 14 ms to minimize.
[2023-03-16 02:03:57] [INFO ] Deduced a trap composed of 79 places in 125 ms of which 0 ms to minimize.
[2023-03-16 02:03:57] [INFO ] Deduced a trap composed of 112 places in 107 ms of which 1 ms to minimize.
[2023-03-16 02:03:57] [INFO ] Deduced a trap composed of 94 places in 148 ms of which 1 ms to minimize.
[2023-03-16 02:03:57] [INFO ] Trap strengthening (SAT) tested/added 36/35 trap constraints in 7963 ms
[2023-03-16 02:03:58] [INFO ] Deduced a trap composed of 87 places in 164 ms of which 0 ms to minimize.
[2023-03-16 02:03:58] [INFO ] Deduced a trap composed of 82 places in 159 ms of which 0 ms to minimize.
[2023-03-16 02:03:58] [INFO ] Deduced a trap composed of 121 places in 146 ms of which 1 ms to minimize.
[2023-03-16 02:03:58] [INFO ] Deduced a trap composed of 83 places in 174 ms of which 1 ms to minimize.
[2023-03-16 02:03:59] [INFO ] Deduced a trap composed of 98 places in 293 ms of which 1 ms to minimize.
[2023-03-16 02:03:59] [INFO ] Deduced a trap composed of 84 places in 158 ms of which 0 ms to minimize.
[2023-03-16 02:03:59] [INFO ] Deduced a trap composed of 49 places in 125 ms of which 0 ms to minimize.
[2023-03-16 02:03:59] [INFO ] Deduced a trap composed of 50 places in 483 ms of which 14 ms to minimize.
[2023-03-16 02:04:00] [INFO ] Deduced a trap composed of 66 places in 154 ms of which 0 ms to minimize.
[2023-03-16 02:04:00] [INFO ] Deduced a trap composed of 42 places in 94 ms of which 0 ms to minimize.
[2023-03-16 02:04:00] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 2309 ms
[2023-03-16 02:04:00] [INFO ] Deduced a trap composed of 48 places in 172 ms of which 1 ms to minimize.
[2023-03-16 02:04:00] [INFO ] Deduced a trap composed of 46 places in 281 ms of which 0 ms to minimize.
[2023-03-16 02:04:01] [INFO ] Deduced a trap composed of 90 places in 131 ms of which 0 ms to minimize.
[2023-03-16 02:04:01] [INFO ] Deduced a trap composed of 91 places in 155 ms of which 18 ms to minimize.
[2023-03-16 02:04:01] [INFO ] Deduced a trap composed of 84 places in 173 ms of which 0 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.solver.global.GlobalPropertySolver.applyReachabilitySolver(GlobalPropertySolver.java:724)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.solveProperty(GlobalPropertySolver.java:558)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.preSolveLiveness(GlobalPropertySolver.java:412)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.preStableMarking(GlobalPropertySolver.java:321)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.solveProperty(GlobalPropertySolver.java:294)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:386)
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-16 02:04:01] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-16 02:04:01] [INFO ] After 25028ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:133
Fused 133 Parikh solutions to 129 different solutions.
Parikh walk visited 19 properties in 3183 ms.
Support contains 114 out of 574 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 574/574 places, 572/572 transitions.
Drop transitions removed 182 transitions
Trivial Post-agglo rules discarded 182 transitions
Performed 182 trivial Post agglomeration. Transition count delta: 182
Iterating post reduction 0 with 182 rules applied. Total rules applied 182 place count 574 transition count 390
Reduce places removed 182 places and 0 transitions.
Ensure Unique test removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Drop transitions removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 1 with 217 rules applied. Total rules applied 399 place count 392 transition count 355
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 411 place count 380 transition count 355
Performed 56 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 56 Pre rules applied. Total rules applied 411 place count 380 transition count 299
Deduced a syphon composed of 56 places in 1 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 3 with 112 rules applied. Total rules applied 523 place count 324 transition count 299
Discarding 21 places :
Symmetric choice reduction at 3 with 21 rule applications. Total rules 544 place count 303 transition count 278
Iterating global reduction 3 with 21 rules applied. Total rules applied 565 place count 303 transition count 278
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 12 Pre rules applied. Total rules applied 565 place count 303 transition count 266
Deduced a syphon composed of 12 places in 16 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 3 with 24 rules applied. Total rules applied 589 place count 291 transition count 266
Performed 60 Post agglomeration using F-continuation condition.Transition count delta: 60
Deduced a syphon composed of 60 places in 1 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 3 with 120 rules applied. Total rules applied 709 place count 231 transition count 206
Drop transitions removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 3 with 7 rules applied. Total rules applied 716 place count 231 transition count 199
Free-agglomeration rule applied 24 times.
Iterating global reduction 3 with 24 rules applied. Total rules applied 740 place count 231 transition count 175
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 3 with 24 rules applied. Total rules applied 764 place count 207 transition count 175
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 765 place count 206 transition count 174
Reduce places removed 10 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 4 with 13 rules applied. Total rules applied 778 place count 196 transition count 171
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 781 place count 193 transition count 171
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 12 Pre rules applied. Total rules applied 781 place count 193 transition count 159
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 6 with 24 rules applied. Total rules applied 805 place count 181 transition count 159
Applied a total of 805 rules in 145 ms. Remains 181 /574 variables (removed 393) and now considering 159/572 (removed 413) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 146 ms. Remains : 181/574 places, 159/572 transitions.
Finished random walk after 531 steps, including 0 resets, run visited all 114 properties in 26 ms. (steps per millisecond=20 )
Able to resolve query StableMarking after proving 234 properties.
FORMULA StableMarking FALSE TECHNIQUES RANDOM_WALK PARIKH_WALK MARKED_SUFFIX_TEST TOPOLOGICAL
Total runtime 33118 ms.
ITS solved all properties within timeout

BK_STOP 1678932245047

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination StableMarking -timeout 180 -rebuildPNML

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="AutoFlight-PT-06b"
export BK_EXAMINATION="StableMarking"
export BK_TOOL="lolaxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="1800"
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 lolaxred"
echo " Input is AutoFlight-PT-06b, examination is StableMarking"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r021-oct2-167813608900288"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/AutoFlight-PT-06b.tgz
mv AutoFlight-PT-06b execution
cd execution
if [ "StableMarking" = "ReachabilityDeadlock" ] || [ "StableMarking" = "UpperBounds" ] || [ "StableMarking" = "QuasiLiveness" ] || [ "StableMarking" = "StableMarking" ] || [ "StableMarking" = "Liveness" ] || [ "StableMarking" = "OneSafe" ] || [ "StableMarking" = "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 [ "StableMarking" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "StableMarking" != "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 "StableMarking.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property StableMarking.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "StableMarking.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 '' StableMarking.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "StableMarking" = "ReachabilityDeadlock" ] || [ "StableMarking" = "QuasiLiveness" ] || [ "StableMarking" = "StableMarking" ] || [ "StableMarking" = "Liveness" ] || [ "StableMarking" = "OneSafe" ] ; then
echo "FORMULA_NAME StableMarking"
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 ;