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-171683789300430.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 ShieldPPPt-PT-050B, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r373-tall-171683789300430
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.5M
-rw-r--r-- 1 mcc users 9.7K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 114K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K 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.6K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Apr 23 07:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 23 07:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:32 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 19 19:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 16K Apr 11 14:30 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 170K Apr 11 14:30 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.5K Apr 11 14:30 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 83K Apr 11 14:30 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 23 07:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:54 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 955K 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 ShieldPPPt-PT-050B-ReachabilityFireability-2024-00
FORMULA_NAME ShieldPPPt-PT-050B-ReachabilityFireability-2024-01
FORMULA_NAME ShieldPPPt-PT-050B-ReachabilityFireability-2024-02
FORMULA_NAME ShieldPPPt-PT-050B-ReachabilityFireability-2024-03
FORMULA_NAME ShieldPPPt-PT-050B-ReachabilityFireability-2024-04
FORMULA_NAME ShieldPPPt-PT-050B-ReachabilityFireability-2024-05
FORMULA_NAME ShieldPPPt-PT-050B-ReachabilityFireability-2024-06
FORMULA_NAME ShieldPPPt-PT-050B-ReachabilityFireability-2024-07
FORMULA_NAME ShieldPPPt-PT-050B-ReachabilityFireability-2024-08
FORMULA_NAME ShieldPPPt-PT-050B-ReachabilityFireability-2024-09
FORMULA_NAME ShieldPPPt-PT-050B-ReachabilityFireability-2024-10
FORMULA_NAME ShieldPPPt-PT-050B-ReachabilityFireability-2024-11
FORMULA_NAME ShieldPPPt-PT-050B-ReachabilityFireability-2024-12
FORMULA_NAME ShieldPPPt-PT-050B-ReachabilityFireability-2024-13
FORMULA_NAME ShieldPPPt-PT-050B-ReachabilityFireability-2024-14
FORMULA_NAME ShieldPPPt-PT-050B-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1716991225268

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=ShieldPPPt-PT-050B
Applying reductions before tool lola
Invoking reducer
Running Version 202304061127
[2024-05-29 14:00:27] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-05-29 14:00:27] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-29 14:00:27] [INFO ] Load time of PNML (sax parser for PT used): 185 ms
[2024-05-29 14:00:27] [INFO ] Transformed 3903 places.
[2024-05-29 14:00:27] [INFO ] Transformed 3553 transitions.
[2024-05-29 14:00:27] [INFO ] Found NUPN structural information;
[2024-05-29 14:00:27] [INFO ] Parsed PT model containing 3903 places and 3553 transitions and 8906 arcs in 420 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 14 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 2 resets, run finished after 592 ms. (steps per millisecond=16 ) properties (out of 16) seen :4
FORMULA ShieldPPPt-PT-050B-ReachabilityFireability-2024-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-050B-ReachabilityFireability-2024-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-050B-ReachabilityFireability-2024-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-050B-ReachabilityFireability-2024-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 12) seen :0
Running SMT prover for 12 properties.
// Phase 1: matrix 3553 rows 3903 cols
[2024-05-29 14:00:28] [INFO ] Computed 551 invariants in 45 ms
[2024-05-29 14:00:30] [INFO ] After 1447ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:12
[2024-05-29 14:00:31] [INFO ] [Nat]Absence check using 551 positive place invariants in 245 ms returned sat
[2024-05-29 14:00:37] [INFO ] After 4714ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :12
[2024-05-29 14:00:38] [INFO ] Deduced a trap composed of 18 places in 1258 ms of which 11 ms to minimize.
[2024-05-29 14:00:39] [INFO ] Deduced a trap composed of 22 places in 1192 ms of which 3 ms to minimize.
[2024-05-29 14:00:41] [INFO ] Deduced a trap composed of 17 places in 1151 ms of which 4 ms to minimize.
[2024-05-29 14:00:42] [INFO ] Deduced a trap composed of 25 places in 1185 ms of which 2 ms to minimize.
[2024-05-29 14:00:43] [INFO ] Deduced a trap composed of 27 places in 1176 ms of which 2 ms to minimize.
[2024-05-29 14:00:45] [INFO ] Deduced a trap composed of 31 places in 1121 ms of which 2 ms to minimize.
[2024-05-29 14:00:46] [INFO ] Deduced a trap composed of 18 places in 1105 ms of which 2 ms to minimize.
[2024-05-29 14:00:47] [INFO ] Deduced a trap composed of 21 places in 1115 ms of which 3 ms to minimize.
[2024-05-29 14:00:48] [INFO ] Deduced a trap composed of 23 places in 1114 ms of which 2 ms to minimize.
[2024-05-29 14:00:49] [INFO ] Deduced a trap composed of 23 places in 1123 ms of which 3 ms to minimize.
[2024-05-29 14:00:51] [INFO ] Deduced a trap composed of 29 places in 1084 ms of which 2 ms to minimize.
[2024-05-29 14:00:52] [INFO ] Deduced a trap composed of 24 places in 1111 ms of which 2 ms to minimize.
[2024-05-29 14:00:53] [INFO ] Deduced a trap composed of 30 places in 1059 ms of which 2 ms to minimize.
[2024-05-29 14:00:54] [INFO ] Deduced a trap composed of 22 places in 1009 ms of which 2 ms to minimize.
[2024-05-29 14:00:55] [INFO ] Deduced a trap composed of 24 places in 985 ms of which 2 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java: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 14:00:55] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-29 14:00:55] [INFO ] After 25461ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:12
Fused 12 Parikh solutions to 11 different solutions.
Parikh walk visited 0 properties in 1551 ms.
Support contains 161 out of 3903 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3903/3903 places, 3553/3553 transitions.
Drop transitions removed 821 transitions
Trivial Post-agglo rules discarded 821 transitions
Performed 821 trivial Post agglomeration. Transition count delta: 821
Iterating post reduction 0 with 821 rules applied. Total rules applied 821 place count 3903 transition count 2732
Reduce places removed 821 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 823 rules applied. Total rules applied 1644 place count 3082 transition count 2730
Reduce places removed 1 places and 0 transitions.
Performed 57 Post agglomeration using F-continuation condition.Transition count delta: 57
Iterating post reduction 2 with 58 rules applied. Total rules applied 1702 place count 3081 transition count 2673
Reduce places removed 57 places and 0 transitions.
Iterating post reduction 3 with 57 rules applied. Total rules applied 1759 place count 3024 transition count 2673
Performed 206 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 206 Pre rules applied. Total rules applied 1759 place count 3024 transition count 2467
Deduced a syphon composed of 206 places in 21 ms
Reduce places removed 206 places and 0 transitions.
Iterating global reduction 4 with 412 rules applied. Total rules applied 2171 place count 2818 transition count 2467
Discarding 326 places :
Symmetric choice reduction at 4 with 326 rule applications. Total rules 2497 place count 2492 transition count 2141
Iterating global reduction 4 with 326 rules applied. Total rules applied 2823 place count 2492 transition count 2141
Performed 121 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 121 Pre rules applied. Total rules applied 2823 place count 2492 transition count 2020
Deduced a syphon composed of 121 places in 15 ms
Reduce places removed 121 places and 0 transitions.
Iterating global reduction 4 with 242 rules applied. Total rules applied 3065 place count 2371 transition count 2020
Performed 779 Post agglomeration using F-continuation condition.Transition count delta: 779
Deduced a syphon composed of 779 places in 9 ms
Reduce places removed 779 places and 0 transitions.
Iterating global reduction 4 with 1558 rules applied. Total rules applied 4623 place count 1592 transition count 1241
Renaming transitions due to excessive name length > 1024 char.
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 7 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 4825 place count 1491 transition count 1241
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 15 places in 6 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 4 with 30 rules applied. Total rules applied 4855 place count 1476 transition count 1241
Free-agglomeration rule applied 5 times.
Iterating global reduction 4 with 5 rules applied. Total rules applied 4860 place count 1476 transition count 1236
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 4865 place count 1471 transition count 1236
Partial Free-agglomeration rule applied 137 times.
Drop transitions removed 137 transitions
Iterating global reduction 5 with 137 rules applied. Total rules applied 5002 place count 1471 transition count 1236
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 5003 place count 1471 transition count 1236
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 5004 place count 1470 transition count 1235
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 5005 place count 1469 transition count 1235
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 2 Pre rules applied. Total rules applied 5005 place count 1469 transition count 1233
Deduced a syphon composed of 2 places in 4 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 5009 place count 1467 transition count 1233
Applied a total of 5009 rules in 1448 ms. Remains 1467 /3903 variables (removed 2436) and now considering 1233/3553 (removed 2320) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1450 ms. Remains : 1467/3903 places, 1233/3553 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 379 ms. (steps per millisecond=26 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 12) 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 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 88 ms. (steps per millisecond=113 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 12) seen :0
Interrupted probabilistic random walk after 77441 steps, run timeout after 3001 ms. (steps per millisecond=25 ) properties seen :{}
Probabilistic random walk after 77441 steps, saw 48984 distinct states, run finished after 3004 ms. (steps per millisecond=25 ) properties seen :0
Running SMT prover for 12 properties.
// Phase 1: matrix 1233 rows 1467 cols
[2024-05-29 14:01:03] [INFO ] Computed 550 invariants in 7 ms
[2024-05-29 14:01:03] [INFO ] After 456ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:12
[2024-05-29 14:01:04] [INFO ] [Nat]Absence check using 550 positive place invariants in 113 ms returned sat
[2024-05-29 14:01:06] [INFO ] After 1559ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :12
[2024-05-29 14:01:06] [INFO ] State equation strengthened by 245 read => feed constraints.
[2024-05-29 14:01:08] [INFO ] After 2478ms SMT Verify possible using 245 Read/Feed constraints in natural domain returned unsat :0 sat :12
[2024-05-29 14:01:09] [INFO ] Deduced a trap composed of 5 places in 274 ms of which 0 ms to minimize.
[2024-05-29 14:01:09] [INFO ] Deduced a trap composed of 6 places in 260 ms of which 1 ms to minimize.
[2024-05-29 14:01:09] [INFO ] Deduced a trap composed of 9 places in 267 ms of which 1 ms to minimize.
[2024-05-29 14:01:09] [INFO ] Deduced a trap composed of 9 places in 281 ms of which 1 ms to minimize.
[2024-05-29 14:01:10] [INFO ] Deduced a trap composed of 11 places in 285 ms of which 1 ms to minimize.
[2024-05-29 14:01:10] [INFO ] Deduced a trap composed of 9 places in 277 ms of which 1 ms to minimize.
[2024-05-29 14:01:11] [INFO ] Deduced a trap composed of 6 places in 268 ms of which 1 ms to minimize.
[2024-05-29 14:01:11] [INFO ] Deduced a trap composed of 8 places in 275 ms of which 1 ms to minimize.
[2024-05-29 14:01:11] [INFO ] Deduced a trap composed of 11 places in 275 ms of which 0 ms to minimize.
[2024-05-29 14:01:11] [INFO ] Deduced a trap composed of 13 places in 239 ms of which 1 ms to minimize.
[2024-05-29 14:01:12] [INFO ] Deduced a trap composed of 14 places in 254 ms of which 1 ms to minimize.
[2024-05-29 14:01:12] [INFO ] Deduced a trap composed of 11 places in 270 ms of which 1 ms to minimize.
[2024-05-29 14:01:12] [INFO ] Deduced a trap composed of 12 places in 252 ms of which 1 ms to minimize.
[2024-05-29 14:01:13] [INFO ] Deduced a trap composed of 13 places in 249 ms of which 0 ms to minimize.
[2024-05-29 14:01:13] [INFO ] Deduced a trap composed of 11 places in 263 ms of which 1 ms to minimize.
[2024-05-29 14:01:13] [INFO ] Deduced a trap composed of 11 places in 228 ms of which 1 ms to minimize.
[2024-05-29 14:01:14] [INFO ] Deduced a trap composed of 13 places in 235 ms of which 1 ms to minimize.
[2024-05-29 14:01:14] [INFO ] Trap strengthening (SAT) tested/added 18/17 trap constraints in 5513 ms
[2024-05-29 14:01:14] [INFO ] Deduced a trap composed of 8 places in 231 ms of which 1 ms to minimize.
[2024-05-29 14:01:15] [INFO ] Deduced a trap composed of 7 places in 290 ms of which 2 ms to minimize.
[2024-05-29 14:01:15] [INFO ] Deduced a trap composed of 5 places in 290 ms of which 1 ms to minimize.
[2024-05-29 14:01:15] [INFO ] Deduced a trap composed of 9 places in 278 ms of which 1 ms to minimize.
[2024-05-29 14:01:16] [INFO ] Deduced a trap composed of 14 places in 243 ms of which 1 ms to minimize.
[2024-05-29 14:01:16] [INFO ] Deduced a trap composed of 9 places in 266 ms of which 0 ms to minimize.
[2024-05-29 14:01:16] [INFO ] Deduced a trap composed of 10 places in 250 ms of which 1 ms to minimize.
[2024-05-29 14:01:16] [INFO ] Deduced a trap composed of 12 places in 253 ms of which 2 ms to minimize.
[2024-05-29 14:01:17] [INFO ] Deduced a trap composed of 10 places in 249 ms of which 1 ms to minimize.
[2024-05-29 14:01:17] [INFO ] Deduced a trap composed of 4 places in 250 ms of which 1 ms to minimize.
[2024-05-29 14:01:17] [INFO ] Deduced a trap composed of 10 places in 257 ms of which 0 ms to minimize.
[2024-05-29 14:01:18] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 3606 ms
[2024-05-29 14:01:18] [INFO ] Deduced a trap composed of 9 places in 249 ms of which 1 ms to minimize.
[2024-05-29 14:01:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 354 ms
[2024-05-29 14:01:18] [INFO ] Deduced a trap composed of 12 places in 252 ms of which 0 ms to minimize.
[2024-05-29 14:01:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 353 ms
[2024-05-29 14:01:19] [INFO ] Deduced a trap composed of 8 places in 195 ms of which 0 ms to minimize.
[2024-05-29 14:01:19] [INFO ] Deduced a trap composed of 9 places in 184 ms of which 1 ms to minimize.
[2024-05-29 14:01:20] [INFO ] Deduced a trap composed of 10 places in 187 ms of which 0 ms to minimize.
[2024-05-29 14:01:20] [INFO ] Deduced a trap composed of 12 places in 203 ms of which 1 ms to minimize.
[2024-05-29 14:01:20] [INFO ] Deduced a trap composed of 10 places in 181 ms of which 1 ms to minimize.
[2024-05-29 14:01:20] [INFO ] Deduced a trap composed of 9 places in 177 ms of which 0 ms to minimize.
[2024-05-29 14:01:21] [INFO ] Deduced a trap composed of 8 places in 183 ms of which 0 ms to minimize.
[2024-05-29 14:01:21] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1840 ms
[2024-05-29 14:01:22] [INFO ] Deduced a trap composed of 8 places in 253 ms of which 1 ms to minimize.
[2024-05-29 14:01:22] [INFO ] Deduced a trap composed of 8 places in 281 ms of which 0 ms to minimize.
[2024-05-29 14:01:22] [INFO ] Deduced a trap composed of 8 places in 283 ms of which 1 ms to minimize.
[2024-05-29 14:01:23] [INFO ] Deduced a trap composed of 5 places in 280 ms of which 2 ms to minimize.
[2024-05-29 14:01:23] [INFO ] Deduced a trap composed of 10 places in 273 ms of which 1 ms to minimize.
[2024-05-29 14:01:23] [INFO ] Deduced a trap composed of 11 places in 270 ms of which 1 ms to minimize.
[2024-05-29 14:01:24] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 2055 ms
[2024-05-29 14:01:24] [INFO ] Deduced a trap composed of 5 places in 259 ms of which 0 ms to minimize.
[2024-05-29 14:01:25] [INFO ] Deduced a trap composed of 10 places in 266 ms of which 1 ms to minimize.
[2024-05-29 14:01:25] [INFO ] Deduced a trap composed of 9 places in 265 ms of which 1 ms to minimize.
[2024-05-29 14:01:25] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1138 ms
[2024-05-29 14:01:25] [INFO ] Deduced a trap composed of 9 places in 276 ms of which 1 ms to minimize.
[2024-05-29 14:01:26] [INFO ] Deduced a trap composed of 9 places in 272 ms of which 1 ms to minimize.
[2024-05-29 14:01:26] [INFO ] Deduced a trap composed of 8 places in 264 ms of which 1 ms to minimize.
[2024-05-29 14:01:26] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1039 ms
[2024-05-29 14:01:27] [INFO ] Deduced a trap composed of 9 places in 267 ms of which 3 ms to minimize.
[2024-05-29 14:01:27] [INFO ] Deduced a trap composed of 8 places in 266 ms of which 1 ms to minimize.
[2024-05-29 14:01:27] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 708 ms
[2024-05-29 14:01:27] [INFO ] After 21334ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :12
Attempting to minimize the solution found.
Minimization took 1251 ms.
[2024-05-29 14:01:28] [INFO ] After 25024ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :11
Parikh walk visited 0 properties in 284 ms.
Support contains 161 out of 1467 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1467/1467 places, 1233/1233 transitions.
Applied a total of 0 rules in 38 ms. Remains 1467 /1467 variables (removed 0) and now considering 1233/1233 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 39 ms. Remains : 1467/1467 places, 1233/1233 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1467/1467 places, 1233/1233 transitions.
Applied a total of 0 rules in 36 ms. Remains 1467 /1467 variables (removed 0) and now considering 1233/1233 (removed 0) transitions.
[2024-05-29 14:01:29] [INFO ] Invariant cache hit.
[2024-05-29 14:01:29] [INFO ] Implicit Places using invariants in 847 ms returned [1447, 1451]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 851 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 1465/1467 places, 1233/1233 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 1463 transition count 1231
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 1463 transition count 1231
Applied a total of 4 rules in 69 ms. Remains 1463 /1465 variables (removed 2) and now considering 1231/1233 (removed 2) transitions.
// Phase 1: matrix 1231 rows 1463 cols
[2024-05-29 14:01:30] [INFO ] Computed 548 invariants in 8 ms
[2024-05-29 14:01:30] [INFO ] Implicit Places using invariants in 763 ms returned []
[2024-05-29 14:01:30] [INFO ] Invariant cache hit.
[2024-05-29 14:01:31] [INFO ] State equation strengthened by 243 read => feed constraints.
[2024-05-29 14:01:35] [INFO ] Implicit Places using invariants and state equation in 4855 ms returned []
Implicit Place search using SMT with State Equation took 5623 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 1463/1467 places, 1231/1233 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 6583 ms. Remains : 1463/1467 places, 1231/1233 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 362 ms. (steps per millisecond=27 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 12) seen :1
FORMULA ShieldPPPt-PT-050B-ReachabilityFireability-2024-13 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 11) seen :0
Interrupted probabilistic random walk after 79916 steps, run timeout after 3001 ms. (steps per millisecond=26 ) properties seen :{}
Probabilistic random walk after 79916 steps, saw 49935 distinct states, run finished after 3001 ms. (steps per millisecond=26 ) properties seen :0
Running SMT prover for 11 properties.
[2024-05-29 14:01:39] [INFO ] Invariant cache hit.
[2024-05-29 14:01:40] [INFO ] After 455ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:11
[2024-05-29 14:01:40] [INFO ] [Nat]Absence check using 548 positive place invariants in 114 ms returned sat
[2024-05-29 14:01:42] [INFO ] After 1430ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :11
[2024-05-29 14:01:42] [INFO ] State equation strengthened by 243 read => feed constraints.
[2024-05-29 14:01:45] [INFO ] After 2472ms SMT Verify possible using 243 Read/Feed constraints in natural domain returned unsat :0 sat :11
[2024-05-29 14:01:45] [INFO ] Deduced a trap composed of 9 places in 273 ms of which 3 ms to minimize.
[2024-05-29 14:01:45] [INFO ] Deduced a trap composed of 8 places in 282 ms of which 1 ms to minimize.
[2024-05-29 14:01:46] [INFO ] Deduced a trap composed of 9 places in 263 ms of which 1 ms to minimize.
[2024-05-29 14:01:46] [INFO ] Deduced a trap composed of 5 places in 271 ms of which 1 ms to minimize.
[2024-05-29 14:01:46] [INFO ] Deduced a trap composed of 5 places in 251 ms of which 0 ms to minimize.
[2024-05-29 14:01:47] [INFO ] Deduced a trap composed of 10 places in 267 ms of which 1 ms to minimize.
[2024-05-29 14:01:47] [INFO ] Deduced a trap composed of 8 places in 270 ms of which 1 ms to minimize.
[2024-05-29 14:01:47] [INFO ] Deduced a trap composed of 5 places in 258 ms of which 0 ms to minimize.
[2024-05-29 14:01:47] [INFO ] Deduced a trap composed of 7 places in 222 ms of which 1 ms to minimize.
[2024-05-29 14:01:48] [INFO ] Deduced a trap composed of 9 places in 257 ms of which 1 ms to minimize.
[2024-05-29 14:01:48] [INFO ] Deduced a trap composed of 9 places in 246 ms of which 0 ms to minimize.
[2024-05-29 14:01:48] [INFO ] Deduced a trap composed of 9 places in 247 ms of which 1 ms to minimize.
[2024-05-29 14:01:49] [INFO ] Deduced a trap composed of 5 places in 256 ms of which 0 ms to minimize.
[2024-05-29 14:01:49] [INFO ] Deduced a trap composed of 9 places in 246 ms of which 0 ms to minimize.
[2024-05-29 14:01:49] [INFO ] Deduced a trap composed of 11 places in 251 ms of which 1 ms to minimize.
[2024-05-29 14:01:50] [INFO ] Deduced a trap composed of 12 places in 247 ms of which 1 ms to minimize.
[2024-05-29 14:01:50] [INFO ] Trap strengthening (SAT) tested/added 17/16 trap constraints in 5107 ms
[2024-05-29 14:01:50] [INFO ] Deduced a trap composed of 9 places in 285 ms of which 1 ms to minimize.
[2024-05-29 14:01:51] [INFO ] Deduced a trap composed of 4 places in 287 ms of which 1 ms to minimize.
[2024-05-29 14:01:51] [INFO ] Deduced a trap composed of 9 places in 263 ms of which 1 ms to minimize.
[2024-05-29 14:01:51] [INFO ] Deduced a trap composed of 10 places in 258 ms of which 0 ms to minimize.
[2024-05-29 14:01:52] [INFO ] Deduced a trap composed of 12 places in 223 ms of which 1 ms to minimize.
[2024-05-29 14:01:52] [INFO ] Deduced a trap composed of 9 places in 268 ms of which 1 ms to minimize.
[2024-05-29 14:01:52] [INFO ] Deduced a trap composed of 11 places in 261 ms of which 1 ms to minimize.
[2024-05-29 14:01:52] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 2346 ms
[2024-05-29 14:01:53] [INFO ] Deduced a trap composed of 11 places in 287 ms of which 1 ms to minimize.
[2024-05-29 14:01:53] [INFO ] Deduced a trap composed of 15 places in 267 ms of which 1 ms to minimize.
[2024-05-29 14:01:53] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 714 ms
[2024-05-29 14:01:54] [INFO ] Deduced a trap composed of 10 places in 240 ms of which 0 ms to minimize.
[2024-05-29 14:01:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 348 ms
[2024-05-29 14:01:54] [INFO ] Deduced a trap composed of 8 places in 238 ms of which 1 ms to minimize.
[2024-05-29 14:01:55] [INFO ] Deduced a trap composed of 7 places in 240 ms of which 0 ms to minimize.
[2024-05-29 14:01:55] [INFO ] Deduced a trap composed of 12 places in 235 ms of which 0 ms to minimize.
[2024-05-29 14:01:55] [INFO ] Deduced a trap composed of 9 places in 236 ms of which 1 ms to minimize.
[2024-05-29 14:01:55] [INFO ] Deduced a trap composed of 10 places in 228 ms of which 1 ms to minimize.
[2024-05-29 14:01:56] [INFO ] Deduced a trap composed of 11 places in 236 ms of which 1 ms to minimize.
[2024-05-29 14:01:56] [INFO ] Deduced a trap composed of 3 places in 230 ms of which 1 ms to minimize.
[2024-05-29 14:01:56] [INFO ] Deduced a trap composed of 15 places in 232 ms of which 1 ms to minimize.
[2024-05-29 14:01:57] [INFO ] Deduced a trap composed of 9 places in 233 ms of which 0 ms to minimize.
[2024-05-29 14:01:57] [INFO ] Deduced a trap composed of 8 places in 235 ms of which 1 ms to minimize.
[2024-05-29 14:01:57] [INFO ] Deduced a trap composed of 10 places in 223 ms of which 0 ms to minimize.
[2024-05-29 14:01:57] [INFO ] Deduced a trap composed of 14 places in 222 ms of which 1 ms to minimize.
[2024-05-29 14:01:58] [INFO ] Deduced a trap composed of 9 places in 227 ms of which 0 ms to minimize.
[2024-05-29 14:01:58] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 3875 ms
[2024-05-29 14:01:59] [INFO ] Deduced a trap composed of 8 places in 263 ms of which 1 ms to minimize.
[2024-05-29 14:02:00] [INFO ] Deduced a trap composed of 15 places in 278 ms of which 0 ms to minimize.
[2024-05-29 14:02:00] [INFO ] Deduced a trap composed of 10 places in 277 ms of which 0 ms to minimize.
[2024-05-29 14:02:00] [INFO ] Deduced a trap composed of 8 places in 239 ms of which 1 ms to minimize.
[2024-05-29 14:02:01] [INFO ] Deduced a trap composed of 8 places in 240 ms of which 0 ms to minimize.
[2024-05-29 14:02:01] [INFO ] Deduced a trap composed of 8 places in 271 ms of which 1 ms to minimize.
[2024-05-29 14:02:01] [INFO ] Deduced a trap composed of 9 places in 269 ms of which 0 ms to minimize.
[2024-05-29 14:02:02] [INFO ] Deduced a trap composed of 13 places in 276 ms of which 1 ms to minimize.
[2024-05-29 14:02:02] [INFO ] Deduced a trap composed of 11 places in 265 ms of which 0 ms to minimize.
[2024-05-29 14:02:02] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 3091 ms
[2024-05-29 14:02:02] [INFO ] Deduced a trap composed of 8 places in 267 ms of which 0 ms to minimize.
[2024-05-29 14:02:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 373 ms
[2024-05-29 14:02:03] [INFO ] Deduced a trap composed of 8 places in 275 ms of which 1 ms to minimize.
[2024-05-29 14:02:03] [INFO ] Deduced a trap composed of 10 places in 255 ms of which 1 ms to minimize.
[2024-05-29 14:02:04] [INFO ] Deduced a trap composed of 11 places in 274 ms of which 1 ms to minimize.
[2024-05-29 14:02:04] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1030 ms
[2024-05-29 14:02:04] [INFO ] After 21650ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :11
Attempting to minimize the solution found.
Minimization took 1114 ms.
[2024-05-29 14:02:05] [INFO ] After 25017ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :10
Parikh walk visited 0 properties in 196 ms.
Support contains 140 out of 1463 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1463/1463 places, 1231/1231 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 1463 transition count 1229
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 1461 transition count 1229
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 7 Pre rules applied. Total rules applied 4 place count 1461 transition count 1222
Deduced a syphon composed of 7 places in 2 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 18 place count 1454 transition count 1222
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 19 place count 1453 transition count 1221
Iterating global reduction 2 with 1 rules applied. Total rules applied 20 place count 1453 transition count 1221
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 2 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 52 place count 1437 transition count 1205
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 58 place count 1434 transition count 1205
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 59 place count 1434 transition count 1205
Applied a total of 59 rules in 194 ms. Remains 1434 /1463 variables (removed 29) and now considering 1205/1231 (removed 26) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 195 ms. Remains : 1434/1463 places, 1205/1231 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 334 ms. (steps per millisecond=29 ) properties (out of 11) seen :1
FORMULA ShieldPPPt-PT-050B-ReachabilityFireability-2024-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 90 ms. (steps per millisecond=111 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 10) seen :0
Interrupted probabilistic random walk after 79847 steps, run timeout after 3001 ms. (steps per millisecond=26 ) properties seen :{}
Probabilistic random walk after 79847 steps, saw 48957 distinct states, run finished after 3004 ms. (steps per millisecond=26 ) properties seen :0
Running SMT prover for 10 properties.
// Phase 1: matrix 1205 rows 1434 cols
[2024-05-29 14:02:09] [INFO ] Computed 548 invariants in 8 ms
[2024-05-29 14:02:10] [INFO ] After 429ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:10
[2024-05-29 14:02:10] [INFO ] [Nat]Absence check using 548 positive place invariants in 112 ms returned sat
[2024-05-29 14:02:12] [INFO ] After 1507ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :10
[2024-05-29 14:02:12] [INFO ] State equation strengthened by 249 read => feed constraints.
[2024-05-29 14:02:14] [INFO ] After 1808ms SMT Verify possible using 249 Read/Feed constraints in natural domain returned unsat :0 sat :10
[2024-05-29 14:02:14] [INFO ] Deduced a trap composed of 5 places in 172 ms of which 0 ms to minimize.
[2024-05-29 14:02:15] [INFO ] Deduced a trap composed of 6 places in 205 ms of which 1 ms to minimize.
[2024-05-29 14:02:15] [INFO ] Deduced a trap composed of 7 places in 185 ms of which 1 ms to minimize.
[2024-05-29 14:02:15] [INFO ] Deduced a trap composed of 8 places in 185 ms of which 1 ms to minimize.
[2024-05-29 14:02:15] [INFO ] Deduced a trap composed of 7 places in 174 ms of which 0 ms to minimize.
[2024-05-29 14:02:15] [INFO ] Deduced a trap composed of 8 places in 173 ms of which 0 ms to minimize.
[2024-05-29 14:02:16] [INFO ] Deduced a trap composed of 8 places in 165 ms of which 0 ms to minimize.
[2024-05-29 14:02:16] [INFO ] Deduced a trap composed of 9 places in 167 ms of which 0 ms to minimize.
[2024-05-29 14:02:16] [INFO ] Deduced a trap composed of 8 places in 158 ms of which 1 ms to minimize.
[2024-05-29 14:02:16] [INFO ] Deduced a trap composed of 8 places in 201 ms of which 1 ms to minimize.
[2024-05-29 14:02:17] [INFO ] Deduced a trap composed of 10 places in 193 ms of which 0 ms to minimize.
[2024-05-29 14:02:17] [INFO ] Deduced a trap composed of 11 places in 180 ms of which 1 ms to minimize.
[2024-05-29 14:02:17] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 2880 ms
[2024-05-29 14:02:17] [INFO ] Deduced a trap composed of 10 places in 195 ms of which 1 ms to minimize.
[2024-05-29 14:02:18] [INFO ] Deduced a trap composed of 4 places in 190 ms of which 0 ms to minimize.
[2024-05-29 14:02:18] [INFO ] Deduced a trap composed of 10 places in 181 ms of which 1 ms to minimize.
[2024-05-29 14:02:18] [INFO ] Deduced a trap composed of 12 places in 185 ms of which 1 ms to minimize.
[2024-05-29 14:02:18] [INFO ] Deduced a trap composed of 8 places in 189 ms of which 0 ms to minimize.
[2024-05-29 14:02:19] [INFO ] Deduced a trap composed of 13 places in 181 ms of which 1 ms to minimize.
[2024-05-29 14:02:19] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1577 ms
[2024-05-29 14:02:19] [INFO ] Deduced a trap composed of 12 places in 175 ms of which 1 ms to minimize.
[2024-05-29 14:02:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 264 ms
[2024-05-29 14:02:20] [INFO ] Deduced a trap composed of 3 places in 175 ms of which 1 ms to minimize.
[2024-05-29 14:02:20] [INFO ] Deduced a trap composed of 5 places in 143 ms of which 1 ms to minimize.
[2024-05-29 14:02:20] [INFO ] Deduced a trap composed of 5 places in 174 ms of which 2 ms to minimize.
[2024-05-29 14:02:20] [INFO ] Deduced a trap composed of 8 places in 153 ms of which 1 ms to minimize.
[2024-05-29 14:02:21] [INFO ] Deduced a trap composed of 8 places in 139 ms of which 0 ms to minimize.
[2024-05-29 14:02:21] [INFO ] Deduced a trap composed of 11 places in 150 ms of which 1 ms to minimize.
[2024-05-29 14:02:21] [INFO ] Deduced a trap composed of 9 places in 150 ms of which 1 ms to minimize.
[2024-05-29 14:02:21] [INFO ] Deduced a trap composed of 9 places in 153 ms of which 1 ms to minimize.
[2024-05-29 14:02:21] [INFO ] Deduced a trap composed of 14 places in 137 ms of which 0 ms to minimize.
[2024-05-29 14:02:22] [INFO ] Deduced a trap composed of 11 places in 131 ms of which 1 ms to minimize.
[2024-05-29 14:02:22] [INFO ] Deduced a trap composed of 10 places in 143 ms of which 1 ms to minimize.
[2024-05-29 14:02:22] [INFO ] Deduced a trap composed of 11 places in 140 ms of which 0 ms to minimize.
[2024-05-29 14:02:22] [INFO ] Deduced a trap composed of 9 places in 146 ms of which 1 ms to minimize.
[2024-05-29 14:02:22] [INFO ] Deduced a trap composed of 9 places in 140 ms of which 0 ms to minimize.
[2024-05-29 14:02:23] [INFO ] Deduced a trap composed of 12 places in 137 ms of which 0 ms to minimize.
[2024-05-29 14:02:23] [INFO ] Trap strengthening (SAT) tested/added 16/15 trap constraints in 3207 ms
[2024-05-29 14:02:23] [INFO ] Deduced a trap composed of 9 places in 103 ms of which 1 ms to minimize.
[2024-05-29 14:02:23] [INFO ] Deduced a trap composed of 9 places in 116 ms of which 0 ms to minimize.
[2024-05-29 14:02:23] [INFO ] Deduced a trap composed of 7 places in 106 ms of which 0 ms to minimize.
[2024-05-29 14:02:24] [INFO ] Deduced a trap composed of 11 places in 99 ms of which 1 ms to minimize.
[2024-05-29 14:02:24] [INFO ] Deduced a trap composed of 4 places in 96 ms of which 1 ms to minimize.
[2024-05-29 14:02:24] [INFO ] Deduced a trap composed of 8 places in 99 ms of which 0 ms to minimize.
[2024-05-29 14:02:24] [INFO ] Deduced a trap composed of 14 places in 106 ms of which 1 ms to minimize.
[2024-05-29 14:02:24] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1153 ms
[2024-05-29 14:02:24] [INFO ] Deduced a trap composed of 5 places in 123 ms of which 0 ms to minimize.
[2024-05-29 14:02:25] [INFO ] Deduced a trap composed of 8 places in 127 ms of which 1 ms to minimize.
[2024-05-29 14:02:25] [INFO ] Deduced a trap composed of 11 places in 135 ms of which 1 ms to minimize.
[2024-05-29 14:02:25] [INFO ] Deduced a trap composed of 12 places in 129 ms of which 1 ms to minimize.
[2024-05-29 14:02:25] [INFO ] Deduced a trap composed of 10 places in 145 ms of which 1 ms to minimize.
[2024-05-29 14:02:25] [INFO ] Deduced a trap composed of 7 places in 140 ms of which 1 ms to minimize.
[2024-05-29 14:02:26] [INFO ] Deduced a trap composed of 10 places in 147 ms of which 0 ms to minimize.
[2024-05-29 14:02:26] [INFO ] Deduced a trap composed of 10 places in 140 ms of which 0 ms to minimize.
[2024-05-29 14:02:26] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 1644 ms
[2024-05-29 14:02:27] [INFO ] Deduced a trap composed of 10 places in 279 ms of which 1 ms to minimize.
[2024-05-29 14:02:27] [INFO ] Deduced a trap composed of 12 places in 294 ms of which 1 ms to minimize.
[2024-05-29 14:02:27] [INFO ] Deduced a trap composed of 15 places in 284 ms of which 1 ms to minimize.
[2024-05-29 14:02:28] [INFO ] Deduced a trap composed of 7 places in 289 ms of which 1 ms to minimize.
[2024-05-29 14:02:28] [INFO ] Deduced a trap composed of 10 places in 283 ms of which 1 ms to minimize.
[2024-05-29 14:02:28] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1750 ms
[2024-05-29 14:02:28] [INFO ] After 15967ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :10
Attempting to minimize the solution found.
Minimization took 2222 ms.
[2024-05-29 14:02:30] [INFO ] After 20487ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :10
Parikh walk visited 0 properties in 134 ms.
Support contains 139 out of 1434 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1434/1434 places, 1205/1205 transitions.
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 2 place count 1433 transition count 1204
Applied a total of 2 rules in 66 ms. Remains 1433 /1434 variables (removed 1) and now considering 1204/1205 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 67 ms. Remains : 1433/1434 places, 1204/1205 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 313 ms. (steps per millisecond=31 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 116 ms. (steps per millisecond=86 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 10) 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 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 90 ms. (steps per millisecond=111 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 73 ms. (steps per millisecond=136 ) properties (out of 10) seen :0
Interrupted probabilistic random walk after 91498 steps, run timeout after 3001 ms. (steps per millisecond=30 ) properties seen :{}
Probabilistic random walk after 91498 steps, saw 56081 distinct states, run finished after 3001 ms. (steps per millisecond=30 ) properties seen :0
Running SMT prover for 10 properties.
// Phase 1: matrix 1204 rows 1433 cols
[2024-05-29 14:02:35] [INFO ] Computed 548 invariants in 5 ms
[2024-05-29 14:02:35] [INFO ] After 415ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:10
[2024-05-29 14:02:36] [INFO ] [Nat]Absence check using 548 positive place invariants in 103 ms returned sat
[2024-05-29 14:02:37] [INFO ] After 1332ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :10
[2024-05-29 14:02:37] [INFO ] State equation strengthened by 249 read => feed constraints.
[2024-05-29 14:02:39] [INFO ] After 1917ms SMT Verify possible using 249 Read/Feed constraints in natural domain returned unsat :0 sat :10
[2024-05-29 14:02:39] [INFO ] Deduced a trap composed of 5 places in 197 ms of which 1 ms to minimize.
[2024-05-29 14:02:40] [INFO ] Deduced a trap composed of 5 places in 199 ms of which 1 ms to minimize.
[2024-05-29 14:02:40] [INFO ] Deduced a trap composed of 7 places in 197 ms of which 1 ms to minimize.
[2024-05-29 14:02:40] [INFO ] Deduced a trap composed of 9 places in 193 ms of which 1 ms to minimize.
[2024-05-29 14:02:40] [INFO ] Deduced a trap composed of 6 places in 187 ms of which 1 ms to minimize.
[2024-05-29 14:02:41] [INFO ] Deduced a trap composed of 6 places in 190 ms of which 0 ms to minimize.
[2024-05-29 14:02:41] [INFO ] Deduced a trap composed of 8 places in 190 ms of which 0 ms to minimize.
[2024-05-29 14:02:41] [INFO ] Deduced a trap composed of 11 places in 185 ms of which 0 ms to minimize.
[2024-05-29 14:02:41] [INFO ] Deduced a trap composed of 8 places in 187 ms of which 1 ms to minimize.
[2024-05-29 14:02:42] [INFO ] Deduced a trap composed of 5 places in 179 ms of which 1 ms to minimize.
[2024-05-29 14:02:42] [INFO ] Deduced a trap composed of 11 places in 191 ms of which 0 ms to minimize.
[2024-05-29 14:02:42] [INFO ] Deduced a trap composed of 8 places in 196 ms of which 0 ms to minimize.
[2024-05-29 14:02:42] [INFO ] Deduced a trap composed of 11 places in 188 ms of which 1 ms to minimize.
[2024-05-29 14:02:43] [INFO ] Deduced a trap composed of 7 places in 182 ms of which 0 ms to minimize.
[2024-05-29 14:02:43] [INFO ] Deduced a trap composed of 9 places in 186 ms of which 1 ms to minimize.
[2024-05-29 14:02:43] [INFO ] Deduced a trap composed of 5 places in 190 ms of which 1 ms to minimize.
[2024-05-29 14:02:43] [INFO ] Deduced a trap composed of 9 places in 180 ms of which 1 ms to minimize.
[2024-05-29 14:02:43] [INFO ] Deduced a trap composed of 8 places in 185 ms of which 0 ms to minimize.
[2024-05-29 14:02:44] [INFO ] Trap strengthening (SAT) tested/added 19/18 trap constraints in 4413 ms
[2024-05-29 14:02:44] [INFO ] Deduced a trap composed of 8 places in 177 ms of which 1 ms to minimize.
[2024-05-29 14:02:44] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 281 ms
[2024-05-29 14:02:44] [INFO ] Deduced a trap composed of 11 places in 195 ms of which 1 ms to minimize.
[2024-05-29 14:02:44] [INFO ] Deduced a trap composed of 8 places in 201 ms of which 0 ms to minimize.
[2024-05-29 14:02:45] [INFO ] Deduced a trap composed of 9 places in 175 ms of which 0 ms to minimize.
[2024-05-29 14:02:45] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 780 ms
[2024-05-29 14:02:45] [INFO ] Deduced a trap composed of 11 places in 208 ms of which 0 ms to minimize.
[2024-05-29 14:02:45] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 310 ms
[2024-05-29 14:02:46] [INFO ] Deduced a trap composed of 9 places in 151 ms of which 1 ms to minimize.
[2024-05-29 14:02:46] [INFO ] Deduced a trap composed of 8 places in 129 ms of which 1 ms to minimize.
[2024-05-29 14:02:46] [INFO ] Deduced a trap composed of 13 places in 149 ms of which 1 ms to minimize.
[2024-05-29 14:02:46] [INFO ] Deduced a trap composed of 16 places in 161 ms of which 0 ms to minimize.
[2024-05-29 14:02:47] [INFO ] Deduced a trap composed of 11 places in 151 ms of which 0 ms to minimize.
[2024-05-29 14:02:47] [INFO ] Deduced a trap composed of 15 places in 155 ms of which 0 ms to minimize.
[2024-05-29 14:02:47] [INFO ] Deduced a trap composed of 11 places in 150 ms of which 1 ms to minimize.
[2024-05-29 14:02:47] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1524 ms
[2024-05-29 14:02:48] [INFO ] Deduced a trap composed of 5 places in 122 ms of which 1 ms to minimize.
[2024-05-29 14:02:48] [INFO ] Deduced a trap composed of 11 places in 92 ms of which 1 ms to minimize.
[2024-05-29 14:02:48] [INFO ] Deduced a trap composed of 4 places in 104 ms of which 1 ms to minimize.
[2024-05-29 14:02:48] [INFO ] Deduced a trap composed of 8 places in 89 ms of which 0 ms to minimize.
[2024-05-29 14:02:48] [INFO ] Deduced a trap composed of 13 places in 93 ms of which 0 ms to minimize.
[2024-05-29 14:02:48] [INFO ] Deduced a trap composed of 6 places in 99 ms of which 1 ms to minimize.
[2024-05-29 14:02:48] [INFO ] Deduced a trap composed of 9 places in 93 ms of which 0 ms to minimize.
[2024-05-29 14:02:49] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1201 ms
[2024-05-29 14:02:49] [INFO ] Deduced a trap composed of 7 places in 268 ms of which 0 ms to minimize.
[2024-05-29 14:02:50] [INFO ] Deduced a trap composed of 7 places in 262 ms of which 1 ms to minimize.
[2024-05-29 14:02:50] [INFO ] Deduced a trap composed of 7 places in 284 ms of which 1 ms to minimize.
[2024-05-29 14:02:50] [INFO ] Deduced a trap composed of 8 places in 271 ms of which 0 ms to minimize.
[2024-05-29 14:02:51] [INFO ] Deduced a trap composed of 8 places in 257 ms of which 1 ms to minimize.
[2024-05-29 14:02:51] [INFO ] Deduced a trap composed of 11 places in 278 ms of which 0 ms to minimize.
[2024-05-29 14:02:51] [INFO ] Deduced a trap composed of 8 places in 264 ms of which 1 ms to minimize.
[2024-05-29 14:02:52] [INFO ] Deduced a trap composed of 12 places in 260 ms of which 1 ms to minimize.
[2024-05-29 14:02:52] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 2631 ms
[2024-05-29 14:02:52] [INFO ] Deduced a trap composed of 7 places in 259 ms of which 1 ms to minimize.
[2024-05-29 14:02:52] [INFO ] Deduced a trap composed of 10 places in 248 ms of which 0 ms to minimize.
[2024-05-29 14:02:53] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 678 ms
[2024-05-29 14:02:53] [INFO ] After 15432ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :10
Attempting to minimize the solution found.
Minimization took 2167 ms.
[2024-05-29 14:02:55] [INFO ] After 19641ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :10
Parikh walk visited 0 properties in 252 ms.
Support contains 139 out of 1433 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1433/1433 places, 1204/1204 transitions.
Applied a total of 0 rules in 49 ms. Remains 1433 /1433 variables (removed 0) and now considering 1204/1204 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 49 ms. Remains : 1433/1433 places, 1204/1204 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1433/1433 places, 1204/1204 transitions.
Applied a total of 0 rules in 39 ms. Remains 1433 /1433 variables (removed 0) and now considering 1204/1204 (removed 0) transitions.
[2024-05-29 14:02:55] [INFO ] Invariant cache hit.
[2024-05-29 14:02:56] [INFO ] Implicit Places using invariants in 1036 ms returned []
[2024-05-29 14:02:56] [INFO ] Invariant cache hit.
[2024-05-29 14:02:57] [INFO ] State equation strengthened by 249 read => feed constraints.
[2024-05-29 14:03:01] [INFO ] Implicit Places using invariants and state equation in 5244 ms returned []
Implicit Place search using SMT with State Equation took 6310 ms to find 0 implicit places.
[2024-05-29 14:03:01] [INFO ] Redundant transitions in 76 ms returned []
[2024-05-29 14:03:01] [INFO ] Invariant cache hit.
[2024-05-29 14:03:02] [INFO ] Dead Transitions using invariants and state equation in 802 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7243 ms. Remains : 1433/1433 places, 1204/1204 transitions.
Partial Free-agglomeration rule applied 245 times.
Drop transitions removed 245 transitions
Iterating global reduction 0 with 245 rules applied. Total rules applied 245 place count 1433 transition count 1204
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 246 place count 1433 transition count 1203
Applied a total of 246 rules in 133 ms. Remains 1433 /1433 variables (removed 0) and now considering 1203/1204 (removed 1) transitions.
Running SMT prover for 10 properties.
// Phase 1: matrix 1203 rows 1433 cols
[2024-05-29 14:03:02] [INFO ] Computed 548 invariants in 4 ms
[2024-05-29 14:03:03] [INFO ] After 522ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:10
[2024-05-29 14:03:03] [INFO ] [Nat]Absence check using 548 positive place invariants in 102 ms returned sat
[2024-05-29 14:03:05] [INFO ] After 1326ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :10
[2024-05-29 14:03:05] [INFO ] State equation strengthened by 217 read => feed constraints.
[2024-05-29 14:03:09] [INFO ] After 4340ms SMT Verify possible using 217 Read/Feed constraints in natural domain returned unsat :0 sat :10
[2024-05-29 14:03:10] [INFO ] Deduced a trap composed of 5 places in 358 ms of which 1 ms to minimize.
[2024-05-29 14:03:10] [INFO ] Deduced a trap composed of 10 places in 344 ms of which 0 ms to minimize.
[2024-05-29 14:03:11] [INFO ] Deduced a trap composed of 11 places in 358 ms of which 1 ms to minimize.
[2024-05-29 14:03:11] [INFO ] Deduced a trap composed of 7 places in 360 ms of which 0 ms to minimize.
[2024-05-29 14:03:12] [INFO ] Deduced a trap composed of 12 places in 333 ms of which 1 ms to minimize.
[2024-05-29 14:03:12] [INFO ] Deduced a trap composed of 17 places in 334 ms of which 1 ms to minimize.
[2024-05-29 14:03:12] [INFO ] Deduced a trap composed of 8 places in 347 ms of which 1 ms to minimize.
[2024-05-29 14:03:13] [INFO ] Deduced a trap composed of 11 places in 313 ms of which 1 ms to minimize.
[2024-05-29 14:03:13] [INFO ] Deduced a trap composed of 10 places in 293 ms of which 1 ms to minimize.
[2024-05-29 14:03:13] [INFO ] Deduced a trap composed of 12 places in 322 ms of which 1 ms to minimize.
[2024-05-29 14:03:14] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 4007 ms
[2024-05-29 14:03:14] [INFO ] Deduced a trap composed of 5 places in 294 ms of which 1 ms to minimize.
[2024-05-29 14:03:15] [INFO ] Deduced a trap composed of 11 places in 332 ms of which 0 ms to minimize.
[2024-05-29 14:03:15] [INFO ] Deduced a trap composed of 8 places in 302 ms of which 1 ms to minimize.
[2024-05-29 14:03:15] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1150 ms
[2024-05-29 14:03:16] [INFO ] Deduced a trap composed of 9 places in 322 ms of which 1 ms to minimize.
[2024-05-29 14:03:16] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 416 ms
[2024-05-29 14:03:16] [INFO ] Deduced a trap composed of 8 places in 302 ms of which 1 ms to minimize.
[2024-05-29 14:03:16] [INFO ] Deduced a trap composed of 8 places in 308 ms of which 0 ms to minimize.
[2024-05-29 14:03:17] [INFO ] Deduced a trap composed of 12 places in 303 ms of which 1 ms to minimize.
[2024-05-29 14:03:17] [INFO ] Deduced a trap composed of 11 places in 296 ms of which 1 ms to minimize.
[2024-05-29 14:03:18] [INFO ] Deduced a trap composed of 9 places in 311 ms of which 1 ms to minimize.
[2024-05-29 14:03:18] [INFO ] Deduced a trap composed of 12 places in 300 ms of which 1 ms to minimize.
[2024-05-29 14:03:18] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 2201 ms
[2024-05-29 14:03:19] [INFO ] Deduced a trap composed of 9 places in 281 ms of which 1 ms to minimize.
[2024-05-29 14:03:20] [INFO ] Deduced a trap composed of 8 places in 305 ms of which 1 ms to minimize.
[2024-05-29 14:03:20] [INFO ] Deduced a trap composed of 8 places in 365 ms of which 1 ms to minimize.
[2024-05-29 14:03:20] [INFO ] Deduced a trap composed of 10 places in 299 ms of which 1 ms to minimize.
[2024-05-29 14:03:21] [INFO ] Deduced a trap composed of 4 places in 296 ms of which 1 ms to minimize.
[2024-05-29 14:03:21] [INFO ] Deduced a trap composed of 8 places in 307 ms of which 4 ms to minimize.
[2024-05-29 14:03:22] [INFO ] Deduced a trap composed of 7 places in 301 ms of which 1 ms to minimize.
[2024-05-29 14:03:22] [INFO ] Deduced a trap composed of 10 places in 288 ms of which 5 ms to minimize.
[2024-05-29 14:03:22] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 3052 ms
[2024-05-29 14:03:23] [INFO ] Deduced a trap composed of 6 places in 255 ms of which 2 ms to minimize.
[2024-05-29 14:03:24] [INFO ] Deduced a trap composed of 4 places in 263 ms of which 0 ms to minimize.
[2024-05-29 14:03:24] [INFO ] Deduced a trap composed of 10 places in 253 ms of which 1 ms to minimize.
[2024-05-29 14:03:24] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1006 ms
[2024-05-29 14:03:25] [INFO ] Deduced a trap composed of 11 places in 245 ms of which 2 ms to minimize.
[2024-05-29 14:03:25] [INFO ] Deduced a trap composed of 14 places in 252 ms of which 3 ms to minimize.
[2024-05-29 14:03:25] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 697 ms
[2024-05-29 14:03:26] [INFO ] Deduced a trap composed of 10 places in 253 ms of which 1 ms to minimize.
[2024-05-29 14:03:26] [INFO ] Deduced a trap composed of 7 places in 256 ms of which 1 ms to minimize.
[2024-05-29 14:03:26] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 667 ms
[2024-05-29 14:03:26] [INFO ] After 21031ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :10
Attempting to minimize the solution found.
Minimization took 3832 ms.
[2024-05-29 14:03:30] [INFO ] After 26906ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :10
[2024-05-29 14:03:30] [INFO ] Export to MCC of 10 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 37 ms.
[2024-05-29 14:03:30] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1433 places, 1204 transitions and 5122 arcs took 7 ms.
[2024-05-29 14:03:31] [INFO ] Flatten gal took : 257 ms
Total runtime 183893 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT ShieldPPPt-PT-050B
BK_EXAMINATION: ReachabilityFireability
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/366
ReachabilityFireability

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

FORMULA ShieldPPPt-PT-050B-ReachabilityFireability-2024-03 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldPPPt-PT-050B-ReachabilityFireability-2024-08 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldPPPt-PT-050B-ReachabilityFireability-2024-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

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

FORMULA ShieldPPPt-PT-050B-ReachabilityFireability-2024-07 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldPPPt-PT-050B-ReachabilityFireability-2024-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

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

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

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

BK_STOP 1716991420431

--------------------
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/366/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/366/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/366/ReachabilityFireability.xml
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Rule S: 0 transitions removed,0 places removed
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 1.000000 secs.
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k: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 # 35 (type EXCL) for 0 ShieldPPPt-PT-050B-ReachabilityFireability-2024-01
lola: time limit : 359 sec
lola: memory limit: 32 pages
lola: LAUNCH task # 31 (type FNDP) for 0 ShieldPPPt-PT-050B-ReachabilityFireability-2024-01
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 32 (type EQUN) for 0 ShieldPPPt-PT-050B-ReachabilityFireability-2024-01
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 34 (type SRCH) for 0 ShieldPPPt-PT-050B-ReachabilityFireability-2024-01
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 # 34 (type SRCH) for ShieldPPPt-PT-050B-ReachabilityFireability-2024-01
lola: result : true
lola: markings : 109
lola: fired transitions : 108
lola: time used : 0.000000
lola: memory pages used : 1
lola: CANCELED task # 31 (type FNDP) for ShieldPPPt-PT-050B-ReachabilityFireability-2024-01 (obsolete)
lola: CANCELED task # 32 (type EQUN) for ShieldPPPt-PT-050B-ReachabilityFireability-2024-01 (obsolete)
lola: CANCELED task # 35 (type EXCL) for ShieldPPPt-PT-050B-ReachabilityFireability-2024-01 (obsolete)
lola: FINISHED task # 31 (type FNDP) for ShieldPPPt-PT-050B-ReachabilityFireability-2024-01
lola: result : true
lola: fired transitions : 107
lola: tried executions : 1
lola: time used : 0.000000
lola: memory pages used : 0
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 # 41 (type EXCL) for 6 ShieldPPPt-PT-050B-ReachabilityFireability-2024-03
lola: time limit : 399 sec
lola: memory limit: 32 pages
lola: LAUNCH task # 37 (type FNDP) for 6 ShieldPPPt-PT-050B-ReachabilityFireability-2024-03
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 38 (type EQUN) for 6 ShieldPPPt-PT-050B-ReachabilityFireability-2024-03
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: LAUNCH task # 40 (type SRCH) for 6 ShieldPPPt-PT-050B-ReachabilityFireability-2024-03
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
sara: try reading problem file /home/mcc/execution/366/ReachabilityFireability-32.sara.
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: FINISHED task # 37 (type FNDP) for ShieldPPPt-PT-050B-ReachabilityFireability-2024-03
lola: result : true
lola: fired transitions : 43
lola: tried executions : 1
lola: time used : 0.000000
lola: memory pages used : 0
lola: CANCELED task # 38 (type EQUN) for ShieldPPPt-PT-050B-ReachabilityFireability-2024-03 (obsolete)
lola: CANCELED task # 40 (type SRCH) for ShieldPPPt-PT-050B-ReachabilityFireability-2024-03 (obsolete)
lola: CANCELED task # 41 (type EXCL) for ShieldPPPt-PT-050B-ReachabilityFireability-2024-03 (obsolete)
lola: LAUNCH task # 47 (type EXCL) for 12 ShieldPPPt-PT-050B-ReachabilityFireability-2024-08
lola: time limit : 449 sec
lola: memory limit: 32 pages
lola: LAUNCH task # 43 (type FNDP) for 12 ShieldPPPt-PT-050B-ReachabilityFireability-2024-08
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 44 (type EQUN) for 12 ShieldPPPt-PT-050B-ReachabilityFireability-2024-08
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 46 (type SRCH) for 12 ShieldPPPt-PT-050B-ReachabilityFireability-2024-08
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
sara: try reading problem file /home/mcc/execution/366/ReachabilityFireability-38.sara.
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 # 43 (type FNDP) for ShieldPPPt-PT-050B-ReachabilityFireability-2024-08
lola: result : true
lola: fired transitions : 99
lola: tried executions : 1
lola: time used : 0.000000
lola: memory pages used : 0
lola: CANCELED task # 44 (type EQUN) for ShieldPPPt-PT-050B-ReachabilityFireability-2024-08 (obsolete)
lola: CANCELED task # 46 (type SRCH) for ShieldPPPt-PT-050B-ReachabilityFireability-2024-08 (obsolete)
lola: CANCELED task # 47 (type EXCL) for ShieldPPPt-PT-050B-ReachabilityFireability-2024-08 (obsolete)
lola: LAUNCH task # 54 (type EXCL) for 18 ShieldPPPt-PT-050B-ReachabilityFireability-2024-11
lola: time limit : 513 sec
lola: memory limit: 32 pages
lola: LAUNCH task # 50 (type FNDP) for 18 ShieldPPPt-PT-050B-ReachabilityFireability-2024-11
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 51 (type EQUN) for 18 ShieldPPPt-PT-050B-ReachabilityFireability-2024-11
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 53 (type SRCH) for 18 ShieldPPPt-PT-050B-ReachabilityFireability-2024-11
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 # 53 (type SRCH) for ShieldPPPt-PT-050B-ReachabilityFireability-2024-11
lola: result : true
lola: markings : 122
lola: fired transitions : 121
lola: time used : 0.000000
lola: memory pages used : 1
lola: CANCELED task # 50 (type FNDP) for ShieldPPPt-PT-050B-ReachabilityFireability-2024-11 (obsolete)
lola: CANCELED task # 51 (type EQUN) for ShieldPPPt-PT-050B-ReachabilityFireability-2024-11 (obsolete)
lola: CANCELED task # 54 (type EXCL) for ShieldPPPt-PT-050B-ReachabilityFireability-2024-11 (obsolete)
lola: FINISHED task # 50 (type FNDP) for ShieldPPPt-PT-050B-ReachabilityFireability-2024-11
lola: result : true
lola: fired transitions : 120
lola: tried executions : 1
lola: time used : 1.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: 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
sara: try reading problem file /home/mcc/execution/366/ReachabilityFireability-51.sara.
lola: LAUNCH task # 61 (type EXCL) for 9 ShieldPPPt-PT-050B-ReachabilityFireability-2024-07
lola: time limit : 599 sec
lola: memory limit: 32 pages
lola: LAUNCH task # 63 (type FNDP) for 3 ShieldPPPt-PT-050B-ReachabilityFireability-2024-02
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 64 (type EQUN) for 3 ShieldPPPt-PT-050B-ReachabilityFireability-2024-02
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 66 (type SRCH) for 3 ShieldPPPt-PT-050B-ReachabilityFireability-2024-02
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
sara: try reading problem file /home/mcc/execution/366/ReachabilityFireability-44.sara.
sara: place or transition ordering is non-deterministic
sara: place or transition ordering is non-deterministic
lola: rewrite Frontend/Parser/formula_rewrite.k:711
sara: place or transition ordering is non-deterministic
sara: place or transition ordering is non-deterministic
lola: FINISHED task # 66 (type SRCH) for ShieldPPPt-PT-050B-ReachabilityFireability-2024-02
lola: result : true
lola: markings : 88
lola: fired transitions : 87
lola: time used : 1.000000
lola: memory pages used : 1
lola: FINISHED task # 63 (type FNDP) for ShieldPPPt-PT-050B-ReachabilityFireability-2024-02
lola: result : true
lola: fired transitions : 86
lola: tried executions : 1
lola: time used : 1.000000
lola: memory pages used : 0
lola: CANCELED task # 64 (type EQUN) for ShieldPPPt-PT-050B-ReachabilityFireability-2024-02 (obsolete)
lola: LAUNCH task # 57 (type FNDP) for 9 ShieldPPPt-PT-050B-ReachabilityFireability-2024-07
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 58 (type EQUN) for 9 ShieldPPPt-PT-050B-ReachabilityFireability-2024-07
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 60 (type SRCH) for 9 ShieldPPPt-PT-050B-ReachabilityFireability-2024-07
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: 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
sara: try reading problem file /home/mcc/execution/366/ReachabilityFireability-64.sara.
lola: FINISHED task # 57 (type FNDP) for ShieldPPPt-PT-050B-ReachabilityFireability-2024-07
lola: result : true
lola: fired transitions : 83
lola: tried executions : 1
lola: time used : 0.000000
lola: memory pages used : 0
lola: CANCELED task # 58 (type EQUN) for ShieldPPPt-PT-050B-ReachabilityFireability-2024-07 (obsolete)
lola: CANCELED task # 60 (type SRCH) for ShieldPPPt-PT-050B-ReachabilityFireability-2024-07 (obsolete)
lola: CANCELED task # 61 (type EXCL) for ShieldPPPt-PT-050B-ReachabilityFireability-2024-07 (obsolete)
lola: LAUNCH task # 74 (type EXCL) for 15 ShieldPPPt-PT-050B-ReachabilityFireability-2024-10
lola: time limit : 898 sec
lola: memory limit: 32 pages
lola: LAUNCH task # 76 (type FNDP) for 21 ShieldPPPt-PT-050B-ReachabilityFireability-2024-12
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 77 (type EQUN) for 21 ShieldPPPt-PT-050B-ReachabilityFireability-2024-12
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 79 (type SRCH) for 21 ShieldPPPt-PT-050B-ReachabilityFireability-2024-12
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: FINISHED task # 76 (type FNDP) for ShieldPPPt-PT-050B-ReachabilityFireability-2024-12
lola: result : true
lola: fired transitions : 96
lola: tried executions : 1
lola: time used : 0.000000
lola: memory pages used : 0
lola: FINISHED task # 79 (type SRCH) for ShieldPPPt-PT-050B-ReachabilityFireability-2024-12
lola: result : true
lola: markings : 98
lola: fired transitions : 97
lola: time used : 0.000000
lola: memory pages used : 1
lola: CANCELED task # 77 (type EQUN) for ShieldPPPt-PT-050B-ReachabilityFireability-2024-12 (obsolete)
lola: LAUNCH task # 70 (type FNDP) for 15 ShieldPPPt-PT-050B-ReachabilityFireability-2024-10
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 71 (type EQUN) for 15 ShieldPPPt-PT-050B-ReachabilityFireability-2024-10
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 73 (type SRCH) for 15 ShieldPPPt-PT-050B-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/366/ReachabilityFireability-58.sara.
lola: FINISHED task # 73 (type SRCH) for ShieldPPPt-PT-050B-ReachabilityFireability-2024-10
lola: result : true
lola: markings : 64
lola: fired transitions : 63
lola: time used : 0.000000
lola: memory pages used : 1
sara: place or transition ordering is non-deterministic
lola: CANCELED task # 70 (type FNDP) for ShieldPPPt-PT-050B-ReachabilityFireability-2024-10 (obsolete)
lola: CANCELED task # 71 (type EQUN) for ShieldPPPt-PT-050B-ReachabilityFireability-2024-10 (obsolete)
lola: CANCELED task # 74 (type EXCL) for ShieldPPPt-PT-050B-ReachabilityFireability-2024-10 (obsolete)
sara: try reading problem file /home/mcc/execution/366/ReachabilityFireability-77.sara.
lola: FINISHED task # 70 (type FNDP) for ShieldPPPt-PT-050B-ReachabilityFireability-2024-10
lola: result : true
lola: fired transitions : 62
lola: tried executions : 1
lola: time used : 1.000000
lola: memory pages used : 0
sara: place or transition ordering is non-deterministic
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 # 86 (type EXCL) for 27 ShieldPPPt-PT-050B-ReachabilityFireability-2024-15
lola: time limit : 1796 sec
lola: memory limit: 32 pages
lola: LAUNCH task # 88 (type FNDP) for 24 ShieldPPPt-PT-050B-ReachabilityFireability-2024-14
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 89 (type EQUN) for 24 ShieldPPPt-PT-050B-ReachabilityFireability-2024-14
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 91 (type SRCH) for 24 ShieldPPPt-PT-050B-ReachabilityFireability-2024-14
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
sara: try reading problem file /home/mcc/execution/366/ReachabilityFireability-71.sara.
lola: FINISHED task # 91 (type SRCH) for ShieldPPPt-PT-050B-ReachabilityFireability-2024-14
lola: result : true
lola: markings : 55
lola: fired transitions : 54
lola: time used : 0.000000
lola: memory pages used : 1
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: CANCELED task # 88 (type FNDP) for ShieldPPPt-PT-050B-ReachabilityFireability-2024-14 (obsolete)
lola: CANCELED task # 89 (type EQUN) for ShieldPPPt-PT-050B-ReachabilityFireability-2024-14 (obsolete)
lola: LAUNCH task # 82 (type FNDP) for 27 ShieldPPPt-PT-050B-ReachabilityFireability-2024-15
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 83 (type EQUN) for 27 ShieldPPPt-PT-050B-ReachabilityFireability-2024-15
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 85 (type SRCH) for 27 ShieldPPPt-PT-050B-ReachabilityFireability-2024-15
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: FINISHED task # 82 (type FNDP) for ShieldPPPt-PT-050B-ReachabilityFireability-2024-15
lola: result : true
lola: fired transitions : 107
lola: tried executions : 1
lola: time used : 0.000000
lola: memory pages used : 0
lola: CANCELED task # 83 (type EQUN) for ShieldPPPt-PT-050B-ReachabilityFireability-2024-15 (obsolete)
lola: CANCELED task # 85 (type SRCH) for ShieldPPPt-PT-050B-ReachabilityFireability-2024-15 (obsolete)
lola: CANCELED task # 86 (type EXCL) for ShieldPPPt-PT-050B-ReachabilityFireability-2024-15 (obsolete)
lola: Portfolio finished: no open formulas

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldPPPt-PT-050B-ReachabilityFireability-2024-01: AG false tandem / insertion
ShieldPPPt-PT-050B-ReachabilityFireability-2024-02: EF true findpath
ShieldPPPt-PT-050B-ReachabilityFireability-2024-03: EF true findpath
ShieldPPPt-PT-050B-ReachabilityFireability-2024-07: AG false findpath
ShieldPPPt-PT-050B-ReachabilityFireability-2024-08: EF true findpath
ShieldPPPt-PT-050B-ReachabilityFireability-2024-10: AG false tandem / insertion
ShieldPPPt-PT-050B-ReachabilityFireability-2024-11: AG false tandem / insertion
ShieldPPPt-PT-050B-ReachabilityFireability-2024-12: EF true findpath
ShieldPPPt-PT-050B-ReachabilityFireability-2024-14: EF true tandem / insertion
ShieldPPPt-PT-050B-ReachabilityFireability-2024-15: EF true findpath


Time elapsed: 7 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="ShieldPPPt-PT-050B"
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 ShieldPPPt-PT-050B, 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-171683789300430"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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