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-171683788500090.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 ShieldIIPs-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-171683788500090
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.2M
-rw-r--r-- 1 mcc users 7.9K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 86K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 55K 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.2K May 19 07:15 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K May 19 16:31 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 19 07:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 19:03 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 11 14:25 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 137K Apr 11 14:25 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.8K Apr 11 14:24 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 75K Apr 11 14:24 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:52 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:52 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 675K 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 ShieldIIPs-PT-040B-ReachabilityFireability-2024-00
FORMULA_NAME ShieldIIPs-PT-040B-ReachabilityFireability-2024-01
FORMULA_NAME ShieldIIPs-PT-040B-ReachabilityFireability-2024-02
FORMULA_NAME ShieldIIPs-PT-040B-ReachabilityFireability-2024-03
FORMULA_NAME ShieldIIPs-PT-040B-ReachabilityFireability-2024-04
FORMULA_NAME ShieldIIPs-PT-040B-ReachabilityFireability-2024-05
FORMULA_NAME ShieldIIPs-PT-040B-ReachabilityFireability-2024-06
FORMULA_NAME ShieldIIPs-PT-040B-ReachabilityFireability-2024-07
FORMULA_NAME ShieldIIPs-PT-040B-ReachabilityFireability-2024-08
FORMULA_NAME ShieldIIPs-PT-040B-ReachabilityFireability-2024-09
FORMULA_NAME ShieldIIPs-PT-040B-ReachabilityFireability-2024-10
FORMULA_NAME ShieldIIPs-PT-040B-ReachabilityFireability-2024-11
FORMULA_NAME ShieldIIPs-PT-040B-ReachabilityFireability-2024-12
FORMULA_NAME ShieldIIPs-PT-040B-ReachabilityFireability-2024-13
FORMULA_NAME ShieldIIPs-PT-040B-ReachabilityFireability-2024-14
FORMULA_NAME ShieldIIPs-PT-040B-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1716942566286

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=ShieldIIPs-PT-040B
Applying reductions before tool lola
Invoking reducer
Running Version 202304061127
[2024-05-29 00:29:28] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-05-29 00:29:28] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-29 00:29:28] [INFO ] Load time of PNML (sax parser for PT used): 162 ms
[2024-05-29 00:29:28] [INFO ] Transformed 2403 places.
[2024-05-29 00:29:28] [INFO ] Transformed 2363 transitions.
[2024-05-29 00:29:28] [INFO ] Found NUPN structural information;
[2024-05-29 00:29:28] [INFO ] Parsed PT model containing 2403 places and 2363 transitions and 7126 arcs in 338 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 13 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 2 resets, run finished after 477 ms. (steps per millisecond=20 ) properties (out of 16) seen :9
FORMULA ShieldIIPs-PT-040B-ReachabilityFireability-2024-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-040B-ReachabilityFireability-2024-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-040B-ReachabilityFireability-2024-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-040B-ReachabilityFireability-2024-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-040B-ReachabilityFireability-2024-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-040B-ReachabilityFireability-2024-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-040B-ReachabilityFireability-2024-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-040B-ReachabilityFireability-2024-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-040B-ReachabilityFireability-2024-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
// Phase 1: matrix 2363 rows 2403 cols
[2024-05-29 00:29:29] [INFO ] Computed 361 invariants in 36 ms
[2024-05-29 00:29:30] [INFO ] After 843ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2024-05-29 00:29:31] [INFO ] [Nat]Absence check using 361 positive place invariants in 146 ms returned sat
[2024-05-29 00:29:35] [INFO ] After 3913ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2024-05-29 00:29:36] [INFO ] Deduced a trap composed of 19 places in 814 ms of which 19 ms to minimize.
[2024-05-29 00:29:37] [INFO ] Deduced a trap composed of 17 places in 773 ms of which 2 ms to minimize.
[2024-05-29 00:29:38] [INFO ] Deduced a trap composed of 17 places in 713 ms of which 2 ms to minimize.
[2024-05-29 00:29:39] [INFO ] Deduced a trap composed of 12 places in 663 ms of which 2 ms to minimize.
[2024-05-29 00:29:39] [INFO ] Deduced a trap composed of 17 places in 679 ms of which 1 ms to minimize.
[2024-05-29 00:29:40] [INFO ] Deduced a trap composed of 25 places in 748 ms of which 2 ms to minimize.
[2024-05-29 00:29:41] [INFO ] Deduced a trap composed of 25 places in 753 ms of which 2 ms to minimize.
[2024-05-29 00:29:42] [INFO ] Deduced a trap composed of 15 places in 755 ms of which 2 ms to minimize.
[2024-05-29 00:29:43] [INFO ] Deduced a trap composed of 32 places in 710 ms of which 1 ms to minimize.
[2024-05-29 00:29:44] [INFO ] Deduced a trap composed of 24 places in 710 ms of which 1 ms to minimize.
[2024-05-29 00:29:44] [INFO ] Deduced a trap composed of 32 places in 671 ms of which 3 ms to minimize.
[2024-05-29 00:29:45] [INFO ] Deduced a trap composed of 33 places in 702 ms of which 1 ms to minimize.
[2024-05-29 00:29:46] [INFO ] Deduced a trap composed of 43 places in 622 ms of which 1 ms to minimize.
[2024-05-29 00:29:47] [INFO ] Deduced a trap composed of 14 places in 650 ms of which 2 ms to minimize.
[2024-05-29 00:29:47] [INFO ] Deduced a trap composed of 24 places in 660 ms of which 2 ms to minimize.
[2024-05-29 00:29:48] [INFO ] Deduced a trap composed of 32 places in 681 ms of which 2 ms to minimize.
[2024-05-29 00:29:49] [INFO ] Deduced a trap composed of 33 places in 629 ms of which 2 ms to minimize.
[2024-05-29 00:29:50] [INFO ] Deduced a trap composed of 18 places in 641 ms of which 2 ms to minimize.
[2024-05-29 00:29:50] [INFO ] Deduced a trap composed of 22 places in 651 ms of which 1 ms to minimize.
[2024-05-29 00:29:51] [INFO ] Deduced a trap composed of 37 places in 650 ms of which 2 ms to minimize.
[2024-05-29 00:29:52] [INFO ] Deduced a trap composed of 26 places in 643 ms of which 2 ms to minimize.
[2024-05-29 00:29:53] [INFO ] Deduced a trap composed of 27 places in 612 ms of which 1 ms to minimize.
[2024-05-29 00:29:53] [INFO ] Deduced a trap composed of 32 places in 599 ms of which 1 ms to minimize.
[2024-05-29 00:29:54] [INFO ] Deduced a trap composed of 36 places in 629 ms of which 2 ms to minimize.
[2024-05-29 00:29:55] [INFO ] Deduced a trap composed of 20 places in 610 ms of which 1 ms to minimize.
[2024-05-29 00:29:56] [INFO ] Deduced a trap composed of 23 places in 606 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 00:29:56] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-29 00:29:56] [INFO ] After 25625ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:7
Parikh walk visited 0 properties in 651 ms.
Support contains 134 out of 2403 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2403/2403 places, 2363/2363 transitions.
Drop transitions removed 173 transitions
Trivial Post-agglo rules discarded 173 transitions
Performed 173 trivial Post agglomeration. Transition count delta: 173
Iterating post reduction 0 with 173 rules applied. Total rules applied 173 place count 2403 transition count 2190
Reduce places removed 173 places and 0 transitions.
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Iterating post reduction 1 with 185 rules applied. Total rules applied 358 place count 2230 transition count 2178
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 370 place count 2218 transition count 2178
Performed 191 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 191 Pre rules applied. Total rules applied 370 place count 2218 transition count 1987
Deduced a syphon composed of 191 places in 8 ms
Reduce places removed 191 places and 0 transitions.
Iterating global reduction 3 with 382 rules applied. Total rules applied 752 place count 2027 transition count 1987
Discarding 253 places :
Symmetric choice reduction at 3 with 253 rule applications. Total rules 1005 place count 1774 transition count 1734
Iterating global reduction 3 with 253 rules applied. Total rules applied 1258 place count 1774 transition count 1734
Performed 85 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 85 Pre rules applied. Total rules applied 1258 place count 1774 transition count 1649
Deduced a syphon composed of 85 places in 5 ms
Reduce places removed 85 places and 0 transitions.
Iterating global reduction 3 with 170 rules applied. Total rules applied 1428 place count 1689 transition count 1649
Performed 574 Post agglomeration using F-continuation condition.Transition count delta: 574
Deduced a syphon composed of 574 places in 9 ms
Reduce places removed 574 places and 0 transitions.
Iterating global reduction 3 with 1148 rules applied. Total rules applied 2576 place count 1115 transition count 1075
Partial Free-agglomeration rule applied 239 times.
Drop transitions removed 239 transitions
Iterating global reduction 3 with 239 rules applied. Total rules applied 2815 place count 1115 transition count 1075
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 2816 place count 1114 transition count 1074
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2817 place count 1113 transition count 1074
Applied a total of 2817 rules in 768 ms. Remains 1113 /2403 variables (removed 1290) and now considering 1074/2363 (removed 1289) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 769 ms. Remains : 1113/2403 places, 1074/2363 transitions.
Incomplete random walk after 10000 steps, including 3 resets, run finished after 234 ms. (steps per millisecond=42 ) properties (out of 7) seen :3
FORMULA ShieldIIPs-PT-040B-ReachabilityFireability-2024-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-040B-ReachabilityFireability-2024-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-040B-ReachabilityFireability-2024-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
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 53 ms. (steps per millisecond=188 ) properties (out of 4) 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 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 1074 rows 1113 cols
[2024-05-29 00:29:57] [INFO ] Computed 360 invariants in 27 ms
[2024-05-29 00:29:58] [INFO ] After 201ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-29 00:29:58] [INFO ] [Nat]Absence check using 350 positive place invariants in 61 ms returned sat
[2024-05-29 00:29:58] [INFO ] [Nat]Absence check using 350 positive and 10 generalized place invariants in 2 ms returned sat
[2024-05-29 00:29:59] [INFO ] After 1276ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-05-29 00:30:00] [INFO ] Deduced a trap composed of 5 places in 180 ms of which 1 ms to minimize.
[2024-05-29 00:30:00] [INFO ] Deduced a trap composed of 8 places in 194 ms of which 0 ms to minimize.
[2024-05-29 00:30:00] [INFO ] Deduced a trap composed of 6 places in 201 ms of which 1 ms to minimize.
[2024-05-29 00:30:01] [INFO ] Deduced a trap composed of 6 places in 176 ms of which 1 ms to minimize.
[2024-05-29 00:30:01] [INFO ] Deduced a trap composed of 8 places in 176 ms of which 1 ms to minimize.
[2024-05-29 00:30:01] [INFO ] Deduced a trap composed of 11 places in 173 ms of which 1 ms to minimize.
[2024-05-29 00:30:01] [INFO ] Deduced a trap composed of 13 places in 171 ms of which 0 ms to minimize.
[2024-05-29 00:30:02] [INFO ] Deduced a trap composed of 9 places in 180 ms of which 10 ms to minimize.
[2024-05-29 00:30:02] [INFO ] Deduced a trap composed of 6 places in 182 ms of which 0 ms to minimize.
[2024-05-29 00:30:02] [INFO ] Deduced a trap composed of 8 places in 176 ms of which 1 ms to minimize.
[2024-05-29 00:30:02] [INFO ] Deduced a trap composed of 12 places in 146 ms of which 1 ms to minimize.
[2024-05-29 00:30:03] [INFO ] Deduced a trap composed of 13 places in 144 ms of which 1 ms to minimize.
[2024-05-29 00:30:03] [INFO ] Deduced a trap composed of 9 places in 119 ms of which 1 ms to minimize.
[2024-05-29 00:30:03] [INFO ] Deduced a trap composed of 9 places in 150 ms of which 1 ms to minimize.
[2024-05-29 00:30:03] [INFO ] Deduced a trap composed of 5 places in 121 ms of which 1 ms to minimize.
[2024-05-29 00:30:03] [INFO ] Deduced a trap composed of 6 places in 122 ms of which 1 ms to minimize.
[2024-05-29 00:30:03] [INFO ] Deduced a trap composed of 6 places in 121 ms of which 0 ms to minimize.
[2024-05-29 00:30:04] [INFO ] Deduced a trap composed of 5 places in 102 ms of which 0 ms to minimize.
[2024-05-29 00:30:04] [INFO ] Deduced a trap composed of 10 places in 107 ms of which 1 ms to minimize.
[2024-05-29 00:30:04] [INFO ] Deduced a trap composed of 5 places in 111 ms of which 0 ms to minimize.
[2024-05-29 00:30:04] [INFO ] Deduced a trap composed of 12 places in 73 ms of which 1 ms to minimize.
[2024-05-29 00:30:04] [INFO ] Deduced a trap composed of 11 places in 70 ms of which 0 ms to minimize.
[2024-05-29 00:30:04] [INFO ] Deduced a trap composed of 8 places in 76 ms of which 0 ms to minimize.
[2024-05-29 00:30:04] [INFO ] Deduced a trap composed of 13 places in 75 ms of which 1 ms to minimize.
[2024-05-29 00:30:05] [INFO ] Deduced a trap composed of 11 places in 73 ms of which 1 ms to minimize.
[2024-05-29 00:30:05] [INFO ] Trap strengthening (SAT) tested/added 26/25 trap constraints in 4879 ms
[2024-05-29 00:30:05] [INFO ] Deduced a trap composed of 8 places in 142 ms of which 0 ms to minimize.
[2024-05-29 00:30:05] [INFO ] Deduced a trap composed of 6 places in 128 ms of which 0 ms to minimize.
[2024-05-29 00:30:05] [INFO ] Deduced a trap composed of 3 places in 120 ms of which 1 ms to minimize.
[2024-05-29 00:30:05] [INFO ] Deduced a trap composed of 9 places in 132 ms of which 1 ms to minimize.
[2024-05-29 00:30:06] [INFO ] Deduced a trap composed of 7 places in 135 ms of which 3 ms to minimize.
[2024-05-29 00:30:06] [INFO ] Deduced a trap composed of 7 places in 131 ms of which 1 ms to minimize.
[2024-05-29 00:30:06] [INFO ] Deduced a trap composed of 11 places in 129 ms of which 1 ms to minimize.
[2024-05-29 00:30:06] [INFO ] Deduced a trap composed of 5 places in 130 ms of which 1 ms to minimize.
[2024-05-29 00:30:06] [INFO ] Deduced a trap composed of 16 places in 118 ms of which 0 ms to minimize.
[2024-05-29 00:30:06] [INFO ] Deduced a trap composed of 7 places in 120 ms of which 0 ms to minimize.
[2024-05-29 00:30:07] [INFO ] Deduced a trap composed of 6 places in 112 ms of which 0 ms to minimize.
[2024-05-29 00:30:07] [INFO ] Deduced a trap composed of 4 places in 114 ms of which 0 ms to minimize.
[2024-05-29 00:30:07] [INFO ] Deduced a trap composed of 8 places in 110 ms of which 1 ms to minimize.
[2024-05-29 00:30:07] [INFO ] Deduced a trap composed of 10 places in 114 ms of which 1 ms to minimize.
[2024-05-29 00:30:07] [INFO ] Deduced a trap composed of 5 places in 116 ms of which 1 ms to minimize.
[2024-05-29 00:30:07] [INFO ] Deduced a trap composed of 12 places in 109 ms of which 2 ms to minimize.
[2024-05-29 00:30:08] [INFO ] Deduced a trap composed of 24 places in 112 ms of which 2 ms to minimize.
[2024-05-29 00:30:08] [INFO ] Deduced a trap composed of 6 places in 104 ms of which 1 ms to minimize.
[2024-05-29 00:30:08] [INFO ] Deduced a trap composed of 8 places in 101 ms of which 0 ms to minimize.
[2024-05-29 00:30:08] [INFO ] Deduced a trap composed of 16 places in 85 ms of which 1 ms to minimize.
[2024-05-29 00:30:08] [INFO ] Deduced a trap composed of 13 places in 90 ms of which 0 ms to minimize.
[2024-05-29 00:30:08] [INFO ] Deduced a trap composed of 12 places in 82 ms of which 1 ms to minimize.
[2024-05-29 00:30:08] [INFO ] Trap strengthening (SAT) tested/added 23/22 trap constraints in 3563 ms
[2024-05-29 00:30:09] [INFO ] Deduced a trap composed of 5 places in 159 ms of which 1 ms to minimize.
[2024-05-29 00:30:09] [INFO ] Deduced a trap composed of 5 places in 180 ms of which 1 ms to minimize.
[2024-05-29 00:30:09] [INFO ] Deduced a trap composed of 8 places in 175 ms of which 1 ms to minimize.
[2024-05-29 00:30:09] [INFO ] Deduced a trap composed of 14 places in 169 ms of which 1 ms to minimize.
[2024-05-29 00:30:09] [INFO ] Deduced a trap composed of 8 places in 163 ms of which 0 ms to minimize.
[2024-05-29 00:30:10] [INFO ] Deduced a trap composed of 16 places in 161 ms of which 0 ms to minimize.
[2024-05-29 00:30:10] [INFO ] Deduced a trap composed of 18 places in 159 ms of which 1 ms to minimize.
[2024-05-29 00:30:10] [INFO ] Deduced a trap composed of 10 places in 120 ms of which 1 ms to minimize.
[2024-05-29 00:30:10] [INFO ] Deduced a trap composed of 9 places in 145 ms of which 1 ms to minimize.
[2024-05-29 00:30:10] [INFO ] Deduced a trap composed of 18 places in 126 ms of which 1 ms to minimize.
[2024-05-29 00:30:11] [INFO ] Deduced a trap composed of 5 places in 123 ms of which 0 ms to minimize.
[2024-05-29 00:30:11] [INFO ] Deduced a trap composed of 8 places in 127 ms of which 0 ms to minimize.
[2024-05-29 00:30:11] [INFO ] Deduced a trap composed of 9 places in 121 ms of which 1 ms to minimize.
[2024-05-29 00:30:11] [INFO ] Deduced a trap composed of 9 places in 122 ms of which 1 ms to minimize.
[2024-05-29 00:30:11] [INFO ] Deduced a trap composed of 18 places in 123 ms of which 1 ms to minimize.
[2024-05-29 00:30:11] [INFO ] Deduced a trap composed of 11 places in 134 ms of which 0 ms to minimize.
[2024-05-29 00:30:12] [INFO ] Deduced a trap composed of 7 places in 103 ms of which 1 ms to minimize.
[2024-05-29 00:30:12] [INFO ] Deduced a trap composed of 17 places in 117 ms of which 0 ms to minimize.
[2024-05-29 00:30:12] [INFO ] Deduced a trap composed of 8 places in 118 ms of which 0 ms to minimize.
[2024-05-29 00:30:12] [INFO ] Deduced a trap composed of 4 places in 114 ms of which 0 ms to minimize.
[2024-05-29 00:30:12] [INFO ] Deduced a trap composed of 5 places in 112 ms of which 0 ms to minimize.
[2024-05-29 00:30:12] [INFO ] Deduced a trap composed of 11 places in 115 ms of which 1 ms to minimize.
[2024-05-29 00:30:13] [INFO ] Deduced a trap composed of 9 places in 120 ms of which 1 ms to minimize.
[2024-05-29 00:30:13] [INFO ] Deduced a trap composed of 13 places in 108 ms of which 0 ms to minimize.
[2024-05-29 00:30:13] [INFO ] Deduced a trap composed of 21 places in 100 ms of which 1 ms to minimize.
[2024-05-29 00:30:13] [INFO ] Deduced a trap composed of 20 places in 90 ms of which 0 ms to minimize.
[2024-05-29 00:30:13] [INFO ] Deduced a trap composed of 16 places in 95 ms of which 0 ms to minimize.
[2024-05-29 00:30:13] [INFO ] Deduced a trap composed of 7 places in 95 ms of which 0 ms to minimize.
[2024-05-29 00:30:13] [INFO ] Deduced a trap composed of 4 places in 92 ms of which 1 ms to minimize.
[2024-05-29 00:30:14] [INFO ] Trap strengthening (SAT) tested/added 30/29 trap constraints in 5153 ms
[2024-05-29 00:30:14] [INFO ] Deduced a trap composed of 7 places in 150 ms of which 1 ms to minimize.
[2024-05-29 00:30:14] [INFO ] Deduced a trap composed of 11 places in 135 ms of which 0 ms to minimize.
[2024-05-29 00:30:14] [INFO ] Deduced a trap composed of 4 places in 137 ms of which 1 ms to minimize.
[2024-05-29 00:30:14] [INFO ] Deduced a trap composed of 4 places in 125 ms of which 0 ms to minimize.
[2024-05-29 00:30:15] [INFO ] Deduced a trap composed of 5 places in 115 ms of which 1 ms to minimize.
[2024-05-29 00:30:15] [INFO ] Deduced a trap composed of 18 places in 113 ms of which 0 ms to minimize.
[2024-05-29 00:30:15] [INFO ] Deduced a trap composed of 17 places in 118 ms of which 1 ms to minimize.
[2024-05-29 00:30:15] [INFO ] Deduced a trap composed of 22 places in 119 ms of which 1 ms to minimize.
[2024-05-29 00:30:15] [INFO ] Deduced a trap composed of 13 places in 119 ms of which 0 ms to minimize.
[2024-05-29 00:30:15] [INFO ] Deduced a trap composed of 7 places in 130 ms of which 0 ms to minimize.
[2024-05-29 00:30:16] [INFO ] Deduced a trap composed of 9 places in 118 ms of which 0 ms to minimize.
[2024-05-29 00:30:16] [INFO ] Deduced a trap composed of 16 places in 109 ms of which 0 ms to minimize.
[2024-05-29 00:30:16] [INFO ] Deduced a trap composed of 9 places in 100 ms of which 1 ms to minimize.
[2024-05-29 00:30:16] [INFO ] Deduced a trap composed of 25 places in 96 ms of which 0 ms to minimize.
[2024-05-29 00:30:16] [INFO ] Deduced a trap composed of 5 places in 97 ms of which 0 ms to minimize.
[2024-05-29 00:30:16] [INFO ] Trap strengthening (SAT) tested/added 16/15 trap constraints in 2585 ms
[2024-05-29 00:30:16] [INFO ] After 18288ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 1113 ms.
[2024-05-29 00:30:17] [INFO ] After 19712ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 79 ms.
Support contains 130 out of 1113 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1113/1113 places, 1074/1074 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 1113 transition count 1073
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1112 transition count 1073
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 1111 transition count 1072
Applied a total of 4 rules in 97 ms. Remains 1111 /1113 variables (removed 2) and now considering 1072/1074 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 98 ms. Remains : 1111/1113 places, 1072/1074 transitions.
Incomplete random walk after 10000 steps, including 3 resets, run finished after 161 ms. (steps per millisecond=62 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 4) 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 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 4) 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 4) seen :0
Interrupted probabilistic random walk after 134506 steps, run timeout after 3001 ms. (steps per millisecond=44 ) properties seen :{}
Probabilistic random walk after 134506 steps, saw 92847 distinct states, run finished after 3002 ms. (steps per millisecond=44 ) properties seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 1072 rows 1111 cols
[2024-05-29 00:30:21] [INFO ] Computed 360 invariants in 11 ms
[2024-05-29 00:30:21] [INFO ] After 235ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-29 00:30:22] [INFO ] [Nat]Absence check using 350 positive place invariants in 60 ms returned sat
[2024-05-29 00:30:22] [INFO ] [Nat]Absence check using 350 positive and 10 generalized place invariants in 2 ms returned sat
[2024-05-29 00:30:23] [INFO ] After 1134ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-05-29 00:30:23] [INFO ] Deduced a trap composed of 9 places in 118 ms of which 0 ms to minimize.
[2024-05-29 00:30:24] [INFO ] Deduced a trap composed of 7 places in 121 ms of which 1 ms to minimize.
[2024-05-29 00:30:24] [INFO ] Deduced a trap composed of 3 places in 121 ms of which 1 ms to minimize.
[2024-05-29 00:30:24] [INFO ] Deduced a trap composed of 7 places in 113 ms of which 0 ms to minimize.
[2024-05-29 00:30:24] [INFO ] Deduced a trap composed of 6 places in 126 ms of which 1 ms to minimize.
[2024-05-29 00:30:24] [INFO ] Deduced a trap composed of 15 places in 133 ms of which 1 ms to minimize.
[2024-05-29 00:30:24] [INFO ] Deduced a trap composed of 4 places in 127 ms of which 0 ms to minimize.
[2024-05-29 00:30:25] [INFO ] Deduced a trap composed of 5 places in 116 ms of which 0 ms to minimize.
[2024-05-29 00:30:25] [INFO ] Deduced a trap composed of 10 places in 103 ms of which 1 ms to minimize.
[2024-05-29 00:30:25] [INFO ] Deduced a trap composed of 5 places in 103 ms of which 0 ms to minimize.
[2024-05-29 00:30:25] [INFO ] Deduced a trap composed of 5 places in 89 ms of which 1 ms to minimize.
[2024-05-29 00:30:25] [INFO ] Deduced a trap composed of 6 places in 113 ms of which 0 ms to minimize.
[2024-05-29 00:30:25] [INFO ] Deduced a trap composed of 8 places in 110 ms of which 0 ms to minimize.
[2024-05-29 00:30:26] [INFO ] Deduced a trap composed of 6 places in 113 ms of which 0 ms to minimize.
[2024-05-29 00:30:26] [INFO ] Deduced a trap composed of 10 places in 114 ms of which 1 ms to minimize.
[2024-05-29 00:30:26] [INFO ] Deduced a trap composed of 19 places in 108 ms of which 0 ms to minimize.
[2024-05-29 00:30:26] [INFO ] Deduced a trap composed of 5 places in 108 ms of which 1 ms to minimize.
[2024-05-29 00:30:26] [INFO ] Deduced a trap composed of 5 places in 108 ms of which 1 ms to minimize.
[2024-05-29 00:30:26] [INFO ] Deduced a trap composed of 6 places in 106 ms of which 0 ms to minimize.
[2024-05-29 00:30:27] [INFO ] Deduced a trap composed of 20 places in 109 ms of which 0 ms to minimize.
[2024-05-29 00:30:27] [INFO ] Deduced a trap composed of 14 places in 107 ms of which 1 ms to minimize.
[2024-05-29 00:30:27] [INFO ] Deduced a trap composed of 7 places in 109 ms of which 1 ms to minimize.
[2024-05-29 00:30:27] [INFO ] Deduced a trap composed of 11 places in 104 ms of which 1 ms to minimize.
[2024-05-29 00:30:27] [INFO ] Deduced a trap composed of 12 places in 109 ms of which 2 ms to minimize.
[2024-05-29 00:30:27] [INFO ] Deduced a trap composed of 13 places in 106 ms of which 0 ms to minimize.
[2024-05-29 00:30:28] [INFO ] Deduced a trap composed of 5 places in 105 ms of which 0 ms to minimize.
[2024-05-29 00:30:28] [INFO ] Deduced a trap composed of 11 places in 102 ms of which 0 ms to minimize.
[2024-05-29 00:30:28] [INFO ] Trap strengthening (SAT) tested/added 28/27 trap constraints in 4526 ms
[2024-05-29 00:30:28] [INFO ] Deduced a trap composed of 8 places in 138 ms of which 0 ms to minimize.
[2024-05-29 00:30:28] [INFO ] Deduced a trap composed of 6 places in 130 ms of which 0 ms to minimize.
[2024-05-29 00:30:28] [INFO ] Deduced a trap composed of 6 places in 129 ms of which 0 ms to minimize.
[2024-05-29 00:30:29] [INFO ] Deduced a trap composed of 13 places in 121 ms of which 0 ms to minimize.
[2024-05-29 00:30:29] [INFO ] Deduced a trap composed of 13 places in 119 ms of which 1 ms to minimize.
[2024-05-29 00:30:29] [INFO ] Deduced a trap composed of 12 places in 116 ms of which 0 ms to minimize.
[2024-05-29 00:30:29] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1028 ms
[2024-05-29 00:30:29] [INFO ] Deduced a trap composed of 4 places in 152 ms of which 1 ms to minimize.
[2024-05-29 00:30:29] [INFO ] Deduced a trap composed of 14 places in 152 ms of which 1 ms to minimize.
[2024-05-29 00:30:30] [INFO ] Deduced a trap composed of 7 places in 156 ms of which 0 ms to minimize.
[2024-05-29 00:30:30] [INFO ] Deduced a trap composed of 12 places in 153 ms of which 0 ms to minimize.
[2024-05-29 00:30:30] [INFO ] Deduced a trap composed of 20 places in 149 ms of which 1 ms to minimize.
[2024-05-29 00:30:30] [INFO ] Deduced a trap composed of 8 places in 147 ms of which 0 ms to minimize.
[2024-05-29 00:30:30] [INFO ] Deduced a trap composed of 8 places in 135 ms of which 1 ms to minimize.
[2024-05-29 00:30:31] [INFO ] Deduced a trap composed of 9 places in 132 ms of which 1 ms to minimize.
[2024-05-29 00:30:31] [INFO ] Deduced a trap composed of 6 places in 136 ms of which 0 ms to minimize.
[2024-05-29 00:30:31] [INFO ] Deduced a trap composed of 4 places in 124 ms of which 1 ms to minimize.
[2024-05-29 00:30:31] [INFO ] Deduced a trap composed of 11 places in 124 ms of which 1 ms to minimize.
[2024-05-29 00:30:31] [INFO ] Deduced a trap composed of 10 places in 116 ms of which 0 ms to minimize.
[2024-05-29 00:30:31] [INFO ] Deduced a trap composed of 10 places in 112 ms of which 0 ms to minimize.
[2024-05-29 00:30:32] [INFO ] Deduced a trap composed of 7 places in 104 ms of which 1 ms to minimize.
[2024-05-29 00:30:32] [INFO ] Deduced a trap composed of 6 places in 96 ms of which 1 ms to minimize.
[2024-05-29 00:30:32] [INFO ] Deduced a trap composed of 7 places in 101 ms of which 1 ms to minimize.
[2024-05-29 00:30:32] [INFO ] Deduced a trap composed of 10 places in 100 ms of which 1 ms to minimize.
[2024-05-29 00:30:32] [INFO ] Deduced a trap composed of 19 places in 103 ms of which 1 ms to minimize.
[2024-05-29 00:30:32] [INFO ] Deduced a trap composed of 5 places in 99 ms of which 0 ms to minimize.
[2024-05-29 00:30:32] [INFO ] Deduced a trap composed of 13 places in 105 ms of which 0 ms to minimize.
[2024-05-29 00:30:32] [INFO ] Trap strengthening (SAT) tested/added 21/20 trap constraints in 3415 ms
[2024-05-29 00:30:33] [INFO ] Deduced a trap composed of 6 places in 200 ms of which 1 ms to minimize.
[2024-05-29 00:30:33] [INFO ] Deduced a trap composed of 4 places in 192 ms of which 0 ms to minimize.
[2024-05-29 00:30:33] [INFO ] Deduced a trap composed of 6 places in 192 ms of which 0 ms to minimize.
[2024-05-29 00:30:34] [INFO ] Deduced a trap composed of 12 places in 193 ms of which 1 ms to minimize.
[2024-05-29 00:30:34] [INFO ] Deduced a trap composed of 5 places in 180 ms of which 1 ms to minimize.
[2024-05-29 00:30:34] [INFO ] Deduced a trap composed of 6 places in 174 ms of which 1 ms to minimize.
[2024-05-29 00:30:34] [INFO ] Deduced a trap composed of 14 places in 184 ms of which 1 ms to minimize.
[2024-05-29 00:30:34] [INFO ] Deduced a trap composed of 11 places in 170 ms of which 0 ms to minimize.
[2024-05-29 00:30:35] [INFO ] Deduced a trap composed of 5 places in 155 ms of which 0 ms to minimize.
[2024-05-29 00:30:35] [INFO ] Deduced a trap composed of 16 places in 151 ms of which 1 ms to minimize.
[2024-05-29 00:30:35] [INFO ] Deduced a trap composed of 10 places in 159 ms of which 1 ms to minimize.
[2024-05-29 00:30:35] [INFO ] Deduced a trap composed of 11 places in 112 ms of which 0 ms to minimize.
[2024-05-29 00:30:35] [INFO ] Deduced a trap composed of 4 places in 116 ms of which 1 ms to minimize.
[2024-05-29 00:30:35] [INFO ] Deduced a trap composed of 7 places in 116 ms of which 0 ms to minimize.
[2024-05-29 00:30:36] [INFO ] Deduced a trap composed of 15 places in 113 ms of which 1 ms to minimize.
[2024-05-29 00:30:36] [INFO ] Deduced a trap composed of 5 places in 115 ms of which 0 ms to minimize.
[2024-05-29 00:30:36] [INFO ] Deduced a trap composed of 11 places in 111 ms of which 0 ms to minimize.
[2024-05-29 00:30:36] [INFO ] Deduced a trap composed of 8 places in 118 ms of which 1 ms to minimize.
[2024-05-29 00:30:36] [INFO ] Deduced a trap composed of 6 places in 101 ms of which 1 ms to minimize.
[2024-05-29 00:30:36] [INFO ] Deduced a trap composed of 5 places in 112 ms of which 1 ms to minimize.
[2024-05-29 00:30:37] [INFO ] Deduced a trap composed of 6 places in 112 ms of which 0 ms to minimize.
[2024-05-29 00:30:37] [INFO ] Deduced a trap composed of 5 places in 104 ms of which 1 ms to minimize.
[2024-05-29 00:30:37] [INFO ] Deduced a trap composed of 6 places in 107 ms of which 0 ms to minimize.
[2024-05-29 00:30:37] [INFO ] Deduced a trap composed of 7 places in 99 ms of which 1 ms to minimize.
[2024-05-29 00:30:37] [INFO ] Deduced a trap composed of 10 places in 112 ms of which 0 ms to minimize.
[2024-05-29 00:30:37] [INFO ] Deduced a trap composed of 9 places in 109 ms of which 0 ms to minimize.
[2024-05-29 00:30:38] [INFO ] Deduced a trap composed of 9 places in 112 ms of which 0 ms to minimize.
[2024-05-29 00:30:38] [INFO ] Deduced a trap composed of 6 places in 106 ms of which 1 ms to minimize.
[2024-05-29 00:30:38] [INFO ] Deduced a trap composed of 7 places in 115 ms of which 1 ms to minimize.
[2024-05-29 00:30:38] [INFO ] Deduced a trap composed of 7 places in 103 ms of which 0 ms to minimize.
[2024-05-29 00:30:38] [INFO ] Deduced a trap composed of 10 places in 103 ms of which 1 ms to minimize.
[2024-05-29 00:30:38] [INFO ] Deduced a trap composed of 7 places in 99 ms of which 1 ms to minimize.
[2024-05-29 00:30:38] [INFO ] Deduced a trap composed of 12 places in 106 ms of which 1 ms to minimize.
[2024-05-29 00:30:39] [INFO ] Deduced a trap composed of 5 places in 106 ms of which 1 ms to minimize.
[2024-05-29 00:30:39] [INFO ] Deduced a trap composed of 19 places in 101 ms of which 0 ms to minimize.
[2024-05-29 00:30:39] [INFO ] Deduced a trap composed of 20 places in 102 ms of which 1 ms to minimize.
[2024-05-29 00:30:39] [INFO ] Deduced a trap composed of 12 places in 103 ms of which 1 ms to minimize.
[2024-05-29 00:30:39] [INFO ] Deduced a trap composed of 8 places in 113 ms of which 0 ms to minimize.
[2024-05-29 00:30:39] [INFO ] Deduced a trap composed of 5 places in 108 ms of which 0 ms to minimize.
[2024-05-29 00:30:39] [INFO ] Deduced a trap composed of 16 places in 114 ms of which 0 ms to minimize.
[2024-05-29 00:30:40] [INFO ] Deduced a trap composed of 9 places in 106 ms of which 0 ms to minimize.
[2024-05-29 00:30:40] [INFO ] Deduced a trap composed of 19 places in 92 ms of which 1 ms to minimize.
[2024-05-29 00:30:40] [INFO ] Deduced a trap composed of 12 places in 109 ms of which 0 ms to minimize.
[2024-05-29 00:30:40] [INFO ] Deduced a trap composed of 9 places in 105 ms of which 0 ms to minimize.
[2024-05-29 00:30:40] [INFO ] Trap strengthening (SAT) tested/added 45/44 trap constraints in 7646 ms
[2024-05-29 00:30:40] [INFO ] After 18648ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 1380 ms.
[2024-05-29 00:30:42] [INFO ] After 20355ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 91 ms.
Support contains 130 out of 1111 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1111/1111 places, 1072/1072 transitions.
Applied a total of 0 rules in 31 ms. Remains 1111 /1111 variables (removed 0) and now considering 1072/1072 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 32 ms. Remains : 1111/1111 places, 1072/1072 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1111/1111 places, 1072/1072 transitions.
Applied a total of 0 rules in 27 ms. Remains 1111 /1111 variables (removed 0) and now considering 1072/1072 (removed 0) transitions.
[2024-05-29 00:30:42] [INFO ] Invariant cache hit.
[2024-05-29 00:30:42] [INFO ] Implicit Places using invariants in 685 ms returned []
[2024-05-29 00:30:42] [INFO ] Invariant cache hit.
[2024-05-29 00:30:44] [INFO ] Implicit Places using invariants and state equation in 1411 ms returned []
Implicit Place search using SMT with State Equation took 2099 ms to find 0 implicit places.
[2024-05-29 00:30:44] [INFO ] Redundant transitions in 87 ms returned []
[2024-05-29 00:30:44] [INFO ] Invariant cache hit.
[2024-05-29 00:30:45] [INFO ] Dead Transitions using invariants and state equation in 568 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2789 ms. Remains : 1111/1111 places, 1072/1072 transitions.
Applied a total of 0 rules in 28 ms. Remains 1111 /1111 variables (removed 0) and now considering 1072/1072 (removed 0) transitions.
Running SMT prover for 4 properties.
[2024-05-29 00:30:45] [INFO ] Invariant cache hit.
[2024-05-29 00:30:45] [INFO ] After 221ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-29 00:30:45] [INFO ] [Nat]Absence check using 350 positive place invariants in 64 ms returned sat
[2024-05-29 00:30:45] [INFO ] [Nat]Absence check using 350 positive and 10 generalized place invariants in 4 ms returned sat
[2024-05-29 00:30:46] [INFO ] After 1176ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-05-29 00:30:47] [INFO ] Deduced a trap composed of 6 places in 133 ms of which 1 ms to minimize.
[2024-05-29 00:30:47] [INFO ] Deduced a trap composed of 5 places in 134 ms of which 1 ms to minimize.
[2024-05-29 00:30:47] [INFO ] Deduced a trap composed of 15 places in 135 ms of which 0 ms to minimize.
[2024-05-29 00:30:47] [INFO ] Deduced a trap composed of 6 places in 130 ms of which 0 ms to minimize.
[2024-05-29 00:30:47] [INFO ] Deduced a trap composed of 9 places in 124 ms of which 1 ms to minimize.
[2024-05-29 00:30:48] [INFO ] Deduced a trap composed of 5 places in 124 ms of which 1 ms to minimize.
[2024-05-29 00:30:48] [INFO ] Deduced a trap composed of 9 places in 116 ms of which 1 ms to minimize.
[2024-05-29 00:30:48] [INFO ] Deduced a trap composed of 8 places in 110 ms of which 1 ms to minimize.
[2024-05-29 00:30:48] [INFO ] Deduced a trap composed of 4 places in 108 ms of which 1 ms to minimize.
[2024-05-29 00:30:48] [INFO ] Deduced a trap composed of 12 places in 119 ms of which 0 ms to minimize.
[2024-05-29 00:30:48] [INFO ] Deduced a trap composed of 9 places in 110 ms of which 0 ms to minimize.
[2024-05-29 00:30:49] [INFO ] Deduced a trap composed of 11 places in 106 ms of which 1 ms to minimize.
[2024-05-29 00:30:49] [INFO ] Deduced a trap composed of 8 places in 113 ms of which 0 ms to minimize.
[2024-05-29 00:30:49] [INFO ] Deduced a trap composed of 6 places in 101 ms of which 1 ms to minimize.
[2024-05-29 00:30:49] [INFO ] Deduced a trap composed of 8 places in 106 ms of which 0 ms to minimize.
[2024-05-29 00:30:49] [INFO ] Deduced a trap composed of 13 places in 103 ms of which 1 ms to minimize.
[2024-05-29 00:30:49] [INFO ] Deduced a trap composed of 17 places in 96 ms of which 0 ms to minimize.
[2024-05-29 00:30:49] [INFO ] Deduced a trap composed of 10 places in 85 ms of which 1 ms to minimize.
[2024-05-29 00:30:50] [INFO ] Deduced a trap composed of 6 places in 80 ms of which 0 ms to minimize.
[2024-05-29 00:30:50] [INFO ] Deduced a trap composed of 6 places in 75 ms of which 0 ms to minimize.
[2024-05-29 00:30:50] [INFO ] Trap strengthening (SAT) tested/added 21/20 trap constraints in 3260 ms
[2024-05-29 00:30:50] [INFO ] Deduced a trap composed of 9 places in 116 ms of which 1 ms to minimize.
[2024-05-29 00:30:50] [INFO ] Deduced a trap composed of 9 places in 97 ms of which 1 ms to minimize.
[2024-05-29 00:30:50] [INFO ] Deduced a trap composed of 20 places in 99 ms of which 0 ms to minimize.
[2024-05-29 00:30:50] [INFO ] Deduced a trap composed of 9 places in 96 ms of which 0 ms to minimize.
[2024-05-29 00:30:50] [INFO ] Deduced a trap composed of 17 places in 84 ms of which 1 ms to minimize.
[2024-05-29 00:30:51] [INFO ] Deduced a trap composed of 8 places in 79 ms of which 0 ms to minimize.
[2024-05-29 00:30:51] [INFO ] Deduced a trap composed of 8 places in 156 ms of which 0 ms to minimize.
[2024-05-29 00:30:51] [INFO ] Deduced a trap composed of 5 places in 121 ms of which 0 ms to minimize.
[2024-05-29 00:30:51] [INFO ] Deduced a trap composed of 5 places in 138 ms of which 1 ms to minimize.
[2024-05-29 00:30:51] [INFO ] Deduced a trap composed of 7 places in 123 ms of which 0 ms to minimize.
[2024-05-29 00:30:51] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1614 ms
[2024-05-29 00:30:52] [INFO ] Deduced a trap composed of 7 places in 161 ms of which 0 ms to minimize.
[2024-05-29 00:30:52] [INFO ] Deduced a trap composed of 8 places in 158 ms of which 0 ms to minimize.
[2024-05-29 00:30:52] [INFO ] Deduced a trap composed of 4 places in 160 ms of which 1 ms to minimize.
[2024-05-29 00:30:52] [INFO ] Deduced a trap composed of 5 places in 168 ms of which 1 ms to minimize.
[2024-05-29 00:30:53] [INFO ] Deduced a trap composed of 18 places in 166 ms of which 1 ms to minimize.
[2024-05-29 00:30:53] [INFO ] Deduced a trap composed of 7 places in 153 ms of which 1 ms to minimize.
[2024-05-29 00:30:53] [INFO ] Deduced a trap composed of 6 places in 145 ms of which 0 ms to minimize.
[2024-05-29 00:30:53] [INFO ] Deduced a trap composed of 23 places in 141 ms of which 0 ms to minimize.
[2024-05-29 00:30:53] [INFO ] Deduced a trap composed of 9 places in 147 ms of which 0 ms to minimize.
[2024-05-29 00:30:54] [INFO ] Deduced a trap composed of 18 places in 141 ms of which 1 ms to minimize.
[2024-05-29 00:30:54] [INFO ] Deduced a trap composed of 10 places in 132 ms of which 0 ms to minimize.
[2024-05-29 00:30:54] [INFO ] Deduced a trap composed of 7 places in 140 ms of which 0 ms to minimize.
[2024-05-29 00:30:54] [INFO ] Deduced a trap composed of 8 places in 154 ms of which 0 ms to minimize.
[2024-05-29 00:30:54] [INFO ] Deduced a trap composed of 11 places in 145 ms of which 0 ms to minimize.
[2024-05-29 00:30:55] [INFO ] Deduced a trap composed of 9 places in 145 ms of which 1 ms to minimize.
[2024-05-29 00:30:55] [INFO ] Deduced a trap composed of 10 places in 132 ms of which 0 ms to minimize.
[2024-05-29 00:30:55] [INFO ] Deduced a trap composed of 12 places in 150 ms of which 1 ms to minimize.
[2024-05-29 00:30:55] [INFO ] Deduced a trap composed of 8 places in 138 ms of which 0 ms to minimize.
[2024-05-29 00:30:55] [INFO ] Deduced a trap composed of 11 places in 128 ms of which 0 ms to minimize.
[2024-05-29 00:30:55] [INFO ] Deduced a trap composed of 8 places in 129 ms of which 0 ms to minimize.
[2024-05-29 00:30:56] [INFO ] Deduced a trap composed of 10 places in 120 ms of which 1 ms to minimize.
[2024-05-29 00:30:56] [INFO ] Deduced a trap composed of 21 places in 125 ms of which 0 ms to minimize.
[2024-05-29 00:30:56] [INFO ] Deduced a trap composed of 14 places in 119 ms of which 1 ms to minimize.
[2024-05-29 00:30:56] [INFO ] Deduced a trap composed of 7 places in 121 ms of which 0 ms to minimize.
[2024-05-29 00:30:56] [INFO ] Deduced a trap composed of 20 places in 136 ms of which 0 ms to minimize.
[2024-05-29 00:30:56] [INFO ] Deduced a trap composed of 6 places in 121 ms of which 0 ms to minimize.
[2024-05-29 00:30:57] [INFO ] Deduced a trap composed of 9 places in 122 ms of which 0 ms to minimize.
[2024-05-29 00:30:57] [INFO ] Deduced a trap composed of 10 places in 133 ms of which 0 ms to minimize.
[2024-05-29 00:30:57] [INFO ] Trap strengthening (SAT) tested/added 29/28 trap constraints in 5336 ms
[2024-05-29 00:30:57] [INFO ] Deduced a trap composed of 8 places in 205 ms of which 1 ms to minimize.
[2024-05-29 00:30:58] [INFO ] Deduced a trap composed of 4 places in 201 ms of which 1 ms to minimize.
[2024-05-29 00:30:58] [INFO ] Deduced a trap composed of 6 places in 201 ms of which 1 ms to minimize.
[2024-05-29 00:30:58] [INFO ] Deduced a trap composed of 12 places in 197 ms of which 1 ms to minimize.
[2024-05-29 00:30:58] [INFO ] Deduced a trap composed of 6 places in 189 ms of which 0 ms to minimize.
[2024-05-29 00:30:58] [INFO ] Deduced a trap composed of 17 places in 196 ms of which 0 ms to minimize.
[2024-05-29 00:30:59] [INFO ] Deduced a trap composed of 14 places in 195 ms of which 1 ms to minimize.
[2024-05-29 00:30:59] [INFO ] Deduced a trap composed of 6 places in 193 ms of which 0 ms to minimize.
[2024-05-29 00:30:59] [INFO ] Deduced a trap composed of 17 places in 182 ms of which 1 ms to minimize.
[2024-05-29 00:30:59] [INFO ] Deduced a trap composed of 4 places in 180 ms of which 1 ms to minimize.
[2024-05-29 00:31:00] [INFO ] Deduced a trap composed of 4 places in 176 ms of which 0 ms to minimize.
[2024-05-29 00:31:00] [INFO ] Deduced a trap composed of 4 places in 177 ms of which 1 ms to minimize.
[2024-05-29 00:31:00] [INFO ] Deduced a trap composed of 8 places in 174 ms of which 1 ms to minimize.
[2024-05-29 00:31:00] [INFO ] Deduced a trap composed of 16 places in 175 ms of which 1 ms to minimize.
[2024-05-29 00:31:01] [INFO ] Deduced a trap composed of 15 places in 173 ms of which 0 ms to minimize.
[2024-05-29 00:31:01] [INFO ] Deduced a trap composed of 12 places in 170 ms of which 0 ms to minimize.
[2024-05-29 00:31:01] [INFO ] Deduced a trap composed of 4 places in 164 ms of which 1 ms to minimize.
[2024-05-29 00:31:01] [INFO ] Deduced a trap composed of 6 places in 164 ms of which 1 ms to minimize.
[2024-05-29 00:31:01] [INFO ] Deduced a trap composed of 10 places in 161 ms of which 0 ms to minimize.
[2024-05-29 00:31:02] [INFO ] Deduced a trap composed of 9 places in 178 ms of which 1 ms to minimize.
[2024-05-29 00:31:02] [INFO ] Deduced a trap composed of 9 places in 176 ms of which 0 ms to minimize.
[2024-05-29 00:31:02] [INFO ] Deduced a trap composed of 19 places in 170 ms of which 0 ms to minimize.
[2024-05-29 00:31:02] [INFO ] Deduced a trap composed of 5 places in 167 ms of which 0 ms to minimize.
[2024-05-29 00:31:02] [INFO ] Deduced a trap composed of 15 places in 166 ms of which 1 ms to minimize.
[2024-05-29 00:31:03] [INFO ] Deduced a trap composed of 18 places in 164 ms of which 0 ms to minimize.
[2024-05-29 00:31:03] [INFO ] Deduced a trap composed of 5 places in 156 ms of which 0 ms to minimize.
[2024-05-29 00:31:03] [INFO ] Deduced a trap composed of 9 places in 148 ms of which 0 ms to minimize.
[2024-05-29 00:31:03] [INFO ] Deduced a trap composed of 19 places in 160 ms of which 0 ms to minimize.
[2024-05-29 00:31:04] [INFO ] Deduced a trap composed of 10 places in 175 ms of which 1 ms to minimize.
[2024-05-29 00:31:04] [INFO ] Deduced a trap composed of 27 places in 168 ms of which 0 ms to minimize.
[2024-05-29 00:31:04] [INFO ] Deduced a trap composed of 6 places in 160 ms of which 1 ms to minimize.
[2024-05-29 00:31:04] [INFO ] Deduced a trap composed of 16 places in 156 ms of which 1 ms to minimize.
[2024-05-29 00:31:04] [INFO ] Deduced a trap composed of 21 places in 160 ms of which 1 ms to minimize.
[2024-05-29 00:31:05] [INFO ] Deduced a trap composed of 22 places in 147 ms of which 1 ms to minimize.
[2024-05-29 00:31:05] [INFO ] Deduced a trap composed of 9 places in 142 ms of which 1 ms to minimize.
[2024-05-29 00:31:05] [INFO ] Deduced a trap composed of 19 places in 131 ms of which 0 ms to minimize.
[2024-05-29 00:31:05] [INFO ] Deduced a trap composed of 19 places in 138 ms of which 1 ms to minimize.
[2024-05-29 00:31:05] [INFO ] Deduced a trap composed of 5 places in 130 ms of which 1 ms to minimize.
[2024-05-29 00:31:06] [INFO ] Deduced a trap composed of 10 places in 136 ms of which 0 ms to minimize.
[2024-05-29 00:31:06] [INFO ] Deduced a trap composed of 18 places in 124 ms of which 0 ms to minimize.
[2024-05-29 00:31:06] [INFO ] Deduced a trap composed of 16 places in 125 ms of which 1 ms to minimize.
[2024-05-29 00:31:06] [INFO ] Trap strengthening (SAT) tested/added 42/41 trap constraints in 8915 ms
[2024-05-29 00:31:06] [INFO ] After 20847ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 1234 ms.
[2024-05-29 00:31:07] [INFO ] After 22404ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
[2024-05-29 00:31:07] [INFO ] Export to MCC of 4 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 5 ms.
[2024-05-29 00:31:07] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1111 places, 1072 transitions and 4919 arcs took 7 ms.
[2024-05-29 00:31:08] [INFO ] Flatten gal took : 181 ms
Total runtime 99847 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT ShieldIIPs-PT-040B
BK_EXAMINATION: ReachabilityFireability
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/373
ReachabilityFireability

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

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

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

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

