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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.2M
-rw-r--r-- 1 mcc users 5.5K Feb 26 01:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 51K Feb 26 01:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.2K Feb 26 01:57 CTLFireability.txt
-rw-r--r-- 1 mcc users 72K Feb 26 01:57 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.5K Feb 25 16:59 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 16:59 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 16:59 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:59 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 26 01:59 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 115K Feb 26 01:59 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.5K Feb 26 01:58 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 60K Feb 26 01:58 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:59 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:59 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 708K 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 ShieldPPPs-PT-040B-ReachabilityFireability-00
FORMULA_NAME ShieldPPPs-PT-040B-ReachabilityFireability-01
FORMULA_NAME ShieldPPPs-PT-040B-ReachabilityFireability-02
FORMULA_NAME ShieldPPPs-PT-040B-ReachabilityFireability-03
FORMULA_NAME ShieldPPPs-PT-040B-ReachabilityFireability-04
FORMULA_NAME ShieldPPPs-PT-040B-ReachabilityFireability-05
FORMULA_NAME ShieldPPPs-PT-040B-ReachabilityFireability-06
FORMULA_NAME ShieldPPPs-PT-040B-ReachabilityFireability-07
FORMULA_NAME ShieldPPPs-PT-040B-ReachabilityFireability-08
FORMULA_NAME ShieldPPPs-PT-040B-ReachabilityFireability-09
FORMULA_NAME ShieldPPPs-PT-040B-ReachabilityFireability-10
FORMULA_NAME ShieldPPPs-PT-040B-ReachabilityFireability-11
FORMULA_NAME ShieldPPPs-PT-040B-ReachabilityFireability-12
FORMULA_NAME ShieldPPPs-PT-040B-ReachabilityFireability-13
FORMULA_NAME ShieldPPPs-PT-040B-ReachabilityFireability-14
FORMULA_NAME ShieldPPPs-PT-040B-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1679276593422

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=ShieldPPPs-PT-040B
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-20 01:43:16] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-03-20 01:43:16] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-20 01:43:16] [INFO ] Load time of PNML (sax parser for PT used): 170 ms
[2023-03-20 01:43:16] [INFO ] Transformed 2723 places.
[2023-03-20 01:43:16] [INFO ] Transformed 2523 transitions.
[2023-03-20 01:43:16] [INFO ] Found NUPN structural information;
[2023-03-20 01:43:16] [INFO ] Parsed PT model containing 2723 places and 2523 transitions and 6966 arcs in 364 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 2 resets, run finished after 616 ms. (steps per millisecond=16 ) properties (out of 16) seen :7
FORMULA ShieldPPPs-PT-040B-ReachabilityFireability-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-040B-ReachabilityFireability-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-040B-ReachabilityFireability-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-040B-ReachabilityFireability-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-040B-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-040B-ReachabilityFireability-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-040B-ReachabilityFireability-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 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 30 ms. (steps per millisecond=333 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 9) 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 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 9) seen :0
Running SMT prover for 9 properties.
// Phase 1: matrix 2523 rows 2723 cols
[2023-03-20 01:43:18] [INFO ] Computed 441 place invariants in 57 ms
[2023-03-20 01:43:19] [INFO ] After 1552ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2023-03-20 01:43:20] [INFO ] [Nat]Absence check using 441 positive place invariants in 269 ms returned sat
[2023-03-20 01:43:27] [INFO ] After 5543ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :8
[2023-03-20 01:43:28] [INFO ] Deduced a trap composed of 31 places in 714 ms of which 16 ms to minimize.
[2023-03-20 01:43:29] [INFO ] Deduced a trap composed of 15 places in 683 ms of which 3 ms to minimize.
[2023-03-20 01:43:30] [INFO ] Deduced a trap composed of 27 places in 660 ms of which 2 ms to minimize.
[2023-03-20 01:43:32] [INFO ] Deduced a trap composed of 22 places in 1393 ms of which 16 ms to minimize.
[2023-03-20 01:43:33] [INFO ] Deduced a trap composed of 32 places in 763 ms of which 6 ms to minimize.
[2023-03-20 01:43:34] [INFO ] Deduced a trap composed of 30 places in 816 ms of which 1 ms to minimize.
[2023-03-20 01:43:35] [INFO ] Deduced a trap composed of 35 places in 873 ms of which 2 ms to minimize.
[2023-03-20 01:43:35] [INFO ] Deduced a trap composed of 31 places in 576 ms of which 1 ms to minimize.
[2023-03-20 01:43:36] [INFO ] Deduced a trap composed of 26 places in 637 ms of which 1 ms to minimize.
[2023-03-20 01:43:37] [INFO ] Deduced a trap composed of 14 places in 997 ms of which 2 ms to minimize.
[2023-03-20 01:43:38] [INFO ] Deduced a trap composed of 29 places in 492 ms of which 2 ms to minimize.
[2023-03-20 01:43:39] [INFO ] Deduced a trap composed of 27 places in 885 ms of which 1 ms to minimize.
[2023-03-20 01:43:40] [INFO ] Deduced a trap composed of 22 places in 784 ms of which 2 ms to minimize.
[2023-03-20 01:43:41] [INFO ] Deduced a trap composed of 41 places in 558 ms of which 2 ms to minimize.
[2023-03-20 01:43:41] [INFO ] Deduced a trap composed of 44 places in 571 ms of which 1 ms to minimize.
[2023-03-20 01:43:42] [INFO ] Deduced a trap composed of 43 places in 841 ms of which 2 ms to minimize.
[2023-03-20 01:43:43] [INFO ] Deduced a trap composed of 31 places in 691 ms of which 1 ms to minimize.
[2023-03-20 01:43:44] [INFO ] Deduced a trap composed of 27 places in 779 ms of which 2 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:902)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-20 01:43:44] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-20 01:43:44] [INFO ] After 25053ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:9
FORMULA ShieldPPPs-PT-040B-ReachabilityFireability-15 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 9 Parikh solutions to 8 different solutions.
FORMULA ShieldPPPs-PT-040B-ReachabilityFireability-07 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 1 properties in 1223 ms.
Support contains 180 out of 2723 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2723/2723 places, 2523/2523 transitions.
Drop transitions removed 235 transitions
Trivial Post-agglo rules discarded 235 transitions
Performed 235 trivial Post agglomeration. Transition count delta: 235
Iterating post reduction 0 with 235 rules applied. Total rules applied 235 place count 2723 transition count 2288
Reduce places removed 235 places and 0 transitions.
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Iterating post reduction 1 with 251 rules applied. Total rules applied 486 place count 2488 transition count 2272
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 2 with 16 rules applied. Total rules applied 502 place count 2472 transition count 2272
Performed 196 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 196 Pre rules applied. Total rules applied 502 place count 2472 transition count 2076
Deduced a syphon composed of 196 places in 7 ms
Reduce places removed 196 places and 0 transitions.
Iterating global reduction 3 with 392 rules applied. Total rules applied 894 place count 2276 transition count 2076
Discarding 244 places :
Symmetric choice reduction at 3 with 244 rule applications. Total rules 1138 place count 2032 transition count 1832
Iterating global reduction 3 with 244 rules applied. Total rules applied 1382 place count 2032 transition count 1832
Performed 84 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 84 Pre rules applied. Total rules applied 1382 place count 2032 transition count 1748
Deduced a syphon composed of 84 places in 10 ms
Reduce places removed 84 places and 0 transitions.
Iterating global reduction 3 with 168 rules applied. Total rules applied 1550 place count 1948 transition count 1748
Performed 535 Post agglomeration using F-continuation condition.Transition count delta: 535
Deduced a syphon composed of 535 places in 5 ms
Reduce places removed 535 places and 0 transitions.
Iterating global reduction 3 with 1070 rules applied. Total rules applied 2620 place count 1413 transition count 1213
Partial Free-agglomeration rule applied 309 times.
Drop transitions removed 309 transitions
Iterating global reduction 3 with 309 rules applied. Total rules applied 2929 place count 1413 transition count 1213
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 2930 place count 1412 transition count 1212
Applied a total of 2930 rules in 1160 ms. Remains 1412 /2723 variables (removed 1311) and now considering 1212/2523 (removed 1311) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1161 ms. Remains : 1412/2723 places, 1212/2523 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 481 ms. (steps per millisecond=20 ) properties (out of 7) seen :3
FORMULA ShieldPPPs-PT-040B-ReachabilityFireability-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-040B-ReachabilityFireability-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-040B-ReachabilityFireability-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 95 ms. (steps per millisecond=105 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 1212 rows 1412 cols
[2023-03-20 01:43:48] [INFO ] Computed 441 place invariants in 24 ms
[2023-03-20 01:43:48] [INFO ] After 270ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-20 01:43:48] [INFO ] [Nat]Absence check using 422 positive place invariants in 94 ms returned sat
[2023-03-20 01:43:48] [INFO ] [Nat]Absence check using 422 positive and 19 generalized place invariants in 3 ms returned sat
[2023-03-20 01:43:50] [INFO ] After 1476ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-20 01:43:50] [INFO ] Deduced a trap composed of 9 places in 222 ms of which 0 ms to minimize.
[2023-03-20 01:43:51] [INFO ] Deduced a trap composed of 12 places in 405 ms of which 1 ms to minimize.
[2023-03-20 01:43:52] [INFO ] Deduced a trap composed of 7 places in 483 ms of which 1 ms to minimize.
[2023-03-20 01:43:52] [INFO ] Deduced a trap composed of 8 places in 319 ms of which 23 ms to minimize.
[2023-03-20 01:43:52] [INFO ] Deduced a trap composed of 12 places in 236 ms of which 1 ms to minimize.
[2023-03-20 01:43:53] [INFO ] Deduced a trap composed of 5 places in 323 ms of which 1 ms to minimize.
[2023-03-20 01:43:53] [INFO ] Deduced a trap composed of 7 places in 136 ms of which 0 ms to minimize.
[2023-03-20 01:43:53] [INFO ] Deduced a trap composed of 15 places in 241 ms of which 1 ms to minimize.
[2023-03-20 01:43:54] [INFO ] Deduced a trap composed of 31 places in 298 ms of which 1 ms to minimize.
[2023-03-20 01:43:54] [INFO ] Deduced a trap composed of 8 places in 189 ms of which 1 ms to minimize.
[2023-03-20 01:43:54] [INFO ] Deduced a trap composed of 8 places in 545 ms of which 0 ms to minimize.
[2023-03-20 01:43:55] [INFO ] Deduced a trap composed of 6 places in 429 ms of which 0 ms to minimize.
[2023-03-20 01:43:55] [INFO ] Deduced a trap composed of 10 places in 234 ms of which 1 ms to minimize.
[2023-03-20 01:43:56] [INFO ] Deduced a trap composed of 13 places in 317 ms of which 1 ms to minimize.
[2023-03-20 01:43:56] [INFO ] Deduced a trap composed of 10 places in 187 ms of which 1 ms to minimize.
[2023-03-20 01:43:56] [INFO ] Deduced a trap composed of 10 places in 152 ms of which 12 ms to minimize.
[2023-03-20 01:43:56] [INFO ] Deduced a trap composed of 6 places in 217 ms of which 0 ms to minimize.
[2023-03-20 01:43:57] [INFO ] Deduced a trap composed of 12 places in 164 ms of which 1 ms to minimize.
[2023-03-20 01:43:57] [INFO ] Deduced a trap composed of 17 places in 234 ms of which 14 ms to minimize.
[2023-03-20 01:43:57] [INFO ] Deduced a trap composed of 11 places in 153 ms of which 0 ms to minimize.
[2023-03-20 01:43:57] [INFO ] Deduced a trap composed of 17 places in 152 ms of which 1 ms to minimize.
[2023-03-20 01:43:58] [INFO ] Deduced a trap composed of 11 places in 137 ms of which 1 ms to minimize.
[2023-03-20 01:43:58] [INFO ] Deduced a trap composed of 8 places in 440 ms of which 26 ms to minimize.
[2023-03-20 01:43:59] [INFO ] Deduced a trap composed of 5 places in 499 ms of which 1 ms to minimize.
[2023-03-20 01:43:59] [INFO ] Deduced a trap composed of 8 places in 219 ms of which 22 ms to minimize.
[2023-03-20 01:43:59] [INFO ] Deduced a trap composed of 7 places in 191 ms of which 1 ms to minimize.
[2023-03-20 01:44:00] [INFO ] Deduced a trap composed of 7 places in 191 ms of which 0 ms to minimize.
[2023-03-20 01:44:00] [INFO ] Deduced a trap composed of 10 places in 160 ms of which 1 ms to minimize.
[2023-03-20 01:44:00] [INFO ] Deduced a trap composed of 9 places in 257 ms of which 0 ms to minimize.
[2023-03-20 01:44:01] [INFO ] Deduced a trap composed of 15 places in 261 ms of which 0 ms to minimize.
[2023-03-20 01:44:01] [INFO ] Deduced a trap composed of 6 places in 211 ms of which 0 ms to minimize.
[2023-03-20 01:44:01] [INFO ] Deduced a trap composed of 13 places in 163 ms of which 1 ms to minimize.
[2023-03-20 01:44:02] [INFO ] Deduced a trap composed of 16 places in 257 ms of which 26 ms to minimize.
[2023-03-20 01:44:02] [INFO ] Deduced a trap composed of 19 places in 161 ms of which 0 ms to minimize.
[2023-03-20 01:44:02] [INFO ] Deduced a trap composed of 16 places in 207 ms of which 0 ms to minimize.
[2023-03-20 01:44:02] [INFO ] Deduced a trap composed of 12 places in 188 ms of which 0 ms to minimize.
[2023-03-20 01:44:03] [INFO ] Deduced a trap composed of 15 places in 116 ms of which 0 ms to minimize.
[2023-03-20 01:44:03] [INFO ] Deduced a trap composed of 7 places in 179 ms of which 13 ms to minimize.
[2023-03-20 01:44:03] [INFO ] Deduced a trap composed of 6 places in 334 ms of which 0 ms to minimize.
[2023-03-20 01:44:03] [INFO ] Deduced a trap composed of 13 places in 133 ms of which 0 ms to minimize.
[2023-03-20 01:44:04] [INFO ] Deduced a trap composed of 18 places in 134 ms of which 0 ms to minimize.
[2023-03-20 01:44:04] [INFO ] Trap strengthening (SAT) tested/added 42/41 trap constraints in 13595 ms
[2023-03-20 01:44:04] [INFO ] Deduced a trap composed of 5 places in 292 ms of which 1 ms to minimize.
[2023-03-20 01:44:05] [INFO ] Deduced a trap composed of 5 places in 304 ms of which 0 ms to minimize.
[2023-03-20 01:44:05] [INFO ] Deduced a trap composed of 8 places in 375 ms of which 0 ms to minimize.
[2023-03-20 01:44:05] [INFO ] Deduced a trap composed of 6 places in 271 ms of which 1 ms to minimize.
[2023-03-20 01:44:06] [INFO ] Deduced a trap composed of 6 places in 253 ms of which 1 ms to minimize.
[2023-03-20 01:44:06] [INFO ] Deduced a trap composed of 7 places in 224 ms of which 0 ms to minimize.
[2023-03-20 01:44:06] [INFO ] Deduced a trap composed of 10 places in 239 ms of which 1 ms to minimize.
[2023-03-20 01:44:07] [INFO ] Deduced a trap composed of 6 places in 195 ms of which 0 ms to minimize.
[2023-03-20 01:44:07] [INFO ] Deduced a trap composed of 17 places in 293 ms of which 39 ms to minimize.
[2023-03-20 01:44:07] [INFO ] Deduced a trap composed of 4 places in 248 ms of which 39 ms to minimize.
[2023-03-20 01:44:08] [INFO ] Deduced a trap composed of 5 places in 252 ms of which 14 ms to minimize.
[2023-03-20 01:44:08] [INFO ] Deduced a trap composed of 5 places in 222 ms of which 1 ms to minimize.
[2023-03-20 01:44:08] [INFO ] Deduced a trap composed of 4 places in 351 ms of which 1 ms to minimize.
[2023-03-20 01:44:09] [INFO ] Deduced a trap composed of 15 places in 315 ms of which 0 ms to minimize.
[2023-03-20 01:44:09] [INFO ] Deduced a trap composed of 6 places in 214 ms of which 0 ms to minimize.
[2023-03-20 01:44:09] [INFO ] Deduced a trap composed of 7 places in 199 ms of which 1 ms to minimize.
[2023-03-20 01:44:10] [INFO ] Deduced a trap composed of 4 places in 426 ms of which 1 ms to minimize.
[2023-03-20 01:44:10] [INFO ] Deduced a trap composed of 4 places in 260 ms of which 1 ms to minimize.
[2023-03-20 01:44:10] [INFO ] Deduced a trap composed of 4 places in 195 ms of which 0 ms to minimize.
[2023-03-20 01:44:11] [INFO ] Deduced a trap composed of 6 places in 235 ms of which 0 ms to minimize.
[2023-03-20 01:44:11] [INFO ] Deduced a trap composed of 12 places in 191 ms of which 1 ms to minimize.
[2023-03-20 01:44:11] [INFO ] Deduced a trap composed of 10 places in 288 ms of which 3 ms to minimize.
[2023-03-20 01:44:12] [INFO ] Deduced a trap composed of 13 places in 265 ms of which 0 ms to minimize.
[2023-03-20 01:44:12] [INFO ] Deduced a trap composed of 16 places in 766 ms of which 1 ms to minimize.
[2023-03-20 01:44:13] [INFO ] Deduced a trap composed of 13 places in 190 ms of which 0 ms to minimize.
[2023-03-20 01:44:13] [INFO ] Deduced a trap composed of 16 places in 446 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 01:44:13] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-20 01:44:13] [INFO ] After 25332ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:4
Parikh walk visited 0 properties in 109 ms.
Support contains 99 out of 1412 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1412/1412 places, 1212/1212 transitions.
Drop transitions removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 0 with 12 rules applied. Total rules applied 12 place count 1412 transition count 1200
Reduce places removed 12 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 13 rules applied. Total rules applied 25 place count 1400 transition count 1199
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 26 place count 1399 transition count 1199
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 12 Pre rules applied. Total rules applied 26 place count 1399 transition count 1187
Deduced a syphon composed of 12 places in 5 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 3 with 24 rules applied. Total rules applied 50 place count 1387 transition count 1187
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 53 place count 1384 transition count 1184
Iterating global reduction 3 with 3 rules applied. Total rules applied 56 place count 1384 transition count 1184
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 56 place count 1384 transition count 1183
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 58 place count 1383 transition count 1183
Performed 50 Post agglomeration using F-continuation condition.Transition count delta: 50
Deduced a syphon composed of 50 places in 2 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 3 with 100 rules applied. Total rules applied 158 place count 1333 transition count 1133
Partial Free-agglomeration rule applied 17 times.
Drop transitions removed 17 transitions
Iterating global reduction 3 with 17 rules applied. Total rules applied 175 place count 1333 transition count 1133
Reduce places removed 4 places and 4 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 179 place count 1329 transition count 1129
Applied a total of 179 rules in 273 ms. Remains 1329 /1412 variables (removed 83) and now considering 1129/1212 (removed 83) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 273 ms. Remains : 1329/1412 places, 1129/1212 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 201 ms. (steps per millisecond=49 ) properties (out of 4) seen :1
FORMULA ShieldPPPs-PT-040B-ReachabilityFireability-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 1129 rows 1329 cols
[2023-03-20 01:44:14] [INFO ] Computed 441 place invariants in 21 ms
[2023-03-20 01:44:14] [INFO ] After 298ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-20 01:44:15] [INFO ] [Nat]Absence check using 419 positive place invariants in 260 ms returned sat
[2023-03-20 01:44:15] [INFO ] [Nat]Absence check using 419 positive and 22 generalized place invariants in 6 ms returned sat
[2023-03-20 01:44:17] [INFO ] After 1546ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-20 01:44:18] [INFO ] Deduced a trap composed of 5 places in 339 ms of which 1 ms to minimize.
[2023-03-20 01:44:18] [INFO ] Deduced a trap composed of 6 places in 240 ms of which 0 ms to minimize.
[2023-03-20 01:44:19] [INFO ] Deduced a trap composed of 6 places in 206 ms of which 0 ms to minimize.
[2023-03-20 01:44:19] [INFO ] Deduced a trap composed of 6 places in 253 ms of which 1 ms to minimize.
[2023-03-20 01:44:20] [INFO ] Deduced a trap composed of 7 places in 302 ms of which 1 ms to minimize.
[2023-03-20 01:44:20] [INFO ] Deduced a trap composed of 7 places in 141 ms of which 0 ms to minimize.
[2023-03-20 01:44:20] [INFO ] Deduced a trap composed of 5 places in 116 ms of which 1 ms to minimize.
[2023-03-20 01:44:20] [INFO ] Deduced a trap composed of 6 places in 282 ms of which 1 ms to minimize.
[2023-03-20 01:44:21] [INFO ] Deduced a trap composed of 9 places in 186 ms of which 0 ms to minimize.
[2023-03-20 01:44:21] [INFO ] Deduced a trap composed of 6 places in 326 ms of which 0 ms to minimize.
[2023-03-20 01:44:21] [INFO ] Deduced a trap composed of 8 places in 209 ms of which 1 ms to minimize.
[2023-03-20 01:44:22] [INFO ] Deduced a trap composed of 13 places in 309 ms of which 0 ms to minimize.
[2023-03-20 01:44:22] [INFO ] Deduced a trap composed of 5 places in 177 ms of which 0 ms to minimize.
[2023-03-20 01:44:22] [INFO ] Deduced a trap composed of 17 places in 257 ms of which 1 ms to minimize.
[2023-03-20 01:44:23] [INFO ] Deduced a trap composed of 4 places in 269 ms of which 1 ms to minimize.
[2023-03-20 01:44:23] [INFO ] Deduced a trap composed of 12 places in 174 ms of which 0 ms to minimize.
[2023-03-20 01:44:23] [INFO ] Deduced a trap composed of 8 places in 236 ms of which 0 ms to minimize.
[2023-03-20 01:44:23] [INFO ] Deduced a trap composed of 6 places in 234 ms of which 1 ms to minimize.
[2023-03-20 01:44:24] [INFO ] Deduced a trap composed of 9 places in 206 ms of which 1 ms to minimize.
[2023-03-20 01:44:24] [INFO ] Deduced a trap composed of 13 places in 240 ms of which 0 ms to minimize.
[2023-03-20 01:44:24] [INFO ] Deduced a trap composed of 6 places in 267 ms of which 0 ms to minimize.
[2023-03-20 01:44:25] [INFO ] Deduced a trap composed of 14 places in 236 ms of which 0 ms to minimize.
[2023-03-20 01:44:25] [INFO ] Deduced a trap composed of 13 places in 156 ms of which 1 ms to minimize.
[2023-03-20 01:44:25] [INFO ] Deduced a trap composed of 9 places in 195 ms of which 0 ms to minimize.
[2023-03-20 01:44:26] [INFO ] Deduced a trap composed of 10 places in 300 ms of which 0 ms to minimize.
[2023-03-20 01:44:26] [INFO ] Deduced a trap composed of 18 places in 253 ms of which 1 ms to minimize.
[2023-03-20 01:44:26] [INFO ] Deduced a trap composed of 14 places in 169 ms of which 0 ms to minimize.
[2023-03-20 01:44:26] [INFO ] Deduced a trap composed of 10 places in 198 ms of which 2 ms to minimize.
[2023-03-20 01:44:27] [INFO ] Deduced a trap composed of 8 places in 255 ms of which 0 ms to minimize.
[2023-03-20 01:44:27] [INFO ] Deduced a trap composed of 7 places in 203 ms of which 1 ms to minimize.
[2023-03-20 01:44:27] [INFO ] Deduced a trap composed of 7 places in 185 ms of which 1 ms to minimize.
[2023-03-20 01:44:27] [INFO ] Deduced a trap composed of 6 places in 142 ms of which 0 ms to minimize.
[2023-03-20 01:44:28] [INFO ] Deduced a trap composed of 5 places in 250 ms of which 1 ms to minimize.
[2023-03-20 01:44:28] [INFO ] Deduced a trap composed of 8 places in 207 ms of which 0 ms to minimize.
[2023-03-20 01:44:29] [INFO ] Deduced a trap composed of 7 places in 236 ms of which 1 ms to minimize.
[2023-03-20 01:44:29] [INFO ] Deduced a trap composed of 6 places in 175 ms of which 0 ms to minimize.
[2023-03-20 01:44:29] [INFO ] Deduced a trap composed of 9 places in 174 ms of which 1 ms to minimize.
[2023-03-20 01:44:29] [INFO ] Deduced a trap composed of 12 places in 315 ms of which 10 ms to minimize.
[2023-03-20 01:44:30] [INFO ] Deduced a trap composed of 15 places in 219 ms of which 0 ms to minimize.
[2023-03-20 01:44:30] [INFO ] Deduced a trap composed of 21 places in 223 ms of which 1 ms to minimize.
[2023-03-20 01:44:31] [INFO ] Deduced a trap composed of 7 places in 236 ms of which 1 ms to minimize.
[2023-03-20 01:44:31] [INFO ] Deduced a trap composed of 12 places in 178 ms of which 0 ms to minimize.
[2023-03-20 01:44:31] [INFO ] Trap strengthening (SAT) tested/added 43/42 trap constraints in 13325 ms
[2023-03-20 01:44:31] [INFO ] Deduced a trap composed of 5 places in 232 ms of which 1 ms to minimize.
[2023-03-20 01:44:32] [INFO ] Deduced a trap composed of 7 places in 222 ms of which 1 ms to minimize.
[2023-03-20 01:44:32] [INFO ] Deduced a trap composed of 6 places in 277 ms of which 1 ms to minimize.
[2023-03-20 01:44:33] [INFO ] Deduced a trap composed of 5 places in 289 ms of which 1 ms to minimize.
[2023-03-20 01:44:33] [INFO ] Deduced a trap composed of 7 places in 293 ms of which 1 ms to minimize.
[2023-03-20 01:44:33] [INFO ] Deduced a trap composed of 7 places in 226 ms of which 1 ms to minimize.
[2023-03-20 01:44:33] [INFO ] Deduced a trap composed of 5 places in 245 ms of which 1 ms to minimize.
[2023-03-20 01:44:34] [INFO ] Deduced a trap composed of 6 places in 207 ms of which 0 ms to minimize.
[2023-03-20 01:44:34] [INFO ] Deduced a trap composed of 4 places in 295 ms of which 0 ms to minimize.
[2023-03-20 01:44:34] [INFO ] Deduced a trap composed of 5 places in 175 ms of which 1 ms to minimize.
[2023-03-20 01:44:35] [INFO ] Deduced a trap composed of 12 places in 252 ms of which 1 ms to minimize.
[2023-03-20 01:44:35] [INFO ] Deduced a trap composed of 7 places in 401 ms of which 1 ms to minimize.
[2023-03-20 01:44:35] [INFO ] Deduced a trap composed of 6 places in 213 ms of which 1 ms to minimize.
[2023-03-20 01:44:36] [INFO ] Deduced a trap composed of 8 places in 205 ms of which 1 ms to minimize.
[2023-03-20 01:44:36] [INFO ] Deduced a trap composed of 5 places in 192 ms of which 15 ms to minimize.
[2023-03-20 01:44:36] [INFO ] Deduced a trap composed of 8 places in 198 ms of which 0 ms to minimize.
[2023-03-20 01:44:36] [INFO ] Deduced a trap composed of 12 places in 216 ms of which 1 ms to minimize.
[2023-03-20 01:44:37] [INFO ] Deduced a trap composed of 15 places in 233 ms of which 1 ms to minimize.
[2023-03-20 01:44:37] [INFO ] Deduced a trap composed of 7 places in 236 ms of which 1 ms to minimize.
[2023-03-20 01:44:38] [INFO ] Deduced a trap composed of 17 places in 502 ms of which 0 ms to minimize.
[2023-03-20 01:44:38] [INFO ] Deduced a trap composed of 7 places in 266 ms of which 0 ms to minimize.
[2023-03-20 01:44:38] [INFO ] Deduced a trap composed of 11 places in 201 ms of which 0 ms to minimize.
[2023-03-20 01:44:39] [INFO ] Deduced a trap composed of 8 places in 247 ms of which 0 ms to minimize.
[2023-03-20 01:44:39] [INFO ] Deduced a trap composed of 10 places in 299 ms of which 0 ms to minimize.
[2023-03-20 01:44:39] [INFO ] Deduced a trap composed of 10 places in 424 ms of which 0 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.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 01:44:39] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-20 01:44:39] [INFO ] After 25107ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:3
Parikh walk visited 0 properties in 85 ms.
Support contains 80 out of 1329 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1329/1329 places, 1129/1129 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 1329 transition count 1128
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 1328 transition count 1128
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 2 place count 1328 transition count 1126
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 6 place count 1326 transition count 1126
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 1 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 2 with 30 rules applied. Total rules applied 36 place count 1311 transition count 1111
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 2 with 3 rules applied. Total rules applied 39 place count 1311 transition count 1111
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 40 place count 1310 transition count 1110
Applied a total of 40 rules in 155 ms. Remains 1310 /1329 variables (removed 19) and now considering 1110/1129 (removed 19) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 156 ms. Remains : 1310/1329 places, 1110/1129 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 233 ms. (steps per millisecond=42 ) properties (out of 3) seen :1
FORMULA ShieldPPPs-PT-040B-ReachabilityFireability-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 89 ms. (steps per millisecond=112 ) properties (out of 2) 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 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 1110 rows 1310 cols
[2023-03-20 01:44:40] [INFO ] Computed 441 place invariants in 50 ms
[2023-03-20 01:44:40] [INFO ] After 171ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-20 01:44:41] [INFO ] [Nat]Absence check using 422 positive place invariants in 95 ms returned sat
[2023-03-20 01:44:41] [INFO ] [Nat]Absence check using 422 positive and 19 generalized place invariants in 4 ms returned sat
[2023-03-20 01:44:43] [INFO ] After 2521ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-20 01:44:48] [INFO ] Deduced a trap composed of 8 places in 272 ms of which 1 ms to minimize.
[2023-03-20 01:44:48] [INFO ] Deduced a trap composed of 7 places in 222 ms of which 1 ms to minimize.
[2023-03-20 01:44:49] [INFO ] Deduced a trap composed of 10 places in 211 ms of which 1 ms to minimize.
[2023-03-20 01:44:49] [INFO ] Deduced a trap composed of 6 places in 234 ms of which 0 ms to minimize.
[2023-03-20 01:44:49] [INFO ] Deduced a trap composed of 6 places in 238 ms of which 1 ms to minimize.
[2023-03-20 01:44:50] [INFO ] Deduced a trap composed of 5 places in 362 ms of which 1 ms to minimize.
[2023-03-20 01:44:50] [INFO ] Deduced a trap composed of 6 places in 286 ms of which 0 ms to minimize.
[2023-03-20 01:44:50] [INFO ] Deduced a trap composed of 5 places in 294 ms of which 1 ms to minimize.
[2023-03-20 01:44:51] [INFO ] Deduced a trap composed of 7 places in 361 ms of which 1 ms to minimize.
[2023-03-20 01:44:51] [INFO ] Deduced a trap composed of 5 places in 263 ms of which 0 ms to minimize.
[2023-03-20 01:44:52] [INFO ] Deduced a trap composed of 4 places in 205 ms of which 1 ms to minimize.
[2023-03-20 01:44:52] [INFO ] Deduced a trap composed of 6 places in 128 ms of which 0 ms to minimize.
[2023-03-20 01:44:52] [INFO ] Deduced a trap composed of 9 places in 196 ms of which 0 ms to minimize.
[2023-03-20 01:44:52] [INFO ] Deduced a trap composed of 5 places in 324 ms of which 1 ms to minimize.
[2023-03-20 01:44:53] [INFO ] Deduced a trap composed of 8 places in 209 ms of which 1 ms to minimize.
[2023-03-20 01:44:53] [INFO ] Deduced a trap composed of 6 places in 193 ms of which 0 ms to minimize.
[2023-03-20 01:44:53] [INFO ] Deduced a trap composed of 6 places in 135 ms of which 1 ms to minimize.
[2023-03-20 01:44:54] [INFO ] Deduced a trap composed of 6 places in 221 ms of which 0 ms to minimize.
[2023-03-20 01:44:54] [INFO ] Deduced a trap composed of 11 places in 197 ms of which 0 ms to minimize.
[2023-03-20 01:44:54] [INFO ] Deduced a trap composed of 5 places in 178 ms of which 0 ms to minimize.
[2023-03-20 01:44:54] [INFO ] Deduced a trap composed of 13 places in 167 ms of which 0 ms to minimize.
[2023-03-20 01:44:55] [INFO ] Deduced a trap composed of 9 places in 221 ms of which 0 ms to minimize.
[2023-03-20 01:44:55] [INFO ] Deduced a trap composed of 6 places in 164 ms of which 1 ms to minimize.
[2023-03-20 01:44:55] [INFO ] Deduced a trap composed of 7 places in 127 ms of which 0 ms to minimize.
[2023-03-20 01:44:55] [INFO ] Deduced a trap composed of 7 places in 187 ms of which 1 ms to minimize.
[2023-03-20 01:44:56] [INFO ] Deduced a trap composed of 10 places in 215 ms of which 1 ms to minimize.
[2023-03-20 01:44:56] [INFO ] Deduced a trap composed of 21 places in 220 ms of which 1 ms to minimize.
[2023-03-20 01:44:56] [INFO ] Trap strengthening (SAT) tested/added 28/27 trap constraints in 8563 ms
[2023-03-20 01:44:57] [INFO ] Deduced a trap composed of 7 places in 315 ms of which 1 ms to minimize.
[2023-03-20 01:44:57] [INFO ] Deduced a trap composed of 6 places in 196 ms of which 1 ms to minimize.
[2023-03-20 01:44:57] [INFO ] Deduced a trap composed of 5 places in 203 ms of which 0 ms to minimize.
[2023-03-20 01:44:58] [INFO ] Deduced a trap composed of 5 places in 280 ms of which 1 ms to minimize.
[2023-03-20 01:44:58] [INFO ] Deduced a trap composed of 8 places in 315 ms of which 0 ms to minimize.
[2023-03-20 01:44:58] [INFO ] Deduced a trap composed of 6 places in 301 ms of which 0 ms to minimize.
[2023-03-20 01:44:59] [INFO ] Deduced a trap composed of 6 places in 277 ms of which 1 ms to minimize.
[2023-03-20 01:44:59] [INFO ] Deduced a trap composed of 5 places in 305 ms of which 2 ms to minimize.
[2023-03-20 01:44:59] [INFO ] Deduced a trap composed of 6 places in 225 ms of which 1 ms to minimize.
[2023-03-20 01:45:00] [INFO ] Deduced a trap composed of 6 places in 422 ms of which 0 ms to minimize.
[2023-03-20 01:45:00] [INFO ] Deduced a trap composed of 7 places in 193 ms of which 1 ms to minimize.
[2023-03-20 01:45:00] [INFO ] Deduced a trap composed of 6 places in 260 ms of which 1 ms to minimize.
[2023-03-20 01:45:01] [INFO ] Deduced a trap composed of 11 places in 371 ms of which 1 ms to minimize.
[2023-03-20 01:45:01] [INFO ] Deduced a trap composed of 6 places in 375 ms of which 0 ms to minimize.
[2023-03-20 01:45:02] [INFO ] Deduced a trap composed of 13 places in 231 ms of which 1 ms to minimize.
[2023-03-20 01:45:02] [INFO ] Deduced a trap composed of 6 places in 340 ms of which 0 ms to minimize.
[2023-03-20 01:45:02] [INFO ] Deduced a trap composed of 6 places in 314 ms of which 0 ms to minimize.
[2023-03-20 01:45:03] [INFO ] Deduced a trap composed of 12 places in 238 ms of which 0 ms to minimize.
[2023-03-20 01:45:03] [INFO ] Deduced a trap composed of 5 places in 221 ms of which 1 ms to minimize.
[2023-03-20 01:45:04] [INFO ] Deduced a trap composed of 26 places in 533 ms of which 0 ms to minimize.
[2023-03-20 01:45:04] [INFO ] Deduced a trap composed of 9 places in 306 ms of which 0 ms to minimize.
[2023-03-20 01:45:04] [INFO ] Deduced a trap composed of 5 places in 317 ms of which 0 ms to minimize.
[2023-03-20 01:45:05] [INFO ] Deduced a trap composed of 17 places in 290 ms of which 1 ms to minimize.
[2023-03-20 01:45:05] [INFO ] Deduced a trap composed of 8 places in 190 ms of which 1 ms to minimize.
[2023-03-20 01:45:05] [INFO ] Deduced a trap composed of 11 places in 160 ms of which 0 ms to minimize.
[2023-03-20 01:45:05] [INFO ] Trap strengthening (SAT) tested/added 25/25 trap constraints in 8843 ms
[2023-03-20 01:45:05] [INFO ] After 24655ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 0 ms.
[2023-03-20 01:45:05] [INFO ] After 25017ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 54 ms.
Support contains 77 out of 1310 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1310/1310 places, 1110/1110 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 1310 transition count 1109
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1309 transition count 1109
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 8 place count 1306 transition count 1106
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 10 place count 1306 transition count 1106
Applied a total of 10 rules in 147 ms. Remains 1306 /1310 variables (removed 4) and now considering 1106/1110 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 147 ms. Remains : 1306/1310 places, 1106/1110 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 199 ms. (steps per millisecond=50 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 121268 steps, run timeout after 3001 ms. (steps per millisecond=40 ) properties seen :{}
Probabilistic random walk after 121268 steps, saw 115370 distinct states, run finished after 3002 ms. (steps per millisecond=40 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 1106 rows 1306 cols
[2023-03-20 01:45:09] [INFO ] Computed 441 place invariants in 40 ms
[2023-03-20 01:45:09] [INFO ] After 254ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-20 01:45:10] [INFO ] [Nat]Absence check using 420 positive place invariants in 249 ms returned sat
[2023-03-20 01:45:10] [INFO ] [Nat]Absence check using 420 positive and 21 generalized place invariants in 3 ms returned sat
[2023-03-20 01:45:11] [INFO ] After 1287ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-20 01:45:13] [INFO ] Deduced a trap composed of 5 places in 231 ms of which 1 ms to minimize.
[2023-03-20 01:45:13] [INFO ] Deduced a trap composed of 6 places in 207 ms of which 0 ms to minimize.
[2023-03-20 01:45:14] [INFO ] Deduced a trap composed of 7 places in 258 ms of which 3 ms to minimize.
[2023-03-20 01:45:14] [INFO ] Deduced a trap composed of 6 places in 212 ms of which 1 ms to minimize.
[2023-03-20 01:45:14] [INFO ] Deduced a trap composed of 4 places in 205 ms of which 1 ms to minimize.
[2023-03-20 01:45:14] [INFO ] Deduced a trap composed of 6 places in 206 ms of which 0 ms to minimize.
[2023-03-20 01:45:15] [INFO ] Deduced a trap composed of 5 places in 270 ms of which 1 ms to minimize.
[2023-03-20 01:45:15] [INFO ] Deduced a trap composed of 6 places in 186 ms of which 1 ms to minimize.
[2023-03-20 01:45:15] [INFO ] Deduced a trap composed of 10 places in 244 ms of which 1 ms to minimize.
[2023-03-20 01:45:16] [INFO ] Deduced a trap composed of 5 places in 223 ms of which 1 ms to minimize.
[2023-03-20 01:45:16] [INFO ] Deduced a trap composed of 5 places in 294 ms of which 10 ms to minimize.
[2023-03-20 01:45:16] [INFO ] Deduced a trap composed of 7 places in 130 ms of which 1 ms to minimize.
[2023-03-20 01:45:16] [INFO ] Deduced a trap composed of 4 places in 140 ms of which 0 ms to minimize.
[2023-03-20 01:45:17] [INFO ] Deduced a trap composed of 4 places in 209 ms of which 1 ms to minimize.
[2023-03-20 01:45:17] [INFO ] Deduced a trap composed of 4 places in 250 ms of which 1 ms to minimize.
[2023-03-20 01:45:17] [INFO ] Deduced a trap composed of 4 places in 186 ms of which 0 ms to minimize.
[2023-03-20 01:45:18] [INFO ] Deduced a trap composed of 10 places in 173 ms of which 0 ms to minimize.
[2023-03-20 01:45:18] [INFO ] Deduced a trap composed of 6 places in 145 ms of which 0 ms to minimize.
[2023-03-20 01:45:18] [INFO ] Deduced a trap composed of 5 places in 304 ms of which 0 ms to minimize.
[2023-03-20 01:45:19] [INFO ] Deduced a trap composed of 6 places in 377 ms of which 1 ms to minimize.
[2023-03-20 01:45:19] [INFO ] Deduced a trap composed of 6 places in 218 ms of which 1 ms to minimize.
[2023-03-20 01:45:19] [INFO ] Deduced a trap composed of 10 places in 189 ms of which 1 ms to minimize.
[2023-03-20 01:45:20] [INFO ] Deduced a trap composed of 6 places in 221 ms of which 0 ms to minimize.
[2023-03-20 01:45:20] [INFO ] Deduced a trap composed of 6 places in 228 ms of which 1 ms to minimize.
[2023-03-20 01:45:20] [INFO ] Deduced a trap composed of 4 places in 158 ms of which 0 ms to minimize.
[2023-03-20 01:45:20] [INFO ] Deduced a trap composed of 7 places in 107 ms of which 1 ms to minimize.
[2023-03-20 01:45:21] [INFO ] Deduced a trap composed of 4 places in 175 ms of which 1 ms to minimize.
[2023-03-20 01:45:21] [INFO ] Deduced a trap composed of 6 places in 184 ms of which 2 ms to minimize.
[2023-03-20 01:45:21] [INFO ] Deduced a trap composed of 4 places in 124 ms of which 1 ms to minimize.
[2023-03-20 01:45:21] [INFO ] Deduced a trap composed of 6 places in 141 ms of which 1 ms to minimize.
[2023-03-20 01:45:22] [INFO ] Deduced a trap composed of 8 places in 116 ms of which 0 ms to minimize.
[2023-03-20 01:45:22] [INFO ] Deduced a trap composed of 13 places in 200 ms of which 1 ms to minimize.
[2023-03-20 01:45:22] [INFO ] Deduced a trap composed of 13 places in 175 ms of which 0 ms to minimize.
[2023-03-20 01:45:22] [INFO ] Deduced a trap composed of 7 places in 195 ms of which 0 ms to minimize.
[2023-03-20 01:45:23] [INFO ] Deduced a trap composed of 7 places in 170 ms of which 1 ms to minimize.
[2023-03-20 01:45:23] [INFO ] Deduced a trap composed of 7 places in 161 ms of which 0 ms to minimize.
[2023-03-20 01:45:23] [INFO ] Deduced a trap composed of 8 places in 234 ms of which 0 ms to minimize.
[2023-03-20 01:45:24] [INFO ] Deduced a trap composed of 5 places in 308 ms of which 0 ms to minimize.
[2023-03-20 01:45:24] [INFO ] Deduced a trap composed of 10 places in 168 ms of which 0 ms to minimize.
[2023-03-20 01:45:24] [INFO ] Deduced a trap composed of 11 places in 111 ms of which 0 ms to minimize.
[2023-03-20 01:45:24] [INFO ] Trap strengthening (SAT) tested/added 41/40 trap constraints in 11366 ms
[2023-03-20 01:45:25] [INFO ] Deduced a trap composed of 6 places in 293 ms of which 1 ms to minimize.
[2023-03-20 01:45:25] [INFO ] Deduced a trap composed of 4 places in 346 ms of which 1 ms to minimize.
[2023-03-20 01:45:25] [INFO ] Deduced a trap composed of 6 places in 249 ms of which 1 ms to minimize.
[2023-03-20 01:45:26] [INFO ] Deduced a trap composed of 10 places in 281 ms of which 22 ms to minimize.
[2023-03-20 01:45:26] [INFO ] Deduced a trap composed of 7 places in 156 ms of which 1 ms to minimize.
[2023-03-20 01:45:26] [INFO ] Deduced a trap composed of 5 places in 418 ms of which 2 ms to minimize.
[2023-03-20 01:45:27] [INFO ] Deduced a trap composed of 5 places in 224 ms of which 0 ms to minimize.
[2023-03-20 01:45:27] [INFO ] Deduced a trap composed of 5 places in 430 ms of which 0 ms to minimize.
[2023-03-20 01:45:27] [INFO ] Deduced a trap composed of 8 places in 132 ms of which 1 ms to minimize.
[2023-03-20 01:45:27] [INFO ] Deduced a trap composed of 4 places in 116 ms of which 0 ms to minimize.
[2023-03-20 01:45:28] [INFO ] Deduced a trap composed of 8 places in 148 ms of which 1 ms to minimize.
[2023-03-20 01:45:28] [INFO ] Deduced a trap composed of 6 places in 219 ms of which 13 ms to minimize.
[2023-03-20 01:45:28] [INFO ] Deduced a trap composed of 6 places in 189 ms of which 0 ms to minimize.
[2023-03-20 01:45:29] [INFO ] Deduced a trap composed of 9 places in 277 ms of which 0 ms to minimize.
[2023-03-20 01:45:29] [INFO ] Deduced a trap composed of 17 places in 292 ms of which 0 ms to minimize.
[2023-03-20 01:45:29] [INFO ] Deduced a trap composed of 8 places in 160 ms of which 1 ms to minimize.
[2023-03-20 01:45:29] [INFO ] Deduced a trap composed of 8 places in 113 ms of which 1 ms to minimize.
[2023-03-20 01:45:30] [INFO ] Deduced a trap composed of 7 places in 144 ms of which 1 ms to minimize.
[2023-03-20 01:45:30] [INFO ] Deduced a trap composed of 10 places in 199 ms of which 0 ms to minimize.
[2023-03-20 01:45:30] [INFO ] Deduced a trap composed of 18 places in 132 ms of which 1 ms to minimize.
[2023-03-20 01:45:30] [INFO ] Deduced a trap composed of 10 places in 129 ms of which 1 ms to minimize.
[2023-03-20 01:45:30] [INFO ] Deduced a trap composed of 5 places in 142 ms of which 0 ms to minimize.
[2023-03-20 01:45:31] [INFO ] Deduced a trap composed of 9 places in 197 ms of which 0 ms to minimize.
[2023-03-20 01:45:31] [INFO ] Deduced a trap composed of 6 places in 157 ms of which 1 ms to minimize.
[2023-03-20 01:45:31] [INFO ] Deduced a trap composed of 9 places in 178 ms of which 0 ms to minimize.
[2023-03-20 01:45:31] [INFO ] Trap strengthening (SAT) tested/added 26/25 trap constraints in 6943 ms
[2023-03-20 01:45:31] [INFO ] After 21456ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 686 ms.
[2023-03-20 01:45:32] [INFO ] After 22734ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 64 ms.
Support contains 77 out of 1306 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1306/1306 places, 1106/1106 transitions.
Applied a total of 0 rules in 37 ms. Remains 1306 /1306 variables (removed 0) and now considering 1106/1106 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 37 ms. Remains : 1306/1306 places, 1106/1106 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1306/1306 places, 1106/1106 transitions.
Applied a total of 0 rules in 35 ms. Remains 1306 /1306 variables (removed 0) and now considering 1106/1106 (removed 0) transitions.
[2023-03-20 01:45:32] [INFO ] Invariant cache hit.
[2023-03-20 01:45:33] [INFO ] Implicit Places using invariants in 1116 ms returned []
[2023-03-20 01:45:33] [INFO ] Invariant cache hit.
[2023-03-20 01:45:36] [INFO ] Implicit Places using invariants and state equation in 2382 ms returned []
Implicit Place search using SMT with State Equation took 3524 ms to find 0 implicit places.
[2023-03-20 01:45:36] [INFO ] Redundant transitions in 58 ms returned []
[2023-03-20 01:45:36] [INFO ] Invariant cache hit.
[2023-03-20 01:45:37] [INFO ] Dead Transitions using invariants and state equation in 944 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4596 ms. Remains : 1306/1306 places, 1106/1106 transitions.
Applied a total of 0 rules in 36 ms. Remains 1306 /1306 variables (removed 0) and now considering 1106/1106 (removed 0) transitions.
Running SMT prover for 2 properties.
[2023-03-20 01:45:37] [INFO ] Invariant cache hit.
[2023-03-20 01:45:37] [INFO ] After 230ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-20 01:45:37] [INFO ] [Nat]Absence check using 420 positive place invariants in 104 ms returned sat
[2023-03-20 01:45:37] [INFO ] [Nat]Absence check using 420 positive and 21 generalized place invariants in 5 ms returned sat
[2023-03-20 01:45:38] [INFO ] After 1096ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-20 01:45:39] [INFO ] Deduced a trap composed of 6 places in 213 ms of which 1 ms to minimize.
[2023-03-20 01:45:40] [INFO ] Deduced a trap composed of 5 places in 212 ms of which 0 ms to minimize.
[2023-03-20 01:45:40] [INFO ] Deduced a trap composed of 9 places in 230 ms of which 1 ms to minimize.
[2023-03-20 01:45:40] [INFO ] Deduced a trap composed of 4 places in 262 ms of which 1 ms to minimize.
[2023-03-20 01:45:41] [INFO ] Deduced a trap composed of 6 places in 304 ms of which 1 ms to minimize.
[2023-03-20 01:45:41] [INFO ] Deduced a trap composed of 7 places in 309 ms of which 1 ms to minimize.
[2023-03-20 01:45:42] [INFO ] Deduced a trap composed of 5 places in 183 ms of which 1 ms to minimize.
[2023-03-20 01:45:42] [INFO ] Deduced a trap composed of 5 places in 260 ms of which 0 ms to minimize.
[2023-03-20 01:45:42] [INFO ] Deduced a trap composed of 4 places in 385 ms of which 0 ms to minimize.
[2023-03-20 01:45:43] [INFO ] Deduced a trap composed of 4 places in 262 ms of which 1 ms to minimize.
[2023-03-20 01:45:43] [INFO ] Deduced a trap composed of 6 places in 245 ms of which 0 ms to minimize.
[2023-03-20 01:45:44] [INFO ] Deduced a trap composed of 6 places in 268 ms of which 1 ms to minimize.
[2023-03-20 01:45:44] [INFO ] Deduced a trap composed of 4 places in 206 ms of which 0 ms to minimize.
[2023-03-20 01:45:44] [INFO ] Deduced a trap composed of 6 places in 169 ms of which 1 ms to minimize.
[2023-03-20 01:45:45] [INFO ] Deduced a trap composed of 6 places in 174 ms of which 1 ms to minimize.
[2023-03-20 01:45:45] [INFO ] Deduced a trap composed of 6 places in 178 ms of which 1 ms to minimize.
[2023-03-20 01:45:45] [INFO ] Deduced a trap composed of 6 places in 134 ms of which 1 ms to minimize.
[2023-03-20 01:45:45] [INFO ] Deduced a trap composed of 5 places in 186 ms of which 0 ms to minimize.
[2023-03-20 01:45:45] [INFO ] Deduced a trap composed of 5 places in 162 ms of which 1 ms to minimize.
[2023-03-20 01:45:46] [INFO ] Deduced a trap composed of 4 places in 226 ms of which 1 ms to minimize.
[2023-03-20 01:45:46] [INFO ] Deduced a trap composed of 8 places in 161 ms of which 0 ms to minimize.
[2023-03-20 01:45:46] [INFO ] Deduced a trap composed of 6 places in 212 ms of which 0 ms to minimize.
[2023-03-20 01:45:46] [INFO ] Deduced a trap composed of 6 places in 113 ms of which 1 ms to minimize.
[2023-03-20 01:45:47] [INFO ] Deduced a trap composed of 4 places in 233 ms of which 1 ms to minimize.
[2023-03-20 01:45:47] [INFO ] Deduced a trap composed of 4 places in 133 ms of which 1 ms to minimize.
[2023-03-20 01:45:47] [INFO ] Deduced a trap composed of 6 places in 127 ms of which 1 ms to minimize.
[2023-03-20 01:45:47] [INFO ] Deduced a trap composed of 9 places in 174 ms of which 1 ms to minimize.
[2023-03-20 01:45:48] [INFO ] Deduced a trap composed of 17 places in 120 ms of which 0 ms to minimize.
[2023-03-20 01:45:48] [INFO ] Deduced a trap composed of 16 places in 174 ms of which 0 ms to minimize.
[2023-03-20 01:45:48] [INFO ] Deduced a trap composed of 4 places in 166 ms of which 1 ms to minimize.
[2023-03-20 01:45:48] [INFO ] Deduced a trap composed of 5 places in 129 ms of which 1 ms to minimize.
[2023-03-20 01:45:48] [INFO ] Deduced a trap composed of 5 places in 70 ms of which 0 ms to minimize.
[2023-03-20 01:45:49] [INFO ] Deduced a trap composed of 7 places in 86 ms of which 1 ms to minimize.
[2023-03-20 01:45:49] [INFO ] Deduced a trap composed of 6 places in 104 ms of which 0 ms to minimize.
[2023-03-20 01:45:49] [INFO ] Deduced a trap composed of 13 places in 122 ms of which 0 ms to minimize.
[2023-03-20 01:45:49] [INFO ] Deduced a trap composed of 6 places in 142 ms of which 0 ms to minimize.
[2023-03-20 01:45:49] [INFO ] Deduced a trap composed of 6 places in 219 ms of which 1 ms to minimize.
[2023-03-20 01:45:50] [INFO ] Deduced a trap composed of 10 places in 135 ms of which 0 ms to minimize.
[2023-03-20 01:45:50] [INFO ] Trap strengthening (SAT) tested/added 39/38 trap constraints in 10559 ms
[2023-03-20 01:45:50] [INFO ] Deduced a trap composed of 6 places in 254 ms of which 1 ms to minimize.
[2023-03-20 01:45:50] [INFO ] Deduced a trap composed of 7 places in 342 ms of which 1 ms to minimize.
[2023-03-20 01:45:51] [INFO ] Deduced a trap composed of 9 places in 227 ms of which 16 ms to minimize.
[2023-03-20 01:45:51] [INFO ] Deduced a trap composed of 6 places in 213 ms of which 1 ms to minimize.
[2023-03-20 01:45:51] [INFO ] Deduced a trap composed of 9 places in 202 ms of which 0 ms to minimize.
[2023-03-20 01:45:51] [INFO ] Deduced a trap composed of 6 places in 234 ms of which 0 ms to minimize.
[2023-03-20 01:45:52] [INFO ] Deduced a trap composed of 7 places in 390 ms of which 1 ms to minimize.
[2023-03-20 01:45:52] [INFO ] Deduced a trap composed of 5 places in 288 ms of which 1 ms to minimize.
[2023-03-20 01:45:53] [INFO ] Deduced a trap composed of 6 places in 394 ms of which 1 ms to minimize.
[2023-03-20 01:45:53] [INFO ] Deduced a trap composed of 6 places in 332 ms of which 1 ms to minimize.
[2023-03-20 01:45:53] [INFO ] Deduced a trap composed of 6 places in 268 ms of which 1 ms to minimize.
[2023-03-20 01:45:54] [INFO ] Deduced a trap composed of 10 places in 222 ms of which 0 ms to minimize.
[2023-03-20 01:45:54] [INFO ] Deduced a trap composed of 8 places in 175 ms of which 1 ms to minimize.
[2023-03-20 01:45:54] [INFO ] Deduced a trap composed of 6 places in 313 ms of which 1 ms to minimize.
[2023-03-20 01:45:55] [INFO ] Deduced a trap composed of 6 places in 213 ms of which 1 ms to minimize.
[2023-03-20 01:45:55] [INFO ] Deduced a trap composed of 7 places in 217 ms of which 1 ms to minimize.
[2023-03-20 01:45:55] [INFO ] Deduced a trap composed of 8 places in 223 ms of which 1 ms to minimize.
[2023-03-20 01:45:55] [INFO ] Deduced a trap composed of 7 places in 228 ms of which 1 ms to minimize.
[2023-03-20 01:45:56] [INFO ] Deduced a trap composed of 8 places in 190 ms of which 0 ms to minimize.
[2023-03-20 01:45:56] [INFO ] Deduced a trap composed of 8 places in 172 ms of which 1 ms to minimize.
[2023-03-20 01:45:56] [INFO ] Deduced a trap composed of 8 places in 175 ms of which 1 ms to minimize.
[2023-03-20 01:45:56] [INFO ] Deduced a trap composed of 5 places in 262 ms of which 1 ms to minimize.
[2023-03-20 01:45:57] [INFO ] Deduced a trap composed of 7 places in 267 ms of which 1 ms to minimize.
[2023-03-20 01:45:57] [INFO ] Deduced a trap composed of 22 places in 241 ms of which 0 ms to minimize.
[2023-03-20 01:45:57] [INFO ] Deduced a trap composed of 25 places in 257 ms of which 1 ms to minimize.
[2023-03-20 01:45:58] [INFO ] Deduced a trap composed of 10 places in 358 ms of which 1 ms to minimize.
[2023-03-20 01:45:58] [INFO ] Deduced a trap composed of 10 places in 336 ms of which 1 ms to minimize.
[2023-03-20 01:45:58] [INFO ] Deduced a trap composed of 7 places in 228 ms of which 1 ms to minimize.
[2023-03-20 01:45:59] [INFO ] Trap strengthening (SAT) tested/added 29/28 trap constraints in 8786 ms
[2023-03-20 01:45:59] [INFO ] After 21215ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 1839 ms.
[2023-03-20 01:46:00] [INFO ] After 23506ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
[2023-03-20 01:46:00] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 16 ms.
[2023-03-20 01:46:01] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1306 places, 1106 transitions and 4838 arcs took 18 ms.
[2023-03-20 01:46:01] [INFO ] Flatten gal took : 200 ms
Total runtime 164953 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT ShieldPPPs-PT-040B
BK_EXAMINATION: ReachabilityFireability
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/375
ReachabilityFireability

