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-167903715500655.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 ShieldPPPt-PT-030B, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r391-oct2-167903715500655
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.1M
-rw-r--r-- 1 mcc users 8.5K Feb 25 20:46 CTLCardinality.txt
-rw-r--r-- 1 mcc users 99K Feb 25 20:46 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Feb 25 20:46 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K Feb 25 20:46 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Feb 25 17:00 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Feb 25 17:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 17:00 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 17:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.0K Feb 25 20:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 90K Feb 25 20:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Feb 25 20:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 89K Feb 25 20:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 17:00 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 17:00 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 569K 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 ShieldPPPt-PT-030B-ReachabilityFireability-00
FORMULA_NAME ShieldPPPt-PT-030B-ReachabilityFireability-01
FORMULA_NAME ShieldPPPt-PT-030B-ReachabilityFireability-02
FORMULA_NAME ShieldPPPt-PT-030B-ReachabilityFireability-03
FORMULA_NAME ShieldPPPt-PT-030B-ReachabilityFireability-04
FORMULA_NAME ShieldPPPt-PT-030B-ReachabilityFireability-05
FORMULA_NAME ShieldPPPt-PT-030B-ReachabilityFireability-06
FORMULA_NAME ShieldPPPt-PT-030B-ReachabilityFireability-07
FORMULA_NAME ShieldPPPt-PT-030B-ReachabilityFireability-08
FORMULA_NAME ShieldPPPt-PT-030B-ReachabilityFireability-09
FORMULA_NAME ShieldPPPt-PT-030B-ReachabilityFireability-10
FORMULA_NAME ShieldPPPt-PT-030B-ReachabilityFireability-11
FORMULA_NAME ShieldPPPt-PT-030B-ReachabilityFireability-12
FORMULA_NAME ShieldPPPt-PT-030B-ReachabilityFireability-13
FORMULA_NAME ShieldPPPt-PT-030B-ReachabilityFireability-14
FORMULA_NAME ShieldPPPt-PT-030B-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1679279705845

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=ShieldPPPt-PT-030B
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-20 02:35:08] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-03-20 02:35:08] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-20 02:35:08] [INFO ] Load time of PNML (sax parser for PT used): 168 ms
[2023-03-20 02:35:08] [INFO ] Transformed 2343 places.
[2023-03-20 02:35:08] [INFO ] Transformed 2133 transitions.
[2023-03-20 02:35:08] [INFO ] Found NUPN structural information;
[2023-03-20 02:35:08] [INFO ] Parsed PT model containing 2343 places and 2133 transitions and 5346 arcs in 405 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 2 resets, run finished after 472 ms. (steps per millisecond=21 ) properties (out of 16) seen :4
FORMULA ShieldPPPt-PT-030B-ReachabilityFireability-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-030B-ReachabilityFireability-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-030B-ReachabilityFireability-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-030B-ReachabilityFireability-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 12) seen :0
Running SMT prover for 12 properties.
// Phase 1: matrix 2133 rows 2343 cols
[2023-03-20 02:35:09] [INFO ] Computed 331 place invariants in 32 ms
[2023-03-20 02:35:10] [INFO ] After 1189ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:12
[2023-03-20 02:35:12] [INFO ] [Nat]Absence check using 331 positive place invariants in 225 ms returned sat
[2023-03-20 02:35:16] [INFO ] After 3865ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :11
[2023-03-20 02:35:18] [INFO ] Deduced a trap composed of 21 places in 977 ms of which 13 ms to minimize.
[2023-03-20 02:35:19] [INFO ] Deduced a trap composed of 17 places in 865 ms of which 1 ms to minimize.
[2023-03-20 02:35:20] [INFO ] Deduced a trap composed of 19 places in 791 ms of which 35 ms to minimize.
[2023-03-20 02:35:20] [INFO ] Deduced a trap composed of 26 places in 615 ms of which 3 ms to minimize.
[2023-03-20 02:35:21] [INFO ] Deduced a trap composed of 27 places in 673 ms of which 15 ms to minimize.
[2023-03-20 02:35:22] [INFO ] Deduced a trap composed of 22 places in 658 ms of which 2 ms to minimize.
[2023-03-20 02:35:22] [INFO ] Deduced a trap composed of 25 places in 489 ms of which 1 ms to minimize.
[2023-03-20 02:35:24] [INFO ] Deduced a trap composed of 43 places in 1021 ms of which 2 ms to minimize.
[2023-03-20 02:35:24] [INFO ] Deduced a trap composed of 29 places in 578 ms of which 1 ms to minimize.
[2023-03-20 02:35:25] [INFO ] Deduced a trap composed of 45 places in 911 ms of which 2 ms to minimize.
[2023-03-20 02:35:26] [INFO ] Deduced a trap composed of 29 places in 765 ms of which 1 ms to minimize.
[2023-03-20 02:35:27] [INFO ] Deduced a trap composed of 34 places in 534 ms of which 3 ms to minimize.
[2023-03-20 02:35:28] [INFO ] Deduced a trap composed of 23 places in 1219 ms of which 26 ms to minimize.
[2023-03-20 02:35:29] [INFO ] Deduced a trap composed of 43 places in 445 ms of which 1 ms to minimize.
[2023-03-20 02:35:29] [INFO ] Deduced a trap composed of 47 places in 372 ms of which 1 ms to minimize.
[2023-03-20 02:35:30] [INFO ] Deduced a trap composed of 41 places in 400 ms of which 2 ms to minimize.
[2023-03-20 02:35:30] [INFO ] Deduced a trap composed of 42 places in 586 ms of which 2 ms to minimize.
[2023-03-20 02:35:31] [INFO ] Deduced a trap composed of 34 places in 377 ms of which 1 ms to minimize.
[2023-03-20 02:35:31] [INFO ] Deduced a trap composed of 29 places in 351 ms of which 0 ms to minimize.
[2023-03-20 02:35:32] [INFO ] Deduced a trap composed of 33 places in 413 ms of which 13 ms to minimize.
[2023-03-20 02:35:32] [INFO ] Deduced a trap composed of 42 places in 385 ms of which 1 ms to minimize.
[2023-03-20 02:35:33] [INFO ] Deduced a trap composed of 33 places in 375 ms of which 1 ms to minimize.
[2023-03-20 02:35:33] [INFO ] Deduced a trap composed of 56 places in 484 ms of which 1 ms to minimize.
[2023-03-20 02:35:34] [INFO ] Deduced a trap composed of 40 places in 439 ms of which 2 ms to minimize.
[2023-03-20 02:35:34] [INFO ] Deduced a trap composed of 31 places in 566 ms of which 1 ms to minimize.
[2023-03-20 02:35:35] [INFO ] Deduced a trap composed of 31 places in 346 ms of which 1 ms to minimize.
[2023-03-20 02:35:35] [INFO ] Deduced a trap composed of 37 places in 336 ms of which 1 ms to minimize.
[2023-03-20 02:35:36] [INFO ] Deduced a trap composed of 43 places in 421 ms of which 1 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:902)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-20 02:35:36] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-20 02:35:36] [INFO ] After 25362ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:12
FORMULA ShieldPPPt-PT-030B-ReachabilityFireability-02 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 12 Parikh solutions to 11 different solutions.
FORMULA ShieldPPPt-PT-030B-ReachabilityFireability-15 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 1 properties in 1120 ms.
Support contains 128 out of 2343 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2343/2343 places, 2133/2133 transitions.
Drop transitions removed 475 transitions
Trivial Post-agglo rules discarded 475 transitions
Performed 475 trivial Post agglomeration. Transition count delta: 475
Iterating post reduction 0 with 475 rules applied. Total rules applied 475 place count 2343 transition count 1658
Reduce places removed 475 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 477 rules applied. Total rules applied 952 place count 1868 transition count 1656
Reduce places removed 1 places and 0 transitions.
Performed 36 Post agglomeration using F-continuation condition.Transition count delta: 36
Iterating post reduction 2 with 37 rules applied. Total rules applied 989 place count 1867 transition count 1620
Reduce places removed 36 places and 0 transitions.
Iterating post reduction 3 with 36 rules applied. Total rules applied 1025 place count 1831 transition count 1620
Performed 125 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 125 Pre rules applied. Total rules applied 1025 place count 1831 transition count 1495
Deduced a syphon composed of 125 places in 5 ms
Reduce places removed 125 places and 0 transitions.
Iterating global reduction 4 with 250 rules applied. Total rules applied 1275 place count 1706 transition count 1495
Discarding 186 places :
Symmetric choice reduction at 4 with 186 rule applications. Total rules 1461 place count 1520 transition count 1309
Iterating global reduction 4 with 186 rules applied. Total rules applied 1647 place count 1520 transition count 1309
Performed 70 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 70 Pre rules applied. Total rules applied 1647 place count 1520 transition count 1239
Deduced a syphon composed of 70 places in 6 ms
Reduce places removed 70 places and 0 transitions.
Iterating global reduction 4 with 140 rules applied. Total rules applied 1787 place count 1450 transition count 1239
Performed 466 Post agglomeration using F-continuation condition.Transition count delta: 466
Deduced a syphon composed of 466 places in 2 ms
Reduce places removed 466 places and 0 transitions.
Iterating global reduction 4 with 932 rules applied. Total rules applied 2719 place count 984 transition count 773
Renaming transitions due to excessive name length > 1024 char.
Performed 66 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 66 places in 1 ms
Reduce places removed 66 places and 0 transitions.
Iterating global reduction 4 with 132 rules applied. Total rules applied 2851 place count 918 transition count 773
Free-agglomeration rule applied 7 times.
Iterating global reduction 4 with 7 rules applied. Total rules applied 2858 place count 918 transition count 766
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 4 with 7 rules applied. Total rules applied 2865 place count 911 transition count 766
Partial Free-agglomeration rule applied 77 times.
Drop transitions removed 77 transitions
Iterating global reduction 5 with 77 rules applied. Total rules applied 2942 place count 911 transition count 766
Applied a total of 2942 rules in 638 ms. Remains 911 /2343 variables (removed 1432) and now considering 766/2133 (removed 1367) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 639 ms. Remains : 911/2343 places, 766/2133 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 339 ms. (steps per millisecond=29 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 10) seen :1
FORMULA ShieldPPPt-PT-030B-ReachabilityFireability-00 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 99 ms. (steps per millisecond=101 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 9) 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 9) 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 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 9) seen :0
Running SMT prover for 9 properties.
// Phase 1: matrix 766 rows 911 cols
[2023-03-20 02:35:39] [INFO ] Computed 331 place invariants in 3 ms
[2023-03-20 02:35:39] [INFO ] [Real]Absence check using 331 positive place invariants in 91 ms returned sat
[2023-03-20 02:35:39] [INFO ] After 430ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2023-03-20 02:35:40] [INFO ] [Nat]Absence check using 331 positive place invariants in 116 ms returned sat
[2023-03-20 02:35:41] [INFO ] After 1286ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :9
[2023-03-20 02:35:41] [INFO ] State equation strengthened by 135 read => feed constraints.
[2023-03-20 02:35:43] [INFO ] After 1653ms SMT Verify possible using 135 Read/Feed constraints in natural domain returned unsat :0 sat :9
[2023-03-20 02:35:43] [INFO ] Deduced a trap composed of 10 places in 204 ms of which 0 ms to minimize.
[2023-03-20 02:35:44] [INFO ] Deduced a trap composed of 6 places in 347 ms of which 1 ms to minimize.
[2023-03-20 02:35:44] [INFO ] Deduced a trap composed of 8 places in 98 ms of which 0 ms to minimize.
[2023-03-20 02:35:44] [INFO ] Deduced a trap composed of 8 places in 140 ms of which 0 ms to minimize.
[2023-03-20 02:35:44] [INFO ] Deduced a trap composed of 6 places in 186 ms of which 1 ms to minimize.
[2023-03-20 02:35:44] [INFO ] Deduced a trap composed of 6 places in 172 ms of which 1 ms to minimize.
[2023-03-20 02:35:44] [INFO ] Deduced a trap composed of 10 places in 140 ms of which 1 ms to minimize.
[2023-03-20 02:35:45] [INFO ] Deduced a trap composed of 11 places in 211 ms of which 1 ms to minimize.
[2023-03-20 02:35:45] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 1983 ms
[2023-03-20 02:35:45] [INFO ] Deduced a trap composed of 11 places in 218 ms of which 0 ms to minimize.
[2023-03-20 02:35:45] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 305 ms
[2023-03-20 02:35:46] [INFO ] Deduced a trap composed of 6 places in 154 ms of which 1 ms to minimize.
[2023-03-20 02:35:46] [INFO ] Deduced a trap composed of 5 places in 286 ms of which 1 ms to minimize.
[2023-03-20 02:35:47] [INFO ] Deduced a trap composed of 6 places in 137 ms of which 13 ms to minimize.
[2023-03-20 02:35:47] [INFO ] Deduced a trap composed of 7 places in 174 ms of which 0 ms to minimize.
[2023-03-20 02:35:47] [INFO ] Deduced a trap composed of 8 places in 150 ms of which 0 ms to minimize.
[2023-03-20 02:35:47] [INFO ] Deduced a trap composed of 6 places in 206 ms of which 31 ms to minimize.
[2023-03-20 02:35:47] [INFO ] Deduced a trap composed of 6 places in 104 ms of which 1 ms to minimize.
[2023-03-20 02:35:48] [INFO ] Deduced a trap composed of 5 places in 139 ms of which 1 ms to minimize.
[2023-03-20 02:35:48] [INFO ] Deduced a trap composed of 7 places in 181 ms of which 0 ms to minimize.
[2023-03-20 02:35:48] [INFO ] Deduced a trap composed of 5 places in 157 ms of which 0 ms to minimize.
[2023-03-20 02:35:48] [INFO ] Deduced a trap composed of 12 places in 232 ms of which 0 ms to minimize.
[2023-03-20 02:35:49] [INFO ] Deduced a trap composed of 7 places in 112 ms of which 0 ms to minimize.
[2023-03-20 02:35:49] [INFO ] Deduced a trap composed of 10 places in 213 ms of which 0 ms to minimize.
[2023-03-20 02:35:49] [INFO ] Deduced a trap composed of 12 places in 137 ms of which 1 ms to minimize.
[2023-03-20 02:35:49] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 3391 ms
[2023-03-20 02:35:50] [INFO ] Deduced a trap composed of 6 places in 146 ms of which 0 ms to minimize.
[2023-03-20 02:35:50] [INFO ] Deduced a trap composed of 6 places in 93 ms of which 1 ms to minimize.
[2023-03-20 02:35:50] [INFO ] Deduced a trap composed of 8 places in 169 ms of which 1 ms to minimize.
[2023-03-20 02:35:50] [INFO ] Deduced a trap composed of 7 places in 258 ms of which 1 ms to minimize.
[2023-03-20 02:35:50] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 962 ms
[2023-03-20 02:35:51] [INFO ] After 9330ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :9
Attempting to minimize the solution found.
Minimization took 920 ms.
[2023-03-20 02:35:51] [INFO ] After 12354ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :9
Fused 9 Parikh solutions to 8 different solutions.
Parikh walk visited 0 properties in 228 ms.
Support contains 91 out of 911 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 911/911 places, 766/766 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 911 transition count 761
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 906 transition count 761
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 10 place count 906 transition count 750
Deduced a syphon composed of 11 places in 26 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 32 place count 895 transition count 750
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Deduced a syphon composed of 22 places in 1 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 2 with 44 rules applied. Total rules applied 76 place count 873 transition count 728
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 90 place count 866 transition count 728
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 91 place count 866 transition count 727
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 92 place count 865 transition count 727
Partial Free-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 3 with 4 rules applied. Total rules applied 96 place count 865 transition count 727
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 97 place count 864 transition count 726
Applied a total of 97 rules in 316 ms. Remains 864 /911 variables (removed 47) and now considering 726/766 (removed 40) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 316 ms. Remains : 864/911 places, 726/766 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 227 ms. (steps per millisecond=44 ) properties (out of 9) seen :4
FORMULA ShieldPPPt-PT-030B-ReachabilityFireability-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-030B-ReachabilityFireability-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-030B-ReachabilityFireability-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-030B-ReachabilityFireability-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 95 ms. (steps per millisecond=105 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 99 ms. (steps per millisecond=101 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 726 rows 864 cols
[2023-03-20 02:35:53] [INFO ] Computed 331 place invariants in 4 ms
[2023-03-20 02:35:53] [INFO ] [Real]Absence check using 331 positive place invariants in 59 ms returned sat
[2023-03-20 02:35:53] [INFO ] After 267ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-20 02:35:53] [INFO ] [Nat]Absence check using 331 positive place invariants in 60 ms returned sat
[2023-03-20 02:35:54] [INFO ] After 749ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-20 02:35:54] [INFO ] State equation strengthened by 127 read => feed constraints.
[2023-03-20 02:35:55] [INFO ] After 697ms SMT Verify possible using 127 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2023-03-20 02:35:55] [INFO ] Deduced a trap composed of 5 places in 280 ms of which 15 ms to minimize.
[2023-03-20 02:35:58] [INFO ] Deduced a trap composed of 5 places in 3013 ms of which 2 ms to minimize.
[2023-03-20 02:35:58] [INFO ] Deduced a trap composed of 9 places in 154 ms of which 1 ms to minimize.
[2023-03-20 02:35:59] [INFO ] Deduced a trap composed of 6 places in 169 ms of which 1 ms to minimize.
[2023-03-20 02:35:59] [INFO ] Deduced a trap composed of 11 places in 151 ms of which 0 ms to minimize.
[2023-03-20 02:35:59] [INFO ] Deduced a trap composed of 5 places in 154 ms of which 1 ms to minimize.
[2023-03-20 02:35:59] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 4367 ms
[2023-03-20 02:36:00] [INFO ] Deduced a trap composed of 5 places in 222 ms of which 1 ms to minimize.
[2023-03-20 02:36:01] [INFO ] Deduced a trap composed of 6 places in 255 ms of which 1 ms to minimize.
[2023-03-20 02:36:01] [INFO ] Deduced a trap composed of 5 places in 220 ms of which 1 ms to minimize.
[2023-03-20 02:36:01] [INFO ] Deduced a trap composed of 8 places in 183 ms of which 14 ms to minimize.
[2023-03-20 02:36:01] [INFO ] Deduced a trap composed of 5 places in 153 ms of which 1 ms to minimize.
[2023-03-20 02:36:02] [INFO ] Deduced a trap composed of 5 places in 148 ms of which 1 ms to minimize.
[2023-03-20 02:36:02] [INFO ] Deduced a trap composed of 5 places in 218 ms of which 1 ms to minimize.
[2023-03-20 02:36:02] [INFO ] Deduced a trap composed of 6 places in 142 ms of which 0 ms to minimize.
[2023-03-20 02:36:02] [INFO ] Deduced a trap composed of 4 places in 126 ms of which 1 ms to minimize.
[2023-03-20 02:36:02] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 2567 ms
[2023-03-20 02:36:03] [INFO ] Deduced a trap composed of 5 places in 158 ms of which 0 ms to minimize.
[2023-03-20 02:36:03] [INFO ] Deduced a trap composed of 5 places in 242 ms of which 1 ms to minimize.
[2023-03-20 02:36:03] [INFO ] Deduced a trap composed of 4 places in 132 ms of which 1 ms to minimize.
[2023-03-20 02:36:03] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 686 ms
[2023-03-20 02:36:03] [INFO ] After 9389ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 803 ms.
[2023-03-20 02:36:04] [INFO ] After 11288ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Parikh walk visited 0 properties in 169 ms.
Support contains 82 out of 864 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 864/864 places, 726/726 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 864 transition count 724
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 862 transition count 724
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 4 place count 862 transition count 721
Deduced a syphon composed of 3 places in 2 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 10 place count 859 transition count 721
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 20 place count 854 transition count 716
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 26 place count 851 transition count 716
Applied a total of 26 rules in 54 ms. Remains 851 /864 variables (removed 13) and now considering 716/726 (removed 10) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 54 ms. Remains : 851/864 places, 716/726 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 231 ms. (steps per millisecond=43 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 95 ms. (steps per millisecond=105 ) properties (out of 5) 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 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 105946 steps, run timeout after 3001 ms. (steps per millisecond=35 ) properties seen :{}
Probabilistic random walk after 105946 steps, saw 81331 distinct states, run finished after 3002 ms. (steps per millisecond=35 ) properties seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 716 rows 851 cols
[2023-03-20 02:36:08] [INFO ] Computed 331 place invariants in 3 ms
[2023-03-20 02:36:08] [INFO ] [Real]Absence check using 331 positive place invariants in 52 ms returned sat
[2023-03-20 02:36:08] [INFO ] After 223ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-20 02:36:08] [INFO ] [Nat]Absence check using 331 positive place invariants in 55 ms returned sat
[2023-03-20 02:36:09] [INFO ] After 664ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-20 02:36:09] [INFO ] State equation strengthened by 138 read => feed constraints.
[2023-03-20 02:36:10] [INFO ] After 633ms SMT Verify possible using 138 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2023-03-20 02:36:10] [INFO ] Deduced a trap composed of 5 places in 132 ms of which 0 ms to minimize.
[2023-03-20 02:36:10] [INFO ] Deduced a trap composed of 5 places in 135 ms of which 1 ms to minimize.
[2023-03-20 02:36:10] [INFO ] Deduced a trap composed of 5 places in 128 ms of which 0 ms to minimize.
[2023-03-20 02:36:11] [INFO ] Deduced a trap composed of 4 places in 142 ms of which 1 ms to minimize.
[2023-03-20 02:36:11] [INFO ] Deduced a trap composed of 10 places in 115 ms of which 0 ms to minimize.
[2023-03-20 02:36:11] [INFO ] Deduced a trap composed of 10 places in 247 ms of which 1 ms to minimize.
[2023-03-20 02:36:11] [INFO ] Deduced a trap composed of 5 places in 262 ms of which 0 ms to minimize.
[2023-03-20 02:36:11] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1504 ms
[2023-03-20 02:36:12] [INFO ] Deduced a trap composed of 8 places in 133 ms of which 0 ms to minimize.
[2023-03-20 02:36:12] [INFO ] Deduced a trap composed of 5 places in 156 ms of which 0 ms to minimize.
[2023-03-20 02:36:12] [INFO ] Deduced a trap composed of 7 places in 139 ms of which 0 ms to minimize.
[2023-03-20 02:36:13] [INFO ] Deduced a trap composed of 5 places in 124 ms of which 0 ms to minimize.
[2023-03-20 02:36:13] [INFO ] Deduced a trap composed of 6 places in 122 ms of which 0 ms to minimize.
[2023-03-20 02:36:13] [INFO ] Deduced a trap composed of 8 places in 121 ms of which 1 ms to minimize.
[2023-03-20 02:36:13] [INFO ] Deduced a trap composed of 5 places in 117 ms of which 1 ms to minimize.
[2023-03-20 02:36:13] [INFO ] Deduced a trap composed of 7 places in 119 ms of which 0 ms to minimize.
[2023-03-20 02:36:14] [INFO ] Deduced a trap composed of 5 places in 132 ms of which 1 ms to minimize.
[2023-03-20 02:36:14] [INFO ] Deduced a trap composed of 8 places in 262 ms of which 0 ms to minimize.
[2023-03-20 02:36:14] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 2426 ms
[2023-03-20 02:36:15] [INFO ] Deduced a trap composed of 9 places in 172 ms of which 1 ms to minimize.
[2023-03-20 02:36:15] [INFO ] Deduced a trap composed of 20 places in 231 ms of which 1 ms to minimize.
[2023-03-20 02:36:15] [INFO ] Deduced a trap composed of 10 places in 126 ms of which 1 ms to minimize.
[2023-03-20 02:36:15] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 732 ms
[2023-03-20 02:36:15] [INFO ] After 6063ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 502 ms.
[2023-03-20 02:36:16] [INFO ] After 7565ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Parikh walk visited 0 properties in 213 ms.
Support contains 82 out of 851 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 851/851 places, 716/716 transitions.
Applied a total of 0 rules in 34 ms. Remains 851 /851 variables (removed 0) and now considering 716/716 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 34 ms. Remains : 851/851 places, 716/716 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 851/851 places, 716/716 transitions.
Applied a total of 0 rules in 18 ms. Remains 851 /851 variables (removed 0) and now considering 716/716 (removed 0) transitions.
[2023-03-20 02:36:16] [INFO ] Invariant cache hit.
[2023-03-20 02:36:17] [INFO ] Implicit Places using invariants in 709 ms returned []
[2023-03-20 02:36:17] [INFO ] Invariant cache hit.
[2023-03-20 02:36:17] [INFO ] State equation strengthened by 138 read => feed constraints.
[2023-03-20 02:36:19] [INFO ] Implicit Places using invariants and state equation in 2245 ms returned []
Implicit Place search using SMT with State Equation took 2998 ms to find 0 implicit places.
[2023-03-20 02:36:19] [INFO ] Redundant transitions in 37 ms returned []
[2023-03-20 02:36:19] [INFO ] Invariant cache hit.
[2023-03-20 02:36:20] [INFO ] Dead Transitions using invariants and state equation in 528 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3600 ms. Remains : 851/851 places, 716/716 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 851 transition count 715
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 850 transition count 715
Partial Free-agglomeration rule applied 154 times.
Drop transitions removed 154 transitions
Iterating global reduction 0 with 154 rules applied. Total rules applied 156 place count 850 transition count 715
Applied a total of 156 rules in 45 ms. Remains 850 /851 variables (removed 1) and now considering 715/716 (removed 1) transitions.
Running SMT prover for 5 properties.
// Phase 1: matrix 715 rows 850 cols
[2023-03-20 02:36:20] [INFO ] Computed 331 place invariants in 2 ms
[2023-03-20 02:36:20] [INFO ] [Real]Absence check using 331 positive place invariants in 84 ms returned sat
[2023-03-20 02:36:20] [INFO ] After 372ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-20 02:36:20] [INFO ] [Nat]Absence check using 331 positive place invariants in 50 ms returned sat
[2023-03-20 02:36:21] [INFO ] After 757ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-20 02:36:21] [INFO ] State equation strengthened by 136 read => feed constraints.
[2023-03-20 02:36:22] [INFO ] After 1332ms SMT Verify possible using 136 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2023-03-20 02:36:23] [INFO ] Deduced a trap composed of 5 places in 250 ms of which 0 ms to minimize.
[2023-03-20 02:36:23] [INFO ] Deduced a trap composed of 5 places in 164 ms of which 1 ms to minimize.
[2023-03-20 02:36:23] [INFO ] Deduced a trap composed of 7 places in 139 ms of which 1 ms to minimize.
[2023-03-20 02:36:23] [INFO ] Deduced a trap composed of 6 places in 122 ms of which 1 ms to minimize.
[2023-03-20 02:36:24] [INFO ] Deduced a trap composed of 13 places in 203 ms of which 1 ms to minimize.
[2023-03-20 02:36:24] [INFO ] Deduced a trap composed of 5 places in 126 ms of which 0 ms to minimize.
[2023-03-20 02:36:24] [INFO ] Deduced a trap composed of 8 places in 251 ms of which 2 ms to minimize.
[2023-03-20 02:36:24] [INFO ] Deduced a trap composed of 6 places in 173 ms of which 1 ms to minimize.
[2023-03-20 02:36:24] [INFO ] Deduced a trap composed of 5 places in 160 ms of which 1 ms to minimize.
[2023-03-20 02:36:25] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 2033 ms
[2023-03-20 02:36:25] [INFO ] Deduced a trap composed of 5 places in 280 ms of which 0 ms to minimize.
[2023-03-20 02:36:25] [INFO ] Deduced a trap composed of 5 places in 141 ms of which 1 ms to minimize.
[2023-03-20 02:36:26] [INFO ] Deduced a trap composed of 6 places in 210 ms of which 0 ms to minimize.
[2023-03-20 02:36:26] [INFO ] Deduced a trap composed of 7 places in 403 ms of which 0 ms to minimize.
[2023-03-20 02:36:26] [INFO ] Deduced a trap composed of 7 places in 122 ms of which 0 ms to minimize.
[2023-03-20 02:36:27] [INFO ] Deduced a trap composed of 6 places in 312 ms of which 1 ms to minimize.
[2023-03-20 02:36:27] [INFO ] Deduced a trap composed of 4 places in 122 ms of which 0 ms to minimize.
[2023-03-20 02:36:27] [INFO ] Deduced a trap composed of 7 places in 182 ms of which 0 ms to minimize.
[2023-03-20 02:36:27] [INFO ] Deduced a trap composed of 6 places in 148 ms of which 1 ms to minimize.
[2023-03-20 02:36:28] [INFO ] Deduced a trap composed of 8 places in 269 ms of which 1 ms to minimize.
[2023-03-20 02:36:28] [INFO ] Deduced a trap composed of 5 places in 409 ms of which 1 ms to minimize.
[2023-03-20 02:36:28] [INFO ] Deduced a trap composed of 4 places in 188 ms of which 0 ms to minimize.
[2023-03-20 02:36:29] [INFO ] Deduced a trap composed of 9 places in 167 ms of which 1 ms to minimize.
[2023-03-20 02:36:29] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 3826 ms
[2023-03-20 02:36:29] [INFO ] Deduced a trap composed of 9 places in 224 ms of which 1 ms to minimize.
[2023-03-20 02:36:29] [INFO ] Deduced a trap composed of 7 places in 117 ms of which 1 ms to minimize.
[2023-03-20 02:36:29] [INFO ] Deduced a trap composed of 12 places in 94 ms of which 1 ms to minimize.
[2023-03-20 02:36:30] [INFO ] Deduced a trap composed of 9 places in 110 ms of which 1 ms to minimize.
[2023-03-20 02:36:30] [INFO ] Deduced a trap composed of 13 places in 153 ms of which 13 ms to minimize.
[2023-03-20 02:36:30] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 959 ms
[2023-03-20 02:36:30] [INFO ] After 8773ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 1256 ms.
[2023-03-20 02:36:31] [INFO ] After 11091ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
[2023-03-20 02:36:31] [INFO ] Export to MCC of 5 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 11 ms.
[2023-03-20 02:36:31] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 851 places, 716 transitions and 3052 arcs took 8 ms.
[2023-03-20 02:36:32] [INFO ] Flatten gal took : 111 ms
Total runtime 83857 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT ShieldPPPt-PT-030B
BK_EXAMINATION: ReachabilityFireability
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/381
ReachabilityFireability