BK_STOP 1716942671509

--------------------
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/373/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/373/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/373/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:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: LAUNCH task # 22 (type EXCL) for 3 ShieldIIPs-PT-040B-ReachabilityFireability-2024-02
lola: time limit : 899 sec
lola: memory limit: 32 pages
lola: LAUNCH task # 14 (type FNDP) for 6 ShieldIIPs-PT-040B-ReachabilityFireability-2024-13
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 15 (type EQUN) for 6 ShieldIIPs-PT-040B-ReachabilityFireability-2024-13
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 17 (type SRCH) for 6 ShieldIIPs-PT-040B-ReachabilityFireability-2024-13
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: FINISHED task # 17 (type SRCH) for ShieldIIPs-PT-040B-ReachabilityFireability-2024-13
lola: result : true
lola: markings : 135
lola: fired transitions : 134
lola: time used : 0.000000
lola: memory pages used : 1
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: CANCELED task # 14 (type FNDP) for ShieldIIPs-PT-040B-ReachabilityFireability-2024-13 (obsolete)
lola: CANCELED task # 15 (type EQUN) for ShieldIIPs-PT-040B-ReachabilityFireability-2024-13 (obsolete)
lola: LAUNCH task # 12 (type FNDP) for 3 ShieldIIPs-PT-040B-ReachabilityFireability-2024-02
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 13 (type EQUN) for 3 ShieldIIPs-PT-040B-ReachabilityFireability-2024-02
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: LAUNCH task # 21 (type SRCH) for 3 ShieldIIPs-PT-040B-ReachabilityFireability-2024-02
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 # 21 (type SRCH) for ShieldIIPs-PT-040B-ReachabilityFireability-2024-02
lola: result : true
lola: markings : 105
lola: fired transitions : 104
lola: time used : 0.000000
lola: memory pages used : 1
lola: CANCELED task # 12 (type FNDP) for ShieldIIPs-PT-040B-ReachabilityFireability-2024-02 (obsolete)
lola: CANCELED task # 13 (type EQUN) for ShieldIIPs-PT-040B-ReachabilityFireability-2024-02 (obsolete)
lola: CANCELED task # 22 (type EXCL) for ShieldIIPs-PT-040B-ReachabilityFireability-2024-02 (obsolete)
lola: LAUNCH task # 29 (type EXCL) for 9 ShieldIIPs-PT-040B-ReachabilityFireability-2024-14
lola: time limit : 1799 sec
lola: memory limit: 32 pages
lola: LAUNCH task # 25 (type FNDP) for 9 ShieldIIPs-PT-040B-ReachabilityFireability-2024-14
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 26 (type EQUN) for 9 ShieldIIPs-PT-040B-ReachabilityFireability-2024-14
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 28 (type SRCH) for 9 ShieldIIPs-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: FINISHED task # 14 (type FNDP) for ShieldIIPs-PT-040B-ReachabilityFireability-2024-13
lola: result : true
lola: fired transitions : 133
lola: tried executions : 1
lola: time used : 0.000000
lola: memory pages used : 0
lola: FINISHED task # 12 (type FNDP) for ShieldIIPs-PT-040B-ReachabilityFireability-2024-02
lola: result : true
lola: fired transitions : 103
lola: tried executions : 1
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: 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 # 29 (type EXCL) for ShieldIIPs-PT-040B-ReachabilityFireability-2024-14
lola: result : true
lola: markings : 487
lola: fired transitions : 486
lola: time used : 0.000000
lola: memory pages used : 1
lola: CANCELED task # 25 (type FNDP) for ShieldIIPs-PT-040B-ReachabilityFireability-2024-14 (obsolete)
lola: CANCELED task # 26 (type EQUN) for ShieldIIPs-PT-040B-ReachabilityFireability-2024-14 (obsolete)
lola: CANCELED task # 28 (type SRCH) for ShieldIIPs-PT-040B-ReachabilityFireability-2024-14 (obsolete)
lola: LAUNCH task # 36 (type EXCL) for 0 ShieldIIPs-PT-040B-ReachabilityFireability-2024-01
lola: time limit : 3598 sec
lola: memory limit: 32 pages
lola: LAUNCH task # 32 (type FNDP) for 0 ShieldIIPs-PT-040B-ReachabilityFireability-2024-01
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 33 (type EQUN) for 0 ShieldIIPs-PT-040B-ReachabilityFireability-2024-01
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 35 (type SRCH) for 0 ShieldIIPs-PT-040B-ReachabilityFireability-2024-01
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: FINISHED task # 25 (type FNDP) for ShieldIIPs-PT-040B-ReachabilityFireability-2024-14
lola: result : unknown
lola: fired transitions : 23096
lola: tried executions : 779
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 # 32 (type FNDP) for ShieldIIPs-PT-040B-ReachabilityFireability-2024-01
lola: result : true
lola: fired transitions : 132
lola: tried executions : 1
lola: time used : 0.000000
lola: memory pages used : 0
lola: CANCELED task # 33 (type EQUN) for ShieldIIPs-PT-040B-ReachabilityFireability-2024-01 (obsolete)
lola: CANCELED task # 35 (type SRCH) for ShieldIIPs-PT-040B-ReachabilityFireability-2024-01 (obsolete)
lola: CANCELED task # 36 (type EXCL) for ShieldIIPs-PT-040B-ReachabilityFireability-2024-01 (obsolete)
lola: Portfolio finished: no open formulas

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldIIPs-PT-040B-ReachabilityFireability-2024-01: AG false findpath
ShieldIIPs-PT-040B-ReachabilityFireability-2024-02: EF true tandem / insertion
ShieldIIPs-PT-040B-ReachabilityFireability-2024-13: EF true tandem / insertion
ShieldIIPs-PT-040B-ReachabilityFireability-2024-14: AG false tandem / relaxed


Time elapsed: 2 secs. Pages in use: 3

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="ShieldIIPs-PT-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 ShieldIIPs-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-171683788500090"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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