FORMULA ShieldPPPs-PT-040B-ReachabilityFireability-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldPPPs-PT-040B-ReachabilityFireability-00 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

BK_STOP 1679276763470

--------------------
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/375/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/375/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/375/ReachabilityFireability.xml
lola: Created skeleton in 0.000000 secs.
lola: Rule S: 0 transitions removed,0 places removed
lola: Created skeleton in 0.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: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 # 11 (type EXCL) for 3 ShieldPPPs-PT-040B-ReachabilityFireability-04
lola: time limit : 1799 sec
lola: memory limit: 32 pages
lola: LAUNCH task # 7 (type FNDP) for 3 ShieldPPPs-PT-040B-ReachabilityFireability-04
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 8 (type EQUN) for 3 ShieldPPPs-PT-040B-ReachabilityFireability-04
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: LAUNCH task # 10 (type SRCH) for 3 ShieldPPPs-PT-040B-ReachabilityFireability-04
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:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: FINISHED task # 10 (type SRCH) for ShieldPPPs-PT-040B-ReachabilityFireability-04
lola: result : true
lola: markings : 186
lola: fired transitions : 185
lola: time used : 0.000000
lola: memory pages used : 1
lola: CANCELED task # 7 (type FNDP) for ShieldPPPs-PT-040B-ReachabilityFireability-04 (obsolete)
lola: CANCELED task # 8 (type EQUN) for ShieldPPPs-PT-040B-ReachabilityFireability-04 (obsolete)
lola: CANCELED task # 11 (type EXCL) for ShieldPPPs-PT-040B-ReachabilityFireability-04 (obsolete)
lola: LAUNCH task # 18 (type EXCL) for 0 ShieldPPPs-PT-040B-ReachabilityFireability-00
lola: time limit : 3598 sec
lola: memory limit: 32 pages
lola: LAUNCH task # 14 (type FNDP) for 0 ShieldPPPs-PT-040B-ReachabilityFireability-00
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 15 (type EQUN) for 0 ShieldPPPs-PT-040B-ReachabilityFireability-00
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 17 (type SRCH) for 0 ShieldPPPs-PT-040B-ReachabilityFireability-00
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: FINISHED task # 7 (type FNDP) for ShieldPPPs-PT-040B-ReachabilityFireability-04
lola: result : unknown
lola: fired transitions : 2080
lola: tried executions : 154
lola: time used : 0.000000
lola: memory pages used : 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: FINISHED task # 17 (type SRCH) for ShieldPPPs-PT-040B-ReachabilityFireability-00
lola: result : true
lola: markings : 141
lola: fired transitions : 140
lola: time used : 0.000000
lola: memory pages used : 1
lola: CANCELED task # 14 (type FNDP) for ShieldPPPs-PT-040B-ReachabilityFireability-00 (obsolete)
lola: CANCELED task # 15 (type EQUN) for ShieldPPPs-PT-040B-ReachabilityFireability-00 (obsolete)
lola: CANCELED task # 18 (type EXCL) for ShieldPPPs-PT-040B-ReachabilityFireability-00 (obsolete)
lola: Portfolio finished: no open formulas

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldPPPs-PT-040B-ReachabilityFireability-00: AG false tandem / insertion
ShieldPPPs-PT-040B-ReachabilityFireability-04: AG false tandem / insertion


Time elapsed: 2 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="ShieldPPPs-PT-040B"
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 ShieldPPPs-PT-040B, 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-167903715300495"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ShieldPPPs-PT-040B.tgz
mv ShieldPPPs-PT-040B 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 ;