About the Execution of LoLa+red for ShieldIIPs-PT-050A
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 1697.100 | 109832.00 | 148472.00 | 39.90 | TTTTTFTFTTFTTTFT | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2023-input.r391-oct2-167903714900151.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 ShieldIIPs-PT-050A, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r391-oct2-167903714900151
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 848K
-rw-r--r-- 1 mcc users 7.6K Feb 25 16:41 CTLCardinality.txt
-rw-r--r-- 1 mcc users 81K Feb 25 16:41 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.6K Feb 25 16:34 CTLFireability.txt
-rw-r--r-- 1 mcc users 39K Feb 25 16:34 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:55 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 16:55 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 16:55 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:55 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 25 17:05 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 120K Feb 25 17:05 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.0K Feb 25 16:48 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 46K Feb 25 16:48 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:55 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:55 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 426K Mar 5 18:23 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 ShieldIIPs-PT-050A-ReachabilityFireability-00
FORMULA_NAME ShieldIIPs-PT-050A-ReachabilityFireability-01
FORMULA_NAME ShieldIIPs-PT-050A-ReachabilityFireability-02
FORMULA_NAME ShieldIIPs-PT-050A-ReachabilityFireability-03
FORMULA_NAME ShieldIIPs-PT-050A-ReachabilityFireability-04
FORMULA_NAME ShieldIIPs-PT-050A-ReachabilityFireability-05
FORMULA_NAME ShieldIIPs-PT-050A-ReachabilityFireability-06
FORMULA_NAME ShieldIIPs-PT-050A-ReachabilityFireability-07
FORMULA_NAME ShieldIIPs-PT-050A-ReachabilityFireability-08
FORMULA_NAME ShieldIIPs-PT-050A-ReachabilityFireability-09
FORMULA_NAME ShieldIIPs-PT-050A-ReachabilityFireability-10
FORMULA_NAME ShieldIIPs-PT-050A-ReachabilityFireability-11
FORMULA_NAME ShieldIIPs-PT-050A-ReachabilityFireability-12
FORMULA_NAME ShieldIIPs-PT-050A-ReachabilityFireability-13
FORMULA_NAME ShieldIIPs-PT-050A-ReachabilityFireability-14
FORMULA_NAME ShieldIIPs-PT-050A-ReachabilityFireability-15
=== Now, execution of the tool begins
BK_START 1679268153341
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=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldIIPs-PT-050A
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-19 23:22:35] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-03-19 23:22:35] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-19 23:22:36] [INFO ] Load time of PNML (sax parser for PT used): 167 ms
[2023-03-19 23:22:36] [INFO ] Transformed 1253 places.
[2023-03-19 23:22:36] [INFO ] Transformed 1203 transitions.
[2023-03-19 23:22:36] [INFO ] Found NUPN structural information;
[2023-03-19 23:22:36] [INFO ] Parsed PT model containing 1253 places and 1203 transitions and 5406 arcs in 306 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 12 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 3 resets, run finished after 471 ms. (steps per millisecond=21 ) properties (out of 16) seen :13
FORMULA ShieldIIPs-PT-050A-ReachabilityFireability-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-050A-ReachabilityFireability-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-050A-ReachabilityFireability-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-050A-ReachabilityFireability-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-050A-ReachabilityFireability-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-050A-ReachabilityFireability-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-050A-ReachabilityFireability-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-050A-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-050A-ReachabilityFireability-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-050A-ReachabilityFireability-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-050A-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-050A-ReachabilityFireability-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-050A-ReachabilityFireability-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 149 ms. (steps per millisecond=67 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 106 ms. (steps per millisecond=94 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 1203 rows 1253 cols
[2023-03-19 23:22:37] [INFO ] Computed 451 place invariants in 26 ms
[2023-03-19 23:22:37] [INFO ] [Real]Absence check using 451 positive place invariants in 96 ms returned sat
[2023-03-19 23:22:37] [INFO ] After 732ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-19 23:22:38] [INFO ] [Nat]Absence check using 451 positive place invariants in 74 ms returned sat
[2023-03-19 23:22:41] [INFO ] After 2871ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-19 23:22:41] [INFO ] Deduced a trap composed of 11 places in 196 ms of which 10 ms to minimize.
[2023-03-19 23:22:42] [INFO ] Deduced a trap composed of 17 places in 981 ms of which 27 ms to minimize.
[2023-03-19 23:22:43] [INFO ] Deduced a trap composed of 19 places in 350 ms of which 27 ms to minimize.
[2023-03-19 23:22:43] [INFO ] Deduced a trap composed of 13 places in 206 ms of which 2 ms to minimize.
[2023-03-19 23:22:43] [INFO ] Deduced a trap composed of 11 places in 230 ms of which 1 ms to minimize.
[2023-03-19 23:22:44] [INFO ] Deduced a trap composed of 11 places in 113 ms of which 1 ms to minimize.
[2023-03-19 23:22:44] [INFO ] Deduced a trap composed of 11 places in 106 ms of which 0 ms to minimize.
[2023-03-19 23:22:44] [INFO ] Deduced a trap composed of 11 places in 177 ms of which 1 ms to minimize.
[2023-03-19 23:22:44] [INFO ] Deduced a trap composed of 19 places in 243 ms of which 0 ms to minimize.
[2023-03-19 23:22:45] [INFO ] Deduced a trap composed of 30 places in 165 ms of which 1 ms to minimize.
[2023-03-19 23:22:45] [INFO ] Deduced a trap composed of 17 places in 54 ms of which 1 ms to minimize.
[2023-03-19 23:22:45] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 4068 ms
[2023-03-19 23:22:46] [INFO ] Deduced a trap composed of 11 places in 180 ms of which 2 ms to minimize.
[2023-03-19 23:22:47] [INFO ] Deduced a trap composed of 13 places in 140 ms of which 1 ms to minimize.
[2023-03-19 23:22:47] [INFO ] Deduced a trap composed of 11 places in 113 ms of which 1 ms to minimize.
[2023-03-19 23:22:47] [INFO ] Deduced a trap composed of 13 places in 129 ms of which 1 ms to minimize.
[2023-03-19 23:22:48] [INFO ] Deduced a trap composed of 9 places in 153 ms of which 0 ms to minimize.
[2023-03-19 23:22:48] [INFO ] Deduced a trap composed of 19 places in 50 ms of which 1 ms to minimize.
[2023-03-19 23:22:48] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1678 ms
[2023-03-19 23:22:48] [INFO ] After 10672ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 3307 ms.
[2023-03-19 23:22:52] [INFO ] After 14405ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 407 ms.
Support contains 67 out of 1253 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1253/1253 places, 1203/1203 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 1253 transition count 1202
Deduced a syphon composed of 1 places in 6 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1252 transition count 1202
Partial Free-agglomeration rule applied 320 times.
Drop transitions removed 320 transitions
Iterating global reduction 0 with 320 rules applied. Total rules applied 322 place count 1252 transition count 1202
Applied a total of 322 rules in 246 ms. Remains 1252 /1253 variables (removed 1) and now considering 1202/1203 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 247 ms. Remains : 1252/1253 places, 1202/1203 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 280 ms. (steps per millisecond=35 ) properties (out of 3) seen :1
FORMULA ShieldIIPs-PT-050A-ReachabilityFireability-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 1202 rows 1252 cols
[2023-03-19 23:22:53] [INFO ] Computed 451 place invariants in 99 ms
[2023-03-19 23:22:53] [INFO ] [Real]Absence check using 446 positive place invariants in 113 ms returned sat
[2023-03-19 23:22:53] [INFO ] [Real]Absence check using 446 positive and 5 generalized place invariants in 3 ms returned sat
[2023-03-19 23:22:53] [INFO ] After 450ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-19 23:22:54] [INFO ] [Nat]Absence check using 446 positive place invariants in 78 ms returned sat
[2023-03-19 23:22:54] [INFO ] [Nat]Absence check using 446 positive and 5 generalized place invariants in 39 ms returned sat
[2023-03-19 23:22:57] [INFO ] After 3374ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-19 23:22:57] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-19 23:22:58] [INFO ] After 787ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-19 23:23:01] [INFO ] Deduced a trap composed of 9 places in 198 ms of which 1 ms to minimize.
[2023-03-19 23:23:09] [INFO ] Deduced a trap composed of 9 places in 426 ms of which 1 ms to minimize.
[2023-03-19 23:23:12] [INFO ] Deduced a trap composed of 13 places in 195 ms of which 1 ms to minimize.
[2023-03-19 23:23:18] [INFO ] Trap strengthening (SAT) tested/added 3/3 trap constraints in 17445 ms
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:769)
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-19 23:23:18] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-19 23:23:18] [INFO ] After 25019ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:2
Parikh walk visited 0 properties in 309 ms.
Support contains 35 out of 1252 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1252/1252 places, 1202/1202 transitions.
Partial Free-agglomeration rule applied 15 times.
Drop transitions removed 15 transitions
Iterating global reduction 0 with 15 rules applied. Total rules applied 15 place count 1252 transition count 1202
Applied a total of 15 rules in 82 ms. Remains 1252 /1252 variables (removed 0) and now considering 1202/1202 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 82 ms. Remains : 1252/1252 places, 1202/1202 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 219 ms. (steps per millisecond=45 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 91 ms. (steps per millisecond=109 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 106 ms. (steps per millisecond=94 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 154599 steps, run timeout after 3001 ms. (steps per millisecond=51 ) properties seen :{1=1}
Probabilistic random walk after 154599 steps, saw 126351 distinct states, run finished after 3025 ms. (steps per millisecond=51 ) properties seen :1
FORMULA ShieldIIPs-PT-050A-ReachabilityFireability-10 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Running SMT prover for 1 properties.
// Phase 1: matrix 1202 rows 1252 cols
[2023-03-19 23:23:22] [INFO ] Computed 451 place invariants in 26 ms
[2023-03-19 23:23:23] [INFO ] [Real]Absence check using 445 positive place invariants in 168 ms returned sat
[2023-03-19 23:23:23] [INFO ] [Real]Absence check using 445 positive and 6 generalized place invariants in 12 ms returned sat
[2023-03-19 23:23:24] [INFO ] After 1478ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 23:23:24] [INFO ] [Nat]Absence check using 445 positive place invariants in 98 ms returned sat
[2023-03-19 23:23:24] [INFO ] [Nat]Absence check using 445 positive and 6 generalized place invariants in 1 ms returned sat
[2023-03-19 23:23:28] [INFO ] After 3483ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 23:23:28] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-19 23:23:28] [INFO ] After 150ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-19 23:23:29] [INFO ] Deduced a trap composed of 8 places in 212 ms of which 13 ms to minimize.
[2023-03-19 23:23:31] [INFO ] Deduced a trap composed of 15 places in 440 ms of which 1 ms to minimize.
[2023-03-19 23:23:31] [INFO ] Deduced a trap composed of 9 places in 376 ms of which 0 ms to minimize.
[2023-03-19 23:23:32] [INFO ] Deduced a trap composed of 17 places in 247 ms of which 1 ms to minimize.
[2023-03-19 23:23:32] [INFO ] Deduced a trap composed of 9 places in 458 ms of which 0 ms to minimize.
[2023-03-19 23:23:33] [INFO ] Deduced a trap composed of 14 places in 531 ms of which 0 ms to minimize.
[2023-03-19 23:23:33] [INFO ] Deduced a trap composed of 13 places in 530 ms of which 1 ms to minimize.
[2023-03-19 23:23:34] [INFO ] Deduced a trap composed of 9 places in 315 ms of which 1 ms to minimize.
[2023-03-19 23:23:35] [INFO ] Deduced a trap composed of 12 places in 718 ms of which 1 ms to minimize.
[2023-03-19 23:23:35] [INFO ] Deduced a trap composed of 15 places in 222 ms of which 1 ms to minimize.
[2023-03-19 23:23:35] [INFO ] Deduced a trap composed of 13 places in 250 ms of which 1 ms to minimize.
[2023-03-19 23:23:36] [INFO ] Deduced a trap composed of 21 places in 350 ms of which 1 ms to minimize.
[2023-03-19 23:23:36] [INFO ] Deduced a trap composed of 21 places in 354 ms of which 26 ms to minimize.
[2023-03-19 23:23:36] [INFO ] Deduced a trap composed of 17 places in 137 ms of which 0 ms to minimize.
[2023-03-19 23:23:36] [INFO ] Deduced a trap composed of 15 places in 121 ms of which 0 ms to minimize.
[2023-03-19 23:23:37] [INFO ] Deduced a trap composed of 17 places in 209 ms of which 1 ms to minimize.
[2023-03-19 23:23:37] [INFO ] Deduced a trap composed of 13 places in 133 ms of which 1 ms to minimize.
[2023-03-19 23:23:37] [INFO ] Deduced a trap composed of 17 places in 157 ms of which 1 ms to minimize.
[2023-03-19 23:23:37] [INFO ] Deduced a trap composed of 9 places in 137 ms of which 1 ms to minimize.
[2023-03-19 23:23:39] [INFO ] Deduced a trap composed of 9 places in 316 ms of which 1 ms to minimize.
[2023-03-19 23:23:40] [INFO ] Deduced a trap composed of 9 places in 147 ms of which 1 ms to minimize.
[2023-03-19 23:23:40] [INFO ] Deduced a trap composed of 13 places in 197 ms of which 0 ms to minimize.
[2023-03-19 23:23:40] [INFO ] Deduced a trap composed of 17 places in 207 ms of which 1 ms to minimize.
[2023-03-19 23:23:41] [INFO ] Deduced a trap composed of 15 places in 169 ms of which 1 ms to minimize.
[2023-03-19 23:23:41] [INFO ] Deduced a trap composed of 15 places in 178 ms of which 2 ms to minimize.
[2023-03-19 23:23:41] [INFO ] Deduced a trap composed of 15 places in 141 ms of which 1 ms to minimize.
[2023-03-19 23:23:41] [INFO ] Deduced a trap composed of 9 places in 100 ms of which 1 ms to minimize.
[2023-03-19 23:23:42] [INFO ] Deduced a trap composed of 18 places in 94 ms of which 1 ms to minimize.
[2023-03-19 23:23:42] [INFO ] Deduced a trap composed of 15 places in 98 ms of which 1 ms to minimize.
[2023-03-19 23:23:42] [INFO ] Deduced a trap composed of 9 places in 209 ms of which 0 ms to minimize.
[2023-03-19 23:23:43] [INFO ] Deduced a trap composed of 9 places in 250 ms of which 0 ms to minimize.
[2023-03-19 23:23:43] [INFO ] Deduced a trap composed of 10 places in 205 ms of which 0 ms to minimize.
[2023-03-19 23:23:43] [INFO ] Deduced a trap composed of 9 places in 199 ms of which 1 ms to minimize.
[2023-03-19 23:23:44] [INFO ] Deduced a trap composed of 9 places in 161 ms of which 0 ms to minimize.
[2023-03-19 23:23:44] [INFO ] Deduced a trap composed of 21 places in 137 ms of which 0 ms to minimize.
[2023-03-19 23:23:44] [INFO ] Deduced a trap composed of 9 places in 101 ms of which 0 ms to minimize.
[2023-03-19 23:23:44] [INFO ] Deduced a trap composed of 17 places in 97 ms of which 1 ms to minimize.
[2023-03-19 23:23:44] [INFO ] Deduced a trap composed of 15 places in 95 ms of which 0 ms to minimize.
[2023-03-19 23:23:45] [INFO ] Trap strengthening (SAT) tested/added 39/38 trap constraints in 16237 ms
[2023-03-19 23:23:45] [INFO ] After 17012ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 220 ms.
[2023-03-19 23:23:45] [INFO ] After 21118ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 114 ms.
Support contains 8 out of 1252 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1252/1252 places, 1202/1202 transitions.
Partial Free-agglomeration rule applied 13 times.
Drop transitions removed 13 transitions
Iterating global reduction 0 with 13 rules applied. Total rules applied 13 place count 1252 transition count 1202
Applied a total of 13 rules in 82 ms. Remains 1252 /1252 variables (removed 0) and now considering 1202/1202 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 82 ms. Remains : 1252/1252 places, 1202/1202 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 125 ms. (steps per millisecond=80 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 217056 steps, run timeout after 3001 ms. (steps per millisecond=72 ) properties seen :{}
Probabilistic random walk after 217056 steps, saw 206835 distinct states, run finished after 3002 ms. (steps per millisecond=72 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 1202 rows 1252 cols
[2023-03-19 23:23:48] [INFO ] Computed 451 place invariants in 46 ms
[2023-03-19 23:23:49] [INFO ] [Real]Absence check using 450 positive place invariants in 68 ms returned sat
[2023-03-19 23:23:49] [INFO ] [Real]Absence check using 450 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-19 23:23:49] [INFO ] After 992ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 23:23:50] [INFO ] [Nat]Absence check using 450 positive place invariants in 218 ms returned sat
[2023-03-19 23:23:50] [INFO ] [Nat]Absence check using 450 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-19 23:23:51] [INFO ] After 1170ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 23:23:51] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-19 23:23:51] [INFO ] After 232ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-19 23:23:52] [INFO ] Deduced a trap composed of 9 places in 314 ms of which 0 ms to minimize.
[2023-03-19 23:23:52] [INFO ] Deduced a trap composed of 9 places in 347 ms of which 1 ms to minimize.
[2023-03-19 23:23:52] [INFO ] Deduced a trap composed of 9 places in 185 ms of which 1 ms to minimize.
[2023-03-19 23:23:53] [INFO ] Deduced a trap composed of 9 places in 322 ms of which 1 ms to minimize.
[2023-03-19 23:23:53] [INFO ] Deduced a trap composed of 9 places in 222 ms of which 0 ms to minimize.
[2023-03-19 23:23:53] [INFO ] Deduced a trap composed of 9 places in 158 ms of which 15 ms to minimize.
[2023-03-19 23:23:54] [INFO ] Deduced a trap composed of 10 places in 182 ms of which 1 ms to minimize.
[2023-03-19 23:23:54] [INFO ] Deduced a trap composed of 13 places in 163 ms of which 14 ms to minimize.
[2023-03-19 23:23:54] [INFO ] Deduced a trap composed of 9 places in 163 ms of which 8 ms to minimize.
[2023-03-19 23:23:54] [INFO ] Deduced a trap composed of 9 places in 87 ms of which 14 ms to minimize.
[2023-03-19 23:23:54] [INFO ] Deduced a trap composed of 15 places in 163 ms of which 1 ms to minimize.
[2023-03-19 23:23:54] [INFO ] Deduced a trap composed of 15 places in 98 ms of which 0 ms to minimize.
[2023-03-19 23:23:55] [INFO ] Deduced a trap composed of 9 places in 114 ms of which 0 ms to minimize.
[2023-03-19 23:23:55] [INFO ] Deduced a trap composed of 13 places in 99 ms of which 0 ms to minimize.
[2023-03-19 23:23:55] [INFO ] Deduced a trap composed of 21 places in 52 ms of which 0 ms to minimize.
[2023-03-19 23:23:55] [INFO ] Deduced a trap composed of 17 places in 76 ms of which 0 ms to minimize.
[2023-03-19 23:23:55] [INFO ] Trap strengthening (SAT) tested/added 17/16 trap constraints in 3587 ms
[2023-03-19 23:23:55] [INFO ] After 3984ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 111 ms.
[2023-03-19 23:23:55] [INFO ] After 5801ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 78 ms.
Support contains 8 out of 1252 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1252/1252 places, 1202/1202 transitions.
Applied a total of 0 rules in 86 ms. Remains 1252 /1252 variables (removed 0) and now considering 1202/1202 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 86 ms. Remains : 1252/1252 places, 1202/1202 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1252/1252 places, 1202/1202 transitions.
Applied a total of 0 rules in 57 ms. Remains 1252 /1252 variables (removed 0) and now considering 1202/1202 (removed 0) transitions.
[2023-03-19 23:23:55] [INFO ] Invariant cache hit.
[2023-03-19 23:23:57] [INFO ] Implicit Places using invariants in 1356 ms returned [1237]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 1375 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 1251/1252 places, 1202/1202 transitions.
Applied a total of 0 rules in 31 ms. Remains 1251 /1251 variables (removed 0) and now considering 1202/1202 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 1465 ms. Remains : 1251/1252 places, 1202/1202 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 112 ms. (steps per millisecond=89 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 205647 steps, run timeout after 3001 ms. (steps per millisecond=68 ) properties seen :{}
Probabilistic random walk after 205647 steps, saw 196412 distinct states, run finished after 3001 ms. (steps per millisecond=68 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 1202 rows 1251 cols
[2023-03-19 23:24:00] [INFO ] Computed 450 place invariants in 18 ms
[2023-03-19 23:24:00] [INFO ] [Real]Absence check using 449 positive place invariants in 96 ms returned sat
[2023-03-19 23:24:00] [INFO ] [Real]Absence check using 449 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-19 23:24:01] [INFO ] After 1153ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 23:24:02] [INFO ] [Nat]Absence check using 449 positive place invariants in 127 ms returned sat
[2023-03-19 23:24:02] [INFO ] [Nat]Absence check using 449 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-19 23:24:03] [INFO ] After 1433ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 23:24:04] [INFO ] Deduced a trap composed of 12 places in 265 ms of which 0 ms to minimize.
[2023-03-19 23:24:04] [INFO ] Deduced a trap composed of 9 places in 243 ms of which 0 ms to minimize.
[2023-03-19 23:24:04] [INFO ] Deduced a trap composed of 15 places in 155 ms of which 0 ms to minimize.
[2023-03-19 23:24:04] [INFO ] Deduced a trap composed of 17 places in 195 ms of which 17 ms to minimize.
[2023-03-19 23:24:06] [INFO ] Deduced a trap composed of 12 places in 338 ms of which 1 ms to minimize.
[2023-03-19 23:24:07] [INFO ] Deduced a trap composed of 9 places in 176 ms of which 0 ms to minimize.
[2023-03-19 23:24:07] [INFO ] Deduced a trap composed of 9 places in 225 ms of which 1 ms to minimize.
[2023-03-19 23:24:07] [INFO ] Deduced a trap composed of 9 places in 165 ms of which 0 ms to minimize.
[2023-03-19 23:24:07] [INFO ] Deduced a trap composed of 9 places in 146 ms of which 0 ms to minimize.
[2023-03-19 23:24:07] [INFO ] Deduced a trap composed of 9 places in 109 ms of which 0 ms to minimize.
[2023-03-19 23:24:08] [INFO ] Deduced a trap composed of 9 places in 137 ms of which 0 ms to minimize.
[2023-03-19 23:24:08] [INFO ] Deduced a trap composed of 15 places in 683 ms of which 1 ms to minimize.
[2023-03-19 23:24:09] [INFO ] Deduced a trap composed of 9 places in 348 ms of which 0 ms to minimize.
[2023-03-19 23:24:09] [INFO ] Deduced a trap composed of 9 places in 119 ms of which 1 ms to minimize.
[2023-03-19 23:24:09] [INFO ] Deduced a trap composed of 9 places in 117 ms of which 1 ms to minimize.
[2023-03-19 23:24:09] [INFO ] Deduced a trap composed of 17 places in 95 ms of which 1 ms to minimize.
[2023-03-19 23:24:10] [INFO ] Deduced a trap composed of 9 places in 280 ms of which 1 ms to minimize.
[2023-03-19 23:24:10] [INFO ] Deduced a trap composed of 9 places in 104 ms of which 1 ms to minimize.
[2023-03-19 23:24:10] [INFO ] Deduced a trap composed of 9 places in 96 ms of which 0 ms to minimize.
[2023-03-19 23:24:10] [INFO ] Deduced a trap composed of 9 places in 82 ms of which 1 ms to minimize.
[2023-03-19 23:24:10] [INFO ] Deduced a trap composed of 9 places in 60 ms of which 1 ms to minimize.
[2023-03-19 23:24:10] [INFO ] Deduced a trap composed of 9 places in 63 ms of which 0 ms to minimize.
[2023-03-19 23:24:11] [INFO ] Deduced a trap composed of 15 places in 49 ms of which 0 ms to minimize.
[2023-03-19 23:24:11] [INFO ] Trap strengthening (SAT) tested/added 24/23 trap constraints in 7355 ms
[2023-03-19 23:24:11] [INFO ] After 9080ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 111 ms.
[2023-03-19 23:24:11] [INFO ] After 9629ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 57 ms.
Support contains 8 out of 1251 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1251/1251 places, 1202/1202 transitions.
Applied a total of 0 rules in 50 ms. Remains 1251 /1251 variables (removed 0) and now considering 1202/1202 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 50 ms. Remains : 1251/1251 places, 1202/1202 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1251/1251 places, 1202/1202 transitions.
Applied a total of 0 rules in 28 ms. Remains 1251 /1251 variables (removed 0) and now considering 1202/1202 (removed 0) transitions.
[2023-03-19 23:24:11] [INFO ] Invariant cache hit.
[2023-03-19 23:24:12] [INFO ] Implicit Places using invariants in 1251 ms returned []
[2023-03-19 23:24:12] [INFO ] Invariant cache hit.
[2023-03-19 23:24:14] [INFO ] Implicit Places using invariants and state equation in 2230 ms returned []
Implicit Place search using SMT with State Equation took 3500 ms to find 0 implicit places.
[2023-03-19 23:24:15] [INFO ] Redundant transitions in 60 ms returned []
[2023-03-19 23:24:15] [INFO ] Invariant cache hit.
[2023-03-19 23:24:15] [INFO ] Dead Transitions using invariants and state equation in 867 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4489 ms. Remains : 1251/1251 places, 1202/1202 transitions.
Applied a total of 0 rules in 52 ms. Remains 1251 /1251 variables (removed 0) and now considering 1202/1202 (removed 0) transitions.
Running SMT prover for 1 properties.
[2023-03-19 23:24:15] [INFO ] Invariant cache hit.
[2023-03-19 23:24:16] [INFO ] [Real]Absence check using 449 positive place invariants in 84 ms returned sat
[2023-03-19 23:24:16] [INFO ] [Real]Absence check using 449 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-19 23:24:16] [INFO ] After 920ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 23:24:17] [INFO ] [Nat]Absence check using 449 positive place invariants in 69 ms returned sat
[2023-03-19 23:24:17] [INFO ] [Nat]Absence check using 449 positive and 1 generalized place invariants in 3 ms returned sat
[2023-03-19 23:24:18] [INFO ] After 1746ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 23:24:19] [INFO ] Deduced a trap composed of 8 places in 214 ms of which 1 ms to minimize.
[2023-03-19 23:24:19] [INFO ] Deduced a trap composed of 9 places in 182 ms of which 1 ms to minimize.
[2023-03-19 23:24:20] [INFO ] Deduced a trap composed of 12 places in 175 ms of which 1 ms to minimize.
[2023-03-19 23:24:20] [INFO ] Deduced a trap composed of 9 places in 145 ms of which 1 ms to minimize.
[2023-03-19 23:24:20] [INFO ] Deduced a trap composed of 13 places in 119 ms of which 1 ms to minimize.
[2023-03-19 23:24:20] [INFO ] Deduced a trap composed of 9 places in 208 ms of which 1 ms to minimize.
[2023-03-19 23:24:20] [INFO ] Deduced a trap composed of 21 places in 103 ms of which 1 ms to minimize.
[2023-03-19 23:24:21] [INFO ] Deduced a trap composed of 15 places in 147 ms of which 1 ms to minimize.
[2023-03-19 23:24:21] [INFO ] Deduced a trap composed of 9 places in 258 ms of which 0 ms to minimize.
[2023-03-19 23:24:21] [INFO ] Deduced a trap composed of 9 places in 94 ms of which 0 ms to minimize.
[2023-03-19 23:24:21] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 2359 ms
[2023-03-19 23:24:21] [INFO ] After 4509ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 263 ms.
[2023-03-19 23:24:21] [INFO ] After 5082ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2023-03-19 23:24:22] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 8 ms.
[2023-03-19 23:24:22] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1251 places, 1202 transitions and 6137 arcs took 20 ms.
[2023-03-19 23:24:22] [INFO ] Flatten gal took : 226 ms
Total runtime 106731 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT ShieldIIPs-PT-050A
BK_EXAMINATION: ReachabilityFireability
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/382
ReachabilityFireability
FORMULA ShieldIIPs-PT-050A-ReachabilityFireability-02 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
BK_STOP 1679268263173
--------------------
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:
++ 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'
++ sed s/.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
lola: MEM LIMIT 32
lola: MEM LIMIT 5
lola: NET
lola: input: PNML file (--pnmlnet)
lola: reading net from /home/mcc/execution/382/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/382/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/382/ReachabilityFireability.xml
lola: Rule S: 0 transitions removed,0 places removed
lola: Created skeleton in 0.000000 secs.
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: LAUNCH task # 7 (type EXCL) for 0 ShieldIIPs-PT-050A-ReachabilityFireability-02
lola: time limit : 3599 sec
lola: memory limit: 32 pages
lola: LAUNCH task # 3 (type FNDP) for 0 ShieldIIPs-PT-050A-ReachabilityFireability-02
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 4 (type EQUN) for 0 ShieldIIPs-PT-050A-ReachabilityFireability-02
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: LAUNCH task # 6 (type SRCH) for 0 ShieldIIPs-PT-050A-ReachabilityFireability-02
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: FINISHED task # 3 (type FNDP) for ShieldIIPs-PT-050A-ReachabilityFireability-02
lola: result : true
lola: fired transitions : 116
lola: tried executions : 1
lola: time used : 0.000000
lola: memory pages used : 0
lola: CANCELED task # 4 (type EQUN) for ShieldIIPs-PT-050A-ReachabilityFireability-02 (obsolete)
lola: CANCELED task # 6 (type SRCH) for ShieldIIPs-PT-050A-ReachabilityFireability-02 (obsolete)
lola: CANCELED task # 7 (type EXCL) for ShieldIIPs-PT-050A-ReachabilityFireability-02 (obsolete)
lola: Portfolio finished: no open formulas
FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldIIPs-PT-050A-ReachabilityFireability-02: EF true findpath
Time elapsed: 1 secs. Pages in use: 2
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="ShieldIIPs-PT-050A"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="lolaxred"
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 lolaxred"
echo " Input is ShieldIIPs-PT-050A, 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 r391-oct2-167903714900151"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/ShieldIIPs-PT-050A.tgz
mv ShieldIIPs-PT-050A 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 '
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 ;