FORMULA ShieldPPPt-PT-030B-ReachabilityFireability-06 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldPPPt-PT-030B-ReachabilityFireability-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldPPPt-PT-030B-ReachabilityFireability-09 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldPPPt-PT-030B-ReachabilityFireability-01 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldPPPt-PT-030B-ReachabilityFireability-08 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

BK_STOP 1679279793276

--------------------
content from stderr:

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityFireability -timeout 360 -rebuildPNML
lola: MEM LIMIT 32
lola: MEM LIMIT 5
lola: NET
lola: input: PNML file (--pnmlnet)
lola: reading net from /home/mcc/execution/381/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/381/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/381/ReachabilityFireability.xml
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Rule S: 0 transitions removed,0 places removed
lola: Created skeleton in 1.000000 secs.
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: LAUNCH task # 25 (type EXCL) for 3 ShieldPPPt-PT-030B-ReachabilityFireability-06
lola: time limit : 719 sec
lola: memory limit: 32 pages
lola: LAUNCH task # 19 (type FNDP) for 3 ShieldPPPt-PT-030B-ReachabilityFireability-06
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 20 (type EQUN) for 3 ShieldPPPt-PT-030B-ReachabilityFireability-06
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 24 (type SRCH) for 3 ShieldPPPt-PT-030B-ReachabilityFireability-06
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
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:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: FINISHED task # 19 (type FNDP) for ShieldPPPt-PT-030B-ReachabilityFireability-06
lola: result : true
lola: fired transitions : 123
lola: tried executions : 1
lola: time used : 0.000000
lola: memory pages used : 0
lola: CANCELED task # 20 (type EQUN) for ShieldPPPt-PT-030B-ReachabilityFireability-06 (obsolete)
lola: CANCELED task # 24 (type SRCH) for ShieldPPPt-PT-030B-ReachabilityFireability-06 (obsolete)
lola: CANCELED task # 25 (type EXCL) for ShieldPPPt-PT-030B-ReachabilityFireability-06 (obsolete)
lola: LAUNCH task # 29 (type EXCL) for 6 ShieldPPPt-PT-030B-ReachabilityFireability-08
lola: time limit : 899 sec
lola: memory limit: 32 pages
lola: LAUNCH task # 21 (type FNDP) for 12 ShieldPPPt-PT-030B-ReachabilityFireability-14
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 22 (type EQUN) for 12 ShieldPPPt-PT-030B-ReachabilityFireability-14
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: LAUNCH task # 32 (type SRCH) for 12 ShieldPPPt-PT-030B-ReachabilityFireability-14
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
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: 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: FINISHED task # 32 (type SRCH) for ShieldPPPt-PT-030B-ReachabilityFireability-14
lola: result : true
lola: markings : 38
lola: fired transitions : 37
lola: time used : 0.000000
lola: memory pages used : 1
lola: CANCELED task # 21 (type FNDP) for ShieldPPPt-PT-030B-ReachabilityFireability-14 (obsolete)
lola: CANCELED task # 22 (type EQUN) for ShieldPPPt-PT-030B-ReachabilityFireability-14 (obsolete)
lola: LAUNCH task # 35 (type FNDP) for 9 ShieldPPPt-PT-030B-ReachabilityFireability-09
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 36 (type EQUN) for 9 ShieldPPPt-PT-030B-ReachabilityFireability-09
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 38 (type SRCH) for 9 ShieldPPPt-PT-030B-ReachabilityFireability-09
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: FINISHED task # 22 (type EQUN) for ShieldPPPt-PT-030B-ReachabilityFireability-14
lola: result : unknown
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: FINISHED task # 21 (type FNDP) for ShieldPPPt-PT-030B-ReachabilityFireability-14
lola: result : unknown
lola: fired transitions : 8
lola: tried executions : 2
lola: time used : 0.000000
lola: memory pages used : 0
lola: FINISHED task # 35 (type FNDP) for ShieldPPPt-PT-030B-ReachabilityFireability-09
lola: result : true
lola: fired transitions : 53
lola: tried executions : 1
lola: time used : 0.000000
lola: memory pages used : 0
lola: CANCELED task # 36 (type EQUN) for ShieldPPPt-PT-030B-ReachabilityFireability-09 (obsolete)
lola: CANCELED task # 38 (type SRCH) for ShieldPPPt-PT-030B-ReachabilityFireability-09 (obsolete)
lola: LAUNCH task # 41 (type FNDP) for 0 ShieldPPPt-PT-030B-ReachabilityFireability-01
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 42 (type EQUN) for 0 ShieldPPPt-PT-030B-ReachabilityFireability-01
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 44 (type SRCH) for 0 ShieldPPPt-PT-030B-ReachabilityFireability-01
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: FINISHED task # 44 (type SRCH) for ShieldPPPt-PT-030B-ReachabilityFireability-01
lola: result : true
lola: markings : 57
lola: fired transitions : 56
lola: time used : 0.000000
lola: memory pages used : 1
lola: CANCELED task # 41 (type FNDP) for ShieldPPPt-PT-030B-ReachabilityFireability-01 (obsolete)
lola: CANCELED task # 42 (type EQUN) for ShieldPPPt-PT-030B-ReachabilityFireability-01 (obsolete)
lola: LAUNCH task # 16 (type FNDP) for 6 ShieldPPPt-PT-030B-ReachabilityFireability-08
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 17 (type EQUN) for 6 ShieldPPPt-PT-030B-ReachabilityFireability-08
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 28 (type SRCH) for 6 ShieldPPPt-PT-030B-ReachabilityFireability-08
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: FINISHED task # 41 (type FNDP) for ShieldPPPt-PT-030B-ReachabilityFireability-01
lola: result : true
lola: fired transitions : 55
lola: tried executions : 1
lola: time used : 0.000000
lola: memory pages used : 0
lola: FINISHED task # 28 (type SRCH) for ShieldPPPt-PT-030B-ReachabilityFireability-08
lola: result : true
lola: markings : 52
lola: fired transitions : 51
lola: time used : 0.000000
lola: memory pages used : 1
lola: CANCELED task # 16 (type FNDP) for ShieldPPPt-PT-030B-ReachabilityFireability-08 (obsolete)
lola: CANCELED task # 17 (type EQUN) for ShieldPPPt-PT-030B-ReachabilityFireability-08 (obsolete)
lola: CANCELED task # 29 (type EXCL) for ShieldPPPt-PT-030B-ReachabilityFireability-08 (obsolete)
lola: Portfolio finished: no open formulas

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldPPPt-PT-030B-ReachabilityFireability-01: EF true tandem / insertion
ShieldPPPt-PT-030B-ReachabilityFireability-06: AG false findpath
ShieldPPPt-PT-030B-ReachabilityFireability-08: AG false tandem / insertion
ShieldPPPt-PT-030B-ReachabilityFireability-09: EF true findpath
ShieldPPPt-PT-030B-ReachabilityFireability-14: EF true tandem / insertion


Time elapsed: 1 secs. Pages in use: 4

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="ShieldPPPt-PT-030B"
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 ShieldPPPt-PT-030B, 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-167903715500655"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ShieldPPPt-PT-030B.tgz
mv ShieldPPPt-PT-030B execution
cd execution
if [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "UpperBounds" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] || [ "ReachabilityFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "ReachabilityFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' ReachabilityFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;