Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r373-tall-171683789000310.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool gold2023
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 r373-tall-171683789000310
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.2M
-rw-r--r-- 1 mcc users 6.3K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 63K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K May 19 07:16 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 19 16:35 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:32 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 19:10 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 13 11:56 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 106K Apr 13 11:56 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.8K Apr 13 11:55 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 75K Apr 13 11:55 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 23 07:53 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:53 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 708K May 18 16:43 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-2024-00
FORMULA_NAME ShieldPPPs-PT-040B-ReachabilityFireability-2024-01
FORMULA_NAME ShieldPPPs-PT-040B-ReachabilityFireability-2024-02
FORMULA_NAME ShieldPPPs-PT-040B-ReachabilityFireability-2024-03
FORMULA_NAME ShieldPPPs-PT-040B-ReachabilityFireability-2024-04
FORMULA_NAME ShieldPPPs-PT-040B-ReachabilityFireability-2024-05
FORMULA_NAME ShieldPPPs-PT-040B-ReachabilityFireability-2024-06
FORMULA_NAME ShieldPPPs-PT-040B-ReachabilityFireability-2024-07
FORMULA_NAME ShieldPPPs-PT-040B-ReachabilityFireability-2024-08
FORMULA_NAME ShieldPPPs-PT-040B-ReachabilityFireability-2024-09
FORMULA_NAME ShieldPPPs-PT-040B-ReachabilityFireability-2024-10
FORMULA_NAME ShieldPPPs-PT-040B-ReachabilityFireability-2024-11
FORMULA_NAME ShieldPPPs-PT-040B-ReachabilityFireability-2024-12
FORMULA_NAME ShieldPPPs-PT-040B-ReachabilityFireability-2024-13
FORMULA_NAME ShieldPPPs-PT-040B-ReachabilityFireability-2024-14
FORMULA_NAME ShieldPPPs-PT-040B-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1716977473626

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=gold2023
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 202304061127
[2024-05-29 10:11:15] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-05-29 10:11:15] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-29 10:11:15] [INFO ] Load time of PNML (sax parser for PT used): 164 ms
[2024-05-29 10:11:15] [INFO ] Transformed 2723 places.
[2024-05-29 10:11:16] [INFO ] Transformed 2523 transitions.
[2024-05-29 10:11:16] [INFO ] Found NUPN structural information;
[2024-05-29 10:11:16] [INFO ] Parsed PT model containing 2723 places and 2523 transitions and 6966 arcs in 351 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 12 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 2 resets, run finished after 474 ms. (steps per millisecond=21 ) properties (out of 16) seen :10
FORMULA ShieldPPPs-PT-040B-ReachabilityFireability-2024-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-040B-ReachabilityFireability-2024-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-040B-ReachabilityFireability-2024-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-040B-ReachabilityFireability-2024-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-040B-ReachabilityFireability-2024-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-040B-ReachabilityFireability-2024-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-040B-ReachabilityFireability-2024-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-040B-ReachabilityFireability-2024-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-040B-ReachabilityFireability-2024-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-040B-ReachabilityFireability-2024-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 6) 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 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 6) 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 6) seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 2523 rows 2723 cols
[2024-05-29 10:11:16] [INFO ] Computed 441 invariants in 43 ms
[2024-05-29 10:11:17] [INFO ] After 982ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2024-05-29 10:11:18] [INFO ] [Nat]Absence check using 441 positive place invariants in 167 ms returned sat
[2024-05-29 10:11:24] [INFO ] After 5056ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2024-05-29 10:11:24] [INFO ] Deduced a trap composed of 20 places in 648 ms of which 15 ms to minimize.
[2024-05-29 10:11:25] [INFO ] Deduced a trap composed of 15 places in 544 ms of which 2 ms to minimize.
[2024-05-29 10:11:26] [INFO ] Deduced a trap composed of 16 places in 721 ms of which 10 ms to minimize.
[2024-05-29 10:11:27] [INFO ] Deduced a trap composed of 24 places in 643 ms of which 2 ms to minimize.
[2024-05-29 10:11:27] [INFO ] Deduced a trap composed of 28 places in 629 ms of which 5 ms to minimize.
[2024-05-29 10:11:28] [INFO ] Deduced a trap composed of 25 places in 567 ms of which 2 ms to minimize.
[2024-05-29 10:11:29] [INFO ] Deduced a trap composed of 32 places in 597 ms of which 2 ms to minimize.
[2024-05-29 10:11:29] [INFO ] Deduced a trap composed of 45 places in 534 ms of which 2 ms to minimize.
[2024-05-29 10:11:30] [INFO ] Deduced a trap composed of 42 places in 559 ms of which 2 ms to minimize.
[2024-05-29 10:11:31] [INFO ] Deduced a trap composed of 31 places in 544 ms of which 1 ms to minimize.
[2024-05-29 10:11:31] [INFO ] Deduced a trap composed of 27 places in 526 ms of which 1 ms to minimize.
[2024-05-29 10:11:32] [INFO ] Deduced a trap composed of 18 places in 552 ms of which 1 ms to minimize.
[2024-05-29 10:11:33] [INFO ] Deduced a trap composed of 27 places in 503 ms of which 2 ms to minimize.
[2024-05-29 10:11:33] [INFO ] Deduced a trap composed of 32 places in 542 ms of which 2 ms to minimize.
[2024-05-29 10:11:34] [INFO ] Deduced a trap composed of 48 places in 503 ms of which 1 ms to minimize.
[2024-05-29 10:11:34] [INFO ] Deduced a trap composed of 29 places in 454 ms of which 2 ms to minimize.
[2024-05-29 10:11:35] [INFO ] Deduced a trap composed of 42 places in 502 ms of which 1 ms to minimize.
[2024-05-29 10:11:36] [INFO ] Deduced a trap composed of 46 places in 471 ms of which 1 ms to minimize.
[2024-05-29 10:11:36] [INFO ] Deduced a trap composed of 35 places in 492 ms of which 1 ms to minimize.
[2024-05-29 10:11:37] [INFO ] Deduced a trap composed of 44 places in 507 ms of which 1 ms to minimize.
[2024-05-29 10:11:37] [INFO ] Deduced a trap composed of 49 places in 469 ms of which 1 ms to minimize.
[2024-05-29 10:11:38] [INFO ] Deduced a trap composed of 34 places in 489 ms of which 2 ms to minimize.
[2024-05-29 10:11:38] [INFO ] Deduced a trap composed of 43 places in 466 ms of which 1 ms to minimize.
[2024-05-29 10:11:39] [INFO ] Deduced a trap composed of 31 places in 494 ms of which 1 ms to minimize.
[2024-05-29 10:11:40] [INFO ] Deduced a trap composed of 41 places in 457 ms of which 8 ms to minimize.
[2024-05-29 10:11:40] [INFO ] Deduced a trap composed of 45 places in 450 ms of which 2 ms to minimize.
[2024-05-29 10:11:41] [INFO ] Deduced a trap composed of 34 places in 439 ms of which 2 ms to minimize.
[2024-05-29 10:11:41] [INFO ] Deduced a trap composed of 46 places in 455 ms of which 1 ms to minimize.
[2024-05-29 10:11:42] [INFO ] Deduced a trap composed of 42 places in 477 ms of which 1 ms to minimize.
[2024-05-29 10:11:42] [INFO ] Deduced a trap composed of 35 places in 435 ms of which 1 ms to minimize.
[2024-05-29 10:11:43] [INFO ] Deduced a trap composed of 48 places in 445 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:1258)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:739)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:659)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:353)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:226)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:96)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:944)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
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)
[2024-05-29 10:11:43] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-29 10:11:43] [INFO ] After 25485ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:6
Parikh walk visited 0 properties in 563 ms.
Support contains 185 out of 2723 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2723/2723 places, 2523/2523 transitions.
Drop transitions removed 236 transitions
Trivial Post-agglo rules discarded 236 transitions
Performed 236 trivial Post agglomeration. Transition count delta: 236
Iterating post reduction 0 with 236 rules applied. Total rules applied 236 place count 2723 transition count 2287
Reduce places removed 236 places and 0 transitions.
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Iterating post reduction 1 with 252 rules applied. Total rules applied 488 place count 2487 transition count 2271
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 2 with 16 rules applied. Total rules applied 504 place count 2471 transition count 2271
Performed 197 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 197 Pre rules applied. Total rules applied 504 place count 2471 transition count 2074
Deduced a syphon composed of 197 places in 6 ms
Reduce places removed 197 places and 0 transitions.
Iterating global reduction 3 with 394 rules applied. Total rules applied 898 place count 2274 transition count 2074
Discarding 244 places :
Symmetric choice reduction at 3 with 244 rule applications. Total rules 1142 place count 2030 transition count 1830
Iterating global reduction 3 with 244 rules applied. Total rules applied 1386 place count 2030 transition count 1830
Performed 85 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 85 Pre rules applied. Total rules applied 1386 place count 2030 transition count 1745
Deduced a syphon composed of 85 places in 11 ms
Reduce places removed 85 places and 0 transitions.
Iterating global reduction 3 with 170 rules applied. Total rules applied 1556 place count 1945 transition count 1745
Performed 545 Post agglomeration using F-continuation condition.Transition count delta: 545
Deduced a syphon composed of 545 places in 2 ms
Reduce places removed 545 places and 0 transitions.
Iterating global reduction 3 with 1090 rules applied. Total rules applied 2646 place count 1400 transition count 1200
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 299 times.
Drop transitions removed 299 transitions
Iterating global reduction 3 with 299 rules applied. Total rules applied 2945 place count 1400 transition count 1200
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 2946 place count 1399 transition count 1199
Applied a total of 2946 rules in 972 ms. Remains 1399 /2723 variables (removed 1324) and now considering 1199/2523 (removed 1324) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 973 ms. Remains : 1399/2723 places, 1199/2523 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 276 ms. (steps per millisecond=36 ) properties (out of 6) seen :1
FORMULA ShieldPPPs-PT-040B-ReachabilityFireability-2024-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 5) 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 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 5) 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 5) seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 1199 rows 1399 cols
[2024-05-29 10:11:45] [INFO ] Computed 441 invariants in 33 ms
[2024-05-29 10:11:46] [INFO ] After 303ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2024-05-29 10:11:46] [INFO ] [Nat]Absence check using 425 positive place invariants in 89 ms returned sat
[2024-05-29 10:11:46] [INFO ] [Nat]Absence check using 425 positive and 16 generalized place invariants in 3 ms returned sat
[2024-05-29 10:11:47] [INFO ] After 1300ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2024-05-29 10:11:48] [INFO ] Deduced a trap composed of 5 places in 354 ms of which 1 ms to minimize.
[2024-05-29 10:11:48] [INFO ] Deduced a trap composed of 4 places in 334 ms of which 1 ms to minimize.
[2024-05-29 10:11:49] [INFO ] Deduced a trap composed of 5 places in 326 ms of which 1 ms to minimize.
[2024-05-29 10:11:49] [INFO ] Deduced a trap composed of 6 places in 316 ms of which 1 ms to minimize.
[2024-05-29 10:11:49] [INFO ] Deduced a trap composed of 5 places in 309 ms of which 1 ms to minimize.
[2024-05-29 10:11:50] [INFO ] Deduced a trap composed of 4 places in 277 ms of which 0 ms to minimize.
[2024-05-29 10:11:50] [INFO ] Deduced a trap composed of 9 places in 267 ms of which 1 ms to minimize.
[2024-05-29 10:11:50] [INFO ] Deduced a trap composed of 4 places in 291 ms of which 1 ms to minimize.
[2024-05-29 10:11:51] [INFO ] Deduced a trap composed of 8 places in 272 ms of which 1 ms to minimize.
[2024-05-29 10:11:51] [INFO ] Deduced a trap composed of 7 places in 275 ms of which 1 ms to minimize.
[2024-05-29 10:11:51] [INFO ] Deduced a trap composed of 5 places in 278 ms of which 1 ms to minimize.
[2024-05-29 10:11:52] [INFO ] Deduced a trap composed of 12 places in 272 ms of which 1 ms to minimize.
[2024-05-29 10:11:52] [INFO ] Deduced a trap composed of 11 places in 270 ms of which 2 ms to minimize.
[2024-05-29 10:11:52] [INFO ] Deduced a trap composed of 5 places in 281 ms of which 1 ms to minimize.
[2024-05-29 10:11:53] [INFO ] Deduced a trap composed of 8 places in 254 ms of which 1 ms to minimize.
[2024-05-29 10:11:53] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 15 trap constraints in 5158 ms
[2024-05-29 10:11:53] [INFO ] Deduced a trap composed of 6 places in 158 ms of which 1 ms to minimize.
[2024-05-29 10:11:53] [INFO ] Deduced a trap composed of 12 places in 141 ms of which 1 ms to minimize.
[2024-05-29 10:11:54] [INFO ] Deduced a trap composed of 5 places in 141 ms of which 0 ms to minimize.
[2024-05-29 10:11:54] [INFO ] Deduced a trap composed of 8 places in 151 ms of which 0 ms to minimize.
[2024-05-29 10:11:54] [INFO ] Deduced a trap composed of 10 places in 148 ms of which 1 ms to minimize.
[2024-05-29 10:11:54] [INFO ] Deduced a trap composed of 8 places in 146 ms of which 1 ms to minimize.
[2024-05-29 10:11:54] [INFO ] Deduced a trap composed of 7 places in 139 ms of which 1 ms to minimize.
[2024-05-29 10:11:55] [INFO ] Deduced a trap composed of 6 places in 168 ms of which 1 ms to minimize.
[2024-05-29 10:11:55] [INFO ] Deduced a trap composed of 8 places in 135 ms of which 1 ms to minimize.
[2024-05-29 10:11:55] [INFO ] Deduced a trap composed of 6 places in 132 ms of which 1 ms to minimize.
[2024-05-29 10:11:55] [INFO ] Deduced a trap composed of 7 places in 125 ms of which 0 ms to minimize.
[2024-05-29 10:11:55] [INFO ] Deduced a trap composed of 6 places in 127 ms of which 0 ms to minimize.
[2024-05-29 10:11:56] [INFO ] Deduced a trap composed of 4 places in 130 ms of which 0 ms to minimize.
[2024-05-29 10:11:56] [INFO ] Deduced a trap composed of 4 places in 134 ms of which 1 ms to minimize.
[2024-05-29 10:11:56] [INFO ] Deduced a trap composed of 5 places in 121 ms of which 0 ms to minimize.
[2024-05-29 10:11:56] [INFO ] Deduced a trap composed of 4 places in 115 ms of which 0 ms to minimize.
[2024-05-29 10:11:56] [INFO ] Deduced a trap composed of 5 places in 119 ms of which 1 ms to minimize.
[2024-05-29 10:11:57] [INFO ] Deduced a trap composed of 6 places in 115 ms of which 7 ms to minimize.
[2024-05-29 10:11:57] [INFO ] Deduced a trap composed of 7 places in 125 ms of which 0 ms to minimize.
[2024-05-29 10:11:57] [INFO ] Trap strengthening (SAT) tested/added 20/19 trap constraints in 3834 ms
[2024-05-29 10:11:57] [INFO ] Deduced a trap composed of 4 places in 298 ms of which 2 ms to minimize.
[2024-05-29 10:11:58] [INFO ] Deduced a trap composed of 4 places in 186 ms of which 2 ms to minimize.
[2024-05-29 10:11:58] [INFO ] Deduced a trap composed of 6 places in 221 ms of which 0 ms to minimize.
[2024-05-29 10:11:58] [INFO ] Deduced a trap composed of 5 places in 239 ms of which 8 ms to minimize.
[2024-05-29 10:11:58] [INFO ] Deduced a trap composed of 7 places in 232 ms of which 0 ms to minimize.
[2024-05-29 10:11:59] [INFO ] Deduced a trap composed of 10 places in 203 ms of which 1 ms to minimize.
[2024-05-29 10:11:59] [INFO ] Deduced a trap composed of 8 places in 208 ms of which 1 ms to minimize.
[2024-05-29 10:11:59] [INFO ] Deduced a trap composed of 15 places in 219 ms of which 1 ms to minimize.
[2024-05-29 10:11:59] [INFO ] Deduced a trap composed of 25 places in 207 ms of which 1 ms to minimize.
[2024-05-29 10:12:00] [INFO ] Deduced a trap composed of 5 places in 193 ms of which 1 ms to minimize.
[2024-05-29 10:12:00] [INFO ] Deduced a trap composed of 24 places in 176 ms of which 1 ms to minimize.
[2024-05-29 10:12:00] [INFO ] Deduced a trap composed of 24 places in 174 ms of which 1 ms to minimize.
[2024-05-29 10:12:00] [INFO ] Deduced a trap composed of 32 places in 159 ms of which 0 ms to minimize.
[2024-05-29 10:12:01] [INFO ] Deduced a trap composed of 32 places in 153 ms of which 0 ms to minimize.
[2024-05-29 10:12:01] [INFO ] Deduced a trap composed of 37 places in 162 ms of which 0 ms to minimize.
[2024-05-29 10:12:01] [INFO ] Deduced a trap composed of 37 places in 164 ms of which 0 ms to minimize.
[2024-05-29 10:12:01] [INFO ] Trap strengthening (SAT) tested/added 17/16 trap constraints in 4121 ms
[2024-05-29 10:12:01] [INFO ] Deduced a trap composed of 7 places in 169 ms of which 2 ms to minimize.
[2024-05-29 10:12:02] [INFO ] Deduced a trap composed of 6 places in 188 ms of which 0 ms to minimize.
[2024-05-29 10:12:02] [INFO ] Deduced a trap composed of 6 places in 181 ms of which 1 ms to minimize.
[2024-05-29 10:12:02] [INFO ] Deduced a trap composed of 19 places in 171 ms of which 1 ms to minimize.
[2024-05-29 10:12:02] [INFO ] Deduced a trap composed of 7 places in 150 ms of which 0 ms to minimize.
[2024-05-29 10:12:02] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1163 ms
[2024-05-29 10:12:03] [INFO ] Deduced a trap composed of 6 places in 154 ms of which 1 ms to minimize.
[2024-05-29 10:12:03] [INFO ] Deduced a trap composed of 6 places in 167 ms of which 1 ms to minimize.
[2024-05-29 10:12:03] [INFO ] Deduced a trap composed of 5 places in 169 ms of which 1 ms to minimize.
[2024-05-29 10:12:03] [INFO ] Deduced a trap composed of 6 places in 163 ms of which 1 ms to minimize.
[2024-05-29 10:12:03] [INFO ] Deduced a trap composed of 5 places in 122 ms of which 0 ms to minimize.
[2024-05-29 10:12:04] [INFO ] Deduced a trap composed of 10 places in 124 ms of which 0 ms to minimize.
[2024-05-29 10:12:04] [INFO ] Deduced a trap composed of 6 places in 117 ms of which 1 ms to minimize.
[2024-05-29 10:12:04] [INFO ] Deduced a trap composed of 7 places in 119 ms of which 0 ms to minimize.
[2024-05-29 10:12:04] [INFO ] Deduced a trap composed of 9 places in 117 ms of which 0 ms to minimize.
[2024-05-29 10:12:04] [INFO ] Deduced a trap composed of 5 places in 111 ms of which 0 ms to minimize.
[2024-05-29 10:12:04] [INFO ] Deduced a trap composed of 8 places in 134 ms of which 1 ms to minimize.
[2024-05-29 10:12:05] [INFO ] Deduced a trap composed of 18 places in 127 ms of which 0 ms to minimize.
[2024-05-29 10:12:05] [INFO ] Deduced a trap composed of 11 places in 117 ms of which 0 ms to minimize.
[2024-05-29 10:12:05] [INFO ] Deduced a trap composed of 13 places in 106 ms of which 1 ms to minimize.
[2024-05-29 10:12:05] [INFO ] Deduced a trap composed of 9 places in 118 ms of which 1 ms to minimize.
[2024-05-29 10:12:05] [INFO ] Deduced a trap composed of 8 places in 102 ms of which 0 ms to minimize.
[2024-05-29 10:12:05] [INFO ] Deduced a trap composed of 7 places in 103 ms of which 1 ms to minimize.
[2024-05-29 10:12:06] [INFO ] Deduced a trap composed of 7 places in 123 ms of which 1 ms to minimize.
[2024-05-29 10:12:06] [INFO ] Deduced a trap composed of 12 places in 98 ms of which 0 ms to minimize.
[2024-05-29 10:12:06] [INFO ] Trap strengthening (SAT) tested/added 20/19 trap constraints in 3461 ms
[2024-05-29 10:12:06] [INFO ] After 19909ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :4
Attempting to minimize the solution found.
Minimization took 724 ms.
[2024-05-29 10:12:07] [INFO ] After 21124ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :4
FORMULA ShieldPPPs-PT-040B-ReachabilityFireability-2024-04 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 5 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 153 ms.
Support contains 148 out of 1399 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1399/1399 places, 1199/1199 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 1399 transition count 1195
Reduce places removed 4 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 5 rules applied. Total rules applied 9 place count 1395 transition count 1194
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 10 place count 1394 transition count 1194
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 10 place count 1394 transition count 1188
Deduced a syphon composed of 6 places in 2 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 22 place count 1388 transition count 1188
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Deduced a syphon composed of 13 places in 3 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 3 with 26 rules applied. Total rules applied 48 place count 1375 transition count 1175
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 50 place count 1375 transition count 1175
Reduce places removed 5 places and 5 transitions.
Iterating global reduction 3 with 5 rules applied. Total rules applied 55 place count 1370 transition count 1170
Applied a total of 55 rules in 207 ms. Remains 1370 /1399 variables (removed 29) and now considering 1170/1199 (removed 29) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 207 ms. Remains : 1370/1399 places, 1170/1199 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 344 ms. (steps per millisecond=29 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 91 ms. (steps per millisecond=109 ) properties (out of 4) 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 4) 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 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 96641 steps, run timeout after 3001 ms. (steps per millisecond=32 ) properties seen :{}
Probabilistic random walk after 96641 steps, saw 64983 distinct states, run finished after 3002 ms. (steps per millisecond=32 ) properties seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 1170 rows 1370 cols
[2024-05-29 10:12:11] [INFO ] Computed 441 invariants in 20 ms
[2024-05-29 10:12:11] [INFO ] After 260ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-29 10:12:11] [INFO ] [Nat]Absence check using 424 positive place invariants in 77 ms returned sat
[2024-05-29 10:12:11] [INFO ] [Nat]Absence check using 424 positive and 17 generalized place invariants in 3 ms returned sat
[2024-05-29 10:12:13] [INFO ] After 1119ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-05-29 10:12:13] [INFO ] Deduced a trap composed of 4 places in 163 ms of which 0 ms to minimize.
[2024-05-29 10:12:13] [INFO ] Deduced a trap composed of 6 places in 165 ms of which 1 ms to minimize.
[2024-05-29 10:12:13] [INFO ] Deduced a trap composed of 5 places in 157 ms of which 0 ms to minimize.
[2024-05-29 10:12:14] [INFO ] Deduced a trap composed of 4 places in 157 ms of which 1 ms to minimize.
[2024-05-29 10:12:14] [INFO ] Deduced a trap composed of 5 places in 150 ms of which 0 ms to minimize.
[2024-05-29 10:12:14] [INFO ] Deduced a trap composed of 4 places in 152 ms of which 1 ms to minimize.
[2024-05-29 10:12:14] [INFO ] Deduced a trap composed of 5 places in 115 ms of which 1 ms to minimize.
[2024-05-29 10:12:14] [INFO ] Deduced a trap composed of 5 places in 115 ms of which 0 ms to minimize.
[2024-05-29 10:12:15] [INFO ] Deduced a trap composed of 7 places in 111 ms of which 1 ms to minimize.
[2024-05-29 10:12:15] [INFO ] Deduced a trap composed of 7 places in 104 ms of which 0 ms to minimize.
[2024-05-29 10:12:15] [INFO ] Deduced a trap composed of 9 places in 107 ms of which 0 ms to minimize.
[2024-05-29 10:12:15] [INFO ] Deduced a trap composed of 7 places in 106 ms of which 1 ms to minimize.
[2024-05-29 10:12:15] [INFO ] Deduced a trap composed of 9 places in 107 ms of which 0 ms to minimize.
[2024-05-29 10:12:15] [INFO ] Deduced a trap composed of 6 places in 101 ms of which 0 ms to minimize.
[2024-05-29 10:12:16] [INFO ] Deduced a trap composed of 6 places in 104 ms of which 0 ms to minimize.
[2024-05-29 10:12:16] [INFO ] Deduced a trap composed of 8 places in 101 ms of which 1 ms to minimize.
[2024-05-29 10:12:16] [INFO ] Deduced a trap composed of 7 places in 101 ms of which 1 ms to minimize.
[2024-05-29 10:12:16] [INFO ] Deduced a trap composed of 7 places in 115 ms of which 0 ms to minimize.
[2024-05-29 10:12:16] [INFO ] Deduced a trap composed of 6 places in 105 ms of which 0 ms to minimize.
[2024-05-29 10:12:17] [INFO ] Deduced a trap composed of 4 places in 134 ms of which 0 ms to minimize.
[2024-05-29 10:12:17] [INFO ] Deduced a trap composed of 4 places in 123 ms of which 0 ms to minimize.
[2024-05-29 10:12:17] [INFO ] Deduced a trap composed of 6 places in 117 ms of which 1 ms to minimize.
[2024-05-29 10:12:17] [INFO ] Deduced a trap composed of 6 places in 119 ms of which 0 ms to minimize.
[2024-05-29 10:12:17] [INFO ] Deduced a trap composed of 5 places in 143 ms of which 0 ms to minimize.
[2024-05-29 10:12:17] [INFO ] Deduced a trap composed of 8 places in 105 ms of which 1 ms to minimize.
[2024-05-29 10:12:18] [INFO ] Deduced a trap composed of 19 places in 93 ms of which 1 ms to minimize.
[2024-05-29 10:12:18] [INFO ] Deduced a trap composed of 10 places in 94 ms of which 1 ms to minimize.
[2024-05-29 10:12:18] [INFO ] Deduced a trap composed of 5 places in 107 ms of which 0 ms to minimize.
[2024-05-29 10:12:18] [INFO ] Deduced a trap composed of 11 places in 110 ms of which 0 ms to minimize.
[2024-05-29 10:12:18] [INFO ] Deduced a trap composed of 6 places in 120 ms of which 1 ms to minimize.
[2024-05-29 10:12:18] [INFO ] Trap strengthening (SAT) tested/added 31/30 trap constraints in 5568 ms
[2024-05-29 10:12:19] [INFO ] Deduced a trap composed of 4 places in 221 ms of which 0 ms to minimize.
[2024-05-29 10:12:19] [INFO ] Deduced a trap composed of 6 places in 221 ms of which 0 ms to minimize.
[2024-05-29 10:12:19] [INFO ] Deduced a trap composed of 5 places in 235 ms of which 0 ms to minimize.
[2024-05-29 10:12:20] [INFO ] Deduced a trap composed of 5 places in 210 ms of which 0 ms to minimize.
[2024-05-29 10:12:20] [INFO ] Deduced a trap composed of 5 places in 247 ms of which 1 ms to minimize.
[2024-05-29 10:12:20] [INFO ] Deduced a trap composed of 6 places in 219 ms of which 2 ms to minimize.
[2024-05-29 10:12:20] [INFO ] Deduced a trap composed of 6 places in 219 ms of which 1 ms to minimize.
[2024-05-29 10:12:21] [INFO ] Deduced a trap composed of 4 places in 221 ms of which 1 ms to minimize.
[2024-05-29 10:12:21] [INFO ] Deduced a trap composed of 4 places in 213 ms of which 1 ms to minimize.
[2024-05-29 10:12:21] [INFO ] Deduced a trap composed of 5 places in 193 ms of which 1 ms to minimize.
[2024-05-29 10:12:21] [INFO ] Deduced a trap composed of 8 places in 178 ms of which 1 ms to minimize.
[2024-05-29 10:12:22] [INFO ] Deduced a trap composed of 6 places in 157 ms of which 1 ms to minimize.
[2024-05-29 10:12:22] [INFO ] Deduced a trap composed of 10 places in 157 ms of which 0 ms to minimize.
[2024-05-29 10:12:22] [INFO ] Deduced a trap composed of 6 places in 157 ms of which 0 ms to minimize.
[2024-05-29 10:12:22] [INFO ] Deduced a trap composed of 7 places in 159 ms of which 0 ms to minimize.
[2024-05-29 10:12:22] [INFO ] Trap strengthening (SAT) tested/added 16/15 trap constraints in 3835 ms
[2024-05-29 10:12:23] [INFO ] Deduced a trap composed of 17 places in 185 ms of which 0 ms to minimize.
[2024-05-29 10:12:23] [INFO ] Deduced a trap composed of 5 places in 197 ms of which 1 ms to minimize.
[2024-05-29 10:12:23] [INFO ] Deduced a trap composed of 8 places in 185 ms of which 0 ms to minimize.
[2024-05-29 10:12:23] [INFO ] Deduced a trap composed of 20 places in 165 ms of which 1 ms to minimize.
[2024-05-29 10:12:24] [INFO ] Deduced a trap composed of 11 places in 160 ms of which 1 ms to minimize.
[2024-05-29 10:12:24] [INFO ] Deduced a trap composed of 17 places in 174 ms of which 0 ms to minimize.
[2024-05-29 10:12:24] [INFO ] Deduced a trap composed of 24 places in 179 ms of which 1 ms to minimize.
[2024-05-29 10:12:24] [INFO ] Deduced a trap composed of 13 places in 168 ms of which 0 ms to minimize.
[2024-05-29 10:12:24] [INFO ] Deduced a trap composed of 7 places in 173 ms of which 0 ms to minimize.
[2024-05-29 10:12:25] [INFO ] Deduced a trap composed of 6 places in 166 ms of which 1 ms to minimize.
[2024-05-29 10:12:25] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 2322 ms
[2024-05-29 10:12:25] [INFO ] Deduced a trap composed of 7 places in 161 ms of which 1 ms to minimize.
[2024-05-29 10:12:25] [INFO ] Deduced a trap composed of 5 places in 152 ms of which 1 ms to minimize.
[2024-05-29 10:12:26] [INFO ] Deduced a trap composed of 5 places in 175 ms of which 0 ms to minimize.
[2024-05-29 10:12:26] [INFO ] Deduced a trap composed of 5 places in 187 ms of which 1 ms to minimize.
[2024-05-29 10:12:26] [INFO ] Deduced a trap composed of 4 places in 183 ms of which 0 ms to minimize.
[2024-05-29 10:12:26] [INFO ] Deduced a trap composed of 14 places in 175 ms of which 1 ms to minimize.
[2024-05-29 10:12:27] [INFO ] Deduced a trap composed of 8 places in 179 ms of which 1 ms to minimize.
[2024-05-29 10:12:27] [INFO ] Deduced a trap composed of 5 places in 171 ms of which 0 ms to minimize.
[2024-05-29 10:12:27] [INFO ] Deduced a trap composed of 5 places in 167 ms of which 0 ms to minimize.
[2024-05-29 10:12:27] [INFO ] Deduced a trap composed of 22 places in 159 ms of which 1 ms to minimize.
[2024-05-29 10:12:27] [INFO ] Deduced a trap composed of 5 places in 159 ms of which 0 ms to minimize.
[2024-05-29 10:12:28] [INFO ] Deduced a trap composed of 11 places in 164 ms of which 0 ms to minimize.
[2024-05-29 10:12:28] [INFO ] Deduced a trap composed of 8 places in 159 ms of which 1 ms to minimize.
[2024-05-29 10:12:28] [INFO ] Deduced a trap composed of 11 places in 159 ms of which 1 ms to minimize.
[2024-05-29 10:12:28] [INFO ] Deduced a trap composed of 22 places in 153 ms of which 0 ms to minimize.
[2024-05-29 10:12:28] [INFO ] Deduced a trap composed of 8 places in 121 ms of which 0 ms to minimize.
[2024-05-29 10:12:29] [INFO ] Deduced a trap composed of 7 places in 125 ms of which 0 ms to minimize.
[2024-05-29 10:12:29] [INFO ] Deduced a trap composed of 21 places in 99 ms of which 0 ms to minimize.
[2024-05-29 10:12:29] [INFO ] Deduced a trap composed of 18 places in 84 ms of which 1 ms to minimize.
[2024-05-29 10:12:29] [INFO ] Deduced a trap composed of 4 places in 86 ms of which 0 ms to minimize.
[2024-05-29 10:12:29] [INFO ] Deduced a trap composed of 13 places in 76 ms of which 1 ms to minimize.
[2024-05-29 10:12:29] [INFO ] Deduced a trap composed of 11 places in 70 ms of which 0 ms to minimize.
[2024-05-29 10:12:29] [INFO ] Deduced a trap composed of 11 places in 68 ms of which 1 ms to minimize.
[2024-05-29 10:12:29] [INFO ] Trap strengthening (SAT) tested/added 24/23 trap constraints in 4486 ms
[2024-05-29 10:12:29] [INFO ] After 18057ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 980 ms.
[2024-05-29 10:12:30] [INFO ] After 19472ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 97 ms.
Support contains 148 out of 1370 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1370/1370 places, 1170/1170 transitions.
Applied a total of 0 rules in 45 ms. Remains 1370 /1370 variables (removed 0) and now considering 1170/1170 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 45 ms. Remains : 1370/1370 places, 1170/1170 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1370/1370 places, 1170/1170 transitions.
Applied a total of 0 rules in 42 ms. Remains 1370 /1370 variables (removed 0) and now considering 1170/1170 (removed 0) transitions.
[2024-05-29 10:12:31] [INFO ] Invariant cache hit.
[2024-05-29 10:12:31] [INFO ] Implicit Places using invariants in 732 ms returned []
[2024-05-29 10:12:31] [INFO ] Invariant cache hit.
[2024-05-29 10:12:33] [INFO ] Implicit Places using invariants and state equation in 1756 ms returned []
Implicit Place search using SMT with State Equation took 2490 ms to find 0 implicit places.
[2024-05-29 10:12:33] [INFO ] Redundant transitions in 70 ms returned []
[2024-05-29 10:12:33] [INFO ] Invariant cache hit.
[2024-05-29 10:12:34] [INFO ] Dead Transitions using invariants and state equation in 724 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3333 ms. Remains : 1370/1370 places, 1170/1170 transitions.
Applied a total of 0 rules in 49 ms. Remains 1370 /1370 variables (removed 0) and now considering 1170/1170 (removed 0) transitions.
Running SMT prover for 4 properties.
[2024-05-29 10:12:34] [INFO ] Invariant cache hit.
[2024-05-29 10:12:34] [INFO ] After 279ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-29 10:12:35] [INFO ] [Nat]Absence check using 424 positive place invariants in 85 ms returned sat
[2024-05-29 10:12:35] [INFO ] [Nat]Absence check using 424 positive and 17 generalized place invariants in 3 ms returned sat
[2024-05-29 10:12:36] [INFO ] After 1145ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-05-29 10:12:36] [INFO ] Deduced a trap composed of 7 places in 223 ms of which 0 ms to minimize.
[2024-05-29 10:12:37] [INFO ] Deduced a trap composed of 4 places in 201 ms of which 1 ms to minimize.
[2024-05-29 10:12:37] [INFO ] Deduced a trap composed of 8 places in 188 ms of which 1 ms to minimize.
[2024-05-29 10:12:37] [INFO ] Deduced a trap composed of 5 places in 171 ms of which 1 ms to minimize.
[2024-05-29 10:12:37] [INFO ] Deduced a trap composed of 5 places in 181 ms of which 0 ms to minimize.
[2024-05-29 10:12:38] [INFO ] Deduced a trap composed of 6 places in 181 ms of which 0 ms to minimize.
[2024-05-29 10:12:38] [INFO ] Deduced a trap composed of 6 places in 147 ms of which 1 ms to minimize.
[2024-05-29 10:12:38] [INFO ] Deduced a trap composed of 8 places in 151 ms of which 0 ms to minimize.
[2024-05-29 10:12:38] [INFO ] Deduced a trap composed of 4 places in 122 ms of which 1 ms to minimize.
[2024-05-29 10:12:39] [INFO ] Deduced a trap composed of 5 places in 131 ms of which 0 ms to minimize.
[2024-05-29 10:12:39] [INFO ] Deduced a trap composed of 5 places in 131 ms of which 1 ms to minimize.
[2024-05-29 10:12:39] [INFO ] Deduced a trap composed of 8 places in 111 ms of which 0 ms to minimize.
[2024-05-29 10:12:39] [INFO ] Deduced a trap composed of 7 places in 109 ms of which 1 ms to minimize.
[2024-05-29 10:12:39] [INFO ] Deduced a trap composed of 6 places in 112 ms of which 1 ms to minimize.
[2024-05-29 10:12:39] [INFO ] Deduced a trap composed of 6 places in 123 ms of which 1 ms to minimize.
[2024-05-29 10:12:40] [INFO ] Deduced a trap composed of 6 places in 124 ms of which 0 ms to minimize.
[2024-05-29 10:12:40] [INFO ] Deduced a trap composed of 8 places in 114 ms of which 1 ms to minimize.
[2024-05-29 10:12:40] [INFO ] Deduced a trap composed of 5 places in 101 ms of which 1 ms to minimize.
[2024-05-29 10:12:40] [INFO ] Deduced a trap composed of 7 places in 97 ms of which 0 ms to minimize.
[2024-05-29 10:12:40] [INFO ] Deduced a trap composed of 5 places in 100 ms of which 1 ms to minimize.
[2024-05-29 10:12:40] [INFO ] Deduced a trap composed of 6 places in 98 ms of which 0 ms to minimize.
[2024-05-29 10:12:41] [INFO ] Deduced a trap composed of 6 places in 84 ms of which 0 ms to minimize.
[2024-05-29 10:12:41] [INFO ] Deduced a trap composed of 4 places in 82 ms of which 0 ms to minimize.
[2024-05-29 10:12:41] [INFO ] Deduced a trap composed of 3 places in 81 ms of which 0 ms to minimize.
[2024-05-29 10:12:41] [INFO ] Deduced a trap composed of 8 places in 80 ms of which 1 ms to minimize.
[2024-05-29 10:12:41] [INFO ] Deduced a trap composed of 10 places in 78 ms of which 0 ms to minimize.
[2024-05-29 10:12:41] [INFO ] Deduced a trap composed of 11 places in 79 ms of which 0 ms to minimize.
[2024-05-29 10:12:41] [INFO ] Deduced a trap composed of 10 places in 79 ms of which 0 ms to minimize.
[2024-05-29 10:12:42] [INFO ] Deduced a trap composed of 11 places in 69 ms of which 0 ms to minimize.
[2024-05-29 10:12:42] [INFO ] Deduced a trap composed of 17 places in 68 ms of which 1 ms to minimize.
[2024-05-29 10:12:42] [INFO ] Trap strengthening (SAT) tested/added 31/30 trap constraints in 5513 ms
[2024-05-29 10:12:42] [INFO ] Deduced a trap composed of 4 places in 294 ms of which 0 ms to minimize.
[2024-05-29 10:12:42] [INFO ] Deduced a trap composed of 5 places in 291 ms of which 1 ms to minimize.
[2024-05-29 10:12:43] [INFO ] Deduced a trap composed of 7 places in 220 ms of which 1 ms to minimize.
[2024-05-29 10:12:43] [INFO ] Deduced a trap composed of 5 places in 232 ms of which 1 ms to minimize.
[2024-05-29 10:12:43] [INFO ] Deduced a trap composed of 5 places in 221 ms of which 1 ms to minimize.
[2024-05-29 10:12:44] [INFO ] Deduced a trap composed of 6 places in 223 ms of which 0 ms to minimize.
[2024-05-29 10:12:44] [INFO ] Deduced a trap composed of 6 places in 236 ms of which 1 ms to minimize.
[2024-05-29 10:12:44] [INFO ] Deduced a trap composed of 7 places in 222 ms of which 0 ms to minimize.
[2024-05-29 10:12:44] [INFO ] Deduced a trap composed of 7 places in 238 ms of which 1 ms to minimize.
[2024-05-29 10:12:45] [INFO ] Deduced a trap composed of 6 places in 219 ms of which 1 ms to minimize.
[2024-05-29 10:12:45] [INFO ] Deduced a trap composed of 6 places in 217 ms of which 1 ms to minimize.
[2024-05-29 10:12:45] [INFO ] Deduced a trap composed of 5 places in 217 ms of which 1 ms to minimize.
[2024-05-29 10:12:45] [INFO ] Deduced a trap composed of 8 places in 231 ms of which 1 ms to minimize.
[2024-05-29 10:12:46] [INFO ] Deduced a trap composed of 4 places in 219 ms of which 1 ms to minimize.
[2024-05-29 10:12:46] [INFO ] Deduced a trap composed of 7 places in 211 ms of which 0 ms to minimize.
[2024-05-29 10:12:46] [INFO ] Deduced a trap composed of 5 places in 208 ms of which 1 ms to minimize.
[2024-05-29 10:12:47] [INFO ] Deduced a trap composed of 7 places in 204 ms of which 2 ms to minimize.
[2024-05-29 10:12:47] [INFO ] Deduced a trap composed of 21 places in 199 ms of which 1 ms to minimize.
[2024-05-29 10:12:47] [INFO ] Deduced a trap composed of 7 places in 197 ms of which 1 ms to minimize.
[2024-05-29 10:12:47] [INFO ] Deduced a trap composed of 3 places in 188 ms of which 1 ms to minimize.
[2024-05-29 10:12:48] [INFO ] Deduced a trap composed of 17 places in 199 ms of which 1 ms to minimize.
[2024-05-29 10:12:48] [INFO ] Deduced a trap composed of 4 places in 198 ms of which 1 ms to minimize.
[2024-05-29 10:12:48] [INFO ] Deduced a trap composed of 9 places in 198 ms of which 1 ms to minimize.
[2024-05-29 10:12:48] [INFO ] Deduced a trap composed of 19 places in 211 ms of which 0 ms to minimize.
[2024-05-29 10:12:49] [INFO ] Deduced a trap composed of 18 places in 183 ms of which 0 ms to minimize.
[2024-05-29 10:12:49] [INFO ] Deduced a trap composed of 14 places in 154 ms of which 1 ms to minimize.
[2024-05-29 10:12:49] [INFO ] Trap strengthening (SAT) tested/added 27/26 trap constraints in 7019 ms
[2024-05-29 10:12:49] [INFO ] Deduced a trap composed of 5 places in 224 ms of which 1 ms to minimize.
[2024-05-29 10:12:49] [INFO ] Deduced a trap composed of 8 places in 235 ms of which 1 ms to minimize.
[2024-05-29 10:12:50] [INFO ] Deduced a trap composed of 8 places in 227 ms of which 1 ms to minimize.
[2024-05-29 10:12:50] [INFO ] Deduced a trap composed of 5 places in 222 ms of which 1 ms to minimize.
[2024-05-29 10:12:50] [INFO ] Deduced a trap composed of 9 places in 205 ms of which 1 ms to minimize.
[2024-05-29 10:12:50] [INFO ] Deduced a trap composed of 8 places in 212 ms of which 1 ms to minimize.
[2024-05-29 10:12:51] [INFO ] Deduced a trap composed of 8 places in 212 ms of which 0 ms to minimize.
[2024-05-29 10:12:51] [INFO ] Deduced a trap composed of 11 places in 193 ms of which 1 ms to minimize.
[2024-05-29 10:12:51] [INFO ] Deduced a trap composed of 4 places in 189 ms of which 1 ms to minimize.
[2024-05-29 10:12:51] [INFO ] Deduced a trap composed of 5 places in 190 ms of which 0 ms to minimize.
[2024-05-29 10:12:52] [INFO ] Deduced a trap composed of 7 places in 197 ms of which 0 ms to minimize.
[2024-05-29 10:12:52] [INFO ] Deduced a trap composed of 7 places in 185 ms of which 0 ms to minimize.
[2024-05-29 10:12:52] [INFO ] Deduced a trap composed of 18 places in 183 ms of which 1 ms to minimize.
[2024-05-29 10:12:52] [INFO ] Deduced a trap composed of 6 places in 182 ms of which 1 ms to minimize.
[2024-05-29 10:12:53] [INFO ] Deduced a trap composed of 20 places in 181 ms of which 7 ms to minimize.
[2024-05-29 10:12:53] [INFO ] Deduced a trap composed of 6 places in 168 ms of which 0 ms to minimize.
[2024-05-29 10:12:53] [INFO ] Deduced a trap composed of 8 places in 187 ms of which 1 ms to minimize.
[2024-05-29 10:12:53] [INFO ] Deduced a trap composed of 24 places in 187 ms of which 1 ms to minimize.
[2024-05-29 10:12:54] [INFO ] Deduced a trap composed of 28 places in 192 ms of which 1 ms to minimize.
[2024-05-29 10:12:54] [INFO ] Deduced a trap composed of 4 places in 172 ms of which 1 ms to minimize.
[2024-05-29 10:12:54] [INFO ] Deduced a trap composed of 14 places in 177 ms of which 1 ms to minimize.
[2024-05-29 10:12:54] [INFO ] Deduced a trap composed of 6 places in 171 ms of which 1 ms to minimize.
[2024-05-29 10:12:54] [INFO ] Deduced a trap composed of 6 places in 156 ms of which 0 ms to minimize.
[2024-05-29 10:12:55] [INFO ] Deduced a trap composed of 4 places in 155 ms of which 1 ms to minimize.
[2024-05-29 10:12:55] [INFO ] Trap strengthening (SAT) tested/added 25/24 trap constraints in 5811 ms
[2024-05-29 10:12:55] [INFO ] Deduced a trap composed of 4 places in 193 ms of which 1 ms to minimize.
[2024-05-29 10:12:55] [INFO ] Deduced a trap composed of 5 places in 160 ms of which 1 ms to minimize.
[2024-05-29 10:12:56] [INFO ] Deduced a trap composed of 8 places in 146 ms of which 1 ms to minimize.
[2024-05-29 10:12:56] [INFO ] Deduced a trap composed of 8 places in 160 ms of which 0 ms to minimize.
[2024-05-29 10:12:56] [INFO ] Deduced a trap composed of 4 places in 145 ms of which 0 ms to minimize.
[2024-05-29 10:12:56] [INFO ] Deduced a trap composed of 9 places in 147 ms of which 0 ms to minimize.
[2024-05-29 10:12:56] [INFO ] Deduced a trap composed of 13 places in 143 ms of which 0 ms to minimize.
[2024-05-29 10:12:57] [INFO ] Deduced a trap composed of 7 places in 125 ms of which 0 ms to minimize.
[2024-05-29 10:12:57] [INFO ] Deduced a trap composed of 19 places in 130 ms of which 0 ms to minimize.
[2024-05-29 10:12:57] [INFO ] Deduced a trap composed of 7 places in 138 ms of which 0 ms to minimize.
[2024-05-29 10:12:57] [INFO ] Deduced a trap composed of 3 places in 139 ms of which 1 ms to minimize.
[2024-05-29 10:12:57] [INFO ] Deduced a trap composed of 7 places in 133 ms of which 0 ms to minimize.
[2024-05-29 10:12:58] [INFO ] Deduced a trap composed of 12 places in 133 ms of which 0 ms to minimize.
[2024-05-29 10:12:58] [INFO ] Deduced a trap composed of 18 places in 120 ms of which 0 ms to minimize.
[2024-05-29 10:12:58] [INFO ] Deduced a trap composed of 8 places in 111 ms of which 0 ms to minimize.
[2024-05-29 10:12:58] [INFO ] Deduced a trap composed of 11 places in 114 ms of which 1 ms to minimize.
[2024-05-29 10:12:58] [INFO ] Deduced a trap composed of 8 places in 110 ms of which 1 ms to minimize.
[2024-05-29 10:12:59] [INFO ] Deduced a trap composed of 8 places in 105 ms of which 1 ms to minimize.
[2024-05-29 10:12:59] [INFO ] Deduced a trap composed of 8 places in 107 ms of which 1 ms to minimize.
[2024-05-29 10:12:59] [INFO ] Deduced a trap composed of 15 places in 108 ms of which 1 ms to minimize.
[2024-05-29 10:12:59] [INFO ] Deduced a trap composed of 11 places in 83 ms of which 0 ms to minimize.
[2024-05-29 10:12:59] [INFO ] Trap strengthening (SAT) tested/added 22/21 trap constraints in 4153 ms
[2024-05-29 10:12:59] [INFO ] After 24368ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 690 ms.
[2024-05-29 10:13:00] [INFO ] After 25502ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
[2024-05-29 10:13:00] [INFO ] Export to MCC of 4 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 6 ms.
[2024-05-29 10:13:00] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1370 places, 1170 transitions and 4779 arcs took 7 ms.
[2024-05-29 10:13:00] [INFO ] Flatten gal took : 142 ms
Total runtime 104969 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/370
ReachabilityFireability

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

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

FORMULA ShieldPPPs-PT-040B-ReachabilityFireability-2024-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

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

BK_STOP 1716977585113

--------------------
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.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /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/370/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/370/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/370/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: Created skeleton in 0.000000 secs.
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: 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 # 23 (type EXCL) for 6 ShieldPPPs-PT-040B-ReachabilityFireability-2024-14
lola: time limit : 899 sec
lola: memory limit: 32 pages
lola: LAUNCH task # 13 (type FNDP) for 6 ShieldPPPs-PT-040B-ReachabilityFireability-2024-14
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 14 (type EQUN) for 6 ShieldPPPs-PT-040B-ReachabilityFireability-2024-14
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 22 (type SRCH) for 6 ShieldPPPs-PT-040B-ReachabilityFireability-2024-14
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: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: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 # 13 (type FNDP) for ShieldPPPs-PT-040B-ReachabilityFireability-2024-14
lola: result : true
lola: fired transitions : 95
lola: tried executions : 1
lola: time used : 0.000000
lola: memory pages used : 0
lola: CANCELED task # 14 (type EQUN) for ShieldPPPs-PT-040B-ReachabilityFireability-2024-14 (obsolete)
lola: CANCELED task # 22 (type SRCH) for ShieldPPPs-PT-040B-ReachabilityFireability-2024-14 (obsolete)
lola: CANCELED task # 23 (type EXCL) for ShieldPPPs-PT-040B-ReachabilityFireability-2024-14 (obsolete)
lola: LAUNCH task # 21 (type EXCL) for 3 ShieldPPPs-PT-040B-ReachabilityFireability-2024-10
lola: time limit : 1199 sec
lola: memory limit: 32 pages
lola: LAUNCH task # 33 (type FNDP) for 0 ShieldPPPs-PT-040B-ReachabilityFireability-2024-05
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 34 (type EQUN) for 0 ShieldPPPs-PT-040B-ReachabilityFireability-2024-05
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 36 (type SRCH) for 0 ShieldPPPs-PT-040B-ReachabilityFireability-2024-05
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 # 33 (type FNDP) for ShieldPPPs-PT-040B-ReachabilityFireability-2024-05
lola: result : true
lola: fired transitions : 194
lola: tried executions : 1
lola: time used : 1.000000
lola: memory pages used : 0
lola: CANCELED task # 34 (type EQUN) for ShieldPPPs-PT-040B-ReachabilityFireability-2024-05 (obsolete)
lola: CANCELED task # 36 (type SRCH) for ShieldPPPs-PT-040B-ReachabilityFireability-2024-05 (obsolete)
lola: LAUNCH task # 26 (type FNDP) for 9 ShieldPPPs-PT-040B-ReachabilityFireability-2024-15
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 27 (type EQUN) for 9 ShieldPPPs-PT-040B-ReachabilityFireability-2024-15
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 29 (type SRCH) for 9 ShieldPPPs-PT-040B-ReachabilityFireability-2024-15
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: FINISHED task # 26 (type FNDP) for ShieldPPPs-PT-040B-ReachabilityFireability-2024-15
lola: result : true
lola: fired transitions : 140
lola: tried executions : 1
lola: time used : 0.000000
lola: memory pages used : 0
lola: CANCELED task # 27 (type EQUN) for ShieldPPPs-PT-040B-ReachabilityFireability-2024-15 (obsolete)
lola: CANCELED task # 29 (type SRCH) for ShieldPPPs-PT-040B-ReachabilityFireability-2024-15 (obsolete)
lola: LAUNCH task # 16 (type FNDP) for 3 ShieldPPPs-PT-040B-ReachabilityFireability-2024-10
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 17 (type EQUN) for 3 ShieldPPPs-PT-040B-ReachabilityFireability-2024-10
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 20 (type SRCH) for 3 ShieldPPPs-PT-040B-ReachabilityFireability-2024-10
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
sara: try reading problem file /home/mcc/execution/370/ReachabilityFireability-14.sara.
lola: FINISHED task # 20 (type SRCH) for ShieldPPPs-PT-040B-ReachabilityFireability-2024-10
lola: result : true
lola: markings : 103
lola: fired transitions : 102
lola: time used : 0.000000
lola: memory pages used : 1
lola: CANCELED task # 16 (type FNDP) for ShieldPPPs-PT-040B-ReachabilityFireability-2024-10 (obsolete)
lola: CANCELED task # 17 (type EQUN) for ShieldPPPs-PT-040B-ReachabilityFireability-2024-10 (obsolete)
lola: CANCELED task # 21 (type EXCL) for ShieldPPPs-PT-040B-ReachabilityFireability-2024-10 (obsolete)
lola: Portfolio finished: no open formulas

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldPPPs-PT-040B-ReachabilityFireability-2024-05: AG false findpath
ShieldPPPs-PT-040B-ReachabilityFireability-2024-10: AG false tandem / insertion
ShieldPPPs-PT-040B-ReachabilityFireability-2024-14: AG false findpath
ShieldPPPs-PT-040B-ReachabilityFireability-2024-15: EF true findpath


Time elapsed: 4 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="gold2023"
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-5568"
echo " Executing tool gold2023"
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 r373-tall-171683789000310"
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 ;